{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JXPELTEDCBASCTMBPYCFKPPKMI","short_pith_number":"pith:JXPELTED","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"},"canonical_sha256":"4dde45cc831041214d817e04553dea62252b702ab5919226b8584dc31fce5650","source":{"kind":"arxiv","id":"1511.07605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07605","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07605v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07605","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"JXPELTEDCBAS","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JXPELTEDCBASCTMB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JXPELTED","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JXPELTEDCBASCTMBPYCFKPPKMI","target":"record","payload":{"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"},"canonical_sha256":"4dde45cc831041214d817e04553dea62252b702ab5919226b8584dc31fce5650","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"},"source_kind":"arxiv","source_id":"1511.07605","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYpypzZL1QlWHLAma/qlURZ9HG6dE/MyHoBJgsEFzfB5EwK6OSFRjbWHOrbwMTbVA3eS/sZe7S5Ucd0AaQ3IBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:50:22.567108Z"},"content_sha256":"a5b0ea120c2b040f22e91360f68956755887a1b8f4059431dcb61318883f06c9","schema_version":"1.0","event_id":"sha256:a5b0ea120c2b040f22e91360f68956755887a1b8f4059431dcb61318883f06c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JXPELTEDCBASCTMBPYCFKPPKMI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MMc9K2Pkgj1P5wpwkb7pIAo9hdxHLLuizmr5ouCm0hC8xXcaERXpxL59c+4qrAE+vaRSAgcZ6MivflXhcejDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:50:22.567470Z"},"content_sha256":"2de1c0de21e094b612cb616e46ffb86af909215a05f7d2b3344c513b21ab7281","schema_version":"1.0","event_id":"sha256:2de1c0de21e094b612cb616e46ffb86af909215a05f7d2b3344c513b21ab7281"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI/bundle.json","state_url":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXPELTEDCBASCTMBPYCFKPPKMI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T21:50:22Z","links":{"resolver":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI","bundle":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI/bundle.json","state":"https://pith.science/pith/JXPELTEDCBASCTMBPYCFKPPKMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXPELTEDCBASCTMBPYCFKPPKMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JXPELTEDCBASCTMBPYCFKPPKMI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ca392788c9e02f01eee3e2cddb8ac618fb4e983327900655ebdac3b8b1b7713b","cross_cats_sorted":["cs.DS","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-24T08:31:03Z","title_canon_sha256":"bfafd2f8f8317a0abd1c31d93ed2bec36cec8756193325f3b6ae51df5a1ecf86"},"schema_version":"1.0","source":{"id":"1511.07605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07605","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07605v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07605","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"JXPELTEDCBAS","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JXPELTEDCBASCTMB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JXPELTED","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:2de1c0de21e094b612cb616e46ffb86af909215a05f7d2b3344c513b21ab7281","target":"graph","created_at":"2026-05-18T01:26:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Christos H. Papadimitriou, Nisheeth K. Vishnoi","cross_cats":["cs.DS","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-24T08:31:03Z","title":"On the Computational Complexity of Limit Cycles in Dynamical Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07605","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a5b0ea120c2b040f22e91360f68956755887a1b8f4059431dcb61318883f06c9","target":"record","created_at":"2026-05-18T01:26:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ca392788c9e02f01eee3e2cddb8ac618fb4e983327900655ebdac3b8b1b7713b","cross_cats_sorted":["cs.DS","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-24T08:31:03Z","title_canon_sha256":"bfafd2f8f8317a0abd1c31d93ed2bec36cec8756193325f3b6ae51df5a1ecf86"},"schema_version":"1.0","source":{"id":"1511.07605","kind":"arxiv","version":1}},"canonical_sha256":"4dde45cc831041214d817e04553dea62252b702ab5919226b8584dc31fce5650","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dde45cc831041214d817e04553dea62252b702ab5919226b8584dc31fce5650","first_computed_at":"2026-05-18T01:26:04.253367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:04.253367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FU6YuepbjMAFCXsYqm5teUIxbe9HrhUNKy+8t88Eikqk7BUeR8Jrg6ytm+rJjsblb3wujwumuD9+UCmvPneRDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:04.254082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5b0ea120c2b040f22e91360f68956755887a1b8f4059431dcb61318883f06c9","sha256:2de1c0de21e094b612cb616e46ffb86af909215a05f7d2b3344c513b21ab7281"],"state_sha256":"0cb1dcd61feadc6f94c0349ad448a8651fe9a172ac2c4e60fd4467699793d83c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Earm+VW2SFMfNLyTpYs7kDT5OUk7IaxYD3JieFA3RPrgkI0h5FGg48z6P/vr94ATK9X5WEznCSMc5WH4orU1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T21:50:22.569642Z","bundle_sha256":"4ef28432d636628110e7fece15d064e7de7309ad5bf490ea6b8e1f22489c4c53"}}