{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5ZNY4A272B4IA6PMN4P2C74XVB","short_pith_number":"pith:5ZNY4A27","schema_version":"1.0","canonical_sha256":"ee5b8e035fd0788079ec6f1fa17f97a8476c4686307fcd0f6977d3620c7842bc","source":{"kind":"arxiv","id":"1905.07223","version":1},"attestation_state":"computed","paper":{"title":"Separating many words by counting occurrences of factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Aleksi Saarela","submitted_at":"2019-05-17T12:24:01Z","abstract_excerpt":"For a given language $L$, we study the languages $X$ such that for all distinct words $u, v \\in L$, there exists a word $x \\in X$ that appears a different number of times as a factor in $u$ and in $v$. In particular, we are interested in the following question: For which languages $L$ does there exist a finite language $X$ satisfying the above condition? We answer this question for all regular languages and for all sets of factors of infinite words."},"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":"1905.07223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-17T12:24:01Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"557fe7a49cece65f7671e454c95416bc543451abf58ac648aab9d34ccfaf67ca","abstract_canon_sha256":"42a07441d420dbf79d57d6ea6d13a0df545c71a73713c016ee9a3e2e01f80951"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:56.130691Z","signature_b64":"jjCAW6MHBXKIUJZPtp3XvJ/nMst5UFg+pnLrYLpJA8iD2/5+ONGo5JGP8TYCtb8vCHk3XgQEvtwSvS/2iy8ZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee5b8e035fd0788079ec6f1fa17f97a8476c4686307fcd0f6977d3620c7842bc","last_reissued_at":"2026-05-17T23:45:56.130130Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:56.130130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separating many words by counting occurrences of factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Aleksi Saarela","submitted_at":"2019-05-17T12:24:01Z","abstract_excerpt":"For a given language $L$, we study the languages $X$ such that for all distinct words $u, v \\in L$, there exists a word $x \\in X$ that appears a different number of times as a factor in $u$ and in $v$. In particular, we are interested in the following question: For which languages $L$ does there exist a finite language $X$ satisfying the above condition? We answer this question for all regular languages and for all sets of factors of infinite words."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07223","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":"1905.07223","created_at":"2026-05-17T23:45:56.130207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07223v1","created_at":"2026-05-17T23:45:56.130207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07223","created_at":"2026-05-17T23:45:56.130207+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZNY4A272B4I","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZNY4A272B4IA6PM","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZNY4A27","created_at":"2026-05-18T12:33:10.108867+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/5ZNY4A272B4IA6PMN4P2C74XVB","json":"https://pith.science/pith/5ZNY4A272B4IA6PMN4P2C74XVB.json","graph_json":"https://pith.science/api/pith-number/5ZNY4A272B4IA6PMN4P2C74XVB/graph.json","events_json":"https://pith.science/api/pith-number/5ZNY4A272B4IA6PMN4P2C74XVB/events.json","paper":"https://pith.science/paper/5ZNY4A27"},"agent_actions":{"view_html":"https://pith.science/pith/5ZNY4A272B4IA6PMN4P2C74XVB","download_json":"https://pith.science/pith/5ZNY4A272B4IA6PMN4P2C74XVB.json","view_paper":"https://pith.science/paper/5ZNY4A27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07223&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZNY4A272B4IA6PMN4P2C74XVB/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZNY4A272B4IA6PMN4P2C74XVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZNY4A272B4IA6PMN4P2C74XVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZNY4A272B4IA6PMN4P2C74XVB/action/storage_attestation","attest_author":"https://pith.science/pith/5ZNY4A272B4IA6PMN4P2C74XVB/action/author_attestation","sign_citation":"https://pith.science/pith/5ZNY4A272B4IA6PMN4P2C74XVB/action/citation_signature","submit_replication":"https://pith.science/pith/5ZNY4A272B4IA6PMN4P2C74XVB/action/replication_record"}},"created_at":"2026-05-17T23:45:56.130207+00:00","updated_at":"2026-05-17T23:45:56.130207+00:00"}