{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5H7RRACXC4WYUOGERAY6SASTDY","short_pith_number":"pith:5H7RRACX","schema_version":"1.0","canonical_sha256":"e9ff188057172d8a38c48831e902531e1f6daa90c8067e6ab12b712684ad0cc8","source":{"kind":"arxiv","id":"2206.02877","version":1},"attestation_state":"computed","paper":{"title":"Convex Relaxation for Optimal Fixture Layout Design","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jeffrey H. Hunt, Jianjun Shi, Shancong Mou, Zhen Zhong","submitted_at":"2022-06-06T20:07:51Z","abstract_excerpt":"This paper proposes a general fixture layout design framework that directly integrates the system equation with the convex relaxation method. Note that the optimal fixture design problem is a large-scale combinatorial optimization problem, we relax it to a convex semidefinite programming (SDP) problem by adopting sparse learning and SDP relaxation techniques. It can be solved efficiently by existing convex optimization algorithms and thus generates a near-optimal fixture layout. A real case study in the half-to-half fuselage assembly process indicates the superiority of our proposed algorithm "},"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":"2206.02877","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2022-06-06T20:07:51Z","cross_cats_sorted":[],"title_canon_sha256":"389e3dbc3391358dbed8626c3047d129585ccca472bbb248553f8a1f531450f3","abstract_canon_sha256":"de90fa4b71796ac1ff1125980e3ba852b0946a9981180e033e8ccad5fb176c79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:29:36.842735Z","signature_b64":"dToDjIbevXGkTHFmYFLonrlojyLzcTT0g/woPplpvWQD+KCWFar/uX34RD09vtoZ9K7pXpq6XGMmYgSuiayBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9ff188057172d8a38c48831e902531e1f6daa90c8067e6ab12b712684ad0cc8","last_reissued_at":"2026-07-05T04:29:36.842361Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:29:36.842361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Relaxation for Optimal Fixture Layout Design","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jeffrey H. Hunt, Jianjun Shi, Shancong Mou, Zhen Zhong","submitted_at":"2022-06-06T20:07:51Z","abstract_excerpt":"This paper proposes a general fixture layout design framework that directly integrates the system equation with the convex relaxation method. Note that the optimal fixture design problem is a large-scale combinatorial optimization problem, we relax it to a convex semidefinite programming (SDP) problem by adopting sparse learning and SDP relaxation techniques. It can be solved efficiently by existing convex optimization algorithms and thus generates a near-optimal fixture layout. A real case study in the half-to-half fuselage assembly process indicates the superiority of our proposed algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.02877","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/2206.02877/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":"2206.02877","created_at":"2026-07-05T04:29:36.842423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.02877v1","created_at":"2026-07-05T04:29:36.842423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.02877","created_at":"2026-07-05T04:29:36.842423+00:00"},{"alias_kind":"pith_short_12","alias_value":"5H7RRACXC4WY","created_at":"2026-07-05T04:29:36.842423+00:00"},{"alias_kind":"pith_short_16","alias_value":"5H7RRACXC4WYUOGE","created_at":"2026-07-05T04:29:36.842423+00:00"},{"alias_kind":"pith_short_8","alias_value":"5H7RRACX","created_at":"2026-07-05T04:29:36.842423+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/5H7RRACXC4WYUOGERAY6SASTDY","json":"https://pith.science/pith/5H7RRACXC4WYUOGERAY6SASTDY.json","graph_json":"https://pith.science/api/pith-number/5H7RRACXC4WYUOGERAY6SASTDY/graph.json","events_json":"https://pith.science/api/pith-number/5H7RRACXC4WYUOGERAY6SASTDY/events.json","paper":"https://pith.science/paper/5H7RRACX"},"agent_actions":{"view_html":"https://pith.science/pith/5H7RRACXC4WYUOGERAY6SASTDY","download_json":"https://pith.science/pith/5H7RRACXC4WYUOGERAY6SASTDY.json","view_paper":"https://pith.science/paper/5H7RRACX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.02877&json=true","fetch_graph":"https://pith.science/api/pith-number/5H7RRACXC4WYUOGERAY6SASTDY/graph.json","fetch_events":"https://pith.science/api/pith-number/5H7RRACXC4WYUOGERAY6SASTDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5H7RRACXC4WYUOGERAY6SASTDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5H7RRACXC4WYUOGERAY6SASTDY/action/storage_attestation","attest_author":"https://pith.science/pith/5H7RRACXC4WYUOGERAY6SASTDY/action/author_attestation","sign_citation":"https://pith.science/pith/5H7RRACXC4WYUOGERAY6SASTDY/action/citation_signature","submit_replication":"https://pith.science/pith/5H7RRACXC4WYUOGERAY6SASTDY/action/replication_record"}},"created_at":"2026-07-05T04:29:36.842423+00:00","updated_at":"2026-07-05T04:29:36.842423+00:00"}