{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ILQ6EQISC7KUBTLJRCQBSVLD5N","short_pith_number":"pith:ILQ6EQIS","schema_version":"1.0","canonical_sha256":"42e1e2411217d540cd6988a0195563eb6922f5adbb7fa3c13ed65f59ccf39452","source":{"kind":"arxiv","id":"1611.06500","version":1},"attestation_state":"computed","paper":{"title":"Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gramoz Goranci, Mikkel Thorup, Monika Henzinger","submitted_at":"2016-11-20T11:08:49Z","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"},"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":"1611.06500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T11:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"da3d71ddd8881498877d1971a2e2aec15f86c4bb231c89cab4050d7960cf2101","abstract_canon_sha256":"ed1cc27a95f4b1867b52a1b1b2a22532d7ea3a93b053410c5bcd57592f6f2c2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:36.625548Z","signature_b64":"6EJBYnepPB7O5t632vsaUQb9acZRFU4kXyy7ZMgovy5Z9fB3wIwrVaBYXQJA6//IS+Mfvw3d3eGDM5DreHO/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42e1e2411217d540cd6988a0195563eb6922f5adbb7fa3c13ed65f59ccf39452","last_reissued_at":"2026-05-18T00:57:36.624822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:36.624822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gramoz Goranci, Mikkel Thorup, Monika Henzinger","submitted_at":"2016-11-20T11:08:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06500","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":"1611.06500","created_at":"2026-05-18T00:57:36.624935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06500v1","created_at":"2026-05-18T00:57:36.624935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06500","created_at":"2026-05-18T00:57:36.624935+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILQ6EQISC7KU","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILQ6EQISC7KUBTLJ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILQ6EQIS","created_at":"2026-05-18T12:30:22.444734+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/ILQ6EQISC7KUBTLJRCQBSVLD5N","json":"https://pith.science/pith/ILQ6EQISC7KUBTLJRCQBSVLD5N.json","graph_json":"https://pith.science/api/pith-number/ILQ6EQISC7KUBTLJRCQBSVLD5N/graph.json","events_json":"https://pith.science/api/pith-number/ILQ6EQISC7KUBTLJRCQBSVLD5N/events.json","paper":"https://pith.science/paper/ILQ6EQIS"},"agent_actions":{"view_html":"https://pith.science/pith/ILQ6EQISC7KUBTLJRCQBSVLD5N","download_json":"https://pith.science/pith/ILQ6EQISC7KUBTLJRCQBSVLD5N.json","view_paper":"https://pith.science/paper/ILQ6EQIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06500&json=true","fetch_graph":"https://pith.science/api/pith-number/ILQ6EQISC7KUBTLJRCQBSVLD5N/graph.json","fetch_events":"https://pith.science/api/pith-number/ILQ6EQISC7KUBTLJRCQBSVLD5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILQ6EQISC7KUBTLJRCQBSVLD5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILQ6EQISC7KUBTLJRCQBSVLD5N/action/storage_attestation","attest_author":"https://pith.science/pith/ILQ6EQISC7KUBTLJRCQBSVLD5N/action/author_attestation","sign_citation":"https://pith.science/pith/ILQ6EQISC7KUBTLJRCQBSVLD5N/action/citation_signature","submit_replication":"https://pith.science/pith/ILQ6EQISC7KUBTLJRCQBSVLD5N/action/replication_record"}},"created_at":"2026-05-18T00:57:36.624935+00:00","updated_at":"2026-05-18T00:57:36.624935+00:00"}