{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:V7CJRSUDIU3KH2MKW6MJ42TJYS","short_pith_number":"pith:V7CJRSUD","canonical_record":{"source":{"id":"2605.12539","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-05T14:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"f2da74a5c2ee121e6b1b58ef10cb3d91b51bed56e3763754861b86498c4f43eb","abstract_canon_sha256":"2762366ea4c53de8e1f514c91399821d6cb2f29584cb139b362c13c3e31b5888"},"schema_version":"1.0"},"canonical_sha256":"afc498ca834536a3e98ab7989e6a69c4b36ce3c2e89c8c1d9d108eb2d714be29","source":{"kind":"arxiv","id":"2605.12539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12539","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12539v1","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12539","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"V7CJRSUDIU3K","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"V7CJRSUDIU3KH2MK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"V7CJRSUD","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:V7CJRSUDIU3KH2MKW6MJ42TJYS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12539","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-05T14:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"f2da74a5c2ee121e6b1b58ef10cb3d91b51bed56e3763754861b86498c4f43eb","abstract_canon_sha256":"2762366ea4c53de8e1f514c91399821d6cb2f29584cb139b362c13c3e31b5888"},"schema_version":"1.0"},"canonical_sha256":"afc498ca834536a3e98ab7989e6a69c4b36ce3c2e89c8c1d9d108eb2d714be29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:02.372675Z","signature_b64":"LA4jCCypb31BWn15s9r/TmBUBwy5lbixKXY5eHqqY0O8bHrDBulnGdHm1QxE+bwkQXJihrnAI2xI3ktKZEXmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afc498ca834536a3e98ab7989e6a69c4b36ce3c2e89c8c1d9d108eb2d714be29","last_reissued_at":"2026-05-18T03:10:02.372114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:02.372114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12539","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-18T03:10:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i8jmBrVx0bmUChsXoQUf/8ZCE82w0jSS9CRORnCCfwOp659wF/HbCtuWF9OFv1hssxQX75m4aJgQ4yFPWJ64Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:41.103057Z"},"content_sha256":"da8ab91e8b50c6be9debcaae71240c41551177d8d88fa4968705afec98c4de0e","schema_version":"1.0","event_id":"sha256:da8ab91e8b50c6be9debcaae71240c41551177d8d88fa4968705afec98c4de0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:V7CJRSUDIU3KH2MKW6MJ42TJYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ocLTL: LTL Realizability and Synthesis Modulo {\\omega}-Categorical Structures","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"ocLTL realizability and synthesis reduce to propositional LTL+P by replacing each data subformula with a finite disjunction over complete types.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ohad Asor","submitted_at":"2026-05-05T14:00:15Z","abstract_excerpt":"We introduce ocLTL, a version of LTL+P modulo {\\omega}-categorical theories. We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula with a finite disjunction over complete types. The complexity remains 2-EXPTIME with additional blowup that depends only on the theory but not the formula."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula with a finite disjunction over complete types. The complexity remains 2-EXPTIME with additional blowup that depends only on the theory but not the formula.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that for the given ω-categorical theory, there are only finitely many complete types, allowing the disjunction to be finite, and that this replacement correctly captures the semantics of the data subformulas in the context of the temporal logic.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ocLTL reduces realizability and synthesis for LTL over ω-categorical structures to propositional LTL+P while preserving 2-EXPTIME complexity with theory-dependent blowup.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"ocLTL realizability and synthesis reduce to propositional LTL+P by replacing each data subformula with a finite disjunction over complete types.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5c709802d489beb2e71bb9948c572770e1087fe5e64827630c427f33c0187c12"},"source":{"id":"2605.12539","kind":"arxiv","version":1},"verdict":{"id":"bd6c9ed1-3c5b-4287-bebc-3f798fd8a8aa","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T21:00:20.054853Z","strongest_claim":"We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula with a finite disjunction over complete types. The complexity remains 2-EXPTIME with additional blowup that depends only on the theory but not the formula.","one_line_summary":"ocLTL reduces realizability and synthesis for LTL over ω-categorical structures to propositional LTL+P while preserving 2-EXPTIME complexity with theory-dependent blowup.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that for the given ω-categorical theory, there are only finitely many complete types, allowing the disjunction to be finite, and that this replacement correctly captures the semantics of the data subformulas in the context of the temporal logic.","pith_extraction_headline":"ocLTL realizability and synthesis reduce to propositional LTL+P by replacing each data subformula with a finite disjunction over complete types."},"references":{"count":17,"sample":[{"doi":"","year":2024,"title":"Full LTL synthesis overinfinite-statearenas","work_id":"a7ce5d3a-a579-4562-9e32-a966cd46ba18","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Ashwin Bhaskar and M. Praveen. Realizability problem for constraint LTL. In29th Inter- national Symposium on Temporal Representation and Reasoning (TIME 2022), volume 247 of LIPIcs, pages 8:1–8:19. Sc","work_id":"521f9442-f496-4a54-9bc8-9eb621f7b5a5","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Two- variable logic on data words.ACM Transactions on Computational Logic, 12(4):27:1–27:26,","work_id":"0ca1a3eb-89fd-4d15-9325-4ad566014e37","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Conference version: LICS 2006. 8","work_id":"b9d90daf-883d-4a20-bbbd-364d68eff853","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Automata theory in nominal sets","work_id":"cdf5bd2e-b22a-42fb-8cc0-b84f869a7404","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"09a2d2ef51dc799958531aab8b761e0cb740456ae361fc1cd06aac307cca7859","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"adaccf7c6b2393c45aaca656447db2d7420e6dbbcbb41d337190ca43c16d4b3b"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"bd6c9ed1-3c5b-4287-bebc-3f798fd8a8aa"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAlhjTArPcH1BIS/LsZRD44xmlDxUCdeETGcjFEIF7XIvVliIytryvbZ2EV7JHWNkQqsjvwDOXvbGLxLQbQXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:27:41.103760Z"},"content_sha256":"c391cd05f87fdba4a2b10ea7caac77b358fa92f002d6daacaabf130bbb8c2c50","schema_version":"1.0","event_id":"sha256:c391cd05f87fdba4a2b10ea7caac77b358fa92f002d6daacaabf130bbb8c2c50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7CJRSUDIU3KH2MKW6MJ42TJYS/bundle.json","state_url":"https://pith.science/pith/V7CJRSUDIU3KH2MKW6MJ42TJYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7CJRSUDIU3KH2MKW6MJ42TJYS/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-02T01:27:41Z","links":{"resolver":"https://pith.science/pith/V7CJRSUDIU3KH2MKW6MJ42TJYS","bundle":"https://pith.science/pith/V7CJRSUDIU3KH2MKW6MJ42TJYS/bundle.json","state":"https://pith.science/pith/V7CJRSUDIU3KH2MKW6MJ42TJYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7CJRSUDIU3KH2MKW6MJ42TJYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:V7CJRSUDIU3KH2MKW6MJ42TJYS","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":"2762366ea4c53de8e1f514c91399821d6cb2f29584cb139b362c13c3e31b5888","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-05T14:00:15Z","title_canon_sha256":"f2da74a5c2ee121e6b1b58ef10cb3d91b51bed56e3763754861b86498c4f43eb"},"schema_version":"1.0","source":{"id":"2605.12539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12539","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12539v1","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12539","created_at":"2026-05-18T03:10:02Z"},{"alias_kind":"pith_short_12","alias_value":"V7CJRSUDIU3K","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"V7CJRSUDIU3KH2MK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"V7CJRSUD","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c391cd05f87fdba4a2b10ea7caac77b358fa92f002d6daacaabf130bbb8c2c50","target":"graph","created_at":"2026-05-18T03:10:02Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula with a finite disjunction over complete types. The complexity remains 2-EXPTIME with additional blowup that depends only on the theory but not the formula."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that for the given ω-categorical theory, there are only finitely many complete types, allowing the disjunction to be finite, and that this replacement correctly captures the semantics of the data subformulas in the context of the temporal logic."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ocLTL reduces realizability and synthesis for LTL over ω-categorical structures to propositional LTL+P while preserving 2-EXPTIME complexity with theory-dependent blowup."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"ocLTL realizability and synthesis reduce to propositional LTL+P by replacing each data subformula with a finite disjunction over complete types."}],"snapshot_sha256":"5c709802d489beb2e71bb9948c572770e1087fe5e64827630c427f33c0187c12"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"adaccf7c6b2393c45aaca656447db2d7420e6dbbcbb41d337190ca43c16d4b3b"},"paper":{"abstract_excerpt":"We introduce ocLTL, a version of LTL+P modulo {\\omega}-categorical theories. We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula with a finite disjunction over complete types. The complexity remains 2-EXPTIME with additional blowup that depends only on the theory but not the formula.","authors_text":"Ohad Asor","cross_cats":[],"headline":"ocLTL realizability and synthesis reduce to propositional LTL+P by replacing each data subformula with a finite disjunction over complete types.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-05T14:00:15Z","title":"ocLTL: LTL Realizability and Synthesis Modulo {\\omega}-Categorical Structures"},"references":{"count":17,"internal_anchors":0,"resolved_work":17,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Full LTL synthesis overinfinite-statearenas","work_id":"a7ce5d3a-a579-4562-9e32-a966cd46ba18","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Ashwin Bhaskar and M. Praveen. Realizability problem for constraint LTL. In29th Inter- national Symposium on Temporal Representation and Reasoning (TIME 2022), volume 247 of LIPIcs, pages 8:1–8:19. Sc","work_id":"521f9442-f496-4a54-9bc8-9eb621f7b5a5","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Two- variable logic on data words.ACM Transactions on Computational Logic, 12(4):27:1–27:26,","work_id":"0ca1a3eb-89fd-4d15-9325-4ad566014e37","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Conference version: LICS 2006. 8","work_id":"b9d90daf-883d-4a20-bbbd-364d68eff853","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Automata theory in nominal sets","work_id":"cdf5bd2e-b22a-42fb-8cc0-b84f869a7404","year":2014}],"snapshot_sha256":"09a2d2ef51dc799958531aab8b761e0cb740456ae361fc1cd06aac307cca7859"},"source":{"id":"2605.12539","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T21:00:20.054853Z","id":"bd6c9ed1-3c5b-4287-bebc-3f798fd8a8aa","model_set":{"reader":"grok-4.3"},"one_line_summary":"ocLTL reduces realizability and synthesis for LTL over ω-categorical structures to propositional LTL+P while preserving 2-EXPTIME complexity with theory-dependent blowup.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"ocLTL realizability and synthesis reduce to propositional LTL+P by replacing each data subformula with a finite disjunction over complete types.","strongest_claim":"We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula with a finite disjunction over complete types. The complexity remains 2-EXPTIME with additional blowup that depends only on the theory but not the formula.","weakest_assumption":"The assumption that for the given ω-categorical theory, there are only finitely many complete types, allowing the disjunction to be finite, and that this replacement correctly captures the semantics of the data subformulas in the context of the temporal logic."}},"verdict_id":"bd6c9ed1-3c5b-4287-bebc-3f798fd8a8aa"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:da8ab91e8b50c6be9debcaae71240c41551177d8d88fa4968705afec98c4de0e","target":"record","created_at":"2026-05-18T03:10:02Z","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":"2762366ea4c53de8e1f514c91399821d6cb2f29584cb139b362c13c3e31b5888","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-05T14:00:15Z","title_canon_sha256":"f2da74a5c2ee121e6b1b58ef10cb3d91b51bed56e3763754861b86498c4f43eb"},"schema_version":"1.0","source":{"id":"2605.12539","kind":"arxiv","version":1}},"canonical_sha256":"afc498ca834536a3e98ab7989e6a69c4b36ce3c2e89c8c1d9d108eb2d714be29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afc498ca834536a3e98ab7989e6a69c4b36ce3c2e89c8c1d9d108eb2d714be29","first_computed_at":"2026-05-18T03:10:02.372114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:02.372114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LA4jCCypb31BWn15s9r/TmBUBwy5lbixKXY5eHqqY0O8bHrDBulnGdHm1QxE+bwkQXJihrnAI2xI3ktKZEXmAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:02.372675Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da8ab91e8b50c6be9debcaae71240c41551177d8d88fa4968705afec98c4de0e","sha256:c391cd05f87fdba4a2b10ea7caac77b358fa92f002d6daacaabf130bbb8c2c50"],"state_sha256":"9fcaaf363c2b0360a35c519c987c9412f62f09ae5d5b8aca8e19c3aa69e36a2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"riNzZ00aCFGFEUuzkMrC07rAHZMCxU8q3xAuOSw1AiGiOblVvudUB8G+G1X++NK7iMabdpz5VBqOaEbXQutrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:27:41.106367Z","bundle_sha256":"8b6abe432e06c677c10f0b3485fe5100cc019e17fdc262d5ceac7be59585cb08"}}