{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VRVZABR7KTAEB76FGFEX45OTIF","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":"339302caa50904538bade68c465867da006205457ca06eef147b932b02fbf24f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T18:12:38Z","title_canon_sha256":"13e894092ba9f40081ce127b24a3c78ec80248bd90772f2d6d4f896656abc7c0"},"schema_version":"1.0","source":{"id":"1112.0784","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0784","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0784v1","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0784","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"VRVZABR7KTAE","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VRVZABR7KTAEB76F","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VRVZABR7","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:00d54b255ad7179defad0043d5084eb03c552ee08a21c11f3dde46bfe6cd1bdf","target":"graph","created_at":"2026-05-18T04:07:05Z","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 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","authors_text":"Jeremy T. Fineman, Michael A. Bender, Robert E. Tarjan, Seth Gilbert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T18:12:38Z","title":"A New Approach to Incremental Cycle Detection and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0784","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:ce3fcfa60f1122a198109bc5afc9f1ebb19839efc679e6036af05d4b1fc2818c","target":"record","created_at":"2026-05-18T04:07:05Z","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":"339302caa50904538bade68c465867da006205457ca06eef147b932b02fbf24f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-04T18:12:38Z","title_canon_sha256":"13e894092ba9f40081ce127b24a3c78ec80248bd90772f2d6d4f896656abc7c0"},"schema_version":"1.0","source":{"id":"1112.0784","kind":"arxiv","version":1}},"canonical_sha256":"ac6b90063f54c040ffc531497e75d341572f5f586f94f28bbb1c0e0336ee906a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac6b90063f54c040ffc531497e75d341572f5f586f94f28bbb1c0e0336ee906a","first_computed_at":"2026-05-18T04:07:05.620103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:05.620103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5JT/bTmAUwpNhjqoXB5GO7Gv5lQHx7hKw6QLZdSy5uSz2UgxY1hH2RVaF8VEjZNOmg0DOEI1UG6DtTfV8QIiDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:05.620664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0784","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce3fcfa60f1122a198109bc5afc9f1ebb19839efc679e6036af05d4b1fc2818c","sha256:00d54b255ad7179defad0043d5084eb03c552ee08a21c11f3dde46bfe6cd1bdf"],"state_sha256":"753f5bb73b10fc7c9bfcc894f0e05fea724cfbb30c103a7ca470aac8e87f6095"}