{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4PVJK5OXMZTAPZZQK5FUBCKT2Q","short_pith_number":"pith:4PVJK5OX","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"},"canonical_sha256":"e3ea9575d7666607e730574b408953d423d1adacac34cdcc4d7d3511fc7c213e","source":{"kind":"arxiv","id":"1202.0524","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0524","created_at":"2026-05-18T03:49:58Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0524v2","created_at":"2026-05-18T03:49:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0524","created_at":"2026-05-18T03:49:58Z"},{"alias_kind":"pith_short_12","alias_value":"4PVJK5OXMZTA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4PVJK5OXMZTAPZZQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4PVJK5OX","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4PVJK5OXMZTAPZZQK5FUBCKT2Q","target":"record","payload":{"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"},"canonical_sha256":"e3ea9575d7666607e730574b408953d423d1adacac34cdcc4d7d3511fc7c213e","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"},"source_kind":"arxiv","source_id":"1202.0524","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:49:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKec6WARkWo5HoMsdMKSRujbwRmDiiul1FRWOuwD90nLmxEkTyC7+gsCRcViWqvOgxsbLYiArOFGjIJBiGOQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:14:12.093828Z"},"content_sha256":"95788a539e5aa1a36f2faede1a7c964dd99413aab1ed9dd02652c887374e6b59","schema_version":"1.0","event_id":"sha256:95788a539e5aa1a36f2faede1a7c964dd99413aab1ed9dd02652c887374e6b59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4PVJK5OXMZTAPZZQK5FUBCKT2Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:49:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcbhEeFULKmyNCULyK0vxiA1c2Eody+AQLj7nzPYCX8xSJ9D/WEXRh91UJAh713Te0IsTiyELrj4A5rcYMzwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:14:12.094171Z"},"content_sha256":"b2e83dd9749d55bfe8212f80e54ad671d0b3f56e9551ceebbf54fcc5981b5729","schema_version":"1.0","event_id":"sha256:b2e83dd9749d55bfe8212f80e54ad671d0b3f56e9551ceebbf54fcc5981b5729"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/bundle.json","state_url":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T23:14:12Z","links":{"resolver":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q","bundle":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/bundle.json","state":"https://pith.science/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PVJK5OXMZTAPZZQK5FUBCKT2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4PVJK5OXMZTAPZZQK5FUBCKT2Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1aa0a75282f2c9342aa5f06886bb3b25f5c6ffab73ae89a2a2f9d2efed3d82f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-02T19:41:33Z","title_canon_sha256":"a490861bc238c3fe6f0cdad4fa79814ac52620c8b3d017f3925492f3995b3613"},"schema_version":"1.0","source":{"id":"1202.0524","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0524","created_at":"2026-05-18T03:49:58Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0524v2","created_at":"2026-05-18T03:49:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0524","created_at":"2026-05-18T03:49:58Z"},{"alias_kind":"pith_short_12","alias_value":"4PVJK5OXMZTA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4PVJK5OXMZTAPZZQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4PVJK5OX","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:b2e83dd9749d55bfe8212f80e54ad671d0b3f56e9551ceebbf54fcc5981b5729","target":"graph","created_at":"2026-05-18T03:49:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bradley Weaver, Jenya Soprunova, Matthew Grimm, Olivia Beckwith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-02T19:41:33Z","title":"Minkowski length of 3D lattice polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0524","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:95788a539e5aa1a36f2faede1a7c964dd99413aab1ed9dd02652c887374e6b59","target":"record","created_at":"2026-05-18T03:49:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1aa0a75282f2c9342aa5f06886bb3b25f5c6ffab73ae89a2a2f9d2efed3d82f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-02T19:41:33Z","title_canon_sha256":"a490861bc238c3fe6f0cdad4fa79814ac52620c8b3d017f3925492f3995b3613"},"schema_version":"1.0","source":{"id":"1202.0524","kind":"arxiv","version":2}},"canonical_sha256":"e3ea9575d7666607e730574b408953d423d1adacac34cdcc4d7d3511fc7c213e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3ea9575d7666607e730574b408953d423d1adacac34cdcc4d7d3511fc7c213e","first_computed_at":"2026-05-18T03:49:58.280125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:58.280125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G2vGT92F+kfs+zPObFSM0bD9/pN3+R5m6RqXguU7kh71tAARb1vOU6xreCMqrNK22FUat6+uZhVCPdShzQfDBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:58.280597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0524","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95788a539e5aa1a36f2faede1a7c964dd99413aab1ed9dd02652c887374e6b59","sha256:b2e83dd9749d55bfe8212f80e54ad671d0b3f56e9551ceebbf54fcc5981b5729"],"state_sha256":"d11f8f9950cc35aa1ef60bf0fd1f3ebcbaf87353f02a29cb4f0b1372efbd01d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjQflFo5J8Bvn0EVE9Rn+hTjO2nBTSgqdE+koZQHeQoqdJ5rnAL3uWBwVDKd5DJ9ElfPyEKedlCVeIveAXxECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:14:12.096322Z","bundle_sha256":"2f26de4a71a42821138b2a5d10be5aa12ce97fafb3b1f0a44ecd544562dc503c"}}