{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MW2WS3GAXP5QDGCOSWJC3P6AOW","short_pith_number":"pith:MW2WS3GA","schema_version":"1.0","canonical_sha256":"65b5696cc0bbfb01984e95922dbfc075894243a51c5fc5a425fba6567b19fc55","source":{"kind":"arxiv","id":"1705.10625","version":1},"attestation_state":"computed","paper":{"title":"On the decidability of $k$-Block determinism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Cl\\'ement Miklarz, Ludovic Mignot, Pascal Caron","submitted_at":"2017-05-30T13:37:02Z","abstract_excerpt":"Br\\\"uggemann-Klein and Wood define a one-unambiguous regular language as a language that can be recognized by a deterministic Glushkov automaton. They give a procedure performed on the minimal DFA, the BW-test, to decide whether a language is one-unambiguous. Block determinism is an extension of one-unambiguity while considering non-empty words as symbols and prefix-freeness as determinism. A block automaton is compact if it does not have two equivalent states (same right language). We showed that a language is $k$-block deterministic if it is recognized by some deterministic $k$-block automat"},"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":"1705.10625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-05-30T13:37:02Z","cross_cats_sorted":[],"title_canon_sha256":"3a1d89fac57e50668ede0b748ade319cf2243a0e7e06af349c5bb9ffca96ce79","abstract_canon_sha256":"51945982cc0def5a9818e3a5d3246167bbf4786bdfe07261f47f97781f6c6d5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:24.004083Z","signature_b64":"RkFr24STZa3gXTm9XNy57YCVilZa6M+BijQiiDmdzkwSyDUII22kwkzPYTI+fyGRUM1phKRaqO/QyU/8htn+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65b5696cc0bbfb01984e95922dbfc075894243a51c5fc5a425fba6567b19fc55","last_reissued_at":"2026-05-18T00:43:24.003566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:24.003566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the decidability of $k$-Block determinism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Cl\\'ement Miklarz, Ludovic Mignot, Pascal Caron","submitted_at":"2017-05-30T13:37:02Z","abstract_excerpt":"Br\\\"uggemann-Klein and Wood define a one-unambiguous regular language as a language that can be recognized by a deterministic Glushkov automaton. They give a procedure performed on the minimal DFA, the BW-test, to decide whether a language is one-unambiguous. Block determinism is an extension of one-unambiguity while considering non-empty words as symbols and prefix-freeness as determinism. A block automaton is compact if it does not have two equivalent states (same right language). We showed that a language is $k$-block deterministic if it is recognized by some deterministic $k$-block automat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10625","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":"1705.10625","created_at":"2026-05-18T00:43:24.003647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10625v1","created_at":"2026-05-18T00:43:24.003647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10625","created_at":"2026-05-18T00:43:24.003647+00:00"},{"alias_kind":"pith_short_12","alias_value":"MW2WS3GAXP5Q","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MW2WS3GAXP5QDGCO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MW2WS3GA","created_at":"2026-05-18T12:31:31.346846+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/MW2WS3GAXP5QDGCOSWJC3P6AOW","json":"https://pith.science/pith/MW2WS3GAXP5QDGCOSWJC3P6AOW.json","graph_json":"https://pith.science/api/pith-number/MW2WS3GAXP5QDGCOSWJC3P6AOW/graph.json","events_json":"https://pith.science/api/pith-number/MW2WS3GAXP5QDGCOSWJC3P6AOW/events.json","paper":"https://pith.science/paper/MW2WS3GA"},"agent_actions":{"view_html":"https://pith.science/pith/MW2WS3GAXP5QDGCOSWJC3P6AOW","download_json":"https://pith.science/pith/MW2WS3GAXP5QDGCOSWJC3P6AOW.json","view_paper":"https://pith.science/paper/MW2WS3GA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10625&json=true","fetch_graph":"https://pith.science/api/pith-number/MW2WS3GAXP5QDGCOSWJC3P6AOW/graph.json","fetch_events":"https://pith.science/api/pith-number/MW2WS3GAXP5QDGCOSWJC3P6AOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MW2WS3GAXP5QDGCOSWJC3P6AOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MW2WS3GAXP5QDGCOSWJC3P6AOW/action/storage_attestation","attest_author":"https://pith.science/pith/MW2WS3GAXP5QDGCOSWJC3P6AOW/action/author_attestation","sign_citation":"https://pith.science/pith/MW2WS3GAXP5QDGCOSWJC3P6AOW/action/citation_signature","submit_replication":"https://pith.science/pith/MW2WS3GAXP5QDGCOSWJC3P6AOW/action/replication_record"}},"created_at":"2026-05-18T00:43:24.003647+00:00","updated_at":"2026-05-18T00:43:24.003647+00:00"}