{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZKBP5N2CMA2X7RVOFRR3QJUATS","short_pith_number":"pith:ZKBP5N2C","schema_version":"1.0","canonical_sha256":"ca82feb74260357fc6ae2c63b826809cba42e9fce8648141e371742ef0479d60","source":{"kind":"arxiv","id":"1512.05974","version":2},"attestation_state":"computed","paper":{"title":"Improved Balanced Flow Computation Using Parametric Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Omar Darwish","submitted_at":"2015-12-18T14:41:01Z","abstract_excerpt":"We present a new algorithm for computing balanced flows in equality networks arising in market equilibrium computations. The current best time bound for computing balanced flows in such networks requires $O(n)$ maxflow computations, where $n$ is the number of nodes in the network [Devanur et al. 2008]. Our algorithm requires only a single parametric flow computation. The best algorithm for computing parametric flows [Gallo et al. 1989] is only by a logarithmic factor slower than the best algorithms for computing maxflows. Hence, the running time of the algorithms in [Devanur et al. 2008] and ["},"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":"1512.05974","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-18T14:41:01Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b076e901831a95955842b737b45d65ba5cb8b7abafdf264b5748b6df3b35060d","abstract_canon_sha256":"a7b295cc18a0e90d00c07cda13655bfaec288dd1f751e230e4a4437286306207"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:58.720061Z","signature_b64":"kGB8aBtlDpVYG0HSOiGnqkO8tFTVKHNBXjQSZ/Qi3B5ES2MzTSqYMS2LPE7KnmNQc0juJkc2EvUP8Cvyx164BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca82feb74260357fc6ae2c63b826809cba42e9fce8648141e371742ef0479d60","last_reissued_at":"2026-05-18T01:14:58.719513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:58.719513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Balanced Flow Computation Using Parametric Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Omar Darwish","submitted_at":"2015-12-18T14:41:01Z","abstract_excerpt":"We present a new algorithm for computing balanced flows in equality networks arising in market equilibrium computations. The current best time bound for computing balanced flows in such networks requires $O(n)$ maxflow computations, where $n$ is the number of nodes in the network [Devanur et al. 2008]. Our algorithm requires only a single parametric flow computation. The best algorithm for computing parametric flows [Gallo et al. 1989] is only by a logarithmic factor slower than the best algorithms for computing maxflows. Hence, the running time of the algorithms in [Devanur et al. 2008] and ["},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05974","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.05974","created_at":"2026-05-18T01:14:58.719578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05974v2","created_at":"2026-05-18T01:14:58.719578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05974","created_at":"2026-05-18T01:14:58.719578+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKBP5N2CMA2X","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKBP5N2CMA2X7RVO","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKBP5N2C","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS","json":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS.json","graph_json":"https://pith.science/api/pith-number/ZKBP5N2CMA2X7RVOFRR3QJUATS/graph.json","events_json":"https://pith.science/api/pith-number/ZKBP5N2CMA2X7RVOFRR3QJUATS/events.json","paper":"https://pith.science/paper/ZKBP5N2C"},"agent_actions":{"view_html":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS","download_json":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS.json","view_paper":"https://pith.science/paper/ZKBP5N2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05974&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKBP5N2CMA2X7RVOFRR3QJUATS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKBP5N2CMA2X7RVOFRR3QJUATS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/action/storage_attestation","attest_author":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/action/author_attestation","sign_citation":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/action/citation_signature","submit_replication":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/action/replication_record"}},"created_at":"2026-05-18T01:14:58.719578+00:00","updated_at":"2026-05-18T01:14:58.719578+00:00"}