{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PWLJOFQD24KUVUPMMN4HURIDPL","short_pith_number":"pith:PWLJOFQD","schema_version":"1.0","canonical_sha256":"7d96971603d7154ad1ec63787a45037aee093f9fc9bffc30bdb9e7fcde5a4fcf","source":{"kind":"arxiv","id":"1408.4184","version":1},"attestation_state":"computed","paper":{"title":"Quadratic diameter bounds for dual network flow polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Elisabeth Finhold, Raymond Hemmecke, Steffen Borgwardt","submitted_at":"2014-08-19T00:42:27Z","abstract_excerpt":"Both the combinatorial and the circuit diameters of polyhedra are of interest to the theory of linear programming for their intimate connection to a best-case performance of linear programming algorithms.\n  We study the diameters of dual network flow polyhedra associated to $b$-flows on directed graphs $G=(V,E)$ and prove quadratic upper bounds for both of them: the minimum of $(|V|-1)\\cdot |E|$ and $\\frac{1}{6}|V|^3$ for the combinatorial diameter, and $\\frac{|V|\\cdot (|V|-1)}{2}$ for the circuit diameter. The latter strengthens the cubic bound implied by a result in [De Loera, Hemmecke, Lee;"},"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":"1408.4184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-19T00:42:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cfd501b0092959eaded47d3113051cba4c7b6c235d3132647079aaade33bf674","abstract_canon_sha256":"eb3de2e7e2ded4d70beb86cac15ddaf661302bcd869029aa5c5e65b5682a8572"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:55.947867Z","signature_b64":"kaaiUXqdOzqjumua6NhuxwXJAVWFsfmKbBqW21GoAxtZ38fHhOjqtn7MoGc3T+6j/ujqUCy31HrWGiJbvpxtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d96971603d7154ad1ec63787a45037aee093f9fc9bffc30bdb9e7fcde5a4fcf","last_reissued_at":"2026-05-18T02:44:55.947377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:55.947377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadratic diameter bounds for dual network flow polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Elisabeth Finhold, Raymond Hemmecke, Steffen Borgwardt","submitted_at":"2014-08-19T00:42:27Z","abstract_excerpt":"Both the combinatorial and the circuit diameters of polyhedra are of interest to the theory of linear programming for their intimate connection to a best-case performance of linear programming algorithms.\n  We study the diameters of dual network flow polyhedra associated to $b$-flows on directed graphs $G=(V,E)$ and prove quadratic upper bounds for both of them: the minimum of $(|V|-1)\\cdot |E|$ and $\\frac{1}{6}|V|^3$ for the combinatorial diameter, and $\\frac{|V|\\cdot (|V|-1)}{2}$ for the circuit diameter. The latter strengthens the cubic bound implied by a result in [De Loera, Hemmecke, Lee;"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4184","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":""},"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":"1408.4184","created_at":"2026-05-18T02:44:55.947445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.4184v1","created_at":"2026-05-18T02:44:55.947445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4184","created_at":"2026-05-18T02:44:55.947445+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWLJOFQD24KU","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWLJOFQD24KUVUPM","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWLJOFQD","created_at":"2026-05-18T12:28:43.426989+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/PWLJOFQD24KUVUPMMN4HURIDPL","json":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL.json","graph_json":"https://pith.science/api/pith-number/PWLJOFQD24KUVUPMMN4HURIDPL/graph.json","events_json":"https://pith.science/api/pith-number/PWLJOFQD24KUVUPMMN4HURIDPL/events.json","paper":"https://pith.science/paper/PWLJOFQD"},"agent_actions":{"view_html":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL","download_json":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL.json","view_paper":"https://pith.science/paper/PWLJOFQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.4184&json=true","fetch_graph":"https://pith.science/api/pith-number/PWLJOFQD24KUVUPMMN4HURIDPL/graph.json","fetch_events":"https://pith.science/api/pith-number/PWLJOFQD24KUVUPMMN4HURIDPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL/action/storage_attestation","attest_author":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL/action/author_attestation","sign_citation":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL/action/citation_signature","submit_replication":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL/action/replication_record"}},"created_at":"2026-05-18T02:44:55.947445+00:00","updated_at":"2026-05-18T02:44:55.947445+00:00"}