{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RZA4ZSPDLNE3BTUWXBNNKCDVTP","short_pith_number":"pith:RZA4ZSPD","schema_version":"1.0","canonical_sha256":"8e41ccc9e35b49b0ce96b85ad508759bd1684f2ae8ff758137c21841bcb3e3dc","source":{"kind":"arxiv","id":"1204.4753","version":1},"attestation_state":"computed","paper":{"title":"0/1 Polytopes with Quadratic Chvatal Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Laura Sanita, Thomas Rothvoss","submitted_at":"2012-04-20T22:01:17Z","abstract_excerpt":"For a polytope P, the Chvatal closure P' is obtained by simultaneously strengthening all feasible inequalities cx <= b (with integral c) to cx <= floor(b). The number of iterations of this procedure that are needed until the integral hull of P is reached is called the Chvatal rank. If P is a subset of [0,1]^n, then it is known that O(n^2 log n) iterations always suffice (Eisenbrand and Schulz (1999)) and at least (1+1/e-o(1))n iterations are sometimes needed (Pokutta and Stauffer (2011)), leaving a huge gap between lower and upper bounds.\n  We prove that there is a polytope contained in the 0/"},"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":"1204.4753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-20T22:01:17Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"c8be5064807533991689f46cb46e3aed22fef9d7f4c8f4b531a995e7e1c77c10","abstract_canon_sha256":"59af4b1d361cc6189620664383ef4dbc8f6859b0726e642270d45dc39ec3e149"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:59.779384Z","signature_b64":"5skQO73jFIHOWlC0b5W76ncl+19kK4+xs0EymQyA8cmg+JBkTOXZIaJBs6NPfLIAGbsrbcQZRPhmMacDcRGyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e41ccc9e35b49b0ce96b85ad508759bd1684f2ae8ff758137c21841bcb3e3dc","last_reissued_at":"2026-05-18T03:56:59.778582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:59.778582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"0/1 Polytopes with Quadratic Chvatal Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Laura Sanita, Thomas Rothvoss","submitted_at":"2012-04-20T22:01:17Z","abstract_excerpt":"For a polytope P, the Chvatal closure P' is obtained by simultaneously strengthening all feasible inequalities cx <= b (with integral c) to cx <= floor(b). The number of iterations of this procedure that are needed until the integral hull of P is reached is called the Chvatal rank. If P is a subset of [0,1]^n, then it is known that O(n^2 log n) iterations always suffice (Eisenbrand and Schulz (1999)) and at least (1+1/e-o(1))n iterations are sometimes needed (Pokutta and Stauffer (2011)), leaving a huge gap between lower and upper bounds.\n  We prove that there is a polytope contained in the 0/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4753","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":"1204.4753","created_at":"2026-05-18T03:56:59.778734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4753v1","created_at":"2026-05-18T03:56:59.778734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4753","created_at":"2026-05-18T03:56:59.778734+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZA4ZSPDLNE3","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZA4ZSPDLNE3BTUW","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZA4ZSPD","created_at":"2026-05-18T12:27:20.899486+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/RZA4ZSPDLNE3BTUWXBNNKCDVTP","json":"https://pith.science/pith/RZA4ZSPDLNE3BTUWXBNNKCDVTP.json","graph_json":"https://pith.science/api/pith-number/RZA4ZSPDLNE3BTUWXBNNKCDVTP/graph.json","events_json":"https://pith.science/api/pith-number/RZA4ZSPDLNE3BTUWXBNNKCDVTP/events.json","paper":"https://pith.science/paper/RZA4ZSPD"},"agent_actions":{"view_html":"https://pith.science/pith/RZA4ZSPDLNE3BTUWXBNNKCDVTP","download_json":"https://pith.science/pith/RZA4ZSPDLNE3BTUWXBNNKCDVTP.json","view_paper":"https://pith.science/paper/RZA4ZSPD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4753&json=true","fetch_graph":"https://pith.science/api/pith-number/RZA4ZSPDLNE3BTUWXBNNKCDVTP/graph.json","fetch_events":"https://pith.science/api/pith-number/RZA4ZSPDLNE3BTUWXBNNKCDVTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZA4ZSPDLNE3BTUWXBNNKCDVTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZA4ZSPDLNE3BTUWXBNNKCDVTP/action/storage_attestation","attest_author":"https://pith.science/pith/RZA4ZSPDLNE3BTUWXBNNKCDVTP/action/author_attestation","sign_citation":"https://pith.science/pith/RZA4ZSPDLNE3BTUWXBNNKCDVTP/action/citation_signature","submit_replication":"https://pith.science/pith/RZA4ZSPDLNE3BTUWXBNNKCDVTP/action/replication_record"}},"created_at":"2026-05-18T03:56:59.778734+00:00","updated_at":"2026-05-18T03:56:59.778734+00:00"}