{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZHJR6VQFI7TQC2GE6RYKWXP4CW","short_pith_number":"pith:ZHJR6VQF","schema_version":"1.0","canonical_sha256":"c9d31f560547e70168c4f470ab5dfc159b610fe375588de14452f74ff3b5a844","source":{"kind":"arxiv","id":"1101.2003","version":2},"attestation_state":"computed","paper":{"title":"Fault-tolerant Cooperative Tasking for Multi-agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Hai Lin, Mohammad Karimadini","submitted_at":"2011-01-11T02:05:23Z","abstract_excerpt":"A natural way for cooperative tasking in multi-agent systems is through a top-down design by decomposing a global task into sub-tasks for each individual agent such that the accomplishments of these sub-tasks will guarantee the achievement of the global task. In our previous works [1], [2] we presented necessary and sufficient conditions on the decomposability of a global task automaton between cooperative agents. As a follow-up work, this paper deals with the robustness issues of the proposed top-down design approach with respect to event failures in the multi-agent systems. The main concern "},"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.2003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-01-11T02:05:23Z","cross_cats_sorted":["cs.MA","math.OC"],"title_canon_sha256":"225bf46cd6b97a2a2d385dc3486776f6f6b0b9c0ad442affd2825369af00dea1","abstract_canon_sha256":"c3906e457fc57d776d31845cb9bd5ef2bf2795924ea3c1c13bd46850d11d83b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:59.040700Z","signature_b64":"Hs96kw2M+8fSupq+n2saPOmJf9L1EFgslzkriynpmAlY/aAJ10ApU9J9/S6cA6QpssLXj/AhwGwMa+u/b6XFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9d31f560547e70168c4f470ab5dfc159b610fe375588de14452f74ff3b5a844","last_reissued_at":"2026-05-18T02:22:59.040060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:59.040060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant Cooperative Tasking for Multi-agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Hai Lin, Mohammad Karimadini","submitted_at":"2011-01-11T02:05:23Z","abstract_excerpt":"A natural way for cooperative tasking in multi-agent systems is through a top-down design by decomposing a global task into sub-tasks for each individual agent such that the accomplishments of these sub-tasks will guarantee the achievement of the global task. In our previous works [1], [2] we presented necessary and sufficient conditions on the decomposability of a global task automaton between cooperative agents. As a follow-up work, this paper deals with the robustness issues of the proposed top-down design approach with respect to event failures in the multi-agent systems. The main concern "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2003","kind":"arxiv","version":2},"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.2003","created_at":"2026-05-18T02:22:59.040150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2003v2","created_at":"2026-05-18T02:22:59.040150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2003","created_at":"2026-05-18T02:22:59.040150+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHJR6VQFI7TQ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHJR6VQFI7TQC2GE","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHJR6VQF","created_at":"2026-05-18T12:26:47.523578+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/ZHJR6VQFI7TQC2GE6RYKWXP4CW","json":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW.json","graph_json":"https://pith.science/api/pith-number/ZHJR6VQFI7TQC2GE6RYKWXP4CW/graph.json","events_json":"https://pith.science/api/pith-number/ZHJR6VQFI7TQC2GE6RYKWXP4CW/events.json","paper":"https://pith.science/paper/ZHJR6VQF"},"agent_actions":{"view_html":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW","download_json":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW.json","view_paper":"https://pith.science/paper/ZHJR6VQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2003&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHJR6VQFI7TQC2GE6RYKWXP4CW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHJR6VQFI7TQC2GE6RYKWXP4CW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/action/storage_attestation","attest_author":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/action/author_attestation","sign_citation":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/action/citation_signature","submit_replication":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/action/replication_record"}},"created_at":"2026-05-18T02:22:59.040150+00:00","updated_at":"2026-05-18T02:22:59.040150+00:00"}