{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2L7BHYCQ22OO36GMKURQ76R6VQ","short_pith_number":"pith:2L7BHYCQ","canonical_record":{"source":{"id":"1610.08379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-26T15:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"7c5ace6cee900eb4c1b15daa905ada830eee3677b03db97355e1bfd1c92b1776","abstract_canon_sha256":"b5aa212eedcb0a32d9ac55b4fd6188da46c2b0d6a20ae3f08a36977a4e9194fd"},"schema_version":"1.0"},"canonical_sha256":"d2fe13e050d69cedf8cc55230ffa3eac0e1c4cb18011701a33614f1cfa35a20c","source":{"kind":"arxiv","id":"1610.08379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08379","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08379v1","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08379","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"2L7BHYCQ22OO","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2L7BHYCQ22OO36GM","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2L7BHYCQ","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2L7BHYCQ22OO36GMKURQ76R6VQ","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-26T15:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"7c5ace6cee900eb4c1b15daa905ada830eee3677b03db97355e1bfd1c92b1776","abstract_canon_sha256":"b5aa212eedcb0a32d9ac55b4fd6188da46c2b0d6a20ae3f08a36977a4e9194fd"},"schema_version":"1.0"},"canonical_sha256":"d2fe13e050d69cedf8cc55230ffa3eac0e1c4cb18011701a33614f1cfa35a20c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:09.796895Z","signature_b64":"FuVTl7sxUOLgmMkd2fdVUWaxApT+MylFctCtrQLgxOnAEQ9zROiz5XKPVuC6T0mocLrwyBFcAOZyIezYkj10Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2fe13e050d69cedf8cc55230ffa3eac0e1c4cb18011701a33614f1cfa35a20c","last_reissued_at":"2026-05-18T01:01:09.796278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:09.796278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08379","source_version":1,"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-18T01:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLvZer8EUwUW7GvZ9CUh7k29vFWDAXLglRWkt558OWyylXMJQm33FbL8za4q19en+RXQuIfI6Lrl475Nj6xmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:03:24.194904Z"},"content_sha256":"67707641114a250f40965352a79e7d67e73ccb8bda120b5b89d91a8a96bc4790","schema_version":"1.0","event_id":"sha256:67707641114a250f40965352a79e7d67e73ccb8bda120b5b89d91a8a96bc4790"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2L7BHYCQ22OO36GMKURQ76R6VQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition of Multi-Agent Planning under Distributed Motion and Task LTL Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimos V. Dimarogonas, Jana Tumova","submitted_at":"2016-10-26T15:32:32Z","abstract_excerpt":"The aim of this work is to introduce an efficient procedure for discrete multi-agent planning under local complex temporal logic behavior specifications. While the first part of an agent's behavior specification constraints the agent's trace and is independent, the second part of the specification expresses the agent's tasks in terms of the services to be provided along the trace and may impose requests for the other agents' collaborations. To fight the extreme computational complexity of centralized multi-agent planning, we propose a two-phase automata-based solution, where we systematically "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08379","kind":"arxiv","version":1},"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-18T01:01:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwPsalnKr0wWQ9B8fqmcUeB/BWZUl3l7E+09fbmVcRSTX/kpO2G2FNQ46Fo8VDIVUMkHuKOBr/7hSonKln+0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:03:24.195329Z"},"content_sha256":"8447dd3da8d792d932314a519c3462efbf60993217ec37f9675006a8bcb8a0df","schema_version":"1.0","event_id":"sha256:8447dd3da8d792d932314a519c3462efbf60993217ec37f9675006a8bcb8a0df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2L7BHYCQ22OO36GMKURQ76R6VQ/bundle.json","state_url":"https://pith.science/pith/2L7BHYCQ22OO36GMKURQ76R6VQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2L7BHYCQ22OO36GMKURQ76R6VQ/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-01T01:03:24Z","links":{"resolver":"https://pith.science/pith/2L7BHYCQ22OO36GMKURQ76R6VQ","bundle":"https://pith.science/pith/2L7BHYCQ22OO36GMKURQ76R6VQ/bundle.json","state":"https://pith.science/pith/2L7BHYCQ22OO36GMKURQ76R6VQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2L7BHYCQ22OO36GMKURQ76R6VQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2L7BHYCQ22OO36GMKURQ76R6VQ","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":"b5aa212eedcb0a32d9ac55b4fd6188da46c2b0d6a20ae3f08a36977a4e9194fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-26T15:32:32Z","title_canon_sha256":"7c5ace6cee900eb4c1b15daa905ada830eee3677b03db97355e1bfd1c92b1776"},"schema_version":"1.0","source":{"id":"1610.08379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08379","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08379v1","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08379","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"2L7BHYCQ22OO","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2L7BHYCQ22OO36GM","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2L7BHYCQ","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:8447dd3da8d792d932314a519c3462efbf60993217ec37f9675006a8bcb8a0df","target":"graph","created_at":"2026-05-18T01:01:09Z","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":"The aim of this work is to introduce an efficient procedure for discrete multi-agent planning under local complex temporal logic behavior specifications. While the first part of an agent's behavior specification constraints the agent's trace and is independent, the second part of the specification expresses the agent's tasks in terms of the services to be provided along the trace and may impose requests for the other agents' collaborations. To fight the extreme computational complexity of centralized multi-agent planning, we propose a two-phase automata-based solution, where we systematically ","authors_text":"Dimos V. Dimarogonas, Jana Tumova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-26T15:32:32Z","title":"Decomposition of Multi-Agent Planning under Distributed Motion and Task LTL Specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08379","kind":"arxiv","version":1},"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:67707641114a250f40965352a79e7d67e73ccb8bda120b5b89d91a8a96bc4790","target":"record","created_at":"2026-05-18T01:01:09Z","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":"b5aa212eedcb0a32d9ac55b4fd6188da46c2b0d6a20ae3f08a36977a4e9194fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-26T15:32:32Z","title_canon_sha256":"7c5ace6cee900eb4c1b15daa905ada830eee3677b03db97355e1bfd1c92b1776"},"schema_version":"1.0","source":{"id":"1610.08379","kind":"arxiv","version":1}},"canonical_sha256":"d2fe13e050d69cedf8cc55230ffa3eac0e1c4cb18011701a33614f1cfa35a20c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2fe13e050d69cedf8cc55230ffa3eac0e1c4cb18011701a33614f1cfa35a20c","first_computed_at":"2026-05-18T01:01:09.796278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:09.796278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FuVTl7sxUOLgmMkd2fdVUWaxApT+MylFctCtrQLgxOnAEQ9zROiz5XKPVuC6T0mocLrwyBFcAOZyIezYkj10Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:09.796895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67707641114a250f40965352a79e7d67e73ccb8bda120b5b89d91a8a96bc4790","sha256:8447dd3da8d792d932314a519c3462efbf60993217ec37f9675006a8bcb8a0df"],"state_sha256":"6164b60e8d4b375978181d935cb15ee61be91f9b8d2dc7b0039ab98d22e4acf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxPGxLiDKNAzGZLDy09KfJRaczH/Xp+i/h1535u1AHr5lQbo4v0ZMRTWcJ7sigN/hJFvnKlKbi1sFT8n3gR4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:03:24.199355Z","bundle_sha256":"233d6fd4d243aac4318de2c9f2e4d580efa59c8d67d1387e7d0c9877ae5529d5"}}