{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OCKQFGWN2VZ6S75E4CYE5HKXNP","short_pith_number":"pith:OCKQFGWN","schema_version":"1.0","canonical_sha256":"7095029acdd573e97fa4e0b04e9d576bd6688a52d8e00028f9fb1f5ebb6b7ecb","source":{"kind":"arxiv","id":"2605.22594","version":1},"attestation_state":"computed","paper":{"title":"Indecomposability of 0/1-polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Akihiro Higashitani, Arnau Padrol, Raman Sanyal","submitted_at":"2026-05-21T15:11:33Z","abstract_excerpt":"We prove that every 0/1-polytope has a unique Minkowski decomposition into indecomposable polytopes, up to translation of summands. The summands lie in pairwise orthogonal subspaces. Thus, every 0/1-polytope is the Cartesian product of indecomposable 0/1-polytopes.\n  As applications, we obtain uniform combinatorial indecomposability criteria for order and chain polytopes, matroid polytopes, stable set and clique polytopes, edge polytopes, flow polytopes, and 2-level/compressed polytopes. We also show that every nontrivial factorization of a multi-affine polynomial is a product of multi-affine "},"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":"2605.22594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-21T15:11:33Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"a10079939ce83b87d098a438f4cedf46a82217f6735840c1f99427258b861bad","abstract_canon_sha256":"99a985765b83adfe667382e97a9070734fa218d0042e03087e028a925d434804"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:59.248951Z","signature_b64":"PzJdGjRk96wBjTOK7IfekTKRwteKA4yrZHDgXN1nqRGj0xjIUZeM+3agJsMw6epxQR7yNoGPLud2n/5V3B/qDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7095029acdd573e97fa4e0b04e9d576bd6688a52d8e00028f9fb1f5ebb6b7ecb","last_reissued_at":"2026-05-22T01:04:59.248099Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:59.248099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indecomposability of 0/1-polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Akihiro Higashitani, Arnau Padrol, Raman Sanyal","submitted_at":"2026-05-21T15:11:33Z","abstract_excerpt":"We prove that every 0/1-polytope has a unique Minkowski decomposition into indecomposable polytopes, up to translation of summands. The summands lie in pairwise orthogonal subspaces. Thus, every 0/1-polytope is the Cartesian product of indecomposable 0/1-polytopes.\n  As applications, we obtain uniform combinatorial indecomposability criteria for order and chain polytopes, matroid polytopes, stable set and clique polytopes, edge polytopes, flow polytopes, and 2-level/compressed polytopes. We also show that every nontrivial factorization of a multi-affine polynomial is a product of multi-affine "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22594","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.22594/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.22594","created_at":"2026-05-22T01:04:59.248234+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22594v1","created_at":"2026-05-22T01:04:59.248234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22594","created_at":"2026-05-22T01:04:59.248234+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCKQFGWN2VZ6","created_at":"2026-05-22T01:04:59.248234+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCKQFGWN2VZ6S75E","created_at":"2026-05-22T01:04:59.248234+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCKQFGWN","created_at":"2026-05-22T01:04:59.248234+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/OCKQFGWN2VZ6S75E4CYE5HKXNP","json":"https://pith.science/pith/OCKQFGWN2VZ6S75E4CYE5HKXNP.json","graph_json":"https://pith.science/api/pith-number/OCKQFGWN2VZ6S75E4CYE5HKXNP/graph.json","events_json":"https://pith.science/api/pith-number/OCKQFGWN2VZ6S75E4CYE5HKXNP/events.json","paper":"https://pith.science/paper/OCKQFGWN"},"agent_actions":{"view_html":"https://pith.science/pith/OCKQFGWN2VZ6S75E4CYE5HKXNP","download_json":"https://pith.science/pith/OCKQFGWN2VZ6S75E4CYE5HKXNP.json","view_paper":"https://pith.science/paper/OCKQFGWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22594&json=true","fetch_graph":"https://pith.science/api/pith-number/OCKQFGWN2VZ6S75E4CYE5HKXNP/graph.json","fetch_events":"https://pith.science/api/pith-number/OCKQFGWN2VZ6S75E4CYE5HKXNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCKQFGWN2VZ6S75E4CYE5HKXNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCKQFGWN2VZ6S75E4CYE5HKXNP/action/storage_attestation","attest_author":"https://pith.science/pith/OCKQFGWN2VZ6S75E4CYE5HKXNP/action/author_attestation","sign_citation":"https://pith.science/pith/OCKQFGWN2VZ6S75E4CYE5HKXNP/action/citation_signature","submit_replication":"https://pith.science/pith/OCKQFGWN2VZ6S75E4CYE5HKXNP/action/replication_record"}},"created_at":"2026-05-22T01:04:59.248234+00:00","updated_at":"2026-05-22T01:04:59.248234+00:00"}