{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:G4SCDXYAPMC4P6SNHJFSRL36LK","short_pith_number":"pith:G4SCDXYA","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"},"canonical_sha256":"372421df007b05c7fa4d3a4b28af7e5a93975b4eb90b75fa7e41a0afc3fd803a","source":{"kind":"arxiv","id":"2512.05307","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.05307","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"2512.05307v4","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.05307","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"G4SCDXYAPMC4","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"pith_short_16","alias_value":"G4SCDXYAPMC4P6SN","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"pith_short_8","alias_value":"G4SCDXYA","created_at":"2026-05-26T01:03:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:G4SCDXYAPMC4P6SNHJFSRL36LK","target":"record","payload":{"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"},"canonical_sha256":"372421df007b05c7fa4d3a4b28af7e5a93975b4eb90b75fa7e41a0afc3fd803a","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"},"source_kind":"arxiv","source_id":"2512.05307","source_version":4,"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-26T01:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0p8wTGmMFOK/HUE0L28cCRJ/frxAXX4oISGXPAwb0nPL6csA2EfzKWUm7bBAF5sScd/tOnNc7yicNYfDPHBdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:42:36.263834Z"},"content_sha256":"605da9a53d3d3dea3b5ed10d57c4284ce3a6c69481a45bffd31b6f24151644ec","schema_version":"1.0","event_id":"sha256:605da9a53d3d3dea3b5ed10d57c4284ce3a6c69481a45bffd31b6f24151644ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:G4SCDXYAPMC4P6SNHJFSRL36LK","target":"graph","payload":{"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"},"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-26T01:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hW5u7re4oZxiFK1W5xusSmRWWxrN1Z7cP6/W5mPbnq1SofV/NrqZTnp81Gv0sdU9TgI+ZRWlLwfndXuFZGcEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:42:36.264288Z"},"content_sha256":"71055fc1e0f71854cd9c3c1953770b4a8772d0e5d767373c60c250771abf3a18","schema_version":"1.0","event_id":"sha256:71055fc1e0f71854cd9c3c1953770b4a8772d0e5d767373c60c250771abf3a18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/bundle.json","state_url":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/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-06-10T11:42:36Z","links":{"resolver":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK","bundle":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/bundle.json","state":"https://pith.science/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4SCDXYAPMC4P6SNHJFSRL36LK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:G4SCDXYAPMC4P6SNHJFSRL36LK","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":"882c8fc15778f23ba1ef1576c13cc5b4ce23bf01e561f8e46a82665f7be93069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-12-04T23:02:42Z","title_canon_sha256":"7a72594f16347280770080c0f17049652cf4dfb3410a3627e54fdad06208616e"},"schema_version":"1.0","source":{"id":"2512.05307","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.05307","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"2512.05307v4","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.05307","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"G4SCDXYAPMC4","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"pith_short_16","alias_value":"G4SCDXYAPMC4P6SN","created_at":"2026-05-26T01:03:19Z"},{"alias_kind":"pith_short_8","alias_value":"G4SCDXYA","created_at":"2026-05-26T01:03:19Z"}],"graph_snapshots":[{"event_id":"sha256:71055fc1e0f71854cd9c3c1953770b4a8772d0e5d767373c60c250771abf3a18","target":"graph","created_at":"2026-05-26T01:03:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.05307/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Arnau Padrol, Germain Poullot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-12-04T23:02:42Z","title":"Indecomposability and beyond via the graph of edge dependencies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.05307","kind":"arxiv","version":4},"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:605da9a53d3d3dea3b5ed10d57c4284ce3a6c69481a45bffd31b6f24151644ec","target":"record","created_at":"2026-05-26T01:03:19Z","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":"882c8fc15778f23ba1ef1576c13cc5b4ce23bf01e561f8e46a82665f7be93069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-12-04T23:02:42Z","title_canon_sha256":"7a72594f16347280770080c0f17049652cf4dfb3410a3627e54fdad06208616e"},"schema_version":"1.0","source":{"id":"2512.05307","kind":"arxiv","version":4}},"canonical_sha256":"372421df007b05c7fa4d3a4b28af7e5a93975b4eb90b75fa7e41a0afc3fd803a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"372421df007b05c7fa4d3a4b28af7e5a93975b4eb90b75fa7e41a0afc3fd803a","first_computed_at":"2026-05-26T01:03:19.310720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:19.310720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8JEH5YxLbTFwsiP0H6pYYvwT0W84GVNAAnsxdFYucSWtbPJSYCAwDz/ukVNFFsj7fOCjpM5X4sHxKPU01pCvCQ==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:19.311262Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.05307","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:605da9a53d3d3dea3b5ed10d57c4284ce3a6c69481a45bffd31b6f24151644ec","sha256:71055fc1e0f71854cd9c3c1953770b4a8772d0e5d767373c60c250771abf3a18"],"state_sha256":"850b07e89d5651cb79f5b4f6d4ad72dea862e5d6b5011ae5513fb669556e6db6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aqno298sW3Ly7vk3OSqee9dMwuBLuB0HHIJR5vjhnOvuZ0MCxBzdBC5JX/koVOJQhUkkKIA6aSeoOw0Qbp7MAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:42:36.267344Z","bundle_sha256":"18d6b21fec8ac6334cba17bd1dee7a1b912a35b8e5bc5ed935be4fbab8ba9a32"}}