{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JXPELTEDCBASCTMBPYCFKPPKMI","short_pith_number":"pith:JXPELTED","schema_version":"1.0","canonical_sha256":"4dde45cc831041214d817e04553dea62252b702ab5919226b8584dc31fce5650","source":{"kind":"arxiv","id":"1511.07605","version":1},"attestation_state":"computed","paper":{"title":"On the Computational Complexity of Limit Cycles in Dynamical Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.DS"],"primary_cat":"cs.CC","authors_text":"Christos H. Papadimitriou, Nisheeth K. Vishnoi","submitted_at":"2015-11-24T08:31:03Z","abstract_excerpt":"We study the Poincare-Bendixson theorem for two-dimensional continuous dynamical systems in compact domains from the point of view of computation, seeking algorithms for finding the limit cycle promised by this classical result. We start by considering a discrete analogue of this theorem and show that both finding a point on a limit cycle, and determining if a given point is on one, are PSPACE-complete.\n  For the continuous version, we show that both problems are uncomputable in the real complexity sense; i.e., their complexity is arbitrarily high. Subsequently, we introduce a notion of an \"ap"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.07605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-24T08:31:03Z","cross_cats_sorted":["cs.DS","math.DS"],"title_canon_sha256":"bfafd2f8f8317a0abd1c31d93ed2bec36cec8756193325f3b6ae51df5a1ecf86","abstract_canon_sha256":"ca392788c9e02f01eee3e2cddb8ac618fb4e983327900655ebdac3b8b1b7713b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.254082Z","signature_b64":"FU6YuepbjMAFCXsYqm5teUIxbe9HrhUNKy+8t88Eikqk7BUeR8Jrg6ytm+rJjsblb3wujwumuD9+UCmvPneRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dde45cc831041214d817e04553dea62252b702ab5919226b8584dc31fce5650","last_reissued_at":"2026-05-18T01:26:04.253367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.253367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Computational Complexity of Limit Cycles in Dynamical Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.DS"],"primary_cat":"cs.CC","authors_text":"Christos H. Papadimitriou, Nisheeth K. Vishnoi","submitted_at":"2015-11-24T08:31:03Z","abstract_excerpt":"We study the Poincare-Bendixson theorem for two-dimensional continuous dynamical systems in compact domains from the point of view of computation, seeking algorithms for finding the limit cycle promised by this classical result. We start by considering a discrete analogue of this theorem and show that both finding a point on a limit cycle, and determining if a given point is on one, are PSPACE-complete.\n  For the continuous version, we show that both problems are uncomputable in the real complexity sense; i.e., their complexity is arbitrarily high. Subsequently, we introduce a notion of an \"ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07605","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.07605","created_at":"2026-05-18T01:26:04.253493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07605v1","created_at":"2026-05-18T01:26:04.253493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07605","created_at":"2026-05-18T01:26:04.253493+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXPELTEDCBAS","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXPELTEDCBASCTMB","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXPELTED","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI","json":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI.json","graph_json":"https://pith.science/api/pith-number/JXPELTEDCBASCTMBPYCFKPPKMI/graph.json","events_json":"https://pith.science/api/pith-number/JXPELTEDCBASCTMBPYCFKPPKMI/events.json","paper":"https://pith.science/paper/JXPELTED"},"agent_actions":{"view_html":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI","download_json":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI.json","view_paper":"https://pith.science/paper/JXPELTED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07605&json=true","fetch_graph":"https://pith.science/api/pith-number/JXPELTEDCBASCTMBPYCFKPPKMI/graph.json","fetch_events":"https://pith.science/api/pith-number/JXPELTEDCBASCTMBPYCFKPPKMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI/action/storage_attestation","attest_author":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI/action/author_attestation","sign_citation":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI/action/citation_signature","submit_replication":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI/action/replication_record"}},"created_at":"2026-05-18T01:26:04.253493+00:00","updated_at":"2026-05-18T01:26:04.253493+00:00"}