{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZUUCTSODXNTEQ4JTW65LPQEIRC","short_pith_number":"pith:ZUUCTSOD","canonical_record":{"source":{"id":"1604.06384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-21T16:53:48Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"f0801df903a6625a3653f4873bc3706f0186fcc0ee399e84d8f04f2e6eaed53e","abstract_canon_sha256":"5a6b403914c92774855f825defb7adeed53a0e1c6d4497a987b9b81e61bc87dd"},"schema_version":"1.0"},"canonical_sha256":"cd2829c9c3bb66487133b7bab7c088888670d7b289b9f5515125dbf2ed9a476a","source":{"kind":"arxiv","id":"1604.06384","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06384","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06384v2","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06384","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZUUCTSODXNTE","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZUUCTSODXNTEQ4JT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZUUCTSOD","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZUUCTSODXNTEQ4JTW65LPQEIRC","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-21T16:53:48Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"f0801df903a6625a3653f4873bc3706f0186fcc0ee399e84d8f04f2e6eaed53e","abstract_canon_sha256":"5a6b403914c92774855f825defb7adeed53a0e1c6d4497a987b9b81e61bc87dd"},"schema_version":"1.0"},"canonical_sha256":"cd2829c9c3bb66487133b7bab7c088888670d7b289b9f5515125dbf2ed9a476a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:47.640935Z","signature_b64":"MiFb1sWIOOLiHlmDqpym5+IZqL6HisifhLlwQoCgPgt76NHZK5um5XZli2enBM0FV1R6OuRpBi04awC2xiJiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd2829c9c3bb66487133b7bab7c088888670d7b289b9f5515125dbf2ed9a476a","last_reissued_at":"2026-05-18T01:13:47.640256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:47.640256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06384","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-18T01:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APQ4CAWB71qPqrBhrWR0VshoExZY+6WsLSwmWdvJ2UU1LNjX2kNi6AE13Li1+oAAZsPStrSE6Y/wmGjjDP61Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:41:37.975919Z"},"content_sha256":"edc8f80a419d3a335bc5202d48467011d5bb9f1302417ef83f82587e5c5946ee","schema_version":"1.0","event_id":"sha256:edc8f80a419d3a335bc5202d48467011d5bb9f1302417ef83f82587e5c5946ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZUUCTSODXNTEQ4JTW65LPQEIRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computation Tree Logic for Synchronization Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Laurent Doyen","submitted_at":"2016-04-21T16:53:48Z","abstract_excerpt":"We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the same path quantifiers and temporal operators as in CTL, but allowing a different order of the quantifiers. This small syntactic variation induces a logic that can express non-regular properties for which known extensions of MSO with equality of path length are undecidable. We show that our variant of CTL is decidable and that the model-checking problem is i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06384","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-18T01:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jw0Hix6FFC1vc5hTn7b/ZGLTY8CFRGB1WF01O1DiNeiMApoZrURBpZBUMNjWkHatzqJh8GoHZYqpgDDo9NFUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:41:37.976452Z"},"content_sha256":"7609d5f6b4e0539a1972fb968b5f31d99b79296d1ecf45f39f7d29a05d06751d","schema_version":"1.0","event_id":"sha256:7609d5f6b4e0539a1972fb968b5f31d99b79296d1ecf45f39f7d29a05d06751d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUUCTSODXNTEQ4JTW65LPQEIRC/bundle.json","state_url":"https://pith.science/pith/ZUUCTSODXNTEQ4JTW65LPQEIRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUUCTSODXNTEQ4JTW65LPQEIRC/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-26T03:41:37Z","links":{"resolver":"https://pith.science/pith/ZUUCTSODXNTEQ4JTW65LPQEIRC","bundle":"https://pith.science/pith/ZUUCTSODXNTEQ4JTW65LPQEIRC/bundle.json","state":"https://pith.science/pith/ZUUCTSODXNTEQ4JTW65LPQEIRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUUCTSODXNTEQ4JTW65LPQEIRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZUUCTSODXNTEQ4JTW65LPQEIRC","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":"5a6b403914c92774855f825defb7adeed53a0e1c6d4497a987b9b81e61bc87dd","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-21T16:53:48Z","title_canon_sha256":"f0801df903a6625a3653f4873bc3706f0186fcc0ee399e84d8f04f2e6eaed53e"},"schema_version":"1.0","source":{"id":"1604.06384","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06384","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06384v2","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06384","created_at":"2026-05-18T01:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZUUCTSODXNTE","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZUUCTSODXNTEQ4JT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZUUCTSOD","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:7609d5f6b4e0539a1972fb968b5f31d99b79296d1ecf45f39f7d29a05d06751d","target":"graph","created_at":"2026-05-18T01:13:47Z","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":"We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the same path quantifiers and temporal operators as in CTL, but allowing a different order of the quantifiers. This small syntactic variation induces a logic that can express non-regular properties for which known extensions of MSO with equality of path length are undecidable. We show that our variant of CTL is decidable and that the model-checking problem is i","authors_text":"Krishnendu Chatterjee, Laurent Doyen","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-21T16:53:48Z","title":"Computation Tree Logic for Synchronization Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06384","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:edc8f80a419d3a335bc5202d48467011d5bb9f1302417ef83f82587e5c5946ee","target":"record","created_at":"2026-05-18T01:13:47Z","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":"5a6b403914c92774855f825defb7adeed53a0e1c6d4497a987b9b81e61bc87dd","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-21T16:53:48Z","title_canon_sha256":"f0801df903a6625a3653f4873bc3706f0186fcc0ee399e84d8f04f2e6eaed53e"},"schema_version":"1.0","source":{"id":"1604.06384","kind":"arxiv","version":2}},"canonical_sha256":"cd2829c9c3bb66487133b7bab7c088888670d7b289b9f5515125dbf2ed9a476a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd2829c9c3bb66487133b7bab7c088888670d7b289b9f5515125dbf2ed9a476a","first_computed_at":"2026-05-18T01:13:47.640256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:47.640256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MiFb1sWIOOLiHlmDqpym5+IZqL6HisifhLlwQoCgPgt76NHZK5um5XZli2enBM0FV1R6OuRpBi04awC2xiJiAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:47.640935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06384","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edc8f80a419d3a335bc5202d48467011d5bb9f1302417ef83f82587e5c5946ee","sha256:7609d5f6b4e0539a1972fb968b5f31d99b79296d1ecf45f39f7d29a05d06751d"],"state_sha256":"2fb2ed195cd18ea1a2ad5fcf3a47e1d0f128e203ca2daf5b99fbc8cdf1b18a32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"43ZHhDTdt9buDe4ED9c6oiX36zwhkTcre6tZCCB4L98izQ6EgESx5ZIisdAct8igxnDwr+SWE42ENx2l+c05Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:41:37.979853Z","bundle_sha256":"a09996bee7d2119c751c95ec4972f408773a5376da8769201466b14a87f08c83"}}