{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GEOZ7OMQ6DUN3H7QDYJNYASZ3X","short_pith_number":"pith:GEOZ7OMQ","schema_version":"1.0","canonical_sha256":"311d9fb990f0e8dd9ff01e12dc0259dde1b2fce5920e092c2aea6a3396bad869","source":{"kind":"arxiv","id":"1311.6605","version":1},"attestation_state":"computed","paper":{"title":"Enhancing Approximations for Regular Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Alois Dreyfus (INRIA Nancy - Grand Est / LORIA / LIFC, FEMTO-ST), Olga Kouchnarenko (INRIA Nancy - Grand Est / LORIA / LIFC, Pierre-Cyrille Heam (INRIA Nancy - Grand Est / LORIA / LIFC, UMR 6174)","submitted_at":"2013-11-26T09:57:16Z","abstract_excerpt":"This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mechanism consists in over-approximating the automata representing reachable sets by merging some of their states with respect to simple syntactic criteria, or a combination of such criteria. The second approximation mechanism consists in manipulating an auxiliary automaton when applying a transducer representing the transition relation to an automaton encoding the initial states. In addition, for the second mechanism we "},"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":"1311.6605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-11-26T09:57:16Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"88ae5cd548f1d0be01c6e06f80a0b292b97fe9dbe9f34c67e99dc9c2ca2a8c69","abstract_canon_sha256":"0c15b96c9d9523b615281c51d5afbc83e06dc9240ca63d52ecafadb2ca9773c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:12.246135Z","signature_b64":"4lte/v+wX2hi3IcGUHtH2LJ3xg6lA4SFpnhoBSLuKvBzl6PwhwzGMdPpBCviE6Iq8PO3Y8xDtNR6JNNKANZDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"311d9fb990f0e8dd9ff01e12dc0259dde1b2fce5920e092c2aea6a3396bad869","last_reissued_at":"2026-05-18T03:06:12.245289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:12.245289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Approximations for Regular Reachability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Alois Dreyfus (INRIA Nancy - Grand Est / LORIA / LIFC, FEMTO-ST), Olga Kouchnarenko (INRIA Nancy - Grand Est / LORIA / LIFC, Pierre-Cyrille Heam (INRIA Nancy - Grand Est / LORIA / LIFC, UMR 6174)","submitted_at":"2013-11-26T09:57:16Z","abstract_excerpt":"This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mechanism consists in over-approximating the automata representing reachable sets by merging some of their states with respect to simple syntactic criteria, or a combination of such criteria. The second approximation mechanism consists in manipulating an auxiliary automaton when applying a transducer representing the transition relation to an automaton encoding the initial states. In addition, for the second mechanism we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6605","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":"1311.6605","created_at":"2026-05-18T03:06:12.245443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6605v1","created_at":"2026-05-18T03:06:12.245443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6605","created_at":"2026-05-18T03:06:12.245443+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEOZ7OMQ6DUN","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEOZ7OMQ6DUN3H7Q","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEOZ7OMQ","created_at":"2026-05-18T12:27:45.050594+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/GEOZ7OMQ6DUN3H7QDYJNYASZ3X","json":"https://pith.science/pith/GEOZ7OMQ6DUN3H7QDYJNYASZ3X.json","graph_json":"https://pith.science/api/pith-number/GEOZ7OMQ6DUN3H7QDYJNYASZ3X/graph.json","events_json":"https://pith.science/api/pith-number/GEOZ7OMQ6DUN3H7QDYJNYASZ3X/events.json","paper":"https://pith.science/paper/GEOZ7OMQ"},"agent_actions":{"view_html":"https://pith.science/pith/GEOZ7OMQ6DUN3H7QDYJNYASZ3X","download_json":"https://pith.science/pith/GEOZ7OMQ6DUN3H7QDYJNYASZ3X.json","view_paper":"https://pith.science/paper/GEOZ7OMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6605&json=true","fetch_graph":"https://pith.science/api/pith-number/GEOZ7OMQ6DUN3H7QDYJNYASZ3X/graph.json","fetch_events":"https://pith.science/api/pith-number/GEOZ7OMQ6DUN3H7QDYJNYASZ3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEOZ7OMQ6DUN3H7QDYJNYASZ3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEOZ7OMQ6DUN3H7QDYJNYASZ3X/action/storage_attestation","attest_author":"https://pith.science/pith/GEOZ7OMQ6DUN3H7QDYJNYASZ3X/action/author_attestation","sign_citation":"https://pith.science/pith/GEOZ7OMQ6DUN3H7QDYJNYASZ3X/action/citation_signature","submit_replication":"https://pith.science/pith/GEOZ7OMQ6DUN3H7QDYJNYASZ3X/action/replication_record"}},"created_at":"2026-05-18T03:06:12.245443+00:00","updated_at":"2026-05-18T03:06:12.245443+00:00"}