{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LAE34QAMGFN6JHRHEZCOZS3633","short_pith_number":"pith:LAE34QAM","canonical_record":{"source":{"id":"2312.16415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-27T05:27:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"02b01a2ed59bc366a819f8721d77e0b2db4ac7f5b880ef46a80631c502f173ab","abstract_canon_sha256":"b0fe3183f53d2ff014c1d697453a765fa4324c2cd85d2f756ced8d54d334565b"},"schema_version":"1.0"},"canonical_sha256":"5809be400c315be49e272644eccb7ededf6e503de7553489e1577cd3ff979c1f","source":{"kind":"arxiv","id":"2312.16415","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16415","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16415v2","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16415","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"LAE34QAMGFN6","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"pith_short_16","alias_value":"LAE34QAMGFN6JHRH","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"pith_short_8","alias_value":"LAE34QAM","created_at":"2026-07-05T08:38:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LAE34QAMGFN6JHRHEZCOZS3633","target":"record","payload":{"canonical_record":{"source":{"id":"2312.16415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-27T05:27:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"02b01a2ed59bc366a819f8721d77e0b2db4ac7f5b880ef46a80631c502f173ab","abstract_canon_sha256":"b0fe3183f53d2ff014c1d697453a765fa4324c2cd85d2f756ced8d54d334565b"},"schema_version":"1.0"},"canonical_sha256":"5809be400c315be49e272644eccb7ededf6e503de7553489e1577cd3ff979c1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:56.087161Z","signature_b64":"1IqbdcKh8Sa8JgqWmZxTPaypygOWkV0lDqxKrAeNezOczm40U8wMwsLubLelMxpOu3AaDouZGVo4DgK80asCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5809be400c315be49e272644eccb7ededf6e503de7553489e1577cd3ff979c1f","last_reissued_at":"2026-07-05T08:38:56.086814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:56.086814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.16415","source_version":2,"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-07-05T08:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UOdyY+iafD6znjFek6FicCvQ2dd5ooA8WG6+sBZFAe7+zwXXMPcHdQeiSX9pTy8mSKgsCvuNfwOZ2pp0XOW5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:14:32.408298Z"},"content_sha256":"7296c9cba82d3b0d4506e3e45c839232bd325d446ccb902059a9e743eb20b304","schema_version":"1.0","event_id":"sha256:7296c9cba82d3b0d4506e3e45c839232bd325d446ccb902059a9e743eb20b304"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LAE34QAMGFN6JHRHEZCOZS3633","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Minimum Steiner Cut in Maximum Flow Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Jason Li, Matthew Ding","submitted_at":"2023-12-27T05:27:22Z","abstract_excerpt":"We devise a deterministic algorithm for minimum Steiner cut, which uses $(\\log n)^{O(1)}$ maximum flow calls and additional near-linear time. This algorithm improves on Li and Panigrahi's (FOCS 2020) algorithm, which uses $(\\log n)^{O(1/\\epsilon^4)}$ maximum flow calls and additional $O(m^{1+\\epsilon})$ time, for $\\epsilon > 0$. Our algorithm thus shows that deterministic minimum Steiner cut can be solved in maximum flow time up to polylogarithmic factors, given any black-box deterministic maximum flow algorithm. Our main technical contribution is a novel deterministic graph decomposition meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16415","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.16415/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfBvdCBiDV5YMLYYO9C/UTDbU+j7c8JfwyaKTbjQLIJ9x+jjIFMx7i4hwl6SMC2oc3TvcksBfVRupZCdprLMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:14:32.408893Z"},"content_sha256":"4dab54b3e9d72a4d01ab106377487516c2af24f3bf01748cf66b67316e1f2079","schema_version":"1.0","event_id":"sha256:4dab54b3e9d72a4d01ab106377487516c2af24f3bf01748cf66b67316e1f2079"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633/bundle.json","state_url":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAE34QAMGFN6JHRHEZCOZS3633/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-08-16T15:14:32Z","links":{"resolver":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633","bundle":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633/bundle.json","state":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAE34QAMGFN6JHRHEZCOZS3633/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LAE34QAMGFN6JHRHEZCOZS3633","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":"b0fe3183f53d2ff014c1d697453a765fa4324c2cd85d2f756ced8d54d334565b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-27T05:27:22Z","title_canon_sha256":"02b01a2ed59bc366a819f8721d77e0b2db4ac7f5b880ef46a80631c502f173ab"},"schema_version":"1.0","source":{"id":"2312.16415","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16415","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16415v2","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16415","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"LAE34QAMGFN6","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"pith_short_16","alias_value":"LAE34QAMGFN6JHRH","created_at":"2026-07-05T08:38:56Z"},{"alias_kind":"pith_short_8","alias_value":"LAE34QAM","created_at":"2026-07-05T08:38:56Z"}],"graph_snapshots":[{"event_id":"sha256:4dab54b3e9d72a4d01ab106377487516c2af24f3bf01748cf66b67316e1f2079","target":"graph","created_at":"2026-07-05T08:38:56Z","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/2312.16415/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We devise a deterministic algorithm for minimum Steiner cut, which uses $(\\log n)^{O(1)}$ maximum flow calls and additional near-linear time. This algorithm improves on Li and Panigrahi's (FOCS 2020) algorithm, which uses $(\\log n)^{O(1/\\epsilon^4)}$ maximum flow calls and additional $O(m^{1+\\epsilon})$ time, for $\\epsilon > 0$. Our algorithm thus shows that deterministic minimum Steiner cut can be solved in maximum flow time up to polylogarithmic factors, given any black-box deterministic maximum flow algorithm. Our main technical contribution is a novel deterministic graph decomposition meth","authors_text":"Jason Li, Matthew Ding","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-27T05:27:22Z","title":"Deterministic Minimum Steiner Cut in Maximum Flow Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16415","kind":"arxiv","version":2},"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:7296c9cba82d3b0d4506e3e45c839232bd325d446ccb902059a9e743eb20b304","target":"record","created_at":"2026-07-05T08:38:56Z","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":"b0fe3183f53d2ff014c1d697453a765fa4324c2cd85d2f756ced8d54d334565b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-27T05:27:22Z","title_canon_sha256":"02b01a2ed59bc366a819f8721d77e0b2db4ac7f5b880ef46a80631c502f173ab"},"schema_version":"1.0","source":{"id":"2312.16415","kind":"arxiv","version":2}},"canonical_sha256":"5809be400c315be49e272644eccb7ededf6e503de7553489e1577cd3ff979c1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5809be400c315be49e272644eccb7ededf6e503de7553489e1577cd3ff979c1f","first_computed_at":"2026-07-05T08:38:56.086814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:38:56.086814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1IqbdcKh8Sa8JgqWmZxTPaypygOWkV0lDqxKrAeNezOczm40U8wMwsLubLelMxpOu3AaDouZGVo4DgK80asCAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:38:56.087161Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.16415","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7296c9cba82d3b0d4506e3e45c839232bd325d446ccb902059a9e743eb20b304","sha256:4dab54b3e9d72a4d01ab106377487516c2af24f3bf01748cf66b67316e1f2079"],"state_sha256":"8bc69d11f7ca66ec81eff0cd3f73f9d9be7cba3ec65bbb55e5db54dcd579a938"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzC9rzf7bIBLSFPmKfXAoCA5seAv1tV3167J9Hc5oS1/Zyw9/U1GhZMroS3S5+sgaerC+YGAQ3dxPfZXDy2FDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T15:14:32.413961Z","bundle_sha256":"b70e51b97572d2613884f3d2831acd64c1ee10960fbe1359cdec93e61657eb76"}}