{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PWLJOFQD24KUVUPMMN4HURIDPL","short_pith_number":"pith:PWLJOFQD","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"},"canonical_sha256":"7d96971603d7154ad1ec63787a45037aee093f9fc9bffc30bdb9e7fcde5a4fcf","source":{"kind":"arxiv","id":"1408.4184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4184","created_at":"2026-05-18T02:44:55Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4184v1","created_at":"2026-05-18T02:44:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4184","created_at":"2026-05-18T02:44:55Z"},{"alias_kind":"pith_short_12","alias_value":"PWLJOFQD24KU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PWLJOFQD24KUVUPM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PWLJOFQD","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PWLJOFQD24KUVUPMMN4HURIDPL","target":"record","payload":{"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"},"canonical_sha256":"7d96971603d7154ad1ec63787a45037aee093f9fc9bffc30bdb9e7fcde5a4fcf","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"},"source_kind":"arxiv","source_id":"1408.4184","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-05-18T02:44:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBhMwluyMkH/MKWHXp0ziN0bLhKLcA5C+CigOGMus9EuWAV0qmbhXuU6zYWTh7zBbiNxemyeD7FE08SV2E6UCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:13:41.024745Z"},"content_sha256":"9cc9821d494b696192ccebcebf2536950f822b164a6b87ed1ac9bf378ce76018","schema_version":"1.0","event_id":"sha256:9cc9821d494b696192ccebcebf2536950f822b164a6b87ed1ac9bf378ce76018"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PWLJOFQD24KUVUPMMN4HURIDPL","target":"graph","payload":{"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"},"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-18T02:44:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Se0R4uAfF2DKkA4GqX+aSGiJY9aFAvsudJ4uCAmYF1p0WLq8mKKsIyOaKM2Vtj4dG73MicFjlswcgNAWJt/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:13:41.025183Z"},"content_sha256":"bab0dc979c03d94b01dbbbec9fc9e2772e1366f9a90e747bbe25c7528443ae56","schema_version":"1.0","event_id":"sha256:bab0dc979c03d94b01dbbbec9fc9e2772e1366f9a90e747bbe25c7528443ae56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL/bundle.json","state_url":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWLJOFQD24KUVUPMMN4HURIDPL/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-05-27T23:13:41Z","links":{"resolver":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL","bundle":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL/bundle.json","state":"https://pith.science/pith/PWLJOFQD24KUVUPMMN4HURIDPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWLJOFQD24KUVUPMMN4HURIDPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PWLJOFQD24KUVUPMMN4HURIDPL","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":"eb3de2e7e2ded4d70beb86cac15ddaf661302bcd869029aa5c5e65b5682a8572","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-19T00:42:27Z","title_canon_sha256":"cfd501b0092959eaded47d3113051cba4c7b6c235d3132647079aaade33bf674"},"schema_version":"1.0","source":{"id":"1408.4184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4184","created_at":"2026-05-18T02:44:55Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4184v1","created_at":"2026-05-18T02:44:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4184","created_at":"2026-05-18T02:44:55Z"},{"alias_kind":"pith_short_12","alias_value":"PWLJOFQD24KU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PWLJOFQD24KUVUPM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PWLJOFQD","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:bab0dc979c03d94b01dbbbec9fc9e2772e1366f9a90e747bbe25c7528443ae56","target":"graph","created_at":"2026-05-18T02:44:55Z","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":"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;","authors_text":"Elisabeth Finhold, Raymond Hemmecke, Steffen Borgwardt","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-19T00:42:27Z","title":"Quadratic diameter bounds for dual network flow polyhedra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4184","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:9cc9821d494b696192ccebcebf2536950f822b164a6b87ed1ac9bf378ce76018","target":"record","created_at":"2026-05-18T02:44:55Z","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":"eb3de2e7e2ded4d70beb86cac15ddaf661302bcd869029aa5c5e65b5682a8572","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-19T00:42:27Z","title_canon_sha256":"cfd501b0092959eaded47d3113051cba4c7b6c235d3132647079aaade33bf674"},"schema_version":"1.0","source":{"id":"1408.4184","kind":"arxiv","version":1}},"canonical_sha256":"7d96971603d7154ad1ec63787a45037aee093f9fc9bffc30bdb9e7fcde5a4fcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d96971603d7154ad1ec63787a45037aee093f9fc9bffc30bdb9e7fcde5a4fcf","first_computed_at":"2026-05-18T02:44:55.947377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:55.947377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kaaiUXqdOzqjumua6NhuxwXJAVWFsfmKbBqW21GoAxtZ38fHhOjqtn7MoGc3T+6j/ujqUCy31HrWGiJbvpxtCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:55.947867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cc9821d494b696192ccebcebf2536950f822b164a6b87ed1ac9bf378ce76018","sha256:bab0dc979c03d94b01dbbbec9fc9e2772e1366f9a90e747bbe25c7528443ae56"],"state_sha256":"7c092a8a2e7fd3e674bb601d66e342facf67c80227b26ecc581886698fe0d938"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDoD4NhhHfrPCmVaPf9wv7a6geMKYyDkjWglj6dHGfMR6awtovZ/4xkFHduYJgrY9ZdeIgLD5YNW/dtF8Fn0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:13:41.027703Z","bundle_sha256":"9d56c517cde7986430cfe8d1289b38b42c14cab7c53f9e540f08f352349d94db"}}