{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Y6WZV3LGTHTFQA75HYGYCNU2AC","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":"ce3b8e4e5e6893b14bf783306fcbc0684913de174bd803916fb9ad0255a0eb16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T01:09:42Z","title_canon_sha256":"254bbacca19c11e2460a85993b9b9f3409d2cdfbea3f28a493ba73f1afdae61e"},"schema_version":"1.0","source":{"id":"2605.15510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15510","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15510v1","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15510","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y6WZV3LGTHTF","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"Y6WZV3LGTHTFQA75","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"Y6WZV3LG","created_at":"2026-05-20T00:01:02Z"}],"graph_snapshots":[{"event_id":"sha256:5adb4e93e6e529c34d706df348c7de1c1b606beb9ee9b3b5c49efb7a5c29bbd0","target":"graph","created_at":"2026-05-20T00:01:02Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"A 27-variable robotic hand design problem is constructed, and simulated annealing is used as a classical baseline to verify the feasibility of the formulation. Quantum annealing is further performed to examine the applicability of the proposed formulation to annealing-based hardware execution. The results show that feasible design combinations satisfying both one-hot selection and pairwise constraints can be obtained, with the observed objective-value range becoming narrower as the number of reads increases."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That design-dependent kinematic metrics can be evaluated accurately by classical computation and that the resulting combinatorial selection problem, including individual rewards, workspace interactions, one-hot constraints, and structural penalties, can be faithfully encoded as a single quadratic objective without critical loss of fidelity."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Presents a QUBO formulation framework for kinematic structure-based robot design optimization, demonstrated on a 27-variable robotic hand case study using simulated and quantum annealing to obtain feasible designs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A framework encodes robotic hand kinematic designs as a single quadratic binary optimization problem."}],"snapshot_sha256":"5c4e763e3896c3d840ac663fae429a3b81a2e7ba3aa37522961c8adb20a378a6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:17.931643Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:53:35.171584Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:55.165370Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.056815Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.849548Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.388447Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.635995Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15510/integrity.json","findings":[],"snapshot_sha256":"bad1bf33544ea4dcb8254700d13e998ca3853e526c411296febb20708ec8feb4","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a quadratic unconstrained binary optimization-based formulation framework for robot design optimization using kinematic structure-level evaluation metrics. In the proposed framework, classical computation is used to evaluate design-dependent metrics while the resulting combinatorial selection problem is formulated in a structure compatible with quantum annealing-based optimization. A robotic hand is adopted as a representative case study, as its performance is determined by both the individual kinematic characteristics of each finger and interaction terms. The proposed form","authors_text":"Dongil Park, HyoJae Kang, Jeongdo Ahn, Yeong Jae Park","cross_cats":[],"headline":"A framework encodes robotic hand kinematic designs as a single quadratic binary optimization problem.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T01:09:42Z","title":"A QUBO Formulation Framework for Kinematic Structure-Based Robot Design Optimization: A Robotic Hand Case Study"},"references":{"count":31,"internal_anchors":4,"resolved_work":31,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Quantum supremacy using a programmable superconducting processor,","work_id":"e093478e-ab8c-4307-85eb-64f759fc4517","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Ibm quantum system two,","work_id":"fb80937f-17f9-4dd3-9cc4-bfd58b6e17b1","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Quan- tum computational advantage with a programmable photonic processor,","work_id":"9e4002e9-8ac4-4b18-abb7-2adea858af6c","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Borealis photonic quantum computer,","work_id":"e30b2979-1a48-4298-86a7-f9cd8134d285","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Available: https://www.xanadu.ai","work_id":"3d4fdcb8-02b4-4d61-b867-d9e72ae00488","year":null}],"snapshot_sha256":"b6bfdadbc7a4c366836a2aee88443f629aef37eab170923f563add6b8ab29183"},"source":{"id":"2605.15510","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:36:05.290386Z","id":"71b3378d-cfce-4f59-a4b8-ad9a97a46dc8","model_set":{"reader":"grok-4.3"},"one_line_summary":"Presents a QUBO formulation framework for kinematic structure-based robot design optimization, demonstrated on a 27-variable robotic hand case study using simulated and quantum annealing to obtain feasible designs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A framework encodes robotic hand kinematic designs as a single quadratic binary optimization problem.","strongest_claim":"A 27-variable robotic hand design problem is constructed, and simulated annealing is used as a classical baseline to verify the feasibility of the formulation. Quantum annealing is further performed to examine the applicability of the proposed formulation to annealing-based hardware execution. The results show that feasible design combinations satisfying both one-hot selection and pairwise constraints can be obtained, with the observed objective-value range becoming narrower as the number of reads increases.","weakest_assumption":"That design-dependent kinematic metrics can be evaluated accurately by classical computation and that the resulting combinatorial selection problem, including individual rewards, workspace interactions, one-hot constraints, and structural penalties, can be faithfully encoded as a single quadratic objective without critical loss of fidelity."}},"verdict_id":"71b3378d-cfce-4f59-a4b8-ad9a97a46dc8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:95022e3408538c41b91fa3482fe9596785e3f7b6304426cbaa8aa12468d8c27a","target":"record","created_at":"2026-05-20T00:01:02Z","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":"ce3b8e4e5e6893b14bf783306fcbc0684913de174bd803916fb9ad0255a0eb16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T01:09:42Z","title_canon_sha256":"254bbacca19c11e2460a85993b9b9f3409d2cdfbea3f28a493ba73f1afdae61e"},"schema_version":"1.0","source":{"id":"2605.15510","kind":"arxiv","version":1}},"canonical_sha256":"c7ad9aed6699e65803fd3e0d81369a00bc3a4ad75821e38acb4896130d005231","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7ad9aed6699e65803fd3e0d81369a00bc3a4ad75821e38acb4896130d005231","first_computed_at":"2026-05-20T00:01:02.332019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:02.332019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"046a+nT0so0vtn7SQmkEKHYGmtHNDA7bEjyt2N5a9d9CosZanmQy/xFFX5gJ7Qt0jpgp/6pw0rR/qUn0NcVSAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:02.332760Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95022e3408538c41b91fa3482fe9596785e3f7b6304426cbaa8aa12468d8c27a","sha256:5adb4e93e6e529c34d706df348c7de1c1b606beb9ee9b3b5c49efb7a5c29bbd0"],"state_sha256":"7865af20548144fe8291b73dbce6725650e131d8dead4d73a05d176015ce350e"}