{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G4CHDAMOE3VMHVBVFUF3ZCZQ7T","short_pith_number":"pith:G4CHDAMO","schema_version":"1.0","canonical_sha256":"370471818e26eac3d4352d0bbc8b30fcd835767ea7f3f2da4b937e8c982b830b","source":{"kind":"arxiv","id":"1310.8381","version":1},"attestation_state":"computed","paper":{"title":"A Labeling Approach to Incremental Cycle Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Amos Fiat, Edith Cohen, Haim Kaplan, Liam Roditty","submitted_at":"2013-10-31T04:41:06Z","abstract_excerpt":"In the \\emph{incremental cycle detection} problem arcs are added to a directed acyclic graph and the algorithm has to report if the new arc closes a cycle. One seeks to minimize the total time to process the entire sequence of arc insertions, or until a cycle appears.\n  In a recent breakthrough, Bender, Fineman, Gilbert and Tarjan \\cite{BeFiGiTa11} presented two different algorithms, with time complexity $O(n^2 \\log n)$ and $O(m \\cdot \\min \\{m^{1/2}, n^{2/3} \\})$, respectively.\n  In this paper we introduce a new technique for incremental cycle detection that allows us to obtain both bounds (up"},"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":"1310.8381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-31T04:41:06Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"fdc37d507d431b101a5d365397699d03d250efc9179ce95064dfed31a254786e","abstract_canon_sha256":"76d19156b9f44bc806448d96651a67b75259ea397785414325c4410e3b3f0e96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:17.274749Z","signature_b64":"WiKzZsR9v2dpEkrsAgbbBnYTsci07cHmnGETZJNJF9uKCViw9vnUMQh2NlJnTp5n337cn5b+pqYrTeWwazcyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"370471818e26eac3d4352d0bbc8b30fcd835767ea7f3f2da4b937e8c982b830b","last_reissued_at":"2026-05-18T03:08:17.274012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:17.274012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Labeling Approach to Incremental Cycle Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Amos Fiat, Edith Cohen, Haim Kaplan, Liam Roditty","submitted_at":"2013-10-31T04:41:06Z","abstract_excerpt":"In the \\emph{incremental cycle detection} problem arcs are added to a directed acyclic graph and the algorithm has to report if the new arc closes a cycle. One seeks to minimize the total time to process the entire sequence of arc insertions, or until a cycle appears.\n  In a recent breakthrough, Bender, Fineman, Gilbert and Tarjan \\cite{BeFiGiTa11} presented two different algorithms, with time complexity $O(n^2 \\log n)$ and $O(m \\cdot \\min \\{m^{1/2}, n^{2/3} \\})$, respectively.\n  In this paper we introduce a new technique for incremental cycle detection that allows us to obtain both bounds (up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8381","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":"1310.8381","created_at":"2026-05-18T03:08:17.274099+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.8381v1","created_at":"2026-05-18T03:08:17.274099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8381","created_at":"2026-05-18T03:08:17.274099+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4CHDAMOE3VM","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4CHDAMOE3VMHVBV","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4CHDAMO","created_at":"2026-05-18T12:27:45.050594+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/G4CHDAMOE3VMHVBVFUF3ZCZQ7T","json":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T.json","graph_json":"https://pith.science/api/pith-number/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/graph.json","events_json":"https://pith.science/api/pith-number/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/events.json","paper":"https://pith.science/paper/G4CHDAMO"},"agent_actions":{"view_html":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T","download_json":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T.json","view_paper":"https://pith.science/paper/G4CHDAMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.8381&json=true","fetch_graph":"https://pith.science/api/pith-number/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/graph.json","fetch_events":"https://pith.science/api/pith-number/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/action/storage_attestation","attest_author":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/action/author_attestation","sign_citation":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/action/citation_signature","submit_replication":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/action/replication_record"}},"created_at":"2026-05-18T03:08:17.274099+00:00","updated_at":"2026-05-18T03:08:17.274099+00:00"}