{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HZ67UQM5WK5XWMMAPXUQ35FYAT","short_pith_number":"pith:HZ67UQM5","canonical_record":{"source":{"id":"2203.00671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-03-01T18:45:57Z","cross_cats_sorted":[],"title_canon_sha256":"0c8b2f84d4f525c9e5b66e10b1b7b8290442f80b9c4c3809e57dbf53faa666c6","abstract_canon_sha256":"a2bf4a56edc2a52e9f4e2a2040dae1a6440e5b39ffd1f226bef5c717b432e0db"},"schema_version":"1.0"},"canonical_sha256":"3e7dfa419db2bb7b31807de90df4b804c42f8c5193a1cdeeae948bb570cc18ac","source":{"kind":"arxiv","id":"2203.00671","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00671","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00671v2","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00671","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"HZ67UQM5WK5X","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"pith_short_16","alias_value":"HZ67UQM5WK5XWMMA","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"pith_short_8","alias_value":"HZ67UQM5","created_at":"2026-07-05T04:17:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HZ67UQM5WK5XWMMAPXUQ35FYAT","target":"record","payload":{"canonical_record":{"source":{"id":"2203.00671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-03-01T18:45:57Z","cross_cats_sorted":[],"title_canon_sha256":"0c8b2f84d4f525c9e5b66e10b1b7b8290442f80b9c4c3809e57dbf53faa666c6","abstract_canon_sha256":"a2bf4a56edc2a52e9f4e2a2040dae1a6440e5b39ffd1f226bef5c717b432e0db"},"schema_version":"1.0"},"canonical_sha256":"3e7dfa419db2bb7b31807de90df4b804c42f8c5193a1cdeeae948bb570cc18ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:17:04.333829Z","signature_b64":"fX3QltLVlSPucqqUjMlpq+zLKqVTvLJ36YQm4L/6br+BmX6s2G9Qhdn8LcjF/8DjgLMY9uQqMXxSMNMLTvPNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e7dfa419db2bb7b31807de90df4b804c42f8c5193a1cdeeae948bb570cc18ac","last_reissued_at":"2026-07-05T04:17:04.333340Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:17:04.333340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.00671","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-05T04:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7r4KE8QXbSZN6+oqqAPkKSoqgj2cgzRi/Bf9ot4ExyYQ4E6LE256SZSXQXAa6lR+eTujwFd/Xfeol7BuXhRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:41:44.935208Z"},"content_sha256":"87416da153b5373aeaebc1d300cb7454d5fc84466617c7efb9d9f8bfe5326c7a","schema_version":"1.0","event_id":"sha256:87416da153b5373aeaebc1d300cb7454d5fc84466617c7efb9d9f8bfe5326c7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HZ67UQM5WK5XWMMAPXUQ35FYAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Li Chen, Maximilian Probst Gutenberg, Rasmus Kyng, Richard Peng, Sushant Sachdeva, Yang P. Liu","submitted_at":"2022-03-01T18:45:57Z","abstract_excerpt":"We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Our algorithm builds the flow through a sequence of $m^{1+o(1)}$ approximate undirected minimum-ratio cycles, each of which is computed and processed in amortized $m^{o(1)}$ time using a new dynamic graph data structure.\n  Our framework extends to algorithms running in $m^{1+o(1)}$ time for computing flows that minimize general edge-separable convex functions to high accuracy. This gives almost-lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00671","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/2203.00671/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-05T04:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egiQq8cP9V0HqlNz1336D+fchSgfCEiKYqve4R3pDArPDgaryWTkR+hdYwVRvIlcYuZvttyVv42yiX7/P7r+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:41:44.935713Z"},"content_sha256":"cfc48e9d98859fb61aaf19252b68caaef07aa313f9f73bdf16028efbc7b734b0","schema_version":"1.0","event_id":"sha256:cfc48e9d98859fb61aaf19252b68caaef07aa313f9f73bdf16028efbc7b734b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZ67UQM5WK5XWMMAPXUQ35FYAT/bundle.json","state_url":"https://pith.science/pith/HZ67UQM5WK5XWMMAPXUQ35FYAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZ67UQM5WK5XWMMAPXUQ35FYAT/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-03T16:41:44Z","links":{"resolver":"https://pith.science/pith/HZ67UQM5WK5XWMMAPXUQ35FYAT","bundle":"https://pith.science/pith/HZ67UQM5WK5XWMMAPXUQ35FYAT/bundle.json","state":"https://pith.science/pith/HZ67UQM5WK5XWMMAPXUQ35FYAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZ67UQM5WK5XWMMAPXUQ35FYAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HZ67UQM5WK5XWMMAPXUQ35FYAT","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":"a2bf4a56edc2a52e9f4e2a2040dae1a6440e5b39ffd1f226bef5c717b432e0db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-03-01T18:45:57Z","title_canon_sha256":"0c8b2f84d4f525c9e5b66e10b1b7b8290442f80b9c4c3809e57dbf53faa666c6"},"schema_version":"1.0","source":{"id":"2203.00671","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00671","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00671v2","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00671","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"HZ67UQM5WK5X","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"pith_short_16","alias_value":"HZ67UQM5WK5XWMMA","created_at":"2026-07-05T04:17:04Z"},{"alias_kind":"pith_short_8","alias_value":"HZ67UQM5","created_at":"2026-07-05T04:17:04Z"}],"graph_snapshots":[{"event_id":"sha256:cfc48e9d98859fb61aaf19252b68caaef07aa313f9f73bdf16028efbc7b734b0","target":"graph","created_at":"2026-07-05T04:17:04Z","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/2203.00671/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Our algorithm builds the flow through a sequence of $m^{1+o(1)}$ approximate undirected minimum-ratio cycles, each of which is computed and processed in amortized $m^{o(1)}$ time using a new dynamic graph data structure.\n  Our framework extends to algorithms running in $m^{1+o(1)}$ time for computing flows that minimize general edge-separable convex functions to high accuracy. This gives almost-lin","authors_text":"Li Chen, Maximilian Probst Gutenberg, Rasmus Kyng, Richard Peng, Sushant Sachdeva, Yang P. Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-03-01T18:45:57Z","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00671","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:87416da153b5373aeaebc1d300cb7454d5fc84466617c7efb9d9f8bfe5326c7a","target":"record","created_at":"2026-07-05T04:17:04Z","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":"a2bf4a56edc2a52e9f4e2a2040dae1a6440e5b39ffd1f226bef5c717b432e0db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-03-01T18:45:57Z","title_canon_sha256":"0c8b2f84d4f525c9e5b66e10b1b7b8290442f80b9c4c3809e57dbf53faa666c6"},"schema_version":"1.0","source":{"id":"2203.00671","kind":"arxiv","version":2}},"canonical_sha256":"3e7dfa419db2bb7b31807de90df4b804c42f8c5193a1cdeeae948bb570cc18ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e7dfa419db2bb7b31807de90df4b804c42f8c5193a1cdeeae948bb570cc18ac","first_computed_at":"2026-07-05T04:17:04.333340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:17:04.333340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fX3QltLVlSPucqqUjMlpq+zLKqVTvLJ36YQm4L/6br+BmX6s2G9Qhdn8LcjF/8DjgLMY9uQqMXxSMNMLTvPNDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:17:04.333829Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.00671","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87416da153b5373aeaebc1d300cb7454d5fc84466617c7efb9d9f8bfe5326c7a","sha256:cfc48e9d98859fb61aaf19252b68caaef07aa313f9f73bdf16028efbc7b734b0"],"state_sha256":"c003656880fd58ac717f1022bc815b2c8aa534fc004f34997aca0aa9d6aef11d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7K/k3m9NWjyOk00rYTrSfvzGwfEV3VHZ2fO8Ccddf7FZRfwCDT35eabaIk2KAjdz83/u+VnNGKZ1T/wbn6lDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:41:44.941582Z","bundle_sha256":"e91fe40e2e20e3c3eeb52c124205446c37ffb9cf3365931832cbbf1a5a3dd8ca"}}