{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CYKWOJFRG5WUEFKY7VSH3LRC66","short_pith_number":"pith:CYKWOJFR","canonical_record":{"source":{"id":"1709.07094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-20T22:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"02d04a0d1196814dcf2aa9fdb2b30ef953c97cbb964ee4cd30cb7a10556803bd","abstract_canon_sha256":"61c7e7d9d351641eda6ca6391f73c5f7b0f78966cc409c81b128d2216d507367"},"schema_version":"1.0"},"canonical_sha256":"16156724b1376d421558fd647dae22f7a1a2e16b8daf50494b8d08a4155696d7","source":{"kind":"arxiv","id":"1709.07094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07094","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07094v1","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07094","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"CYKWOJFRG5WU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CYKWOJFRG5WUEFKY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CYKWOJFR","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CYKWOJFRG5WUEFKY7VSH3LRC66","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-20T22:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"02d04a0d1196814dcf2aa9fdb2b30ef953c97cbb964ee4cd30cb7a10556803bd","abstract_canon_sha256":"61c7e7d9d351641eda6ca6391f73c5f7b0f78966cc409c81b128d2216d507367"},"schema_version":"1.0"},"canonical_sha256":"16156724b1376d421558fd647dae22f7a1a2e16b8daf50494b8d08a4155696d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:36.586996Z","signature_b64":"1FEbI+J1inKwLdfQuVngfIFUAa1/yA0+oXe6oiJ+ttrFeUeE/DHlyHYTbVkPUxqjVRGro065t88yefge1t5HCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16156724b1376d421558fd647dae22f7a1a2e16b8daf50494b8d08a4155696d7","last_reissued_at":"2026-05-18T00:34:36.586541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:36.586541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07094","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-18T00:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81e1q/Xd/R4AomprKLIye2fIgWSL+u3ZsQPZgc9kVy7UoIrEjFPHKOhTxS3bKaDr9HWn4nSA8m4i6+EqTW4ADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:55:55.367553Z"},"content_sha256":"582653e0785f5f31eebdfd6e89eb1a7f03650f2a46c473efb0192a38e2185cbe","schema_version":"1.0","event_id":"sha256:582653e0785f5f31eebdfd6e89eb1a7f03650f2a46c473efb0192a38e2185cbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CYKWOJFRG5WUEFKY7VSH3LRC66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Richard M. Murray, Sumanth Dathathri","submitted_at":"2017-09-20T22:14:11Z","abstract_excerpt":"Temporal logic based synthesis approaches are often used to find trajectories that are correct-by-construction for tasks in systems with complex behavior. Some examples of such tasks include synchronization for multi-agent hybrid systems, reactive motion planning for robots. However, the scalability of such approaches is of concern and at times a bottleneck when transitioning from theory to practice. In this paper, we identify a class of problems in the GR(1) fragment of linear-time temporal logic (LTL) where the synthesis problem allows for a decomposition that enables easy parallelization. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07094","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-18T00:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ad+YJsz03k7hodMQ+Qc83nZjlBjoAd36Gu58oVRL1G/lSzdjRQseokLDgWFjf+Ed/6EW/Y7bpaRBsaNAWmkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:55:55.367917Z"},"content_sha256":"be6c37c52469768fedad4af883c9f4298e46dde04a20d08c20b10175606cb4d4","schema_version":"1.0","event_id":"sha256:be6c37c52469768fedad4af883c9f4298e46dde04a20d08c20b10175606cb4d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYKWOJFRG5WUEFKY7VSH3LRC66/bundle.json","state_url":"https://pith.science/pith/CYKWOJFRG5WUEFKY7VSH3LRC66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYKWOJFRG5WUEFKY7VSH3LRC66/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-05-27T01:55:55Z","links":{"resolver":"https://pith.science/pith/CYKWOJFRG5WUEFKY7VSH3LRC66","bundle":"https://pith.science/pith/CYKWOJFRG5WUEFKY7VSH3LRC66/bundle.json","state":"https://pith.science/pith/CYKWOJFRG5WUEFKY7VSH3LRC66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYKWOJFRG5WUEFKY7VSH3LRC66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CYKWOJFRG5WUEFKY7VSH3LRC66","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":"61c7e7d9d351641eda6ca6391f73c5f7b0f78966cc409c81b128d2216d507367","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-20T22:14:11Z","title_canon_sha256":"02d04a0d1196814dcf2aa9fdb2b30ef953c97cbb964ee4cd30cb7a10556803bd"},"schema_version":"1.0","source":{"id":"1709.07094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07094","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07094v1","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07094","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"CYKWOJFRG5WU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CYKWOJFRG5WUEFKY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CYKWOJFR","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:be6c37c52469768fedad4af883c9f4298e46dde04a20d08c20b10175606cb4d4","target":"graph","created_at":"2026-05-18T00:34:36Z","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":"Temporal logic based synthesis approaches are often used to find trajectories that are correct-by-construction for tasks in systems with complex behavior. Some examples of such tasks include synchronization for multi-agent hybrid systems, reactive motion planning for robots. However, the scalability of such approaches is of concern and at times a bottleneck when transitioning from theory to practice. In this paper, we identify a class of problems in the GR(1) fragment of linear-time temporal logic (LTL) where the synthesis problem allows for a decomposition that enables easy parallelization. T","authors_text":"Richard M. Murray, Sumanth Dathathri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-20T22:14:11Z","title":"Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07094","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:582653e0785f5f31eebdfd6e89eb1a7f03650f2a46c473efb0192a38e2185cbe","target":"record","created_at":"2026-05-18T00:34:36Z","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":"61c7e7d9d351641eda6ca6391f73c5f7b0f78966cc409c81b128d2216d507367","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-20T22:14:11Z","title_canon_sha256":"02d04a0d1196814dcf2aa9fdb2b30ef953c97cbb964ee4cd30cb7a10556803bd"},"schema_version":"1.0","source":{"id":"1709.07094","kind":"arxiv","version":1}},"canonical_sha256":"16156724b1376d421558fd647dae22f7a1a2e16b8daf50494b8d08a4155696d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16156724b1376d421558fd647dae22f7a1a2e16b8daf50494b8d08a4155696d7","first_computed_at":"2026-05-18T00:34:36.586541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:36.586541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1FEbI+J1inKwLdfQuVngfIFUAa1/yA0+oXe6oiJ+ttrFeUeE/DHlyHYTbVkPUxqjVRGro065t88yefge1t5HCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:36.586996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:582653e0785f5f31eebdfd6e89eb1a7f03650f2a46c473efb0192a38e2185cbe","sha256:be6c37c52469768fedad4af883c9f4298e46dde04a20d08c20b10175606cb4d4"],"state_sha256":"9cb9fa6b2b1a0151dd71290f2a17bc27a4210f97f9d4981cf1a4a63c34eec860"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJQxucyQ5TFPDOb/IefcFQtIoFwiNJUlnaDJe2C8FyqM8JDIRVEMnzDXHleCh9LbbB5WngmLqAyqTNWCXP0xBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:55:55.370518Z","bundle_sha256":"585235dfff7df8486cf7ff0f10c73b16db454999e9d5c2047f93119ff4519588"}}