{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K4SH6CDBUQBD3JNX6ICQ2NXTAP","short_pith_number":"pith:K4SH6CDB","schema_version":"1.0","canonical_sha256":"57247f0861a4023da5b7f2050d36f303cee674ca139ff08487cfd5c2f18a79fa","source":{"kind":"arxiv","id":"1101.2002","version":3},"attestation_state":"computed","paper":{"title":"Cooperative Tasking for Deterministic Specification Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Hai Lin, Mohammad Karimadini","submitted_at":"2011-01-11T01:44:37Z","abstract_excerpt":"In our previous work [1], a divide-and-conquer approach was proposed for cooperative tasking among multi-agent systems. The basic idea is to decompose a requested global specification into subtasks for individual agents such that the fulfillment of these subtasks by each individual agent leads to the satisfaction of the global specification as a team. It was shown that not all tasks can be decomposed. Furthermore, a necessary and sufficient condition was proposed for the decomposability of a task automaton between two cooperative agents. The current paper continues the results in [1] and propo"},"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":"1101.2002","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-01-11T01:44:37Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"9e46416c31f48ce0dbc520bcdc44f304e395c0e2e7abe5d13e1dd6fc4a5128ca","abstract_canon_sha256":"d78e30381b7c9f0e2e276f501fe26d759bfb623c0c7f007890adf0db39797d2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:59.050549Z","signature_b64":"zkGy2yKStmZ8JmIqUtuxgWqmC0q2d7CvU2h5ZoQDns5VWZXi2tVgQsJOMtrJHY0F83YGL2+OtWY2oTYmbVF5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57247f0861a4023da5b7f2050d36f303cee674ca139ff08487cfd5c2f18a79fa","last_reissued_at":"2026-05-18T02:22:59.049862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:59.049862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Tasking for Deterministic Specification Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.SY","authors_text":"Hai Lin, Mohammad Karimadini","submitted_at":"2011-01-11T01:44:37Z","abstract_excerpt":"In our previous work [1], a divide-and-conquer approach was proposed for cooperative tasking among multi-agent systems. The basic idea is to decompose a requested global specification into subtasks for individual agents such that the fulfillment of these subtasks by each individual agent leads to the satisfaction of the global specification as a team. It was shown that not all tasks can be decomposed. Furthermore, a necessary and sufficient condition was proposed for the decomposability of a task automaton between two cooperative agents. The current paper continues the results in [1] and propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2002","kind":"arxiv","version":3},"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":"1101.2002","created_at":"2026-05-18T02:22:59.049959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2002v3","created_at":"2026-05-18T02:22:59.049959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2002","created_at":"2026-05-18T02:22:59.049959+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4SH6CDBUQBD","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4SH6CDBUQBD3JNX","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4SH6CDB","created_at":"2026-05-18T12:26:32.869790+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/K4SH6CDBUQBD3JNX6ICQ2NXTAP","json":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP.json","graph_json":"https://pith.science/api/pith-number/K4SH6CDBUQBD3JNX6ICQ2NXTAP/graph.json","events_json":"https://pith.science/api/pith-number/K4SH6CDBUQBD3JNX6ICQ2NXTAP/events.json","paper":"https://pith.science/paper/K4SH6CDB"},"agent_actions":{"view_html":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP","download_json":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP.json","view_paper":"https://pith.science/paper/K4SH6CDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2002&json=true","fetch_graph":"https://pith.science/api/pith-number/K4SH6CDBUQBD3JNX6ICQ2NXTAP/graph.json","fetch_events":"https://pith.science/api/pith-number/K4SH6CDBUQBD3JNX6ICQ2NXTAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/action/storage_attestation","attest_author":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/action/author_attestation","sign_citation":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/action/citation_signature","submit_replication":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/action/replication_record"}},"created_at":"2026-05-18T02:22:59.049959+00:00","updated_at":"2026-05-18T02:22:59.049959+00:00"}