{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:25LR6CWS56LI3QU5J4IBKJZRMP","short_pith_number":"pith:25LR6CWS","schema_version":"1.0","canonical_sha256":"d7571f0ad2ef968dc29d4f1015273163f16ec7117a9598b592358a7cb984fbdc","source":{"kind":"arxiv","id":"1105.2397","version":1},"attestation_state":"computed","paper":{"title":"Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Robert Endre Tarjan, Rogers Mathew, Siddhartha Sen, Telikepalli Kavitha","submitted_at":"2011-05-12T07:57:28Z","abstract_excerpt":"We present two on-line algorithms for maintaining a topological order of a directed $n$-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles $m$ arc additions in $O(m^{3/2})$ time. For sparse graphs ($m/n = O(1)$), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural {\\em locality} property. Our second algorithm handles an arbitrary sequence of arc additions in $O(n^{5/2})$ time. For sufficiently dense graphs, this bound improves the best prev"},"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":"1105.2397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-12T07:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"b410d338afbb1cd854537ed000096762e87fe290116f0243db0cf3c8552d406b","abstract_canon_sha256":"d8ef9994895dcfe1afdf76ee7cf6df227b79db3535db02bc90ffc2b9fe15060d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:10.635650Z","signature_b64":"motfaINZQKQCaS2tCjA2tCGVNOc8vmINLhYMFd4e8bAGchUMhsb5QzYsdO15LNcjpoqWkqqcacK/jNwNkDTmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7571f0ad2ef968dc29d4f1015273163f16ec7117a9598b592358a7cb984fbdc","last_reissued_at":"2026-05-18T04:22:10.635285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:10.635285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Robert Endre Tarjan, Rogers Mathew, Siddhartha Sen, Telikepalli Kavitha","submitted_at":"2011-05-12T07:57:28Z","abstract_excerpt":"We present two on-line algorithms for maintaining a topological order of a directed $n$-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles $m$ arc additions in $O(m^{3/2})$ time. For sparse graphs ($m/n = O(1)$), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural {\\em locality} property. Our second algorithm handles an arbitrary sequence of arc additions in $O(n^{5/2})$ time. For sufficiently dense graphs, this bound improves the best prev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2397","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":"1105.2397","created_at":"2026-05-18T04:22:10.635342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2397v1","created_at":"2026-05-18T04:22:10.635342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2397","created_at":"2026-05-18T04:22:10.635342+00:00"},{"alias_kind":"pith_short_12","alias_value":"25LR6CWS56LI","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"25LR6CWS56LI3QU5","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"25LR6CWS","created_at":"2026-05-18T12:26:18.847500+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/25LR6CWS56LI3QU5J4IBKJZRMP","json":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP.json","graph_json":"https://pith.science/api/pith-number/25LR6CWS56LI3QU5J4IBKJZRMP/graph.json","events_json":"https://pith.science/api/pith-number/25LR6CWS56LI3QU5J4IBKJZRMP/events.json","paper":"https://pith.science/paper/25LR6CWS"},"agent_actions":{"view_html":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP","download_json":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP.json","view_paper":"https://pith.science/paper/25LR6CWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2397&json=true","fetch_graph":"https://pith.science/api/pith-number/25LR6CWS56LI3QU5J4IBKJZRMP/graph.json","fetch_events":"https://pith.science/api/pith-number/25LR6CWS56LI3QU5J4IBKJZRMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP/action/storage_attestation","attest_author":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP/action/author_attestation","sign_citation":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP/action/citation_signature","submit_replication":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP/action/replication_record"}},"created_at":"2026-05-18T04:22:10.635342+00:00","updated_at":"2026-05-18T04:22:10.635342+00:00"}