{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:25LR6CWS56LI3QU5J4IBKJZRMP","short_pith_number":"pith:25LR6CWS","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"},"canonical_sha256":"d7571f0ad2ef968dc29d4f1015273163f16ec7117a9598b592358a7cb984fbdc","source":{"kind":"arxiv","id":"1105.2397","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2397","created_at":"2026-05-18T04:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2397v1","created_at":"2026-05-18T04:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2397","created_at":"2026-05-18T04:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"25LR6CWS56LI","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"25LR6CWS56LI3QU5","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"25LR6CWS","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:25LR6CWS56LI3QU5J4IBKJZRMP","target":"record","payload":{"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"},"canonical_sha256":"d7571f0ad2ef968dc29d4f1015273163f16ec7117a9598b592358a7cb984fbdc","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"},"source_kind":"arxiv","source_id":"1105.2397","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-18T04:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KoQT0yECi2VJzX1GK/iiVU/lNC3LYqHs/vQclEZ7nSwF4f3iqoiHQrIIOmTTsSCXvZzboTJ/W0HlUlSD70UHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:26:54.136566Z"},"content_sha256":"837c0b94d91615f55399cbbc311045d4b5d98f6f613d3f9a8792e2bca19e9caf","schema_version":"1.0","event_id":"sha256:837c0b94d91615f55399cbbc311045d4b5d98f6f613d3f9a8792e2bca19e9caf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:25LR6CWS56LI3QU5J4IBKJZRMP","target":"graph","payload":{"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"},"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-18T04:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bv9t1kg16DbcY6e1wogaNLOSdHPJyd9wjFpFPqttBOFZ2S6Iv5oyURU+dFtMmeiMFyhn9e7xj4KMG3x6Bc9jDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:26:54.136983Z"},"content_sha256":"e3ccb002ee948d209019947080d3a5b2c06ce97b75e87954558960ece73ca45c","schema_version":"1.0","event_id":"sha256:e3ccb002ee948d209019947080d3a5b2c06ce97b75e87954558960ece73ca45c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP/bundle.json","state_url":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25LR6CWS56LI3QU5J4IBKJZRMP/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-05-31T18:26:54Z","links":{"resolver":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP","bundle":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP/bundle.json","state":"https://pith.science/pith/25LR6CWS56LI3QU5J4IBKJZRMP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25LR6CWS56LI3QU5J4IBKJZRMP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:25LR6CWS56LI3QU5J4IBKJZRMP","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":"d8ef9994895dcfe1afdf76ee7cf6df227b79db3535db02bc90ffc2b9fe15060d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-12T07:57:28Z","title_canon_sha256":"b410d338afbb1cd854537ed000096762e87fe290116f0243db0cf3c8552d406b"},"schema_version":"1.0","source":{"id":"1105.2397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2397","created_at":"2026-05-18T04:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2397v1","created_at":"2026-05-18T04:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2397","created_at":"2026-05-18T04:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"25LR6CWS56LI","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"25LR6CWS56LI3QU5","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"25LR6CWS","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:e3ccb002ee948d209019947080d3a5b2c06ce97b75e87954558960ece73ca45c","target":"graph","created_at":"2026-05-18T04:22:10Z","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 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","authors_text":"Bernhard Haeupler, Robert Endre Tarjan, Rogers Mathew, Siddhartha Sen, Telikepalli Kavitha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-12T07:57:28Z","title":"Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2397","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:837c0b94d91615f55399cbbc311045d4b5d98f6f613d3f9a8792e2bca19e9caf","target":"record","created_at":"2026-05-18T04:22:10Z","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":"d8ef9994895dcfe1afdf76ee7cf6df227b79db3535db02bc90ffc2b9fe15060d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-12T07:57:28Z","title_canon_sha256":"b410d338afbb1cd854537ed000096762e87fe290116f0243db0cf3c8552d406b"},"schema_version":"1.0","source":{"id":"1105.2397","kind":"arxiv","version":1}},"canonical_sha256":"d7571f0ad2ef968dc29d4f1015273163f16ec7117a9598b592358a7cb984fbdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7571f0ad2ef968dc29d4f1015273163f16ec7117a9598b592358a7cb984fbdc","first_computed_at":"2026-05-18T04:22:10.635285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:10.635285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"motfaINZQKQCaS2tCjA2tCGVNOc8vmINLhYMFd4e8bAGchUMhsb5QzYsdO15LNcjpoqWkqqcacK/jNwNkDTmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:10.635650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:837c0b94d91615f55399cbbc311045d4b5d98f6f613d3f9a8792e2bca19e9caf","sha256:e3ccb002ee948d209019947080d3a5b2c06ce97b75e87954558960ece73ca45c"],"state_sha256":"f3f13bc28b566314b15e5cf1ea4854e0bbd96c6105e7ff94fcd25e5dc0e32504"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30btlr+hK7Ce3UBH9Gc2hRWF4ay4wZ21DyxJ1cb9DT1IqxaWXUEY1Rw0/HgQwkZ2gLlUslu7k+D63Gnzhy9FDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:26:54.140213Z","bundle_sha256":"6414d482cd101f37ae5fb8bbb7876babead4890357a81f3befae287be92bdb84"}}