{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G4SCDXYAPMC4P6SNHJFSRL36LK","short_pith_number":"pith:G4SCDXYA","schema_version":"1.0","canonical_sha256":"372421df007b05c7fa4d3a4b28af7e5a93975b4eb90b75fa7e41a0afc3fd803a","source":{"kind":"arxiv","id":"2512.05307","version":4},"attestation_state":"computed","paper":{"title":"Indecomposability and beyond via the graph of edge dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arnau Padrol, Germain Poullot","submitted_at":"2025-12-04T23:02:42Z","abstract_excerpt":"A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize indecomposability. In this paper, we introduce a new approach to indecomposability for frameworks and polytopes based on the graph of implicit edge dependencies, which records proportionalities between edge lengths across all deformations. This yields a new indecomposability criterion that unifies and generalizes most previous approaches, and has additional consequenc"},"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":"2512.05307","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-12-04T23:02:42Z","cross_cats_sorted":[],"title_canon_sha256":"7a72594f16347280770080c0f17049652cf4dfb3410a3627e54fdad06208616e","abstract_canon_sha256":"882c8fc15778f23ba1ef1576c13cc5b4ce23bf01e561f8e46a82665f7be93069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:19.311262Z","signature_b64":"8JEH5YxLbTFwsiP0H6pYYvwT0W84GVNAAnsxdFYucSWtbPJSYCAwDz/ukVNFFsj7fOCjpM5X4sHxKPU01pCvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"372421df007b05c7fa4d3a4b28af7e5a93975b4eb90b75fa7e41a0afc3fd803a","last_reissued_at":"2026-05-26T01:03:19.310720Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:19.310720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indecomposability and beyond via the graph of edge dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arnau Padrol, Germain Poullot","submitted_at":"2025-12-04T23:02:42Z","abstract_excerpt":"A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize indecomposability. In this paper, we introduce a new approach to indecomposability for frameworks and polytopes based on the graph of implicit edge dependencies, which records proportionalities between edge lengths across all deformations. This yields a new indecomposability criterion that unifies and generalizes most previous approaches, and has additional consequenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.05307","kind":"arxiv","version":4},"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/2512.05307/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":"2512.05307","created_at":"2026-05-26T01:03:19.310789+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.05307v4","created_at":"2026-05-26T01:03:19.310789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.05307","created_at":"2026-05-26T01:03:19.310789+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4SCDXYAPMC4","created_at":"2026-05-26T01:03:19.310789+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4SCDXYAPMC4P6SN","created_at":"2026-05-26T01:03:19.310789+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4SCDXYA","created_at":"2026-05-26T01:03:19.310789+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22594","citing_title":"Indecomposability of 0/1-polytopes","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK","json":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK.json","graph_json":"https://pith.science/api/pith-number/G4SCDXYAPMC4P6SNHJFSRL36LK/graph.json","events_json":"https://pith.science/api/pith-number/G4SCDXYAPMC4P6SNHJFSRL36LK/events.json","paper":"https://pith.science/paper/G4SCDXYA"},"agent_actions":{"view_html":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK","download_json":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK.json","view_paper":"https://pith.science/paper/G4SCDXYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.05307&json=true","fetch_graph":"https://pith.science/api/pith-number/G4SCDXYAPMC4P6SNHJFSRL36LK/graph.json","fetch_events":"https://pith.science/api/pith-number/G4SCDXYAPMC4P6SNHJFSRL36LK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/action/storage_attestation","attest_author":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/action/author_attestation","sign_citation":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/action/citation_signature","submit_replication":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/action/replication_record"}},"created_at":"2026-05-26T01:03:19.310789+00:00","updated_at":"2026-05-26T01:03:19.310789+00:00"}