{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EFCS7QLYMXWHULY7OBVPC5O5BU","short_pith_number":"pith:EFCS7QLY","schema_version":"1.0","canonical_sha256":"21452fc17865ec7a2f1f706af175dd0d1ce0588f30af866db1a3702d2033a1b5","source":{"kind":"arxiv","id":"1804.10459","version":1},"attestation_state":"computed","paper":{"title":"Testing Simon's congruence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lukas Fleischer, Manfred Kufleitner","submitted_at":"2018-04-27T12:06:42Z","abstract_excerpt":"Piecewise testable languages are a subclass of the regular languages. There are many equivalent ways of defining them; Simon's congruence $\\sim_k$ is one of the most classical approaches. Two words are $\\sim_k$-equivalent if they have the same set of (scattered) subwords of length at most k. A language L is piecewise testable if there exists some k such that L is a union of $\\sim_k$-classes. For each equivalence class of $\\sim_k$, one can define a canonical representative in shortlex normal form, that is, the minimal word with respect to the lexicographic order among the shortest words in $\\si"},"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":"1804.10459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-27T12:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"cd8f751b66f49cbb38545dc84c72258b8be16579801f45278e02125e3c788fb0","abstract_canon_sha256":"37a056094ef5d2750f73ee77e7fb8439d92d5d5b12b31f433091c378acf46255"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:20.689742Z","signature_b64":"96468eL6F9H+o4Hz2Tc1+1h3pbpjnwPNL1OYsw5H4UjUlmI7JBRrKsTa3RikY+JDdXEu9BY3Ioh1sEP7uVCtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21452fc17865ec7a2f1f706af175dd0d1ce0588f30af866db1a3702d2033a1b5","last_reissued_at":"2026-05-18T00:17:20.688986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:20.688986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Simon's congruence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lukas Fleischer, Manfred Kufleitner","submitted_at":"2018-04-27T12:06:42Z","abstract_excerpt":"Piecewise testable languages are a subclass of the regular languages. There are many equivalent ways of defining them; Simon's congruence $\\sim_k$ is one of the most classical approaches. Two words are $\\sim_k$-equivalent if they have the same set of (scattered) subwords of length at most k. A language L is piecewise testable if there exists some k such that L is a union of $\\sim_k$-classes. For each equivalence class of $\\sim_k$, one can define a canonical representative in shortlex normal form, that is, the minimal word with respect to the lexicographic order among the shortest words in $\\si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10459","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":"1804.10459","created_at":"2026-05-18T00:17:20.689103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10459v1","created_at":"2026-05-18T00:17:20.689103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10459","created_at":"2026-05-18T00:17:20.689103+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFCS7QLYMXWH","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFCS7QLYMXWHULY7","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFCS7QLY","created_at":"2026-05-18T12:32:22.470017+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/EFCS7QLYMXWHULY7OBVPC5O5BU","json":"https://pith.science/pith/EFCS7QLYMXWHULY7OBVPC5O5BU.json","graph_json":"https://pith.science/api/pith-number/EFCS7QLYMXWHULY7OBVPC5O5BU/graph.json","events_json":"https://pith.science/api/pith-number/EFCS7QLYMXWHULY7OBVPC5O5BU/events.json","paper":"https://pith.science/paper/EFCS7QLY"},"agent_actions":{"view_html":"https://pith.science/pith/EFCS7QLYMXWHULY7OBVPC5O5BU","download_json":"https://pith.science/pith/EFCS7QLYMXWHULY7OBVPC5O5BU.json","view_paper":"https://pith.science/paper/EFCS7QLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10459&json=true","fetch_graph":"https://pith.science/api/pith-number/EFCS7QLYMXWHULY7OBVPC5O5BU/graph.json","fetch_events":"https://pith.science/api/pith-number/EFCS7QLYMXWHULY7OBVPC5O5BU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFCS7QLYMXWHULY7OBVPC5O5BU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFCS7QLYMXWHULY7OBVPC5O5BU/action/storage_attestation","attest_author":"https://pith.science/pith/EFCS7QLYMXWHULY7OBVPC5O5BU/action/author_attestation","sign_citation":"https://pith.science/pith/EFCS7QLYMXWHULY7OBVPC5O5BU/action/citation_signature","submit_replication":"https://pith.science/pith/EFCS7QLYMXWHULY7OBVPC5O5BU/action/replication_record"}},"created_at":"2026-05-18T00:17:20.689103+00:00","updated_at":"2026-05-18T00:17:20.689103+00:00"}