{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LCITPT4PGJNXDIQSOBVJCEOW36","short_pith_number":"pith:LCITPT4P","schema_version":"1.0","canonical_sha256":"589137cf8f325b71a212706a9111d6df84b9cbdde6c2ef6feccc90b69ea1c9a2","source":{"kind":"arxiv","id":"2508.14725","version":1},"attestation_state":"computed","paper":{"title":"Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.FL"],"primary_cat":"cs.LO","authors_text":"Christoph Weinhuber, Daniel Hausmann, Gianmarco Parretti, Giuseppe De Giacomo, Nir Piterman, Shufang Zhu","submitted_at":"2025-08-20T14:07:43Z","abstract_excerpt":"Recently, the Manna-Pnueli Hierarchy has been used to define the temporal logics LTLfp and PPLTLp, which allow to use finite-trace LTLf/PPLTL techniques in infinite-trace settings while achieving the expressiveness of full LTL. In this paper, we present the first actual solvers for reactive synthesis in these logics. These are based on games on graphs that leverage DFA-based techniques from LTLf/PPLTL to construct the game arena. We start with a symbolic solver based on Emerson-Lei games, which reduces lower-class properties (guarantee, safety) to higher ones (recurrence, persistence) before s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.14725","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-08-20T14:07:43Z","cross_cats_sorted":["cs.AI","cs.FL"],"title_canon_sha256":"83288089d359b4e2156e7a1e58e960ae819038eec6aeee6be5acd71a515d3cc0","abstract_canon_sha256":"7d1c1d6355b021f7438cedebba2dde690a36e1d08212b2bbebbd0eae61693e92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:37.610879Z","signature_b64":"Y9QjcLqFTQVqCXw+clYQs1or3O68yMZrIsakNYa8uAiDh6L4Hn37985PJkPMEVePRewptcgWLup++9St+68dAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"589137cf8f325b71a212706a9111d6df84b9cbdde6c2ef6feccc90b69ea1c9a2","last_reissued_at":"2026-07-05T11:56:37.610392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:37.610392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.FL"],"primary_cat":"cs.LO","authors_text":"Christoph Weinhuber, Daniel Hausmann, Gianmarco Parretti, Giuseppe De Giacomo, Nir Piterman, Shufang Zhu","submitted_at":"2025-08-20T14:07:43Z","abstract_excerpt":"Recently, the Manna-Pnueli Hierarchy has been used to define the temporal logics LTLfp and PPLTLp, which allow to use finite-trace LTLf/PPLTL techniques in infinite-trace settings while achieving the expressiveness of full LTL. In this paper, we present the first actual solvers for reactive synthesis in these logics. These are based on games on graphs that leverage DFA-based techniques from LTLf/PPLTL to construct the game arena. We start with a symbolic solver based on Emerson-Lei games, which reduces lower-class properties (guarantee, safety) to higher ones (recurrence, persistence) before s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14725","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.14725/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.14725","created_at":"2026-07-05T11:56:37.610459+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14725v1","created_at":"2026-07-05T11:56:37.610459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14725","created_at":"2026-07-05T11:56:37.610459+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCITPT4PGJNX","created_at":"2026-07-05T11:56:37.610459+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCITPT4PGJNXDIQS","created_at":"2026-07-05T11:56:37.610459+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCITPT4P","created_at":"2026-07-05T11:56:37.610459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18532","citing_title":"Symbolic Synthesis for LTLf+ Obligations","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LCITPT4PGJNXDIQSOBVJCEOW36","json":"https://pith.science/pith/LCITPT4PGJNXDIQSOBVJCEOW36.json","graph_json":"https://pith.science/api/pith-number/LCITPT4PGJNXDIQSOBVJCEOW36/graph.json","events_json":"https://pith.science/api/pith-number/LCITPT4PGJNXDIQSOBVJCEOW36/events.json","paper":"https://pith.science/paper/LCITPT4P"},"agent_actions":{"view_html":"https://pith.science/pith/LCITPT4PGJNXDIQSOBVJCEOW36","download_json":"https://pith.science/pith/LCITPT4PGJNXDIQSOBVJCEOW36.json","view_paper":"https://pith.science/paper/LCITPT4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14725&json=true","fetch_graph":"https://pith.science/api/pith-number/LCITPT4PGJNXDIQSOBVJCEOW36/graph.json","fetch_events":"https://pith.science/api/pith-number/LCITPT4PGJNXDIQSOBVJCEOW36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCITPT4PGJNXDIQSOBVJCEOW36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCITPT4PGJNXDIQSOBVJCEOW36/action/storage_attestation","attest_author":"https://pith.science/pith/LCITPT4PGJNXDIQSOBVJCEOW36/action/author_attestation","sign_citation":"https://pith.science/pith/LCITPT4PGJNXDIQSOBVJCEOW36/action/citation_signature","submit_replication":"https://pith.science/pith/LCITPT4PGJNXDIQSOBVJCEOW36/action/replication_record"}},"created_at":"2026-07-05T11:56:37.610459+00:00","updated_at":"2026-07-05T11:56:37.610459+00:00"}