{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:C44OA7AWSFU42XJMIZMYSO2SJZ","short_pith_number":"pith:C44OA7AW","canonical_record":{"source":{"id":"2304.01600","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-04T07:41:41Z","cross_cats_sorted":[],"title_canon_sha256":"8782d778e7db44d2737f449b6b1a963409bd370f4c3e4c93ad092a2f74dfb15b","abstract_canon_sha256":"040182da0619980f865ee30f3c32e5925f792699550c59e5151999af59ace2ce"},"schema_version":"1.0"},"canonical_sha256":"1738e07c169169cd5d2c4659893b524e6670e655fc74071ffb4d61fe730c6a13","source":{"kind":"arxiv","id":"2304.01600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.01600","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"2304.01600v1","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01600","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"C44OA7AWSFU4","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"pith_short_16","alias_value":"C44OA7AWSFU42XJM","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"pith_short_8","alias_value":"C44OA7AW","created_at":"2026-07-05T05:57:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:C44OA7AWSFU42XJMIZMYSO2SJZ","target":"record","payload":{"canonical_record":{"source":{"id":"2304.01600","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-04T07:41:41Z","cross_cats_sorted":[],"title_canon_sha256":"8782d778e7db44d2737f449b6b1a963409bd370f4c3e4c93ad092a2f74dfb15b","abstract_canon_sha256":"040182da0619980f865ee30f3c32e5925f792699550c59e5151999af59ace2ce"},"schema_version":"1.0"},"canonical_sha256":"1738e07c169169cd5d2c4659893b524e6670e655fc74071ffb4d61fe730c6a13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:57:42.356649Z","signature_b64":"rWL8D/NHcK+atBNTSqpm335JPW+fVf4Mz3sgdMAJ/BqWmn8lz9aUHmQxuKI/YHSqUNXhx0skv0FYq0nbVILoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1738e07c169169cd5d2c4659893b524e6670e655fc74071ffb4d61fe730c6a13","last_reissued_at":"2026-07-05T05:57:42.356224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:57:42.356224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.01600","source_version":1,"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-05T05:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/7aqNV82SxUNA7SDy9JMwlbLqns91bBNrbwprIgfuqe/H/QeXCQjcy+OFcR3PLz2ZmPdKuVsALwTHAg+foUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:17:59.078247Z"},"content_sha256":"54a5792cf7eb4bfeff56907fdab7cb9fa2ba596d48ad790aa680bdfe2aedd50a","schema_version":"1.0","event_id":"sha256:54a5792cf7eb4bfeff56907fdab7cb9fa2ba596d48ad790aa680bdfe2aedd50a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:C44OA7AWSFU42XJMIZMYSO2SJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Cost Flow in the CONGEST Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tijn de Vos","submitted_at":"2023-04-04T07:41:41Z","abstract_excerpt":"We consider the CONGEST model on a network with $n$ nodes, $m$ edges, diameter $D$, and integer costs and capacities bounded by $\\text{poly} n$. In this paper, we show how to find an exact solution to the minimum cost flow problem in $n^{1/2+o(1)}(\\sqrt{n}+D)$ rounds, improving the state of the art algorithm with running time $m^{3/7+o(1)}(\\sqrt nD^{1/4}+D)$ [Forster et al. FOCS 2021], which only holds for the special case of unit capacity graphs. For certain graphs, we achieve even better results. In particular, for planar graphs, expander graphs, $n^{o(1)}$-genus graphs, $n^{o(1)}$-treewidth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01600","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.01600/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-05T05:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVsEOtmCzfKnbj27/S7PusvglMIUczjQ23cn6lrmeMkaTS7pOOGXv+r4W1h4gRZapvFMw6/+uhy52uUmu1LjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:17:59.079686Z"},"content_sha256":"e323e29199ecfcfe4d542052cec3f60198cb91a24093a4b32dfe2a84a43cba89","schema_version":"1.0","event_id":"sha256:e323e29199ecfcfe4d542052cec3f60198cb91a24093a4b32dfe2a84a43cba89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/bundle.json","state_url":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/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-16T14:17:59Z","links":{"resolver":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ","bundle":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/bundle.json","state":"https://pith.science/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C44OA7AWSFU42XJMIZMYSO2SJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:C44OA7AWSFU42XJMIZMYSO2SJZ","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":"040182da0619980f865ee30f3c32e5925f792699550c59e5151999af59ace2ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-04T07:41:41Z","title_canon_sha256":"8782d778e7db44d2737f449b6b1a963409bd370f4c3e4c93ad092a2f74dfb15b"},"schema_version":"1.0","source":{"id":"2304.01600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.01600","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"2304.01600v1","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01600","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"C44OA7AWSFU4","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"pith_short_16","alias_value":"C44OA7AWSFU42XJM","created_at":"2026-07-05T05:57:42Z"},{"alias_kind":"pith_short_8","alias_value":"C44OA7AW","created_at":"2026-07-05T05:57:42Z"}],"graph_snapshots":[{"event_id":"sha256:e323e29199ecfcfe4d542052cec3f60198cb91a24093a4b32dfe2a84a43cba89","target":"graph","created_at":"2026-07-05T05:57:42Z","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/2304.01600/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the CONGEST model on a network with $n$ nodes, $m$ edges, diameter $D$, and integer costs and capacities bounded by $\\text{poly} n$. In this paper, we show how to find an exact solution to the minimum cost flow problem in $n^{1/2+o(1)}(\\sqrt{n}+D)$ rounds, improving the state of the art algorithm with running time $m^{3/7+o(1)}(\\sqrt nD^{1/4}+D)$ [Forster et al. FOCS 2021], which only holds for the special case of unit capacity graphs. For certain graphs, we achieve even better results. In particular, for planar graphs, expander graphs, $n^{o(1)}$-genus graphs, $n^{o(1)}$-treewidth","authors_text":"Tijn de Vos","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-04T07:41:41Z","title":"Minimum Cost Flow in the CONGEST Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01600","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:54a5792cf7eb4bfeff56907fdab7cb9fa2ba596d48ad790aa680bdfe2aedd50a","target":"record","created_at":"2026-07-05T05:57:42Z","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":"040182da0619980f865ee30f3c32e5925f792699550c59e5151999af59ace2ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-04-04T07:41:41Z","title_canon_sha256":"8782d778e7db44d2737f449b6b1a963409bd370f4c3e4c93ad092a2f74dfb15b"},"schema_version":"1.0","source":{"id":"2304.01600","kind":"arxiv","version":1}},"canonical_sha256":"1738e07c169169cd5d2c4659893b524e6670e655fc74071ffb4d61fe730c6a13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1738e07c169169cd5d2c4659893b524e6670e655fc74071ffb4d61fe730c6a13","first_computed_at":"2026-07-05T05:57:42.356224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:57:42.356224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rWL8D/NHcK+atBNTSqpm335JPW+fVf4Mz3sgdMAJ/BqWmn8lz9aUHmQxuKI/YHSqUNXhx0skv0FYq0nbVILoDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:57:42.356649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.01600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54a5792cf7eb4bfeff56907fdab7cb9fa2ba596d48ad790aa680bdfe2aedd50a","sha256:e323e29199ecfcfe4d542052cec3f60198cb91a24093a4b32dfe2a84a43cba89"],"state_sha256":"fa2903326cb113d383cae14524ef5971bc941ba04c1d84cc083b314072497356"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"og6wD2tzAlgEM0ciBzL+8bHIXD6nkggGbioVgLezTeHd7aUAvVOobs8xWo2YaWBng8RKwlM95rfnJ3E9kwvyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:17:59.086916Z","bundle_sha256":"3e8a423fb1385fb3fcd0065213f915ed0e1998d5192a3749589611a2044f3fc4"}}