{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XGEU36LKOD6EASZZ73RQD5XNTL","short_pith_number":"pith:XGEU36LK","schema_version":"1.0","canonical_sha256":"b9894df96a70fc404b39fee301f6ed9ad557b2b56d63a5914d05549011525497","source":{"kind":"arxiv","id":"1108.4272","version":2},"attestation_state":"computed","paper":{"title":"On sub-determinants and the diameter of polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Friedrich Eisenbrand, Marco Di Summa, Martin Niemeier, Nicolai H\\\"ahnle, Nicolas Bonifas","submitted_at":"2011-08-22T10:23:47Z","abstract_excerpt":"We derive a new upper bound on the diameter of a polyhedron P = {x \\in R^n : Ax <= b}, where A \\in Z^{m\\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \\Delta. More precisely, we show that the diameter of P is bounded by O(\\Delta^2 n^4 log n\\Delta). If P is bounded, then we show that the diameter of P is at most O(\\Delta^2 n^3.5 log n\\Delta).\n  For the special case in which A is a totally unimodular matrix, the bounds are O(n^4 log n) and O(n^3.5 log n) respectively. This improves over the previous best bound of O(m^16 n^3 (log mn)^3) "},"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":"1108.4272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-22T10:23:47Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0627881dc217dd13c1654425d172b5649d3ca852be331210e9ed518793d698c6","abstract_canon_sha256":"213d209b2658dcb3a2a8bcd6c3fb2b15e855f3bd6bad781759bf0c91037245af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:05.044173Z","signature_b64":"9NPdnigyWFEXW3imiiGPgehKoCXGwWuggZpmaAuPCexQdWGLJBI0naL09gbaviIWbl5ADjBsfbrHr60kE2MOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9894df96a70fc404b39fee301f6ed9ad557b2b56d63a5914d05549011525497","last_reissued_at":"2026-05-18T02:53:05.043543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:05.043543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sub-determinants and the diameter of polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Friedrich Eisenbrand, Marco Di Summa, Martin Niemeier, Nicolai H\\\"ahnle, Nicolas Bonifas","submitted_at":"2011-08-22T10:23:47Z","abstract_excerpt":"We derive a new upper bound on the diameter of a polyhedron P = {x \\in R^n : Ax <= b}, where A \\in Z^{m\\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \\Delta. More precisely, we show that the diameter of P is bounded by O(\\Delta^2 n^4 log n\\Delta). If P is bounded, then we show that the diameter of P is at most O(\\Delta^2 n^3.5 log n\\Delta).\n  For the special case in which A is a totally unimodular matrix, the bounds are O(n^4 log n) and O(n^3.5 log n) respectively. This improves over the previous best bound of O(m^16 n^3 (log mn)^3) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4272","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":"1108.4272","created_at":"2026-05-18T02:53:05.043643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4272v2","created_at":"2026-05-18T02:53:05.043643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4272","created_at":"2026-05-18T02:53:05.043643+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGEU36LKOD6E","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGEU36LKOD6EASZZ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGEU36LK","created_at":"2026-05-18T12:26:44.992195+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/XGEU36LKOD6EASZZ73RQD5XNTL","json":"https://pith.science/pith/XGEU36LKOD6EASZZ73RQD5XNTL.json","graph_json":"https://pith.science/api/pith-number/XGEU36LKOD6EASZZ73RQD5XNTL/graph.json","events_json":"https://pith.science/api/pith-number/XGEU36LKOD6EASZZ73RQD5XNTL/events.json","paper":"https://pith.science/paper/XGEU36LK"},"agent_actions":{"view_html":"https://pith.science/pith/XGEU36LKOD6EASZZ73RQD5XNTL","download_json":"https://pith.science/pith/XGEU36LKOD6EASZZ73RQD5XNTL.json","view_paper":"https://pith.science/paper/XGEU36LK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4272&json=true","fetch_graph":"https://pith.science/api/pith-number/XGEU36LKOD6EASZZ73RQD5XNTL/graph.json","fetch_events":"https://pith.science/api/pith-number/XGEU36LKOD6EASZZ73RQD5XNTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGEU36LKOD6EASZZ73RQD5XNTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGEU36LKOD6EASZZ73RQD5XNTL/action/storage_attestation","attest_author":"https://pith.science/pith/XGEU36LKOD6EASZZ73RQD5XNTL/action/author_attestation","sign_citation":"https://pith.science/pith/XGEU36LKOD6EASZZ73RQD5XNTL/action/citation_signature","submit_replication":"https://pith.science/pith/XGEU36LKOD6EASZZ73RQD5XNTL/action/replication_record"}},"created_at":"2026-05-18T02:53:05.043643+00:00","updated_at":"2026-05-18T02:53:05.043643+00:00"}