{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ILXDLBMD5MKNQFWCYSAKR35JYG","short_pith_number":"pith:ILXDLBMD","schema_version":"1.0","canonical_sha256":"42ee358583eb14d816c2c480a8efa9c1b30916de7a41ffc338fe908fd371384e","source":{"kind":"arxiv","id":"2407.10034","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.10034","created_at":"2026-07-05T08:43:37.965454+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.10034v1","created_at":"2026-07-05T08:43:37.965454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10034","created_at":"2026-07-05T08:43:37.965454+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILXDLBMD5MKN","created_at":"2026-07-05T08:43:37.965454+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILXDLBMD5MKNQFWC","created_at":"2026-07-05T08:43:37.965454+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILXDLBMD","created_at":"2026-07-05T08:43:37.965454+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05215","citing_title":"VLAff: Vision-Language-Affordance Model for Unified Actionable Affordances","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG","json":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG.json","graph_json":"https://pith.science/api/pith-number/ILXDLBMD5MKNQFWCYSAKR35JYG/graph.json","events_json":"https://pith.science/api/pith-number/ILXDLBMD5MKNQFWCYSAKR35JYG/events.json","paper":"https://pith.science/paper/ILXDLBMD"},"agent_actions":{"view_html":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG","download_json":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG.json","view_paper":"https://pith.science/paper/ILXDLBMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.10034&json=true","fetch_graph":"https://pith.science/api/pith-number/ILXDLBMD5MKNQFWCYSAKR35JYG/graph.json","fetch_events":"https://pith.science/api/pith-number/ILXDLBMD5MKNQFWCYSAKR35JYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/action/storage_attestation","attest_author":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/action/author_attestation","sign_citation":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/action/citation_signature","submit_replication":"https://pith.science/pith/ILXDLBMD5MKNQFWCYSAKR35JYG/action/replication_record"}},"created_at":"2026-07-05T08:43:37.965454+00:00","updated_at":"2026-07-05T08:43:37.965454+00:00"}