{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4PVJK5OXMZTAPZZQK5FUBCKT2Q","short_pith_number":"pith:4PVJK5OX","schema_version":"1.0","canonical_sha256":"e3ea9575d7666607e730574b408953d423d1adacac34cdcc4d7d3511fc7c213e","source":{"kind":"arxiv","id":"1202.0524","version":2},"attestation_state":"computed","paper":{"title":"Minkowski length of 3D lattice polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bradley Weaver, Jenya Soprunova, Matthew Grimm, Olivia Beckwith","submitted_at":"2012-02-02T19:41:33Z","abstract_excerpt":"We study the Minkowski length L(P) of a lattice polytope P, which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P. The Minkowski length represents the largest possible number of factors in a factorization of polynomials with exponent vectors in P, and shows up in lower bounds for the minimum distance of toric codes. In this paper we give a polytime algorithm for computing L(P) where P is a 3D lattice polytope. We next study 3D lattice polytopes of Minkowski length 1. In particular, we show that if Q, a subpolytope of P, is the Minkowski sum o"},"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":"1202.0524","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-02T19:41:33Z","cross_cats_sorted":[],"title_canon_sha256":"a490861bc238c3fe6f0cdad4fa79814ac52620c8b3d017f3925492f3995b3613","abstract_canon_sha256":"1aa0a75282f2c9342aa5f06886bb3b25f5c6ffab73ae89a2a2f9d2efed3d82f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:58.280597Z","signature_b64":"G2vGT92F+kfs+zPObFSM0bD9/pN3+R5m6RqXguU7kh71tAARb1vOU6xreCMqrNK22FUat6+uZhVCPdShzQfDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ea9575d7666607e730574b408953d423d1adacac34cdcc4d7d3511fc7c213e","last_reissued_at":"2026-05-18T03:49:58.280125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:58.280125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minkowski length of 3D lattice polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bradley Weaver, Jenya Soprunova, Matthew Grimm, Olivia Beckwith","submitted_at":"2012-02-02T19:41:33Z","abstract_excerpt":"We study the Minkowski length L(P) of a lattice polytope P, which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P. The Minkowski length represents the largest possible number of factors in a factorization of polynomials with exponent vectors in P, and shows up in lower bounds for the minimum distance of toric codes. In this paper we give a polytime algorithm for computing L(P) where P is a 3D lattice polytope. We next study 3D lattice polytopes of Minkowski length 1. In particular, we show that if Q, a subpolytope of P, is the Minkowski sum o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0524","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":"1202.0524","created_at":"2026-05-18T03:49:58.280197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0524v2","created_at":"2026-05-18T03:49:58.280197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0524","created_at":"2026-05-18T03:49:58.280197+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PVJK5OXMZTA","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PVJK5OXMZTAPZZQ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PVJK5OX","created_at":"2026-05-18T12:26:53.410803+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/4PVJK5OXMZTAPZZQK5FUBCKT2Q","json":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q.json","graph_json":"https://pith.science/api/pith-number/4PVJK5OXMZTAPZZQK5FUBCKT2Q/graph.json","events_json":"https://pith.science/api/pith-number/4PVJK5OXMZTAPZZQK5FUBCKT2Q/events.json","paper":"https://pith.science/paper/4PVJK5OX"},"agent_actions":{"view_html":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q","download_json":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q.json","view_paper":"https://pith.science/paper/4PVJK5OX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0524&json=true","fetch_graph":"https://pith.science/api/pith-number/4PVJK5OXMZTAPZZQK5FUBCKT2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/4PVJK5OXMZTAPZZQK5FUBCKT2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/action/storage_attestation","attest_author":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/action/author_attestation","sign_citation":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/action/citation_signature","submit_replication":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/action/replication_record"}},"created_at":"2026-05-18T03:49:58.280197+00:00","updated_at":"2026-05-18T03:49:58.280197+00:00"}