{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZHJR6VQFI7TQC2GE6RYKWXP4CW","short_pith_number":"pith:ZHJR6VQF","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"},"canonical_sha256":"c9d31f560547e70168c4f470ab5dfc159b610fe375588de14452f74ff3b5a844","source":{"kind":"arxiv","id":"1101.2003","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2003","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2003v2","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2003","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZHJR6VQFI7TQ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZHJR6VQFI7TQC2GE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZHJR6VQF","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZHJR6VQFI7TQC2GE6RYKWXP4CW","target":"record","payload":{"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"},"canonical_sha256":"c9d31f560547e70168c4f470ab5dfc159b610fe375588de14452f74ff3b5a844","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"},"source_kind":"arxiv","source_id":"1101.2003","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhN0tFDQ0KSshCg9LXgv8h4Ms8BRha8Eg19eU8Zw24kfT8tnZspX1lVhkRC+/RhsyGZcLbuaNSAQ2/Dz72uIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:01:31.589356Z"},"content_sha256":"5e364731f54709bf40d49c61f6d75c2f242c6c443d79a14d944e24f5c2a0bcf4","schema_version":"1.0","event_id":"sha256:5e364731f54709bf40d49c61f6d75c2f242c6c443d79a14d944e24f5c2a0bcf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZHJR6VQFI7TQC2GE6RYKWXP4CW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WplTdlpQZnDYFHUqcnBZq5JysJ38XrzizjidZRFnoW8IS7cCl3k+50C+uuq9F8jbcRe6HJ9nqRYvOsisW/nRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:01:31.589875Z"},"content_sha256":"07923d676e33e4da9e0e4d6ed9290fbd26448c2701fe2fc0973db027b70d0b15","schema_version":"1.0","event_id":"sha256:07923d676e33e4da9e0e4d6ed9290fbd26448c2701fe2fc0973db027b70d0b15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/bundle.json","state_url":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T12:01:31Z","links":{"resolver":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW","bundle":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/bundle.json","state":"https://pith.science/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHJR6VQFI7TQC2GE6RYKWXP4CW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZHJR6VQFI7TQC2GE6RYKWXP4CW","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":"c3906e457fc57d776d31845cb9bd5ef2bf2795924ea3c1c13bd46850d11d83b0","cross_cats_sorted":["cs.MA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-01-11T02:05:23Z","title_canon_sha256":"225bf46cd6b97a2a2d385dc3486776f6f6b0b9c0ad442affd2825369af00dea1"},"schema_version":"1.0","source":{"id":"1101.2003","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2003","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2003v2","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2003","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZHJR6VQFI7TQ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZHJR6VQFI7TQC2GE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZHJR6VQF","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:07923d676e33e4da9e0e4d6ed9290fbd26448c2701fe2fc0973db027b70d0b15","target":"graph","created_at":"2026-05-18T02:22:59Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Hai Lin, Mohammad Karimadini","cross_cats":["cs.MA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-01-11T02:05:23Z","title":"Fault-tolerant Cooperative Tasking for Multi-agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2003","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5e364731f54709bf40d49c61f6d75c2f242c6c443d79a14d944e24f5c2a0bcf4","target":"record","created_at":"2026-05-18T02:22:59Z","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":"c3906e457fc57d776d31845cb9bd5ef2bf2795924ea3c1c13bd46850d11d83b0","cross_cats_sorted":["cs.MA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-01-11T02:05:23Z","title_canon_sha256":"225bf46cd6b97a2a2d385dc3486776f6f6b0b9c0ad442affd2825369af00dea1"},"schema_version":"1.0","source":{"id":"1101.2003","kind":"arxiv","version":2}},"canonical_sha256":"c9d31f560547e70168c4f470ab5dfc159b610fe375588de14452f74ff3b5a844","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9d31f560547e70168c4f470ab5dfc159b610fe375588de14452f74ff3b5a844","first_computed_at":"2026-05-18T02:22:59.040060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:59.040060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hs96kw2M+8fSupq+n2saPOmJf9L1EFgslzkriynpmAlY/aAJ10ApU9J9/S6cA6QpssLXj/AhwGwMa+u/b6XFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:59.040700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2003","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e364731f54709bf40d49c61f6d75c2f242c6c443d79a14d944e24f5c2a0bcf4","sha256:07923d676e33e4da9e0e4d6ed9290fbd26448c2701fe2fc0973db027b70d0b15"],"state_sha256":"3f79e6ab43561841e76809fbd7485d5c54d54cde4d294fe3a94570150266720f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8W8rWQxtDJFmjPOFcNoNzaV+66MCb4DhfHYrwxmy4qcxy42t8ab5l9aXt4Gbb+A5Xpx4Z83ZXpk2Zj/PznKKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:01:31.595022Z","bundle_sha256":"103e1bf9def997e39b69b52ce4ae62d30bd510e0ea030482a45e92816c7d98d6"}}