{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:K4SH6CDBUQBD3JNX6ICQ2NXTAP","short_pith_number":"pith:K4SH6CDB","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"},"canonical_sha256":"57247f0861a4023da5b7f2050d36f303cee674ca139ff08487cfd5c2f18a79fa","source":{"kind":"arxiv","id":"1101.2002","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2002","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2002v3","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2002","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"K4SH6CDBUQBD","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K4SH6CDBUQBD3JNX","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K4SH6CDB","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:K4SH6CDBUQBD3JNX6ICQ2NXTAP","target":"record","payload":{"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"},"canonical_sha256":"57247f0861a4023da5b7f2050d36f303cee674ca139ff08487cfd5c2f18a79fa","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"},"source_kind":"arxiv","source_id":"1101.2002","source_version":3,"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":"q7Ehq4DqNEfpaK2ARUhjDC9zZflFs1JuCfb7e4ntYPhBj3ApBZj9+jpPibiHXvu6UiXMWVeAjzcUQXnwvDE2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:32:04.215891Z"},"content_sha256":"2024f6ee141499dd4d866ce9c2f6228394f8d5061ec8e19ca52d19d2417f3ce1","schema_version":"1.0","event_id":"sha256:2024f6ee141499dd4d866ce9c2f6228394f8d5061ec8e19ca52d19d2417f3ce1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:K4SH6CDBUQBD3JNX6ICQ2NXTAP","target":"graph","payload":{"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"},"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":"gG7BSgUelH/YLPE1hiutLAr39Jm14L+0EJ0BHBIYqPKBYYhIZ+WUh1TM7Sqjgzf5/BjKAYYLy4RqBDx1Ff7BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:32:04.216618Z"},"content_sha256":"1bc0ce1084c4114912d66127bdeb75378f95130c5d219157219f8684229d71b1","schema_version":"1.0","event_id":"sha256:1bc0ce1084c4114912d66127bdeb75378f95130c5d219157219f8684229d71b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/bundle.json","state_url":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/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-10T02:32:04Z","links":{"resolver":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP","bundle":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/bundle.json","state":"https://pith.science/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K4SH6CDBUQBD3JNX6ICQ2NXTAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:K4SH6CDBUQBD3JNX6ICQ2NXTAP","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":"d78e30381b7c9f0e2e276f501fe26d759bfb623c0c7f007890adf0db39797d2f","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-01-11T01:44:37Z","title_canon_sha256":"9e46416c31f48ce0dbc520bcdc44f304e395c0e2e7abe5d13e1dd6fc4a5128ca"},"schema_version":"1.0","source":{"id":"1101.2002","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2002","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2002v3","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2002","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"K4SH6CDBUQBD","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K4SH6CDBUQBD3JNX","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K4SH6CDB","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:1bc0ce1084c4114912d66127bdeb75378f95130c5d219157219f8684229d71b1","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":"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","authors_text":"Hai Lin, Mohammad Karimadini","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-01-11T01:44:37Z","title":"Cooperative Tasking for Deterministic Specification Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2002","kind":"arxiv","version":3},"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:2024f6ee141499dd4d866ce9c2f6228394f8d5061ec8e19ca52d19d2417f3ce1","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":"d78e30381b7c9f0e2e276f501fe26d759bfb623c0c7f007890adf0db39797d2f","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-01-11T01:44:37Z","title_canon_sha256":"9e46416c31f48ce0dbc520bcdc44f304e395c0e2e7abe5d13e1dd6fc4a5128ca"},"schema_version":"1.0","source":{"id":"1101.2002","kind":"arxiv","version":3}},"canonical_sha256":"57247f0861a4023da5b7f2050d36f303cee674ca139ff08487cfd5c2f18a79fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57247f0861a4023da5b7f2050d36f303cee674ca139ff08487cfd5c2f18a79fa","first_computed_at":"2026-05-18T02:22:59.049862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:59.049862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zkGy2yKStmZ8JmIqUtuxgWqmC0q2d7CvU2h5ZoQDns5VWZXi2tVgQsJOMtrJHY0F83YGL2+OtWY2oTYmbVF5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:59.050549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2002","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2024f6ee141499dd4d866ce9c2f6228394f8d5061ec8e19ca52d19d2417f3ce1","sha256:1bc0ce1084c4114912d66127bdeb75378f95130c5d219157219f8684229d71b1"],"state_sha256":"9d72cfd1905244960a770f83d84a7933a0bd29eda44e234227a360ca8cee65dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2i+CwsQvwbsxwqg0ehfQyfUkL44r0Fbl/mP8pUE5p3MW1yh/XXfeKI9vhSKQqoDCZBZ5+VRiotK2HHV/O9MDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:32:04.220470Z","bundle_sha256":"3b9a45a6daff2696ca28b96b7a03b9356b3415146af2cb2dd92d722f94f5f8c9"}}