{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3GQ4AZ4B5RNOEK5R7B2CZXR5N5","short_pith_number":"pith:3GQ4AZ4B","canonical_record":{"source":{"id":"1312.3905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-13T19:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"db61740fbeca7d1674f2f0eb071725c501ea7b62e0b32ae1cf3792a45019a83f","abstract_canon_sha256":"8b120816deeaa76c11b33a0211e3a687fe182d462d1dbdd64dbf26e51a439662"},"schema_version":"1.0"},"canonical_sha256":"d9a1c06781ec5ae22bb1f8742cde3d6f69fa4fa67efa9d56a3297b21b17400b1","source":{"kind":"arxiv","id":"1312.3905","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3905","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3905v2","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3905","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"pith_short_12","alias_value":"3GQ4AZ4B5RNO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3GQ4AZ4B5RNOEK5R","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3GQ4AZ4B","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3GQ4AZ4B5RNOEK5R7B2CZXR5N5","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-13T19:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"db61740fbeca7d1674f2f0eb071725c501ea7b62e0b32ae1cf3792a45019a83f","abstract_canon_sha256":"8b120816deeaa76c11b33a0211e3a687fe182d462d1dbdd64dbf26e51a439662"},"schema_version":"1.0"},"canonical_sha256":"d9a1c06781ec5ae22bb1f8742cde3d6f69fa4fa67efa9d56a3297b21b17400b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:45.200345Z","signature_b64":"A0ashB7OdzKH69DQlDfVHma6ojpY666zUa3j4vg1bvl0GM+V1guesQOFukSzZNsF2bQFmqYx0W88Ecv5S/TcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9a1c06781ec5ae22bb1f8742cde3d6f69fa4fa67efa9d56a3297b21b17400b1","last_reissued_at":"2026-05-18T02:58:45.199452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:45.199452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3905","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-05-18T02:58:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxMpZ2h2YSuPXuTNTu7uvvJaPX1vYxOiTPdQnUrcppt/A/sIbc8kRclAxhm14ee5JoS8uV7ZMuUv+Hj3m36SBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:53:49.372706Z"},"content_sha256":"998a224bcfb73aea013418fed679eb9e8b554a2f1e62640d558ee7e1af004114","schema_version":"1.0","event_id":"sha256:998a224bcfb73aea013418fed679eb9e8b554a2f1e62640d558ee7e1af004114"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3GQ4AZ4B5RNOEK5R7B2CZXR5N5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Combinatorial $\\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Karrenbauer, Ruben Becker","submitted_at":"2013-12-13T19:01:48Z","abstract_excerpt":"We present a combinatorial method for the min-cost flow problem and prove that its expected running time is bounded by $\\tilde O(m^{3/2})$. This matches the best known bounds, which previously have only been achieved by numerical algorithms or for special cases. Our contribution contains three parts that might be interesting in their own right: (1) We provide a construction of an equivalent auxiliary network and interior primal and dual points with potential $P_0=\\tilde{O}(\\sqrt{m})$ in linear time. (2) We present a combinatorial potential reduction algorithm that transforms initial solutions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3905","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":""},"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-18T02:58:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJ1O2pDgA81oBic+vbmijjRAqArlwsXraRZq/IenxD2V6oJM14NhStrRmKsovjRNDDRqPmQhKHPtDzTU4tuUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:53:49.373391Z"},"content_sha256":"d44dfd63437962b3a56b375f43186365f2f06c4edc1cde2a11780a120c896e4d","schema_version":"1.0","event_id":"sha256:d44dfd63437962b3a56b375f43186365f2f06c4edc1cde2a11780a120c896e4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GQ4AZ4B5RNOEK5R7B2CZXR5N5/bundle.json","state_url":"https://pith.science/pith/3GQ4AZ4B5RNOEK5R7B2CZXR5N5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GQ4AZ4B5RNOEK5R7B2CZXR5N5/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-25T02:53:49Z","links":{"resolver":"https://pith.science/pith/3GQ4AZ4B5RNOEK5R7B2CZXR5N5","bundle":"https://pith.science/pith/3GQ4AZ4B5RNOEK5R7B2CZXR5N5/bundle.json","state":"https://pith.science/pith/3GQ4AZ4B5RNOEK5R7B2CZXR5N5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GQ4AZ4B5RNOEK5R7B2CZXR5N5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3GQ4AZ4B5RNOEK5R7B2CZXR5N5","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":"8b120816deeaa76c11b33a0211e3a687fe182d462d1dbdd64dbf26e51a439662","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-13T19:01:48Z","title_canon_sha256":"db61740fbeca7d1674f2f0eb071725c501ea7b62e0b32ae1cf3792a45019a83f"},"schema_version":"1.0","source":{"id":"1312.3905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3905","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3905v2","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3905","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"pith_short_12","alias_value":"3GQ4AZ4B5RNO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3GQ4AZ4B5RNOEK5R","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3GQ4AZ4B","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:d44dfd63437962b3a56b375f43186365f2f06c4edc1cde2a11780a120c896e4d","target":"graph","created_at":"2026-05-18T02:58:45Z","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 combinatorial method for the min-cost flow problem and prove that its expected running time is bounded by $\\tilde O(m^{3/2})$. This matches the best known bounds, which previously have only been achieved by numerical algorithms or for special cases. Our contribution contains three parts that might be interesting in their own right: (1) We provide a construction of an equivalent auxiliary network and interior primal and dual points with potential $P_0=\\tilde{O}(\\sqrt{m})$ in linear time. (2) We present a combinatorial potential reduction algorithm that transforms initial solutions ","authors_text":"Andreas Karrenbauer, Ruben Becker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-13T19:01:48Z","title":"A Combinatorial $\\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3905","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:998a224bcfb73aea013418fed679eb9e8b554a2f1e62640d558ee7e1af004114","target":"record","created_at":"2026-05-18T02:58:45Z","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":"8b120816deeaa76c11b33a0211e3a687fe182d462d1dbdd64dbf26e51a439662","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-13T19:01:48Z","title_canon_sha256":"db61740fbeca7d1674f2f0eb071725c501ea7b62e0b32ae1cf3792a45019a83f"},"schema_version":"1.0","source":{"id":"1312.3905","kind":"arxiv","version":2}},"canonical_sha256":"d9a1c06781ec5ae22bb1f8742cde3d6f69fa4fa67efa9d56a3297b21b17400b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9a1c06781ec5ae22bb1f8742cde3d6f69fa4fa67efa9d56a3297b21b17400b1","first_computed_at":"2026-05-18T02:58:45.199452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:45.199452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A0ashB7OdzKH69DQlDfVHma6ojpY666zUa3j4vg1bvl0GM+V1guesQOFukSzZNsF2bQFmqYx0W88Ecv5S/TcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:45.200345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:998a224bcfb73aea013418fed679eb9e8b554a2f1e62640d558ee7e1af004114","sha256:d44dfd63437962b3a56b375f43186365f2f06c4edc1cde2a11780a120c896e4d"],"state_sha256":"8ffa6e0e2d17d893e0f6354898756c52ae6f2544d4d7a2c4887d059013b11d88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYjsMj3jAuRGdG6HB4KF5LiTs71oL0Mdmrkp7FBdcBRu0vMPil7htSyUI+oIxKEPKiV6cGxQGYxkcTwFfu9DBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:53:49.376741Z","bundle_sha256":"46c749e75503d5201168ea03f5e5a8bddbd90ef09ea41600927df2eaaf93f90a"}}