{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KVLHEZGYMTB6USIS5RYRFQMNFV","short_pith_number":"pith:KVLHEZGY","schema_version":"1.0","canonical_sha256":"55567264d864c3ea4912ec7112c18d2d70dc519854f50be176de5dbc921d78ab","source":{"kind":"arxiv","id":"1607.00643","version":1},"attestation_state":"computed","paper":{"title":"More indecomposable polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"David Yost, Krzysztof Przes{\\l}awski","submitted_at":"2016-07-03T14:02:30Z","abstract_excerpt":"We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a significant class of polytopes. We illustrate further the power of these techniques, compared with the traditional method of examining triangular faces, with several applications. In any dimension $d\\neq 2$, we show that of all the polytopes with $d^2+\\frac{d}{2}$ or fewer edges, only one is decomposable. In 3 dimensions, we complete the classification, in te"},"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":"1607.00643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-03T14:02:30Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"d622c7954e2d37b613d95464c7bed1144c0d2cd23284be9d9ea8454c5132874a","abstract_canon_sha256":"c62a277a87d003899eb64ff08e7f7c34374e33b39368e07c9806c5e200dcc743"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:34.567592Z","signature_b64":"5JZmZL5WTrvoGCqAdlc2CqEZm7yPGXvxSAiO3CyKqPvwC/JaL8yge49axPmnnX9jtU2bSDmzpwUdnObwvDJfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55567264d864c3ea4912ec7112c18d2d70dc519854f50be176de5dbc921d78ab","last_reissued_at":"2026-05-18T01:11:34.567162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:34.567162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More indecomposable polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"David Yost, Krzysztof Przes{\\l}awski","submitted_at":"2016-07-03T14:02:30Z","abstract_excerpt":"We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a significant class of polytopes. We illustrate further the power of these techniques, compared with the traditional method of examining triangular faces, with several applications. In any dimension $d\\neq 2$, we show that of all the polytopes with $d^2+\\frac{d}{2}$ or fewer edges, only one is decomposable. In 3 dimensions, we complete the classification, in te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00643","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":"1607.00643","created_at":"2026-05-18T01:11:34.567234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00643v1","created_at":"2026-05-18T01:11:34.567234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00643","created_at":"2026-05-18T01:11:34.567234+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVLHEZGYMTB6","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVLHEZGYMTB6USIS","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVLHEZGY","created_at":"2026-05-18T12:30:29.479603+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/KVLHEZGYMTB6USIS5RYRFQMNFV","json":"https://pith.science/pith/KVLHEZGYMTB6USIS5RYRFQMNFV.json","graph_json":"https://pith.science/api/pith-number/KVLHEZGYMTB6USIS5RYRFQMNFV/graph.json","events_json":"https://pith.science/api/pith-number/KVLHEZGYMTB6USIS5RYRFQMNFV/events.json","paper":"https://pith.science/paper/KVLHEZGY"},"agent_actions":{"view_html":"https://pith.science/pith/KVLHEZGYMTB6USIS5RYRFQMNFV","download_json":"https://pith.science/pith/KVLHEZGYMTB6USIS5RYRFQMNFV.json","view_paper":"https://pith.science/paper/KVLHEZGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00643&json=true","fetch_graph":"https://pith.science/api/pith-number/KVLHEZGYMTB6USIS5RYRFQMNFV/graph.json","fetch_events":"https://pith.science/api/pith-number/KVLHEZGYMTB6USIS5RYRFQMNFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVLHEZGYMTB6USIS5RYRFQMNFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVLHEZGYMTB6USIS5RYRFQMNFV/action/storage_attestation","attest_author":"https://pith.science/pith/KVLHEZGYMTB6USIS5RYRFQMNFV/action/author_attestation","sign_citation":"https://pith.science/pith/KVLHEZGYMTB6USIS5RYRFQMNFV/action/citation_signature","submit_replication":"https://pith.science/pith/KVLHEZGYMTB6USIS5RYRFQMNFV/action/replication_record"}},"created_at":"2026-05-18T01:11:34.567234+00:00","updated_at":"2026-05-18T01:11:34.567234+00:00"}