{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZPA2YLG6PFDTC5GN5S4PBHEJNV","short_pith_number":"pith:ZPA2YLG6","schema_version":"1.0","canonical_sha256":"cbc1ac2cde79473174cdecb8f09c896d68427b587dd14434e31af7cd32627b92","source":{"kind":"arxiv","id":"1701.06282","version":2},"attestation_state":"computed","paper":{"title":"Lazy Automata Techniques for WS1S","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Ond\\v{r}ej Leng\\'al, Petr Jank\\r{u}, Tom\\'a\\v{s} Fiedor, Tom\\'a\\v{s} Vojnar","submitted_at":"2017-01-23T07:30:12Z","abstract_excerpt":"We present a new decision procedure for the logic WS1S. It originates from the classical approach, which first builds an automaton accepting all models of a formula and then tests whether its language is empty. The main novelty is to test the emptiness on the fly, while constructing a symbolic, term-based representation of the automaton, and prune the constructed state space from parts irrelevant to the test. The pruning is done by a generalization of two techniques used in antichain-based language inclusion and universality checking of finite automata: subsumption and early termination. The r"},"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.06282","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-23T07:30:12Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"663b4f3bc05e985826bb4085e84ff1e78805bb12baad76fa35fac8b7bbe7e4cb","abstract_canon_sha256":"8dc788e089bedea60e8e6cec3ddd7da7b5fbc2703cd053ba21402e949c87a1af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:12.647969Z","signature_b64":"60/6x0bAFPOy/5avJzcltlevZNnEG12/rKCxd2dPueNY9iUQJxSa9BcYmYsqILzj+oJBLcDLDO2lhyoY1fswCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbc1ac2cde79473174cdecb8f09c896d68427b587dd14434e31af7cd32627b92","last_reissued_at":"2026-05-18T00:52:12.647358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:12.647358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lazy Automata Techniques for WS1S","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Ond\\v{r}ej Leng\\'al, Petr Jank\\r{u}, Tom\\'a\\v{s} Fiedor, Tom\\'a\\v{s} Vojnar","submitted_at":"2017-01-23T07:30:12Z","abstract_excerpt":"We present a new decision procedure for the logic WS1S. It originates from the classical approach, which first builds an automaton accepting all models of a formula and then tests whether its language is empty. The main novelty is to test the emptiness on the fly, while constructing a symbolic, term-based representation of the automaton, and prune the constructed state space from parts irrelevant to the test. The pruning is done by a generalization of two techniques used in antichain-based language inclusion and universality checking of finite automata: subsumption and early termination. The r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06282","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.06282","created_at":"2026-05-18T00:52:12.647467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06282v2","created_at":"2026-05-18T00:52:12.647467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06282","created_at":"2026-05-18T00:52:12.647467+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPA2YLG6PFDT","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPA2YLG6PFDTC5GN","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPA2YLG6","created_at":"2026-05-18T12:31:59.375834+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/ZPA2YLG6PFDTC5GN5S4PBHEJNV","json":"https://pith.science/pith/ZPA2YLG6PFDTC5GN5S4PBHEJNV.json","graph_json":"https://pith.science/api/pith-number/ZPA2YLG6PFDTC5GN5S4PBHEJNV/graph.json","events_json":"https://pith.science/api/pith-number/ZPA2YLG6PFDTC5GN5S4PBHEJNV/events.json","paper":"https://pith.science/paper/ZPA2YLG6"},"agent_actions":{"view_html":"https://pith.science/pith/ZPA2YLG6PFDTC5GN5S4PBHEJNV","download_json":"https://pith.science/pith/ZPA2YLG6PFDTC5GN5S4PBHEJNV.json","view_paper":"https://pith.science/paper/ZPA2YLG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06282&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPA2YLG6PFDTC5GN5S4PBHEJNV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPA2YLG6PFDTC5GN5S4PBHEJNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPA2YLG6PFDTC5GN5S4PBHEJNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPA2YLG6PFDTC5GN5S4PBHEJNV/action/storage_attestation","attest_author":"https://pith.science/pith/ZPA2YLG6PFDTC5GN5S4PBHEJNV/action/author_attestation","sign_citation":"https://pith.science/pith/ZPA2YLG6PFDTC5GN5S4PBHEJNV/action/citation_signature","submit_replication":"https://pith.science/pith/ZPA2YLG6PFDTC5GN5S4PBHEJNV/action/replication_record"}},"created_at":"2026-05-18T00:52:12.647467+00:00","updated_at":"2026-05-18T00:52:12.647467+00:00"}