{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LJ4LPMIJ6WIMCB3A2BL5KMB3TE","short_pith_number":"pith:LJ4LPMIJ","canonical_record":{"source":{"id":"1507.01158","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2015-07-05T02:05:17Z","cross_cats_sorted":[],"title_canon_sha256":"afa26297d5a89c3eb741cd55d2498f446afec12302ec6c0355b59241f66cb90e","abstract_canon_sha256":"7812b9f372df2cb3a2c0adb0b81a5b4ef03806d9206e8ba4a0d77376c0af172b"},"schema_version":"1.0"},"canonical_sha256":"5a78b7b109f590c10760d057d5303b992597ac95521b3e2ff2ac7e4253285c03","source":{"kind":"arxiv","id":"1507.01158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01158","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01158v1","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01158","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"LJ4LPMIJ6WIM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LJ4LPMIJ6WIMCB3A","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LJ4LPMIJ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LJ4LPMIJ6WIMCB3A2BL5KMB3TE","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01158","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2015-07-05T02:05:17Z","cross_cats_sorted":[],"title_canon_sha256":"afa26297d5a89c3eb741cd55d2498f446afec12302ec6c0355b59241f66cb90e","abstract_canon_sha256":"7812b9f372df2cb3a2c0adb0b81a5b4ef03806d9206e8ba4a0d77376c0af172b"},"schema_version":"1.0"},"canonical_sha256":"5a78b7b109f590c10760d057d5303b992597ac95521b3e2ff2ac7e4253285c03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:17.971352Z","signature_b64":"wG0SmsGGSXTwjfaDnRcXgGr4NgvT/ywTe44ULkEfKizfgK+fvJuNqDM+s73XvK0IEMFm8IuJC2AJfQjK9jdhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a78b7b109f590c10760d057d5303b992597ac95521b3e2ff2ac7e4253285c03","last_reissued_at":"2026-05-18T01:37:17.970659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:17.970659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01158","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-05-18T01:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gWUWLo2SHOW3nSzVExW0AntFREqeJ/xB0r0SBBIJQquay0nBHkvfZgPVHC2G3JNVipZoa+KdripT/GWJk/xDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:18:34.197789Z"},"content_sha256":"6c72d856bb3c5d0af0e44e96c5c4fce0032fbeb7ce4f987f37b1c4dd49ab577d","schema_version":"1.0","event_id":"sha256:6c72d856bb3c5d0af0e44e96c5c4fce0032fbeb7ce4f987f37b1c4dd49ab577d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LJ4LPMIJ6WIMCB3A2BL5KMB3TE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Decomposition and Recombination of Isostatic Geometric Constraint Systems for Designing Layered Materials","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Joel Willoughby, Meera Sitharam, Menghan Wang, Troy Baker","submitted_at":"2015-07-05T02:05:17Z","abstract_excerpt":"Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint systems, we describe an O(n^3) algorithm for a broad class of constraint systems that are isostatic or underconstrained. The algorithm achieves optimality by using the new notion of a canonical DR-plan that also meets various desirable, previously studied criteria. In addition, we leverage recent results on Cayley configuration spaces to show that the indeco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01158","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":""},"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-18T01:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMVkwEWlUOTkTYvHsIwybOmgT0V8bQbsHNGQZZpiXzzfbybQrpK9lQQuoTayQ6nFrMCzSEhW6gXL7hbr1ZQhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:18:34.198495Z"},"content_sha256":"f6ab21538c5d7e6b8933736c46e2c4d93dcb947dd0de3bf483681ca0ce8f8043","schema_version":"1.0","event_id":"sha256:f6ab21538c5d7e6b8933736c46e2c4d93dcb947dd0de3bf483681ca0ce8f8043"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/bundle.json","state_url":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/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-05-25T21:18:34Z","links":{"resolver":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE","bundle":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/bundle.json","state":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LJ4LPMIJ6WIMCB3A2BL5KMB3TE","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":"7812b9f372df2cb3a2c0adb0b81a5b4ef03806d9206e8ba4a0d77376c0af172b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2015-07-05T02:05:17Z","title_canon_sha256":"afa26297d5a89c3eb741cd55d2498f446afec12302ec6c0355b59241f66cb90e"},"schema_version":"1.0","source":{"id":"1507.01158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01158","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01158v1","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01158","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"LJ4LPMIJ6WIM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LJ4LPMIJ6WIMCB3A","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LJ4LPMIJ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:f6ab21538c5d7e6b8933736c46e2c4d93dcb947dd0de3bf483681ca0ce8f8043","target":"graph","created_at":"2026-05-18T01:37:17Z","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"},"paper":{"abstract_excerpt":"Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint systems, we describe an O(n^3) algorithm for a broad class of constraint systems that are isostatic or underconstrained. The algorithm achieves optimality by using the new notion of a canonical DR-plan that also meets various desirable, previously studied criteria. In addition, we leverage recent results on Cayley configuration spaces to show that the indeco","authors_text":"Joel Willoughby, Meera Sitharam, Menghan Wang, Troy Baker","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2015-07-05T02:05:17Z","title":"Optimal Decomposition and Recombination of Isostatic Geometric Constraint Systems for Designing Layered Materials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01158","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:6c72d856bb3c5d0af0e44e96c5c4fce0032fbeb7ce4f987f37b1c4dd49ab577d","target":"record","created_at":"2026-05-18T01:37:17Z","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":"7812b9f372df2cb3a2c0adb0b81a5b4ef03806d9206e8ba4a0d77376c0af172b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2015-07-05T02:05:17Z","title_canon_sha256":"afa26297d5a89c3eb741cd55d2498f446afec12302ec6c0355b59241f66cb90e"},"schema_version":"1.0","source":{"id":"1507.01158","kind":"arxiv","version":1}},"canonical_sha256":"5a78b7b109f590c10760d057d5303b992597ac95521b3e2ff2ac7e4253285c03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a78b7b109f590c10760d057d5303b992597ac95521b3e2ff2ac7e4253285c03","first_computed_at":"2026-05-18T01:37:17.970659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:17.970659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wG0SmsGGSXTwjfaDnRcXgGr4NgvT/ywTe44ULkEfKizfgK+fvJuNqDM+s73XvK0IEMFm8IuJC2AJfQjK9jdhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:17.971352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c72d856bb3c5d0af0e44e96c5c4fce0032fbeb7ce4f987f37b1c4dd49ab577d","sha256:f6ab21538c5d7e6b8933736c46e2c4d93dcb947dd0de3bf483681ca0ce8f8043"],"state_sha256":"84807f22a735efdb53063216675a45e0b51e167b2018f498019ca6546aa8d3b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oP9GywBmlxcpeqTL6W6Y1KfkHNk8OcNvNcilJdRfNC1Kl5EQuRMPlj5HPt6KwvWEqbcxdaOlM6BTI0Q2/lLBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:18:34.202579Z","bundle_sha256":"b26f77478de885f0ae1720e7998d1f5e501b93054deecb33c4d32844e6307249"}}