{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OVONPGDE7IQRK27OANMXBJYSEM","short_pith_number":"pith:OVONPGDE","schema_version":"1.0","canonical_sha256":"755cd79864fa21156bee035970a7122325f32531f5d7fc16726a0da2291a5b55","source":{"kind":"arxiv","id":"1701.01971","version":1},"attestation_state":"computed","paper":{"title":"Backward deterministic and weak alternating $\\omega$-automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Sebastian Preugschat, Thomas Wilke","submitted_at":"2017-01-08T15:25:53Z","abstract_excerpt":"We present a direct transformation of weak alternating $\\omega$-automata into equivalent backward deterministic $\\omega$-automata and show (1) how it can be used to obtain a transformation of non-deterministic B\\\"uchi automata into equivalent backward deterministic automata and (2) that it yields optimal equivalent backward deterministic automata when applied to linear-time temporal logic formulas. (1) uses the alternation-free fragment of the linear-time $\\mu$-calculus as an intermediate step; (2) is based on the straightforward translation of linear-time temporal logic into weak alternating "},"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":"1701.01971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-08T15:25:53Z","cross_cats_sorted":[],"title_canon_sha256":"0f5245122842e0a3c95d8b9f43210bb33ba115720a6414004eeac1d769f4d9a8","abstract_canon_sha256":"3ff09ea94c580e899acfa43d88de23b900baabc301e4820239849ac5161f56c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:12.954014Z","signature_b64":"0YvgH972ehmz0rvIoLQKbyBqowt/2uctF5zJVEQKL3XYhv8KCdAjqMMm8gFnacTjmeaq3AZzey0mn85D+ty+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"755cd79864fa21156bee035970a7122325f32531f5d7fc16726a0da2291a5b55","last_reissued_at":"2026-05-18T00:53:12.953518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:12.953518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Backward deterministic and weak alternating $\\omega$-automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Sebastian Preugschat, Thomas Wilke","submitted_at":"2017-01-08T15:25:53Z","abstract_excerpt":"We present a direct transformation of weak alternating $\\omega$-automata into equivalent backward deterministic $\\omega$-automata and show (1) how it can be used to obtain a transformation of non-deterministic B\\\"uchi automata into equivalent backward deterministic automata and (2) that it yields optimal equivalent backward deterministic automata when applied to linear-time temporal logic formulas. (1) uses the alternation-free fragment of the linear-time $\\mu$-calculus as an intermediate step; (2) is based on the straightforward translation of linear-time temporal logic into weak alternating "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01971","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.01971","created_at":"2026-05-18T00:53:12.953586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01971v1","created_at":"2026-05-18T00:53:12.953586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01971","created_at":"2026-05-18T00:53:12.953586+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVONPGDE7IQR","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVONPGDE7IQRK27O","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVONPGDE","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OVONPGDE7IQRK27OANMXBJYSEM","json":"https://pith.science/pith/OVONPGDE7IQRK27OANMXBJYSEM.json","graph_json":"https://pith.science/api/pith-number/OVONPGDE7IQRK27OANMXBJYSEM/graph.json","events_json":"https://pith.science/api/pith-number/OVONPGDE7IQRK27OANMXBJYSEM/events.json","paper":"https://pith.science/paper/OVONPGDE"},"agent_actions":{"view_html":"https://pith.science/pith/OVONPGDE7IQRK27OANMXBJYSEM","download_json":"https://pith.science/pith/OVONPGDE7IQRK27OANMXBJYSEM.json","view_paper":"https://pith.science/paper/OVONPGDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01971&json=true","fetch_graph":"https://pith.science/api/pith-number/OVONPGDE7IQRK27OANMXBJYSEM/graph.json","fetch_events":"https://pith.science/api/pith-number/OVONPGDE7IQRK27OANMXBJYSEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVONPGDE7IQRK27OANMXBJYSEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVONPGDE7IQRK27OANMXBJYSEM/action/storage_attestation","attest_author":"https://pith.science/pith/OVONPGDE7IQRK27OANMXBJYSEM/action/author_attestation","sign_citation":"https://pith.science/pith/OVONPGDE7IQRK27OANMXBJYSEM/action/citation_signature","submit_replication":"https://pith.science/pith/OVONPGDE7IQRK27OANMXBJYSEM/action/replication_record"}},"created_at":"2026-05-18T00:53:12.953586+00:00","updated_at":"2026-05-18T00:53:12.953586+00:00"}