{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ILQ6EQISC7KUBTLJRCQBSVLD5N","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":"ed1cc27a95f4b1867b52a1b1b2a22532d7ea3a93b053410c5bcd57592f6f2c2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T11:08:49Z","title_canon_sha256":"da3d71ddd8881498877d1971a2e2aec15f86c4bb231c89cab4050d7960cf2101"},"schema_version":"1.0","source":{"id":"1611.06500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06500","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06500v1","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06500","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"ILQ6EQISC7KU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ILQ6EQISC7KUBTLJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ILQ6EQIS","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:7e2ecde44ab8e9364a5fa48db3b8cca0831d5d21effd6a42c5950c6b95905c7e","target":"graph","created_at":"2026-05-18T00:57:36Z","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 a deterministic incremental algorithm for \\textit{exactly} maintaining the size of a minimum cut with $\\widetilde{O}(1)$ amortized time per edge insertion and $O(1)$ query time. This result partially answers an open question posed by Thorup [Combinatorica 2007]. It also stays in sharp contrast to a polynomial conditional lower-bound for the fully-dynamic weighted minimum cut problem. Our algorithm is obtained by combining a recent sparsification technique of Kawarabayashi and Thorup [STOC 2015] and an exact incremental algorithm of Henzinger [J. of Algorithm 1997]. We also study spa","authors_text":"Gramoz Goranci, Mikkel Thorup, Monika Henzinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T11:08:49Z","title":"Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06500","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:53cbb37e97aac21a3be44afffc87d9536ea82abf40ac153361566a1cb0b82efd","target":"record","created_at":"2026-05-18T00:57:36Z","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":"ed1cc27a95f4b1867b52a1b1b2a22532d7ea3a93b053410c5bcd57592f6f2c2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T11:08:49Z","title_canon_sha256":"da3d71ddd8881498877d1971a2e2aec15f86c4bb231c89cab4050d7960cf2101"},"schema_version":"1.0","source":{"id":"1611.06500","kind":"arxiv","version":1}},"canonical_sha256":"42e1e2411217d540cd6988a0195563eb6922f5adbb7fa3c13ed65f59ccf39452","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42e1e2411217d540cd6988a0195563eb6922f5adbb7fa3c13ed65f59ccf39452","first_computed_at":"2026-05-18T00:57:36.624822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:36.624822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6EJBYnepPB7O5t632vsaUQb9acZRFU4kXyy7ZMgovy5Z9fB3wIwrVaBYXQJA6//IS+Mfvw3d3eGDM5DreHO/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:36.625548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53cbb37e97aac21a3be44afffc87d9536ea82abf40ac153361566a1cb0b82efd","sha256:7e2ecde44ab8e9364a5fa48db3b8cca0831d5d21effd6a42c5950c6b95905c7e"],"state_sha256":"209fa2bb0dc622c06e9f120b5659ac0d5d95b33ad05245781cd6cc8636528a62"}