{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ISVIUJQYX5HN6UPIS5ZYTSRJN3","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":"9cf19fae3b743565e3e43e28362f03ef5b6008940d410d9f6924b643fa7faa4d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-01-18T03:09:17Z","title_canon_sha256":"3a1f802f85d6f81e91e00ba09386164262b93e6ca7ce3a17fb5f0fcf55a80957"},"schema_version":"1.0","source":{"id":"2401.09700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.09700","created_at":"2026-07-05T07:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"2401.09700v1","created_at":"2026-07-05T07:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09700","created_at":"2026-07-05T07:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"ISVIUJQYX5HN","created_at":"2026-07-05T07:35:00Z"},{"alias_kind":"pith_short_16","alias_value":"ISVIUJQYX5HN6UPI","created_at":"2026-07-05T07:35:00Z"},{"alias_kind":"pith_short_8","alias_value":"ISVIUJQY","created_at":"2026-07-05T07:35:00Z"}],"graph_snapshots":[{"event_id":"sha256:956bfdab45b3cef628b9585aeb1e0a0e2c1e3b77e6e5ce4a4222198ec6b0317d","target":"graph","created_at":"2026-07-05T07:35:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.09700/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a deterministic fully dynamic algorithm with subpolynomial worst-case time per graph update such that after processing each update of the graph, the algorithm outputs a minimum cut of the graph if the graph has a cut of size at most $c$ for some $c = (\\log n)^{o(1)}$. Previously, the best update time was $\\widetilde O(\\sqrt{n})$ for any $c > 2$ and $c = O(\\log n)$ [Thorup, Combinatorica'07].","authors_text":"Mikkel Thorup, Wenyu Jin, Xiaorui Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-01-18T03:09:17Z","title":"Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09700","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:914b5c74c2bed6f29bff175417803dc319546b3425091653213ca3fb4b75dbc4","target":"record","created_at":"2026-07-05T07:35:00Z","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":"9cf19fae3b743565e3e43e28362f03ef5b6008940d410d9f6924b643fa7faa4d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-01-18T03:09:17Z","title_canon_sha256":"3a1f802f85d6f81e91e00ba09386164262b93e6ca7ce3a17fb5f0fcf55a80957"},"schema_version":"1.0","source":{"id":"2401.09700","kind":"arxiv","version":1}},"canonical_sha256":"44aa8a2618bf4edf51e8977389ca296eeb39cbbe1a19e0378ebb4b6660db879a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44aa8a2618bf4edf51e8977389ca296eeb39cbbe1a19e0378ebb4b6660db879a","first_computed_at":"2026-07-05T07:35:00.982533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:35:00.982533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A2yNQZbKgkg1Nh9K4xKE3GdobhSkGZi4UsXIgirGFAZmWJhCD2l1mx3A1uBlk7QXHSpKgH27emCAvtOqDyqvBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:35:00.983055Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.09700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:914b5c74c2bed6f29bff175417803dc319546b3425091653213ca3fb4b75dbc4","sha256:956bfdab45b3cef628b9585aeb1e0a0e2c1e3b77e6e5ce4a4222198ec6b0317d"],"state_sha256":"f79a3b98b4fb30491690ab84cffa848bbe7e7807aee64d66b0e6f9fde5d89931"}