{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PWARYCTHL6ZVCVT6RPE63CTV6V","short_pith_number":"pith:PWARYCTH","schema_version":"1.0","canonical_sha256":"7d811c0a675fb351567e8bc9ed8a75f56002921a69dfcc33404b8026ecfd4709","source":{"kind":"arxiv","id":"1906.06194","version":2},"attestation_state":"computed","paper":{"title":"A Congruence-based Perspective on Automata Minimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Elena Guti\\'errez, Pedro Valero, Pierre Ganty","submitted_at":"2019-06-14T13:19:45Z","abstract_excerpt":"In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language."},"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":"1906.06194","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-06-14T13:19:45Z","cross_cats_sorted":[],"title_canon_sha256":"86416087b61a890b1cf572b37d255fdbe350fb38e381f014acbddc66f7ae8002","abstract_canon_sha256":"5ac352c6033b8a6c81ecf5093eb51db63612e05e6e57500590e3ec0a0c59c4b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:07.809934Z","signature_b64":"KSIRwBQXsS7xJq6X1eUv2I4MLatxxQswS/10+wADO+xypgx0owk7adCjgBR1z32B6j+3LZU0X7G7nQKjenFwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d811c0a675fb351567e8bc9ed8a75f56002921a69dfcc33404b8026ecfd4709","last_reissued_at":"2026-05-17T23:42:07.808454Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:07.808454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Congruence-based Perspective on Automata Minimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Elena Guti\\'errez, Pedro Valero, Pierre Ganty","submitted_at":"2019-06-14T13:19:45Z","abstract_excerpt":"In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06194","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":"1906.06194","created_at":"2026-05-17T23:42:07.808604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06194v2","created_at":"2026-05-17T23:42:07.808604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06194","created_at":"2026-05-17T23:42:07.808604+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWARYCTHL6ZV","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWARYCTHL6ZVCVT6","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWARYCTH","created_at":"2026-05-18T12:33:24.271573+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/PWARYCTHL6ZVCVT6RPE63CTV6V","json":"https://pith.science/pith/PWARYCTHL6ZVCVT6RPE63CTV6V.json","graph_json":"https://pith.science/api/pith-number/PWARYCTHL6ZVCVT6RPE63CTV6V/graph.json","events_json":"https://pith.science/api/pith-number/PWARYCTHL6ZVCVT6RPE63CTV6V/events.json","paper":"https://pith.science/paper/PWARYCTH"},"agent_actions":{"view_html":"https://pith.science/pith/PWARYCTHL6ZVCVT6RPE63CTV6V","download_json":"https://pith.science/pith/PWARYCTHL6ZVCVT6RPE63CTV6V.json","view_paper":"https://pith.science/paper/PWARYCTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06194&json=true","fetch_graph":"https://pith.science/api/pith-number/PWARYCTHL6ZVCVT6RPE63CTV6V/graph.json","fetch_events":"https://pith.science/api/pith-number/PWARYCTHL6ZVCVT6RPE63CTV6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWARYCTHL6ZVCVT6RPE63CTV6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWARYCTHL6ZVCVT6RPE63CTV6V/action/storage_attestation","attest_author":"https://pith.science/pith/PWARYCTHL6ZVCVT6RPE63CTV6V/action/author_attestation","sign_citation":"https://pith.science/pith/PWARYCTHL6ZVCVT6RPE63CTV6V/action/citation_signature","submit_replication":"https://pith.science/pith/PWARYCTHL6ZVCVT6RPE63CTV6V/action/replication_record"}},"created_at":"2026-05-17T23:42:07.808604+00:00","updated_at":"2026-05-17T23:42:07.808604+00:00"}