{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LJ4LPMIJ6WIMCB3A2BL5KMB3TE","short_pith_number":"pith:LJ4LPMIJ","schema_version":"1.0","canonical_sha256":"5a78b7b109f590c10760d057d5303b992597ac95521b3e2ff2ac7e4253285c03","source":{"kind":"arxiv","id":"1507.01158","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.01158","created_at":"2026-05-18T01:37:17.970762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01158v1","created_at":"2026-05-18T01:37:17.970762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01158","created_at":"2026-05-18T01:37:17.970762+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ4LPMIJ6WIM","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ4LPMIJ6WIMCB3A","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ4LPMIJ","created_at":"2026-05-18T12:29:29.992203+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/LJ4LPMIJ6WIMCB3A2BL5KMB3TE","json":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE.json","graph_json":"https://pith.science/api/pith-number/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/graph.json","events_json":"https://pith.science/api/pith-number/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/events.json","paper":"https://pith.science/paper/LJ4LPMIJ"},"agent_actions":{"view_html":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE","download_json":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE.json","view_paper":"https://pith.science/paper/LJ4LPMIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01158&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/action/storage_attestation","attest_author":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/action/author_attestation","sign_citation":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/action/citation_signature","submit_replication":"https://pith.science/pith/LJ4LPMIJ6WIMCB3A2BL5KMB3TE/action/replication_record"}},"created_at":"2026-05-18T01:37:17.970762+00:00","updated_at":"2026-05-18T01:37:17.970762+00:00"}