Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in [1].
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms
Authors: Daniel J. Rosenkrantz, Madhav Marathe, S. S. Ravi, Richard E. Stearns11334-11342
AAAI 2021 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We show that computational intractability results for reachability problems hold even for dynamical systems on directed acyclic graphs (dags). We also show that for dynamical systems on dags where each local function is monotone, the reachability problem can be solved efficiently. |
| Researcher Affiliation | Academia | 1Biocomplexity Institute and Initiative, University Virginia, Charlottesville, VA 22904. 2Computer Science Dept., University at Albany SUNY, Albany, NY 12222. 3Computer Science Dept., University Virginia, Charlottesville, VA 22904. |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. |
| Open Datasets | No | The paper is theoretical and does not use datasets. |
| Dataset Splits | No | The paper is theoretical and does not provide dataset split information. |
| Hardware Specification | No | The paper is theoretical and does not describe computational experiments that would require hardware specifications. |
| Software Dependencies | No | The paper is theoretical and does not describe software used for experiments that would require specific version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe an experimental setup with hyperparameters or training configurations. |