{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G4CHDAMOE3VMHVBVFUF3ZCZQ7T","short_pith_number":"pith:G4CHDAMO","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"},"canonical_sha256":"370471818e26eac3d4352d0bbc8b30fcd835767ea7f3f2da4b937e8c982b830b","source":{"kind":"arxiv","id":"1310.8381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8381","created_at":"2026-05-18T03:08:17Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8381v1","created_at":"2026-05-18T03:08:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8381","created_at":"2026-05-18T03:08:17Z"},{"alias_kind":"pith_short_12","alias_value":"G4CHDAMOE3VM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G4CHDAMOE3VMHVBV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G4CHDAMO","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G4CHDAMOE3VMHVBVFUF3ZCZQ7T","target":"record","payload":{"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"},"canonical_sha256":"370471818e26eac3d4352d0bbc8b30fcd835767ea7f3f2da4b937e8c982b830b","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"},"source_kind":"arxiv","source_id":"1310.8381","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-18T03:08:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSDvLnrWgGYT94ysdk+VWmEQrm7AwM2yIfZXajRIYthESZDbVUVNsEDYzE7Fv9STtizVf5Gf9EPXnwJH/XlQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:15:12.097518Z"},"content_sha256":"416abdcd93fbf87959367c0a5ac93f0db0fca6c11c825d6603c772f8d8abb36d","schema_version":"1.0","event_id":"sha256:416abdcd93fbf87959367c0a5ac93f0db0fca6c11c825d6603c772f8d8abb36d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G4CHDAMOE3VMHVBVFUF3ZCZQ7T","target":"graph","payload":{"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"},"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-18T03:08:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WUOCRfrt3NGpZES9CLiG6OL6CVKukV9ZfwprQF3UuncjXDcUQQQpjYX0tFDAPOe3PcYkuWl3SS3XtNa1oUbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:15:12.097923Z"},"content_sha256":"11ad00dc568bb0a956f4dadc6d58d2bbf29d87b8a4a86d0300157ed51495ee26","schema_version":"1.0","event_id":"sha256:11ad00dc568bb0a956f4dadc6d58d2bbf29d87b8a4a86d0300157ed51495ee26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/bundle.json","state_url":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/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-06-11T12:15:12Z","links":{"resolver":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T","bundle":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/bundle.json","state":"https://pith.science/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4CHDAMOE3VMHVBVFUF3ZCZQ7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G4CHDAMOE3VMHVBVFUF3ZCZQ7T","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":"76d19156b9f44bc806448d96651a67b75259ea397785414325c4410e3b3f0e96","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-31T04:41:06Z","title_canon_sha256":"fdc37d507d431b101a5d365397699d03d250efc9179ce95064dfed31a254786e"},"schema_version":"1.0","source":{"id":"1310.8381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.8381","created_at":"2026-05-18T03:08:17Z"},{"alias_kind":"arxiv_version","alias_value":"1310.8381v1","created_at":"2026-05-18T03:08:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.8381","created_at":"2026-05-18T03:08:17Z"},{"alias_kind":"pith_short_12","alias_value":"G4CHDAMOE3VM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G4CHDAMOE3VMHVBV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G4CHDAMO","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:11ad00dc568bb0a956f4dadc6d58d2bbf29d87b8a4a86d0300157ed51495ee26","target":"graph","created_at":"2026-05-18T03:08:17Z","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":"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","authors_text":"Amos Fiat, Edith Cohen, Haim Kaplan, Liam Roditty","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-31T04:41:06Z","title":"A Labeling Approach to Incremental Cycle Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.8381","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:416abdcd93fbf87959367c0a5ac93f0db0fca6c11c825d6603c772f8d8abb36d","target":"record","created_at":"2026-05-18T03:08:17Z","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":"76d19156b9f44bc806448d96651a67b75259ea397785414325c4410e3b3f0e96","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-31T04:41:06Z","title_canon_sha256":"fdc37d507d431b101a5d365397699d03d250efc9179ce95064dfed31a254786e"},"schema_version":"1.0","source":{"id":"1310.8381","kind":"arxiv","version":1}},"canonical_sha256":"370471818e26eac3d4352d0bbc8b30fcd835767ea7f3f2da4b937e8c982b830b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"370471818e26eac3d4352d0bbc8b30fcd835767ea7f3f2da4b937e8c982b830b","first_computed_at":"2026-05-18T03:08:17.274012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:17.274012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WiKzZsR9v2dpEkrsAgbbBnYTsci07cHmnGETZJNJF9uKCViw9vnUMQh2NlJnTp5n337cn5b+pqYrTeWwazcyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:17.274749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.8381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:416abdcd93fbf87959367c0a5ac93f0db0fca6c11c825d6603c772f8d8abb36d","sha256:11ad00dc568bb0a956f4dadc6d58d2bbf29d87b8a4a86d0300157ed51495ee26"],"state_sha256":"c25de0ddd7b6966db333d17fadab922cfe7bc0ed1a7688fdf98ea088812ef3ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7kRMhH5Hs6JKRMxtIQKfUhDR6u2LlP9JcyWgsV7jkGAuJBbVnyxKV9Bi8nuTbzD+kmzdg1gcysmJP5sySUGyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:15:12.099907Z","bundle_sha256":"8738ae2153296f13fe1ce011a33c3459993b0d86fe2b13c43dec0d9dcc0c5d8f"}}