{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UCPGNLT6XEC7SJ2DPNDXMJLJL3","short_pith_number":"pith:UCPGNLT6","canonical_record":{"source":{"id":"2506.01079","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-01T16:30:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3258223cbb7b13e80b60e13cc5483fd8a42fbc4fe0a831eac7998ddaebe18efd","abstract_canon_sha256":"9dd9f6727c68c0b57a318b545f2f21aa4888e316aa0ae68f90a89fc1535dbde3"},"schema_version":"1.0"},"canonical_sha256":"a09e66ae7eb905f927437b477625695ec127ec3bb6c92aa6bd3e43a63b200737","source":{"kind":"arxiv","id":"2506.01079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01079","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01079v1","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01079","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"UCPGNLT6XEC7","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_16","alias_value":"UCPGNLT6XEC7SJ2D","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_8","alias_value":"UCPGNLT6","created_at":"2026-07-05T11:13:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UCPGNLT6XEC7SJ2DPNDXMJLJL3","target":"record","payload":{"canonical_record":{"source":{"id":"2506.01079","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-01T16:30:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3258223cbb7b13e80b60e13cc5483fd8a42fbc4fe0a831eac7998ddaebe18efd","abstract_canon_sha256":"9dd9f6727c68c0b57a318b545f2f21aa4888e316aa0ae68f90a89fc1535dbde3"},"schema_version":"1.0"},"canonical_sha256":"a09e66ae7eb905f927437b477625695ec127ec3bb6c92aa6bd3e43a63b200737","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:46.064937Z","signature_b64":"BBnv4uCP6oPD3V5Qfpu3EQjuxppnb95h81lnLXg4kH4HVgg3h/XBxlO2TJiJNN6pFGZkVQJbdz4RWvZlv3sUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a09e66ae7eb905f927437b477625695ec127ec3bb6c92aa6bd3e43a63b200737","last_reissued_at":"2026-07-05T11:13:46.064472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:46.064472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.01079","source_version":1,"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-07-05T11:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVi9vsorL/ndKepfpps91HstRkqb5OoYXaCImFeUSJpElj/onaZQTgSPZ8RllS2aTXEm3WVzTBJa6xLk/ZEZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:09:42.526821Z"},"content_sha256":"c7924d15d27eb492d1bffc4722952c47930f76ae7add0810490008ac2ad8475c","schema_version":"1.0","event_id":"sha256:c7924d15d27eb492d1bffc4722952c47930f76ae7add0810490008ac2ad8475c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UCPGNLT6XEC7SJ2DPNDXMJLJL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unfolding Boxes with Local Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CG","authors_text":"Bernardo Subercaseaux, Eric Wang, Long Qian, Marijn J. H. Heule","submitted_at":"2025-06-01T16:30:07Z","abstract_excerpt":"We consider the problem of finding and enumerating polyominos that can be folded into multiple non-isomorphic boxes. While several computational approaches have been proposed, including SAT, randomized algorithms, and decision diagrams, none has been able to perform at scale. We argue that existing SAT encodings are hindered by the presence of global constraints (e.g., graph connectivity or acyclicity), which are generally hard to encode effectively and hard for solvers to reason about. In this work, we propose a new SAT-based approach that replaces these global constraints with simple local c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01079","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/2506.01079/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-07-05T11:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eF4ZOX3X9gb50E2H733+NXRMzI3ATlCWwX1bfbSOqtDpWM/s31acSoK1HQsWzm6egpLGvG5I6EbdUZBlx8RgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:09:42.527719Z"},"content_sha256":"5c2c08436840f95011adf2117ed837d079678265b0b61b1e180839921fef316c","schema_version":"1.0","event_id":"sha256:5c2c08436840f95011adf2117ed837d079678265b0b61b1e180839921fef316c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCPGNLT6XEC7SJ2DPNDXMJLJL3/bundle.json","state_url":"https://pith.science/pith/UCPGNLT6XEC7SJ2DPNDXMJLJL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCPGNLT6XEC7SJ2DPNDXMJLJL3/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-08-08T01:09:42Z","links":{"resolver":"https://pith.science/pith/UCPGNLT6XEC7SJ2DPNDXMJLJL3","bundle":"https://pith.science/pith/UCPGNLT6XEC7SJ2DPNDXMJLJL3/bundle.json","state":"https://pith.science/pith/UCPGNLT6XEC7SJ2DPNDXMJLJL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCPGNLT6XEC7SJ2DPNDXMJLJL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UCPGNLT6XEC7SJ2DPNDXMJLJL3","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":"9dd9f6727c68c0b57a318b545f2f21aa4888e316aa0ae68f90a89fc1535dbde3","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-01T16:30:07Z","title_canon_sha256":"3258223cbb7b13e80b60e13cc5483fd8a42fbc4fe0a831eac7998ddaebe18efd"},"schema_version":"1.0","source":{"id":"2506.01079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01079","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01079v1","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01079","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"UCPGNLT6XEC7","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_16","alias_value":"UCPGNLT6XEC7SJ2D","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_8","alias_value":"UCPGNLT6","created_at":"2026-07-05T11:13:46Z"}],"graph_snapshots":[{"event_id":"sha256:5c2c08436840f95011adf2117ed837d079678265b0b61b1e180839921fef316c","target":"graph","created_at":"2026-07-05T11:13:46Z","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/2506.01079/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of finding and enumerating polyominos that can be folded into multiple non-isomorphic boxes. While several computational approaches have been proposed, including SAT, randomized algorithms, and decision diagrams, none has been able to perform at scale. We argue that existing SAT encodings are hindered by the presence of global constraints (e.g., graph connectivity or acyclicity), which are generally hard to encode effectively and hard for solvers to reason about. In this work, we propose a new SAT-based approach that replaces these global constraints with simple local c","authors_text":"Bernardo Subercaseaux, Eric Wang, Long Qian, Marijn J. H. Heule","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-01T16:30:07Z","title":"Unfolding Boxes with Local Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01079","kind":"arxiv","version":1},"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:c7924d15d27eb492d1bffc4722952c47930f76ae7add0810490008ac2ad8475c","target":"record","created_at":"2026-07-05T11:13:46Z","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":"9dd9f6727c68c0b57a318b545f2f21aa4888e316aa0ae68f90a89fc1535dbde3","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-01T16:30:07Z","title_canon_sha256":"3258223cbb7b13e80b60e13cc5483fd8a42fbc4fe0a831eac7998ddaebe18efd"},"schema_version":"1.0","source":{"id":"2506.01079","kind":"arxiv","version":1}},"canonical_sha256":"a09e66ae7eb905f927437b477625695ec127ec3bb6c92aa6bd3e43a63b200737","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a09e66ae7eb905f927437b477625695ec127ec3bb6c92aa6bd3e43a63b200737","first_computed_at":"2026-07-05T11:13:46.064472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:46.064472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BBnv4uCP6oPD3V5Qfpu3EQjuxppnb95h81lnLXg4kH4HVgg3h/XBxlO2TJiJNN6pFGZkVQJbdz4RWvZlv3sUBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:46.064937Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7924d15d27eb492d1bffc4722952c47930f76ae7add0810490008ac2ad8475c","sha256:5c2c08436840f95011adf2117ed837d079678265b0b61b1e180839921fef316c"],"state_sha256":"905444ea1c5c650813a08546031867c2e7f6c92c32d0e5feac1a0e7c0aa5218f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PekIrLDLtAk4rFkJSFoscxY9eFjUYySrdDB6OO1LN7DP1PY/YWVc+aUp1Sq3TMiTtCZY1fgyIq+pfGNwupNSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T01:09:42.533333Z","bundle_sha256":"573ebdb8a85fe49925da4f7735f3fda3da188bf0ce2c883cd1d0dc0ad1145659"}}