{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N3CHDPOHTEQMBBRYEWQGSMVUWR","short_pith_number":"pith:N3CHDPOH","schema_version":"1.0","canonical_sha256":"6ec471bdc79920c0863825a06932b4b44f938ce94220b482853fa7366df99934","source":{"kind":"arxiv","id":"1509.05200","version":1},"attestation_state":"computed","paper":{"title":"Notions of maximality for integral lattice-free polyhedra: the case of dimension three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.OC"],"primary_cat":"math.CO","authors_text":"Gennadiy Averkov, Jan Kr\\\"umpelmann, Stefan Weltge","submitted_at":"2015-09-17T10:41:28Z","abstract_excerpt":"Lattice-free sets (convex subsets of $\\mathbb{R}^d$ without interior integer points) and their applications for cutting-plane methods in mixed-integer optimization have been studied in recent literature. Notably, the family of all integral lattice-free polyhedra which are not properly contained in another integral lattice-free polyhedron has been of particular interest. We call these polyhedra $\\mathbb{Z}^d$-maximal.\n  It is known that, for fixed $d$, the family $\\mathbb{Z}^d$-maximal integral lattice-free polyhedra is finite up to unimodular equivalence. In view of possible applications in cu"},"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":"1509.05200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-17T10:41:28Z","cross_cats_sorted":["math.AG","math.OC"],"title_canon_sha256":"d7c046dd9a43bad09d48e51547df8a52d448685091a67bd45620ee7de4576625","abstract_canon_sha256":"393d24d15a7971a51ca441e18627edc1b70df4f747bd3828c1cbfc77487a4a6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:49.627412Z","signature_b64":"qZLImOilkwaCndg69d9nx0zinVWLBcPDzrs7SanGfgle1i0AyBqm76vCFYPvlEGES5/iJc0GUFUQ8lWWz+t+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ec471bdc79920c0863825a06932b4b44f938ce94220b482853fa7366df99934","last_reissued_at":"2026-05-18T01:32:49.626832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:49.626832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Notions of maximality for integral lattice-free polyhedra: the case of dimension three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.OC"],"primary_cat":"math.CO","authors_text":"Gennadiy Averkov, Jan Kr\\\"umpelmann, Stefan Weltge","submitted_at":"2015-09-17T10:41:28Z","abstract_excerpt":"Lattice-free sets (convex subsets of $\\mathbb{R}^d$ without interior integer points) and their applications for cutting-plane methods in mixed-integer optimization have been studied in recent literature. Notably, the family of all integral lattice-free polyhedra which are not properly contained in another integral lattice-free polyhedron has been of particular interest. We call these polyhedra $\\mathbb{Z}^d$-maximal.\n  It is known that, for fixed $d$, the family $\\mathbb{Z}^d$-maximal integral lattice-free polyhedra is finite up to unimodular equivalence. In view of possible applications in cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05200","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":"1509.05200","created_at":"2026-05-18T01:32:49.626901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05200v1","created_at":"2026-05-18T01:32:49.626901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05200","created_at":"2026-05-18T01:32:49.626901+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3CHDPOHTEQM","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3CHDPOHTEQMBBRY","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3CHDPOH","created_at":"2026-05-18T12:29:32.376354+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/N3CHDPOHTEQMBBRYEWQGSMVUWR","json":"https://pith.science/pith/N3CHDPOHTEQMBBRYEWQGSMVUWR.json","graph_json":"https://pith.science/api/pith-number/N3CHDPOHTEQMBBRYEWQGSMVUWR/graph.json","events_json":"https://pith.science/api/pith-number/N3CHDPOHTEQMBBRYEWQGSMVUWR/events.json","paper":"https://pith.science/paper/N3CHDPOH"},"agent_actions":{"view_html":"https://pith.science/pith/N3CHDPOHTEQMBBRYEWQGSMVUWR","download_json":"https://pith.science/pith/N3CHDPOHTEQMBBRYEWQGSMVUWR.json","view_paper":"https://pith.science/paper/N3CHDPOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05200&json=true","fetch_graph":"https://pith.science/api/pith-number/N3CHDPOHTEQMBBRYEWQGSMVUWR/graph.json","fetch_events":"https://pith.science/api/pith-number/N3CHDPOHTEQMBBRYEWQGSMVUWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3CHDPOHTEQMBBRYEWQGSMVUWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3CHDPOHTEQMBBRYEWQGSMVUWR/action/storage_attestation","attest_author":"https://pith.science/pith/N3CHDPOHTEQMBBRYEWQGSMVUWR/action/author_attestation","sign_citation":"https://pith.science/pith/N3CHDPOHTEQMBBRYEWQGSMVUWR/action/citation_signature","submit_replication":"https://pith.science/pith/N3CHDPOHTEQMBBRYEWQGSMVUWR/action/replication_record"}},"created_at":"2026-05-18T01:32:49.626901+00:00","updated_at":"2026-05-18T01:32:49.626901+00:00"}