{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NA5DQFNGHMJBHTTYIVADWQ6ZJX","short_pith_number":"pith:NA5DQFNG","canonical_record":{"source":{"id":"1808.09430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-28T17:43:14Z","cross_cats_sorted":[],"title_canon_sha256":"14325d9fe91ed4524f114cad885e9175832e6e208bc9fea88c3af7b2e1f0d97e","abstract_canon_sha256":"cfc967bba234045252e3c419078124fe96ec07fea2efd79030e182ebe756b701"},"schema_version":"1.0"},"canonical_sha256":"683a3815a63b1213ce7845403b43d94dd5c9b1c3ed96fcbfc8320af5fd08c5e0","source":{"kind":"arxiv","id":"1808.09430","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09430","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09430v1","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09430","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"NA5DQFNGHMJB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NA5DQFNGHMJBHTTY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NA5DQFNG","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NA5DQFNGHMJBHTTYIVADWQ6ZJX","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-28T17:43:14Z","cross_cats_sorted":[],"title_canon_sha256":"14325d9fe91ed4524f114cad885e9175832e6e208bc9fea88c3af7b2e1f0d97e","abstract_canon_sha256":"cfc967bba234045252e3c419078124fe96ec07fea2efd79030e182ebe756b701"},"schema_version":"1.0"},"canonical_sha256":"683a3815a63b1213ce7845403b43d94dd5c9b1c3ed96fcbfc8320af5fd08c5e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:01.414450Z","signature_b64":"h4Lq2MDLYMUm1hBOB5csOwP0YI6aR5cy6/Q4jPr6b/ESyl2GFhDmXhTmUJRuQjhQrYKkFDWM9QY+V9+eZTgUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"683a3815a63b1213ce7845403b43d94dd5c9b1c3ed96fcbfc8320af5fd08c5e0","last_reissued_at":"2026-05-18T00:07:01.413963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:01.413963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09430","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:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCeikDcKkSMGI34VG2rUJWbHawLs8smTrBMVrJ1WnxYxPufvSwtOnxM+KLiXuo1aXnt1YXFiUrYA27ZRJVctDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:46:03.060237Z"},"content_sha256":"035af7bc0e85b7412914ababc54c7254b0ad4e96297ae309991b602650ba6576","schema_version":"1.0","event_id":"sha256:035af7bc0e85b7412914ababc54c7254b0ad4e96297ae309991b602650ba6576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NA5DQFNGHMJBHTTYIVADWQ6ZJX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reactive Synthesis: Branching Logics and Parameterized Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ayrat Khalimov","submitted_at":"2018-08-28T17:43:14Z","abstract_excerpt":"Reactive synthesis is an automatic way to translate a human intention expressed in some logic into a system of some kind. This thesis has two parts, devoted to logic and to systems.\n  In Part I, we develop two new approaches to CTL* synthesis. The first approach consists of two extensions of the SMT-based bounded synthesis: one follows bottom-up CTL* model checking, another one follows the automata framework. The second approach reduces CTL* synthesis to LTL synthesis. The reduction turns any LTL synthesiser into a CTL* synthesiser. The two approaches were implemented and are available online."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09430","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:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JG0eftzoh4L42a9THoEUzWzBhk3aq3Ye0wZaBoxq/D5XqHjfNqMYwflOYLuylqbSyLJYtC0rZVJ5+otakrpeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:46:03.060605Z"},"content_sha256":"27738684cd358f56f69f0f23a7866861c5f66c0718f5e250aba0f06f30dd681e","schema_version":"1.0","event_id":"sha256:27738684cd358f56f69f0f23a7866861c5f66c0718f5e250aba0f06f30dd681e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NA5DQFNGHMJBHTTYIVADWQ6ZJX/bundle.json","state_url":"https://pith.science/pith/NA5DQFNGHMJBHTTYIVADWQ6ZJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NA5DQFNGHMJBHTTYIVADWQ6ZJX/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-29T22:46:03Z","links":{"resolver":"https://pith.science/pith/NA5DQFNGHMJBHTTYIVADWQ6ZJX","bundle":"https://pith.science/pith/NA5DQFNGHMJBHTTYIVADWQ6ZJX/bundle.json","state":"https://pith.science/pith/NA5DQFNGHMJBHTTYIVADWQ6ZJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NA5DQFNGHMJBHTTYIVADWQ6ZJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NA5DQFNGHMJBHTTYIVADWQ6ZJX","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":"cfc967bba234045252e3c419078124fe96ec07fea2efd79030e182ebe756b701","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-28T17:43:14Z","title_canon_sha256":"14325d9fe91ed4524f114cad885e9175832e6e208bc9fea88c3af7b2e1f0d97e"},"schema_version":"1.0","source":{"id":"1808.09430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09430","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09430v1","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09430","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"NA5DQFNGHMJB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NA5DQFNGHMJBHTTY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NA5DQFNG","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:27738684cd358f56f69f0f23a7866861c5f66c0718f5e250aba0f06f30dd681e","target":"graph","created_at":"2026-05-18T00:07:01Z","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":"Reactive synthesis is an automatic way to translate a human intention expressed in some logic into a system of some kind. This thesis has two parts, devoted to logic and to systems.\n  In Part I, we develop two new approaches to CTL* synthesis. The first approach consists of two extensions of the SMT-based bounded synthesis: one follows bottom-up CTL* model checking, another one follows the automata framework. The second approach reduces CTL* synthesis to LTL synthesis. The reduction turns any LTL synthesiser into a CTL* synthesiser. The two approaches were implemented and are available online.","authors_text":"Ayrat Khalimov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-28T17:43:14Z","title":"Reactive Synthesis: Branching Logics and Parameterized Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09430","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:035af7bc0e85b7412914ababc54c7254b0ad4e96297ae309991b602650ba6576","target":"record","created_at":"2026-05-18T00:07:01Z","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":"cfc967bba234045252e3c419078124fe96ec07fea2efd79030e182ebe756b701","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-28T17:43:14Z","title_canon_sha256":"14325d9fe91ed4524f114cad885e9175832e6e208bc9fea88c3af7b2e1f0d97e"},"schema_version":"1.0","source":{"id":"1808.09430","kind":"arxiv","version":1}},"canonical_sha256":"683a3815a63b1213ce7845403b43d94dd5c9b1c3ed96fcbfc8320af5fd08c5e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"683a3815a63b1213ce7845403b43d94dd5c9b1c3ed96fcbfc8320af5fd08c5e0","first_computed_at":"2026-05-18T00:07:01.413963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:01.413963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h4Lq2MDLYMUm1hBOB5csOwP0YI6aR5cy6/Q4jPr6b/ESyl2GFhDmXhTmUJRuQjhQrYKkFDWM9QY+V9+eZTgUDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:01.414450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:035af7bc0e85b7412914ababc54c7254b0ad4e96297ae309991b602650ba6576","sha256:27738684cd358f56f69f0f23a7866861c5f66c0718f5e250aba0f06f30dd681e"],"state_sha256":"72c30af925b98a27d3419f21b3453e2ad2f9f5052535ae3fb696c1383d875640"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9oAoBsB+7rJqhpsqQxq0wDg9bs4z3usEGgz8X8wDoahc3orbmpIiFQRQKDhCaHG6dMAJsaqJOuoJ3T9byHjdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:46:03.062694Z","bundle_sha256":"f00d13a6adc8af7e86ec9c69910c8da13187ee54092bda8fa14775ce461bd513"}}