{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ILXDLBMD5MKNQFWCYSAKR35JYG","short_pith_number":"pith:ILXDLBMD","canonical_record":{"source":{"id":"2407.10034","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-14T00:53:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f2faeab7d1d91ce2c15eda3ba496b132ed401ed4e82f3bde09607e1bbca11570","abstract_canon_sha256":"ce79effa6807ec259d6e24b0ef47eefa8f07ffc6e887717be98568d876ab6fbe"},"schema_version":"1.0"},"canonical_sha256":"42ee358583eb14d816c2c480a8efa9c1b30916de7a41ffc338fe908fd371384e","source":{"kind":"arxiv","id":"2407.10034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.10034","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"arxiv_version","alias_value":"2407.10034v1","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10034","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"pith_short_12","alias_value":"ILXDLBMD5MKN","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"pith_short_16","alias_value":"ILXDLBMD5MKNQFWC","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"pith_short_8","alias_value":"ILXDLBMD","created_at":"2026-07-05T08:43:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ILXDLBMD5MKNQFWCYSAKR35JYG","target":"record","payload":{"canonical_record":{"source":{"id":"2407.10034","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-14T00:53:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f2faeab7d1d91ce2c15eda3ba496b132ed401ed4e82f3bde09607e1bbca11570","abstract_canon_sha256":"ce79effa6807ec259d6e24b0ef47eefa8f07ffc6e887717be98568d876ab6fbe"},"schema_version":"1.0"},"canonical_sha256":"42ee358583eb14d816c2c480a8efa9c1b30916de7a41ffc338fe908fd371384e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:37.965808Z","signature_b64":"tOX4YXVDb3KlkvKqP3ZwzDgGl4T+sKqo6xn++idqKFcrlywY2JGiQuVzBfNpUInjaFXYlawKhZ4N9kFhZ2WoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42ee358583eb14d816c2c480a8efa9c1b30916de7a41ffc338fe908fd371384e","last_reissued_at":"2026-07-05T08:43:37.965403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:37.965403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.10034","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-05T08:43:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CLUf2qDuGlZ+ZVBD+94RB506qQ+GMVTuFjW89Ewi3FAv/Qzjh3fP4xGqDtJH84vFroBczWauhI7pwu3nA/eBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:57:58.615494Z"},"content_sha256":"f854b1642a6fc3079c7906d39876c5fa99f0f9b31d5d951c64ae2f31f61e8965","schema_version":"1.0","event_id":"sha256:f854b1642a6fc3079c7906d39876c5fa99f0f9b31d5d951c64ae2f31f61e8965"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ILXDLBMD5MKNQFWCYSAKR35JYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Nithin Kavi","submitted_at":"2024-07-14T00:53:14Z","abstract_excerpt":"In 2022, Chen et al. proposed an algorithm in \\cite{main} that solves the min cost flow problem in $m^{1 + o(1)} \\log U \\log C$ time, where $m$ is the number of edges in the graph, $U$ is an upper bound on capacities and $C$ is an upper bound on costs. However, as far as the authors of \\cite{main} know, no one has implemented their algorithm to date. In this paper, we discuss implementations of several key portions of the algorithm given in \\cite{main}, including the justifications for specific implementation choices. For the portions of the algorithm that we do not implement, we provide stubs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.10034","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/2407.10034/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:43:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIj0ebE6CtoxTwplFerCoO/xGMsCy62RlnPhVUtnu/aJw9mhjbjXllrzbSBw6X0KQpzClkpuLNndB/9AzLi3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:57:58.616240Z"},"content_sha256":"3685b42b08bb8efff9f1ed7e810c94c98b6846155c32aae8eb69471c44cb375f","schema_version":"1.0","event_id":"sha256:3685b42b08bb8efff9f1ed7e810c94c98b6846155c32aae8eb69471c44cb375f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/bundle.json","state_url":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/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-10T00:57:58Z","links":{"resolver":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG","bundle":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/bundle.json","state":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ILXDLBMD5MKNQFWCYSAKR35JYG","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":"ce79effa6807ec259d6e24b0ef47eefa8f07ffc6e887717be98568d876ab6fbe","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-14T00:53:14Z","title_canon_sha256":"f2faeab7d1d91ce2c15eda3ba496b132ed401ed4e82f3bde09607e1bbca11570"},"schema_version":"1.0","source":{"id":"2407.10034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.10034","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"arxiv_version","alias_value":"2407.10034v1","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10034","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"pith_short_12","alias_value":"ILXDLBMD5MKN","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"pith_short_16","alias_value":"ILXDLBMD5MKNQFWC","created_at":"2026-07-05T08:43:37Z"},{"alias_kind":"pith_short_8","alias_value":"ILXDLBMD","created_at":"2026-07-05T08:43:37Z"}],"graph_snapshots":[{"event_id":"sha256:3685b42b08bb8efff9f1ed7e810c94c98b6846155c32aae8eb69471c44cb375f","target":"graph","created_at":"2026-07-05T08:43:37Z","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/2407.10034/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 2022, Chen et al. proposed an algorithm in \\cite{main} that solves the min cost flow problem in $m^{1 + o(1)} \\log U \\log C$ time, where $m$ is the number of edges in the graph, $U$ is an upper bound on capacities and $C$ is an upper bound on costs. However, as far as the authors of \\cite{main} know, no one has implemented their algorithm to date. In this paper, we discuss implementations of several key portions of the algorithm given in \\cite{main}, including the justifications for specific implementation choices. For the portions of the algorithm that we do not implement, we provide stubs","authors_text":"Nithin Kavi","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-14T00:53:14Z","title":"Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.10034","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:f854b1642a6fc3079c7906d39876c5fa99f0f9b31d5d951c64ae2f31f61e8965","target":"record","created_at":"2026-07-05T08:43:37Z","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":"ce79effa6807ec259d6e24b0ef47eefa8f07ffc6e887717be98568d876ab6fbe","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-14T00:53:14Z","title_canon_sha256":"f2faeab7d1d91ce2c15eda3ba496b132ed401ed4e82f3bde09607e1bbca11570"},"schema_version":"1.0","source":{"id":"2407.10034","kind":"arxiv","version":1}},"canonical_sha256":"42ee358583eb14d816c2c480a8efa9c1b30916de7a41ffc338fe908fd371384e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42ee358583eb14d816c2c480a8efa9c1b30916de7a41ffc338fe908fd371384e","first_computed_at":"2026-07-05T08:43:37.965403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:43:37.965403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tOX4YXVDb3KlkvKqP3ZwzDgGl4T+sKqo6xn++idqKFcrlywY2JGiQuVzBfNpUInjaFXYlawKhZ4N9kFhZ2WoCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:43:37.965808Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.10034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f854b1642a6fc3079c7906d39876c5fa99f0f9b31d5d951c64ae2f31f61e8965","sha256:3685b42b08bb8efff9f1ed7e810c94c98b6846155c32aae8eb69471c44cb375f"],"state_sha256":"201e08774950dfce3a452748563a0dc0366d4f2d7f936889f0252efe05636674"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lr8S3YzIBBRFlOY7D1IUuMQSrsZdLQM52yfn6zrqESuQdE1pFKQDRvz3nBmkwrxmDXIIgmX3NvBp7UYm//mUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T00:57:58.621236Z","bundle_sha256":"b58c70ac1cc40514afaceefd7011277eb080fe32279004d18c53aa4de726e4cc"}}