{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SCNYAZM6D63NSRDS4R2ESWDPZ3","short_pith_number":"pith:SCNYAZM6","schema_version":"1.0","canonical_sha256":"909b80659e1fb6d94472e47449586fced5a43f19d3d2547946daf47edab88867","source":{"kind":"arxiv","id":"2503.10743","version":1},"attestation_state":"computed","paper":{"title":"Spatial-Temporal Graph Diffusion Policy with Kinematic Modeling for Bimanual Robotic Manipulation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.RO","authors_text":"Hao Li, Jianye Hao, Liqiang Nie, Longxiang Gao, Michael Yu Wang, Qi Lv, Rui Shao, Xiang Deng, Yinchuan Li","submitted_at":"2025-03-13T17:48:35Z","abstract_excerpt":"Despite the significant success of imitation learning in robotic manipulation, its application to bimanual tasks remains highly challenging. Existing approaches mainly learn a policy to predict a distant next-best end-effector pose (NBP) and then compute the corresponding joint rotation angles for motion using inverse kinematics. However, they suffer from two important issues: (1) rarely considering the physical robotic structure, which may cause self-collisions or interferences, and (2) overlooking the kinematics constraint, which may result in the predicted poses not conforming to the actual"},"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":"2503.10743","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2025-03-13T17:48:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5493bdb532ef4cb2010504894bf8f72d5fefbe908e7e763f2622480a5b38f0ce","abstract_canon_sha256":"e91e45cbc1c7b760667573b3a98f099db1ff0a7f09387df98d1eeec54193310e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:05.227787Z","signature_b64":"swqCvoiRJxF7tOi6xG3lfhee8T75UugUqtdTwS/tYGcep5pEHJXPUfGFyg2SIIGNBJ0YVBSdaceTGfzccAnEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"909b80659e1fb6d94472e47449586fced5a43f19d3d2547946daf47edab88867","last_reissued_at":"2026-07-05T10:31:05.227281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:05.227281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatial-Temporal Graph Diffusion Policy with Kinematic Modeling for Bimanual Robotic Manipulation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.RO","authors_text":"Hao Li, Jianye Hao, Liqiang Nie, Longxiang Gao, Michael Yu Wang, Qi Lv, Rui Shao, Xiang Deng, Yinchuan Li","submitted_at":"2025-03-13T17:48:35Z","abstract_excerpt":"Despite the significant success of imitation learning in robotic manipulation, its application to bimanual tasks remains highly challenging. Existing approaches mainly learn a policy to predict a distant next-best end-effector pose (NBP) and then compute the corresponding joint rotation angles for motion using inverse kinematics. However, they suffer from two important issues: (1) rarely considering the physical robotic structure, which may cause self-collisions or interferences, and (2) overlooking the kinematics constraint, which may result in the predicted poses not conforming to the actual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10743","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/2503.10743/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":"2503.10743","created_at":"2026-07-05T10:31:05.227343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10743v1","created_at":"2026-07-05T10:31:05.227343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10743","created_at":"2026-07-05T10:31:05.227343+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCNYAZM6D63N","created_at":"2026-07-05T10:31:05.227343+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCNYAZM6D63NSRDS","created_at":"2026-07-05T10:31:05.227343+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCNYAZM6","created_at":"2026-07-05T10:31:05.227343+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03142","citing_title":"AffordDP: Generalizable Diffusion Policy with Transferable Affordance","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SCNYAZM6D63NSRDS4R2ESWDPZ3","json":"https://pith.science/pith/SCNYAZM6D63NSRDS4R2ESWDPZ3.json","graph_json":"https://pith.science/api/pith-number/SCNYAZM6D63NSRDS4R2ESWDPZ3/graph.json","events_json":"https://pith.science/api/pith-number/SCNYAZM6D63NSRDS4R2ESWDPZ3/events.json","paper":"https://pith.science/paper/SCNYAZM6"},"agent_actions":{"view_html":"https://pith.science/pith/SCNYAZM6D63NSRDS4R2ESWDPZ3","download_json":"https://pith.science/pith/SCNYAZM6D63NSRDS4R2ESWDPZ3.json","view_paper":"https://pith.science/paper/SCNYAZM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10743&json=true","fetch_graph":"https://pith.science/api/pith-number/SCNYAZM6D63NSRDS4R2ESWDPZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/SCNYAZM6D63NSRDS4R2ESWDPZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCNYAZM6D63NSRDS4R2ESWDPZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCNYAZM6D63NSRDS4R2ESWDPZ3/action/storage_attestation","attest_author":"https://pith.science/pith/SCNYAZM6D63NSRDS4R2ESWDPZ3/action/author_attestation","sign_citation":"https://pith.science/pith/SCNYAZM6D63NSRDS4R2ESWDPZ3/action/citation_signature","submit_replication":"https://pith.science/pith/SCNYAZM6D63NSRDS4R2ESWDPZ3/action/replication_record"}},"created_at":"2026-07-05T10:31:05.227343+00:00","updated_at":"2026-07-05T10:31:05.227343+00:00"}