{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3ESHJ7CYZKN4HTXR52P4PD33HS","short_pith_number":"pith:3ESHJ7CY","schema_version":"1.0","canonical_sha256":"d92474fc58ca9bc3cef1ee9fc78f7b3c885a9da7884c3d5e4ade6f13b6d199a6","source":{"kind":"arxiv","id":"1301.3751","version":1},"attestation_state":"computed","paper":{"title":"On the transition reduction problem for finite automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, el Houcein el Abdalaoui, Mohamed Dahmoune","submitted_at":"2013-01-16T16:49:21Z","abstract_excerpt":"We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language $L(E_n)$ denoted by the regular expression $E_n=(1+\\varepsilon)... (2+\\varepsilon)... (3+\\varepsilon)... (n+\\varepsilon)$. These results can be used in the general case of the transition reduction problem."},"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":"1301.3751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-16T16:49:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dd82741dd084f8c96c184553461bc844347c89a4401c2e2508354cabd7defaf0","abstract_canon_sha256":"7a27c3b8fd164e31935655f442f49e7336608ee58c9f4038d43c70d8e6d6639b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:16.824340Z","signature_b64":"hfkPtqKq6Q7KxlpA7DfJmLKXf29SAYwtQ7zcGAf1FxM69yb+uDbZ9KTqMsY3FDAXfKsD5kFNa+iG5joa/8ywAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d92474fc58ca9bc3cef1ee9fc78f7b3c885a9da7884c3d5e4ade6f13b6d199a6","last_reissued_at":"2026-05-18T03:36:16.823702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:16.823702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the transition reduction problem for finite automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, el Houcein el Abdalaoui, Mohamed Dahmoune","submitted_at":"2013-01-16T16:49:21Z","abstract_excerpt":"We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language $L(E_n)$ denoted by the regular expression $E_n=(1+\\varepsilon)... (2+\\varepsilon)... (3+\\varepsilon)... (n+\\varepsilon)$. These results can be used in the general case of the transition reduction problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3751","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":"1301.3751","created_at":"2026-05-18T03:36:16.823818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3751v1","created_at":"2026-05-18T03:36:16.823818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3751","created_at":"2026-05-18T03:36:16.823818+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ESHJ7CYZKN4","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ESHJ7CYZKN4HTXR","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ESHJ7CY","created_at":"2026-05-18T12:27:32.513160+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/3ESHJ7CYZKN4HTXR52P4PD33HS","json":"https://pith.science/pith/3ESHJ7CYZKN4HTXR52P4PD33HS.json","graph_json":"https://pith.science/api/pith-number/3ESHJ7CYZKN4HTXR52P4PD33HS/graph.json","events_json":"https://pith.science/api/pith-number/3ESHJ7CYZKN4HTXR52P4PD33HS/events.json","paper":"https://pith.science/paper/3ESHJ7CY"},"agent_actions":{"view_html":"https://pith.science/pith/3ESHJ7CYZKN4HTXR52P4PD33HS","download_json":"https://pith.science/pith/3ESHJ7CYZKN4HTXR52P4PD33HS.json","view_paper":"https://pith.science/paper/3ESHJ7CY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3751&json=true","fetch_graph":"https://pith.science/api/pith-number/3ESHJ7CYZKN4HTXR52P4PD33HS/graph.json","fetch_events":"https://pith.science/api/pith-number/3ESHJ7CYZKN4HTXR52P4PD33HS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ESHJ7CYZKN4HTXR52P4PD33HS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ESHJ7CYZKN4HTXR52P4PD33HS/action/storage_attestation","attest_author":"https://pith.science/pith/3ESHJ7CYZKN4HTXR52P4PD33HS/action/author_attestation","sign_citation":"https://pith.science/pith/3ESHJ7CYZKN4HTXR52P4PD33HS/action/citation_signature","submit_replication":"https://pith.science/pith/3ESHJ7CYZKN4HTXR52P4PD33HS/action/replication_record"}},"created_at":"2026-05-18T03:36:16.823818+00:00","updated_at":"2026-05-18T03:36:16.823818+00:00"}