{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D2P4K55INHKUEF6XY7Z7BW6DDB","short_pith_number":"pith:D2P4K55I","schema_version":"1.0","canonical_sha256":"1e9fc577a869d54217d7c7f3f0dbc3187134339e3d3abc8d4e43346e3fad8de4","source":{"kind":"arxiv","id":"1604.04338","version":1},"attestation_state":"computed","paper":{"title":"A simple proof of tail--polynomial bounds on the diameter of polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.OC","authors_text":"Noriyoshi Sukegawa, Shinji Mizuno","submitted_at":"2016-04-15T02:33:17Z","abstract_excerpt":"Let $\\Delta(d,n)$ denote the maximum diameter of a $d$-dimensional polyhedron with $n$ facets. In this paper, we propose a unified analysis of a recursive inequality about $\\Delta(d,n)$ established by Kalai and Kleitman in 1992. This yields much simpler proofs of a tail--polynomial and tail--almost--linear bounds on $\\Delta(d,n)$ which are recently discussed by Gallagher and Kim."},"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":"1604.04338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-15T02:33:17Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"c299e499e51ec6e530195256b0e00e45c7242fa8fb8d8f88eb9b61d10c3da2c8","abstract_canon_sha256":"0b9f3ee84b9cce0fd4c837cd581f7b7bde1bfe4d09d8835a5e4b57a6e878004a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:04.456286Z","signature_b64":"dLkYPci8wb2enrsJ1LgBnBBHH+tO7IH5aL25jZ84LrPl1d8yULmJJpAIrcyb1PqR+SGv13mYTVr6mJsU+AtBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e9fc577a869d54217d7c7f3f0dbc3187134339e3d3abc8d4e43346e3fad8de4","last_reissued_at":"2026-05-18T01:17:04.455585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:04.455585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple proof of tail--polynomial bounds on the diameter of polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.OC","authors_text":"Noriyoshi Sukegawa, Shinji Mizuno","submitted_at":"2016-04-15T02:33:17Z","abstract_excerpt":"Let $\\Delta(d,n)$ denote the maximum diameter of a $d$-dimensional polyhedron with $n$ facets. In this paper, we propose a unified analysis of a recursive inequality about $\\Delta(d,n)$ established by Kalai and Kleitman in 1992. This yields much simpler proofs of a tail--polynomial and tail--almost--linear bounds on $\\Delta(d,n)$ which are recently discussed by Gallagher and Kim."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04338","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":"1604.04338","created_at":"2026-05-18T01:17:04.455698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04338v1","created_at":"2026-05-18T01:17:04.455698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04338","created_at":"2026-05-18T01:17:04.455698+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2P4K55INHKU","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2P4K55INHKUEF6X","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2P4K55I","created_at":"2026-05-18T12:30:09.641336+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/D2P4K55INHKUEF6XY7Z7BW6DDB","json":"https://pith.science/pith/D2P4K55INHKUEF6XY7Z7BW6DDB.json","graph_json":"https://pith.science/api/pith-number/D2P4K55INHKUEF6XY7Z7BW6DDB/graph.json","events_json":"https://pith.science/api/pith-number/D2P4K55INHKUEF6XY7Z7BW6DDB/events.json","paper":"https://pith.science/paper/D2P4K55I"},"agent_actions":{"view_html":"https://pith.science/pith/D2P4K55INHKUEF6XY7Z7BW6DDB","download_json":"https://pith.science/pith/D2P4K55INHKUEF6XY7Z7BW6DDB.json","view_paper":"https://pith.science/paper/D2P4K55I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04338&json=true","fetch_graph":"https://pith.science/api/pith-number/D2P4K55INHKUEF6XY7Z7BW6DDB/graph.json","fetch_events":"https://pith.science/api/pith-number/D2P4K55INHKUEF6XY7Z7BW6DDB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2P4K55INHKUEF6XY7Z7BW6DDB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2P4K55INHKUEF6XY7Z7BW6DDB/action/storage_attestation","attest_author":"https://pith.science/pith/D2P4K55INHKUEF6XY7Z7BW6DDB/action/author_attestation","sign_citation":"https://pith.science/pith/D2P4K55INHKUEF6XY7Z7BW6DDB/action/citation_signature","submit_replication":"https://pith.science/pith/D2P4K55INHKUEF6XY7Z7BW6DDB/action/replication_record"}},"created_at":"2026-05-18T01:17:04.455698+00:00","updated_at":"2026-05-18T01:17:04.455698+00:00"}