{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VDKW3P3TAEGRYQCYJA7CULZE2V","short_pith_number":"pith:VDKW3P3T","schema_version":"1.0","canonical_sha256":"a8d56dbf73010d1c4058483e2a2f24d57201ad994b04a9ae932757b00f5a1b9d","source":{"kind":"arxiv","id":"2608.02445","version":1},"attestation_state":"computed","paper":{"title":"Minkowski decomposability of symmetric edge polytopes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akihiro Higashitani, Aki Mori","submitted_at":"2026-08-03T16:23:46Z","abstract_excerpt":"In this paper, we study the Minkowski decomposability of symmetric edge polytopes $P_G^\\pm$ of a finite simple graph $G$ on vertex set $[n]$. More precisely, we give a complete characterization of graphs whose symmetric edge polytopes are Minkowski decomposable. We prove that $P_G^\\pm$ is Minkowski decomposable if and only if $G$ is one of the three complete multipartite graphs: $K_n$, $K_{2,n-2}$, or $K_{1,1,n-2}$. In other words, if $G$ does not belong to these three families, then $P_G^\\pm$ is Minkowski indecomposable."},"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":"2608.02445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-03T16:23:46Z","cross_cats_sorted":[],"title_canon_sha256":"7d7454015bd1450aa981581c149809bddc81cb51f60ab8ae4a9e056583b310e5","abstract_canon_sha256":"8713f192a1b7bff590378703fddaedd808e542afd51066e0a9517619dcb5012d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:43:31.326978Z","signature_b64":"rZJuck+pYMVaAXhmJldEZlKxq9TD6lQp2/unyxfCqQ2a1DLAaXKZWEuhC3nQzldbg3hFkciCDHSNpIMwzY6ZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8d56dbf73010d1c4058483e2a2f24d57201ad994b04a9ae932757b00f5a1b9d","last_reissued_at":"2026-08-04T02:43:31.324691Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:43:31.324691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minkowski decomposability of symmetric edge polytopes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akihiro Higashitani, Aki Mori","submitted_at":"2026-08-03T16:23:46Z","abstract_excerpt":"In this paper, we study the Minkowski decomposability of symmetric edge polytopes $P_G^\\pm$ of a finite simple graph $G$ on vertex set $[n]$. More precisely, we give a complete characterization of graphs whose symmetric edge polytopes are Minkowski decomposable. We prove that $P_G^\\pm$ is Minkowski decomposable if and only if $G$ is one of the three complete multipartite graphs: $K_n$, $K_{2,n-2}$, or $K_{1,1,n-2}$. In other words, if $G$ does not belong to these three families, then $P_G^\\pm$ is Minkowski indecomposable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02445","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/2608.02445/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":"2608.02445","created_at":"2026-08-04T02:43:31.327001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.02445v1","created_at":"2026-08-04T02:43:31.327001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02445","created_at":"2026-08-04T02:43:31.327001+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDKW3P3TAEGR","created_at":"2026-08-04T02:43:31.327001+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDKW3P3TAEGRYQCY","created_at":"2026-08-04T02:43:31.327001+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDKW3P3T","created_at":"2026-08-04T02:43:31.327001+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/VDKW3P3TAEGRYQCYJA7CULZE2V","json":"https://pith.science/pith/VDKW3P3TAEGRYQCYJA7CULZE2V.json","graph_json":"https://pith.science/api/pith-number/VDKW3P3TAEGRYQCYJA7CULZE2V/graph.json","events_json":"https://pith.science/api/pith-number/VDKW3P3TAEGRYQCYJA7CULZE2V/events.json","paper":"https://pith.science/paper/VDKW3P3T"},"agent_actions":{"view_html":"https://pith.science/pith/VDKW3P3TAEGRYQCYJA7CULZE2V","download_json":"https://pith.science/pith/VDKW3P3TAEGRYQCYJA7CULZE2V.json","view_paper":"https://pith.science/paper/VDKW3P3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.02445&json=true","fetch_graph":"https://pith.science/api/pith-number/VDKW3P3TAEGRYQCYJA7CULZE2V/graph.json","fetch_events":"https://pith.science/api/pith-number/VDKW3P3TAEGRYQCYJA7CULZE2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDKW3P3TAEGRYQCYJA7CULZE2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDKW3P3TAEGRYQCYJA7CULZE2V/action/storage_attestation","attest_author":"https://pith.science/pith/VDKW3P3TAEGRYQCYJA7CULZE2V/action/author_attestation","sign_citation":"https://pith.science/pith/VDKW3P3TAEGRYQCYJA7CULZE2V/action/citation_signature","submit_replication":"https://pith.science/pith/VDKW3P3TAEGRYQCYJA7CULZE2V/action/replication_record"}},"created_at":"2026-08-04T02:43:31.327001+00:00","updated_at":"2026-08-04T02:43:31.327001+00:00"}