{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZKBP5N2CMA2X7RVOFRR3QJUATS","short_pith_number":"pith:ZKBP5N2C","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"},"canonical_sha256":"ca82feb74260357fc6ae2c63b826809cba42e9fce8648141e371742ef0479d60","source":{"kind":"arxiv","id":"1512.05974","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05974","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05974v2","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05974","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZKBP5N2CMA2X","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZKBP5N2CMA2X7RVO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZKBP5N2C","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZKBP5N2CMA2X7RVOFRR3QJUATS","target":"record","payload":{"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"},"canonical_sha256":"ca82feb74260357fc6ae2c63b826809cba42e9fce8648141e371742ef0479d60","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"},"source_kind":"arxiv","source_id":"1512.05974","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-05-18T01:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYaSxLU5dj18SRJ5Z612g6ilfUA6DSbYvHhBIaW3HCP/7eSxaCZVp/+veXYFJ/QyDEdXQySiY+nr4RJ1ZpcsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:47:38.172253Z"},"content_sha256":"a2bbcc58ad3be386f60857df666e2574e9f6e829a1a8adf1f1411f56f8aa2aff","schema_version":"1.0","event_id":"sha256:a2bbcc58ad3be386f60857df666e2574e9f6e829a1a8adf1f1411f56f8aa2aff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZKBP5N2CMA2X7RVOFRR3QJUATS","target":"graph","payload":{"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"},"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-05-18T01:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"siKdLSLsl2t8bWF+4rHgoshh10t8K8Hqj6BbDvLb2o5bdmoUpZScFBHkNiwb5W2juUClhB6RHYeZ6w+jav6pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:47:38.172843Z"},"content_sha256":"ed8f734b3780cb8d57935f7619ef39d6a4f85b901d49bfecfd16d925c03083f9","schema_version":"1.0","event_id":"sha256:ed8f734b3780cb8d57935f7619ef39d6a4f85b901d49bfecfd16d925c03083f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/bundle.json","state_url":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/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-06-07T09:47:38Z","links":{"resolver":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS","bundle":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/bundle.json","state":"https://pith.science/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKBP5N2CMA2X7RVOFRR3QJUATS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZKBP5N2CMA2X7RVOFRR3QJUATS","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":"a7b295cc18a0e90d00c07cda13655bfaec288dd1f751e230e4a4437286306207","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-18T14:41:01Z","title_canon_sha256":"b076e901831a95955842b737b45d65ba5cb8b7abafdf264b5748b6df3b35060d"},"schema_version":"1.0","source":{"id":"1512.05974","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05974","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05974v2","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05974","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZKBP5N2CMA2X","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZKBP5N2CMA2X7RVO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZKBP5N2C","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:ed8f734b3780cb8d57935f7619ef39d6a4f85b901d49bfecfd16d925c03083f9","target":"graph","created_at":"2026-05-18T01:14:58Z","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"},"paper":{"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 [","authors_text":"Kurt Mehlhorn, Omar Darwish","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-18T14:41:01Z","title":"Improved Balanced Flow Computation Using Parametric Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05974","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:a2bbcc58ad3be386f60857df666e2574e9f6e829a1a8adf1f1411f56f8aa2aff","target":"record","created_at":"2026-05-18T01:14:58Z","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":"a7b295cc18a0e90d00c07cda13655bfaec288dd1f751e230e4a4437286306207","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-18T14:41:01Z","title_canon_sha256":"b076e901831a95955842b737b45d65ba5cb8b7abafdf264b5748b6df3b35060d"},"schema_version":"1.0","source":{"id":"1512.05974","kind":"arxiv","version":2}},"canonical_sha256":"ca82feb74260357fc6ae2c63b826809cba42e9fce8648141e371742ef0479d60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca82feb74260357fc6ae2c63b826809cba42e9fce8648141e371742ef0479d60","first_computed_at":"2026-05-18T01:14:58.719513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:58.719513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kGB8aBtlDpVYG0HSOiGnqkO8tFTVKHNBXjQSZ/Qi3B5ES2MzTSqYMS2LPE7KnmNQc0juJkc2EvUP8Cvyx164BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:58.720061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05974","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2bbcc58ad3be386f60857df666e2574e9f6e829a1a8adf1f1411f56f8aa2aff","sha256:ed8f734b3780cb8d57935f7619ef39d6a4f85b901d49bfecfd16d925c03083f9"],"state_sha256":"e2866420a2f83085fa848687b96946eeaa341a45e6ad1a46944b70cc78e1304a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6aMQPkxBSA+TuCprMkVHmWyRoPMhviHzTQp3Amwwpe7EKeSPtmY1myenyYE8jkqS5SW0Ju3er8yt5ZGyv4vBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:47:38.176244Z","bundle_sha256":"b41ae94268cdaf9258a7bf9f3bacb49e8ed5c3886eb9b0d2d1e32804082d7878"}}