{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NM3IYPOU7HLKFIB7IPQX3YWYSQ","short_pith_number":"pith:NM3IYPOU","schema_version":"1.0","canonical_sha256":"6b368c3dd4f9d6a2a03f43e17de2d894325e68b09fac21c81e4bc7a965a7635f","source":{"kind":"arxiv","id":"2404.12570","version":1},"attestation_state":"computed","paper":{"title":"Stackelberg Game-Theoretic Learning for Collaborative Assembly Task Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.RO","authors_text":"Lan Shi, Quanyan Zhu, Yuhan Zhao","submitted_at":"2024-04-19T01:37:23Z","abstract_excerpt":"As assembly tasks grow in complexity, collaboration among multiple robots becomes essential for task completion. However, centralized task planning has become inadequate for adapting to the increasing intelligence and versatility of robots, along with rising customized orders. There is a need for efficient and automated planning mechanisms capable of coordinating diverse robots for collaborative assembly. To this end, we propose a Stackelberg game-theoretic learning approach. By leveraging Stackelberg games, we characterize robot collaboration through leader-follower interaction to enhance str"},"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":"2404.12570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-04-19T01:37:23Z","cross_cats_sorted":["cs.GT","cs.MA"],"title_canon_sha256":"9ed267e9a145ab330f5f171ae1100963fa731c905536f170827e9e9222f7b942","abstract_canon_sha256":"8225b3cb25b78f75d885c790dc6517aaeeda447636df2a533e3dd633ceae3e6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:09:55.455005Z","signature_b64":"aAjaDh3OLKiAgEBlQOSm4E9w9YxOgvCRUHz6PBvb2/yQQhzSj0teQr9+A+Fa3Xf0HUrzbctyYHlaXf3kaRfnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b368c3dd4f9d6a2a03f43e17de2d894325e68b09fac21c81e4bc7a965a7635f","last_reissued_at":"2026-07-05T08:09:55.454576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:09:55.454576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stackelberg Game-Theoretic Learning for Collaborative Assembly Task Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA"],"primary_cat":"cs.RO","authors_text":"Lan Shi, Quanyan Zhu, Yuhan Zhao","submitted_at":"2024-04-19T01:37:23Z","abstract_excerpt":"As assembly tasks grow in complexity, collaboration among multiple robots becomes essential for task completion. However, centralized task planning has become inadequate for adapting to the increasing intelligence and versatility of robots, along with rising customized orders. There is a need for efficient and automated planning mechanisms capable of coordinating diverse robots for collaborative assembly. To this end, we propose a Stackelberg game-theoretic learning approach. By leveraging Stackelberg games, we characterize robot collaboration through leader-follower interaction to enhance str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.12570","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/2404.12570/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":"2404.12570","created_at":"2026-07-05T08:09:55.454638+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.12570v1","created_at":"2026-07-05T08:09:55.454638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.12570","created_at":"2026-07-05T08:09:55.454638+00:00"},{"alias_kind":"pith_short_12","alias_value":"NM3IYPOU7HLK","created_at":"2026-07-05T08:09:55.454638+00:00"},{"alias_kind":"pith_short_16","alias_value":"NM3IYPOU7HLKFIB7","created_at":"2026-07-05T08:09:55.454638+00:00"},{"alias_kind":"pith_short_8","alias_value":"NM3IYPOU","created_at":"2026-07-05T08:09:55.454638+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/NM3IYPOU7HLKFIB7IPQX3YWYSQ","json":"https://pith.science/pith/NM3IYPOU7HLKFIB7IPQX3YWYSQ.json","graph_json":"https://pith.science/api/pith-number/NM3IYPOU7HLKFIB7IPQX3YWYSQ/graph.json","events_json":"https://pith.science/api/pith-number/NM3IYPOU7HLKFIB7IPQX3YWYSQ/events.json","paper":"https://pith.science/paper/NM3IYPOU"},"agent_actions":{"view_html":"https://pith.science/pith/NM3IYPOU7HLKFIB7IPQX3YWYSQ","download_json":"https://pith.science/pith/NM3IYPOU7HLKFIB7IPQX3YWYSQ.json","view_paper":"https://pith.science/paper/NM3IYPOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.12570&json=true","fetch_graph":"https://pith.science/api/pith-number/NM3IYPOU7HLKFIB7IPQX3YWYSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NM3IYPOU7HLKFIB7IPQX3YWYSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NM3IYPOU7HLKFIB7IPQX3YWYSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NM3IYPOU7HLKFIB7IPQX3YWYSQ/action/storage_attestation","attest_author":"https://pith.science/pith/NM3IYPOU7HLKFIB7IPQX3YWYSQ/action/author_attestation","sign_citation":"https://pith.science/pith/NM3IYPOU7HLKFIB7IPQX3YWYSQ/action/citation_signature","submit_replication":"https://pith.science/pith/NM3IYPOU7HLKFIB7IPQX3YWYSQ/action/replication_record"}},"created_at":"2026-07-05T08:09:55.454638+00:00","updated_at":"2026-07-05T08:09:55.454638+00:00"}