{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VRVZABR7KTAEB76FGFEX45OTIF","short_pith_number":"pith:VRVZABR7","schema_version":"1.0","canonical_sha256":"ac6b90063f54c040ffc531497e75d341572f5f586f94f28bbb1c0e0336ee906a","source":{"kind":"arxiv","id":"1112.0784","version":1},"attestation_state":"computed","paper":{"title":"A New Approach to Incremental Cycle Detection and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman, Michael A. Bender, Robert E. Tarjan, Seth Gilbert","submitted_at":"2011-12-04T18:12:38Z","abstract_excerpt":"We consider the problem of detecting a cycle in a directed graph that grows by arc insertions, and the related problems of maintaining a topological order and the strong components of such a graph. For these problems, we give two algorithms, one suited to sparse graphs, and the other to dense graphs. The former takes the minimum of O(m^{3/2}) and O(mn^{2/3}) time to insert m arcs into an n-vertex graph; the latter takes O(n^2 log(n)) time. Our sparse algorithm is considerably simpler than a previous O(m^{3/2})-time algorithm; it is also faster on graphs of sufficient density. The time bound of"},"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":"1112.0784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T18:12:38Z","cross_cats_sorted":[],"title_canon_sha256":"13e894092ba9f40081ce127b24a3c78ec80248bd90772f2d6d4f896656abc7c0","abstract_canon_sha256":"339302caa50904538bade68c465867da006205457ca06eef147b932b02fbf24f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:05.620664Z","signature_b64":"5JT/bTmAUwpNhjqoXB5GO7Gv5lQHx7hKw6QLZdSy5uSz2UgxY1hH2RVaF8VEjZNOmg0DOEI1UG6DtTfV8QIiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac6b90063f54c040ffc531497e75d341572f5f586f94f28bbb1c0e0336ee906a","last_reissued_at":"2026-05-18T04:07:05.620103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:05.620103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Approach to Incremental Cycle Detection and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman, Michael A. Bender, Robert E. Tarjan, Seth Gilbert","submitted_at":"2011-12-04T18:12:38Z","abstract_excerpt":"We consider the problem of detecting a cycle in a directed graph that grows by arc insertions, and the related problems of maintaining a topological order and the strong components of such a graph. For these problems, we give two algorithms, one suited to sparse graphs, and the other to dense graphs. The former takes the minimum of O(m^{3/2}) and O(mn^{2/3}) time to insert m arcs into an n-vertex graph; the latter takes O(n^2 log(n)) time. Our sparse algorithm is considerably simpler than a previous O(m^{3/2})-time algorithm; it is also faster on graphs of sufficient density. The time bound of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0784","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":"1112.0784","created_at":"2026-05-18T04:07:05.620190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0784v1","created_at":"2026-05-18T04:07:05.620190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0784","created_at":"2026-05-18T04:07:05.620190+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRVZABR7KTAE","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRVZABR7KTAEB76F","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRVZABR7","created_at":"2026-05-18T12:26:44.992195+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/VRVZABR7KTAEB76FGFEX45OTIF","json":"https://pith.science/pith/VRVZABR7KTAEB76FGFEX45OTIF.json","graph_json":"https://pith.science/api/pith-number/VRVZABR7KTAEB76FGFEX45OTIF/graph.json","events_json":"https://pith.science/api/pith-number/VRVZABR7KTAEB76FGFEX45OTIF/events.json","paper":"https://pith.science/paper/VRVZABR7"},"agent_actions":{"view_html":"https://pith.science/pith/VRVZABR7KTAEB76FGFEX45OTIF","download_json":"https://pith.science/pith/VRVZABR7KTAEB76FGFEX45OTIF.json","view_paper":"https://pith.science/paper/VRVZABR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0784&json=true","fetch_graph":"https://pith.science/api/pith-number/VRVZABR7KTAEB76FGFEX45OTIF/graph.json","fetch_events":"https://pith.science/api/pith-number/VRVZABR7KTAEB76FGFEX45OTIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRVZABR7KTAEB76FGFEX45OTIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRVZABR7KTAEB76FGFEX45OTIF/action/storage_attestation","attest_author":"https://pith.science/pith/VRVZABR7KTAEB76FGFEX45OTIF/action/author_attestation","sign_citation":"https://pith.science/pith/VRVZABR7KTAEB76FGFEX45OTIF/action/citation_signature","submit_replication":"https://pith.science/pith/VRVZABR7KTAEB76FGFEX45OTIF/action/replication_record"}},"created_at":"2026-05-18T04:07:05.620190+00:00","updated_at":"2026-05-18T04:07:05.620190+00:00"}