{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:W4G7P7QUYKCYLMO2JQLRBORIFE","short_pith_number":"pith:W4G7P7QU","canonical_record":{"source":{"id":"0911.0231","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2009-11-02T04:23:25Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"dd8d7381b4914a8f143bcf6eefc1df2c8597f844ba6e87f7d35f542368ddba57","abstract_canon_sha256":"40cd36a73fcda9449b408f8655f6bff895ee7b1849adb6e09ce6880623cd00c5"},"schema_version":"1.0"},"canonical_sha256":"b70df7fe14c28585b1da4c1710ba28293d840de0dbffada5dab92660cea6a7f4","source":{"kind":"arxiv","id":"0911.0231","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.0231","created_at":"2026-05-18T04:31:50Z"},{"alias_kind":"arxiv_version","alias_value":"0911.0231v3","created_at":"2026-05-18T04:31:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0231","created_at":"2026-05-18T04:31:50Z"},{"alias_kind":"pith_short_12","alias_value":"W4G7P7QUYKCY","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"W4G7P7QUYKCYLMO2","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"W4G7P7QU","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:W4G7P7QUYKCYLMO2JQLRBORIFE","target":"record","payload":{"canonical_record":{"source":{"id":"0911.0231","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2009-11-02T04:23:25Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"dd8d7381b4914a8f143bcf6eefc1df2c8597f844ba6e87f7d35f542368ddba57","abstract_canon_sha256":"40cd36a73fcda9449b408f8655f6bff895ee7b1849adb6e09ce6880623cd00c5"},"schema_version":"1.0"},"canonical_sha256":"b70df7fe14c28585b1da4c1710ba28293d840de0dbffada5dab92660cea6a7f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:50.522896Z","signature_b64":"IfJngWMAjrN2yl2DmEuqDGJcUoiZbwlI1XSfu4WtERvQNl458WK4EhZPBMDjkxp84UWdiSQpAN5fZdI5w2uIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b70df7fe14c28585b1da4c1710ba28293d840de0dbffada5dab92660cea6a7f4","last_reissued_at":"2026-05-18T04:31:50.522238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:50.522238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.0231","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-18T04:31:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dxDdtIgOCAbVPuBJA2yJ9mIKb6E45ZM7z0AvZ59UcBFj2lSQwTa6C1RGRglklQg9gK9iiCwQ30YGCEzL8qnWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:47:17.142939Z"},"content_sha256":"c2c992e62f170c8a4e22a1531b69c49b43f83fbe187889d5a020746c8ccf9fe3","schema_version":"1.0","event_id":"sha256:c2c992e62f170c8a4e22a1531b69c49b43f83fbe187889d5a020746c8ccf9fe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:W4G7P7QUYKCYLMO2JQLRBORIFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synchronized Task Decomposition for Cooperative Multi-agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"cs.MA","authors_text":"Hai Lin, Mohammad Karimadini","submitted_at":"2009-11-02T04:23:25Z","abstract_excerpt":"It is an amazing fact that remarkably complex behaviors could emerge from a large collection of very rudimentary dynamical agents through very simple local interactions. However, it still remains elusive on how to design these local interactions among agents so as to achieve certain desired collective behaviors. This paper aims to tackle this challenge and proposes a divide-and-conquer approach to guarantee specified global behaviors through local coordination and control design for multi-agent systems. The basic idea is to decompose the requested global specification into subtasks for each in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0231","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-18T04:31:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5poEb0yChRbGAt+qGjhp3RRwUvmuUhuayudgI/2PCLMyhr2+aO7ukX1NJLG8Fan9AHSDxCb6MAzYcY+7vMdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:47:17.143725Z"},"content_sha256":"2679059d65e1010f0b27a141dfa0c1aae36d833c19ebf9d86186dd52e0d031de","schema_version":"1.0","event_id":"sha256:2679059d65e1010f0b27a141dfa0c1aae36d833c19ebf9d86186dd52e0d031de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4G7P7QUYKCYLMO2JQLRBORIFE/bundle.json","state_url":"https://pith.science/pith/W4G7P7QUYKCYLMO2JQLRBORIFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4G7P7QUYKCYLMO2JQLRBORIFE/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:47:17Z","links":{"resolver":"https://pith.science/pith/W4G7P7QUYKCYLMO2JQLRBORIFE","bundle":"https://pith.science/pith/W4G7P7QUYKCYLMO2JQLRBORIFE/bundle.json","state":"https://pith.science/pith/W4G7P7QUYKCYLMO2JQLRBORIFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4G7P7QUYKCYLMO2JQLRBORIFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:W4G7P7QUYKCYLMO2JQLRBORIFE","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":"40cd36a73fcda9449b408f8655f6bff895ee7b1849adb6e09ce6880623cd00c5","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2009-11-02T04:23:25Z","title_canon_sha256":"dd8d7381b4914a8f143bcf6eefc1df2c8597f844ba6e87f7d35f542368ddba57"},"schema_version":"1.0","source":{"id":"0911.0231","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.0231","created_at":"2026-05-18T04:31:50Z"},{"alias_kind":"arxiv_version","alias_value":"0911.0231v3","created_at":"2026-05-18T04:31:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0231","created_at":"2026-05-18T04:31:50Z"},{"alias_kind":"pith_short_12","alias_value":"W4G7P7QUYKCY","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"W4G7P7QUYKCYLMO2","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"W4G7P7QU","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:2679059d65e1010f0b27a141dfa0c1aae36d833c19ebf9d86186dd52e0d031de","target":"graph","created_at":"2026-05-18T04:31:50Z","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":"It is an amazing fact that remarkably complex behaviors could emerge from a large collection of very rudimentary dynamical agents through very simple local interactions. However, it still remains elusive on how to design these local interactions among agents so as to achieve certain desired collective behaviors. This paper aims to tackle this challenge and proposes a divide-and-conquer approach to guarantee specified global behaviors through local coordination and control design for multi-agent systems. The basic idea is to decompose the requested global specification into subtasks for each in","authors_text":"Hai Lin, Mohammad Karimadini","cross_cats":["cs.DC","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2009-11-02T04:23:25Z","title":"Synchronized Task Decomposition for Cooperative Multi-agent Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0231","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:c2c992e62f170c8a4e22a1531b69c49b43f83fbe187889d5a020746c8ccf9fe3","target":"record","created_at":"2026-05-18T04:31:50Z","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":"40cd36a73fcda9449b408f8655f6bff895ee7b1849adb6e09ce6880623cd00c5","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2009-11-02T04:23:25Z","title_canon_sha256":"dd8d7381b4914a8f143bcf6eefc1df2c8597f844ba6e87f7d35f542368ddba57"},"schema_version":"1.0","source":{"id":"0911.0231","kind":"arxiv","version":3}},"canonical_sha256":"b70df7fe14c28585b1da4c1710ba28293d840de0dbffada5dab92660cea6a7f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b70df7fe14c28585b1da4c1710ba28293d840de0dbffada5dab92660cea6a7f4","first_computed_at":"2026-05-18T04:31:50.522238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:50.522238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IfJngWMAjrN2yl2DmEuqDGJcUoiZbwlI1XSfu4WtERvQNl458WK4EhZPBMDjkxp84UWdiSQpAN5fZdI5w2uIBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:50.522896Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.0231","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2c992e62f170c8a4e22a1531b69c49b43f83fbe187889d5a020746c8ccf9fe3","sha256:2679059d65e1010f0b27a141dfa0c1aae36d833c19ebf9d86186dd52e0d031de"],"state_sha256":"e0cb4dafead3bb6168402f72fe4101167df0e5127414ef770591e63aa2032a29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4ocSLF3BVQAT8l2lTo2WvUczFUUMOoXhXMv+c+W/VtDNwmWsxLQwtvC1tLYX2TDRzAzYmfAVsiCZKTPZT39Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:47:17.147890Z","bundle_sha256":"c8c26786c28a9c2200e78dda97c823c725d8bd12c35472016109fa56ff618466"}}