{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N3WLLOQUDDT44I3OGPT4OY36XP","short_pith_number":"pith:N3WLLOQU","schema_version":"1.0","canonical_sha256":"6eecb5ba1418e7ce236e33e7c7637ebbfab8286ebb7e0ad2256bb491f2500752","source":{"kind":"arxiv","id":"1103.4513","version":1},"attestation_state":"computed","paper":{"title":"Remarks on separating words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.FL","authors_text":"David A. Wilson, Erik D. Demaine, Jeffrey Shallit, Sarah Eisenstat","submitted_at":"2011-03-23T13:31:37Z","abstract_excerpt":"The separating words problem asks for the size of the smallest DFA needed to distinguish between two words of length <= n (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results."},"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":"1103.4513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-03-23T13:31:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c3d07eb185014404af21819929e6562402216d12d84a3aee8e41ff1efeee751f","abstract_canon_sha256":"788e7b0e69eb0e150b9455f22a69cf5adc1439b551a66740037b93f5021f1bac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:01.886831Z","signature_b64":"WZz89RmEvDf6w7YeVeM5fqnVmvxjLlUfNUtFp+SUFdyGWL2PpetVtswJNNni/INiaaChQSFK6ruWei1ibAXfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eecb5ba1418e7ce236e33e7c7637ebbfab8286ebb7e0ad2256bb491f2500752","last_reissued_at":"2026-05-18T04:26:01.886422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:01.886422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Remarks on separating words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.FL","authors_text":"David A. Wilson, Erik D. Demaine, Jeffrey Shallit, Sarah Eisenstat","submitted_at":"2011-03-23T13:31:37Z","abstract_excerpt":"The separating words problem asks for the size of the smallest DFA needed to distinguish between two words of length <= n (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4513","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":"1103.4513","created_at":"2026-05-18T04:26:01.886483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4513v1","created_at":"2026-05-18T04:26:01.886483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4513","created_at":"2026-05-18T04:26:01.886483+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3WLLOQUDDT4","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3WLLOQUDDT44I3O","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3WLLOQU","created_at":"2026-05-18T12:26:37.096874+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/N3WLLOQUDDT44I3OGPT4OY36XP","json":"https://pith.science/pith/N3WLLOQUDDT44I3OGPT4OY36XP.json","graph_json":"https://pith.science/api/pith-number/N3WLLOQUDDT44I3OGPT4OY36XP/graph.json","events_json":"https://pith.science/api/pith-number/N3WLLOQUDDT44I3OGPT4OY36XP/events.json","paper":"https://pith.science/paper/N3WLLOQU"},"agent_actions":{"view_html":"https://pith.science/pith/N3WLLOQUDDT44I3OGPT4OY36XP","download_json":"https://pith.science/pith/N3WLLOQUDDT44I3OGPT4OY36XP.json","view_paper":"https://pith.science/paper/N3WLLOQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4513&json=true","fetch_graph":"https://pith.science/api/pith-number/N3WLLOQUDDT44I3OGPT4OY36XP/graph.json","fetch_events":"https://pith.science/api/pith-number/N3WLLOQUDDT44I3OGPT4OY36XP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3WLLOQUDDT44I3OGPT4OY36XP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3WLLOQUDDT44I3OGPT4OY36XP/action/storage_attestation","attest_author":"https://pith.science/pith/N3WLLOQUDDT44I3OGPT4OY36XP/action/author_attestation","sign_citation":"https://pith.science/pith/N3WLLOQUDDT44I3OGPT4OY36XP/action/citation_signature","submit_replication":"https://pith.science/pith/N3WLLOQUDDT44I3OGPT4OY36XP/action/replication_record"}},"created_at":"2026-05-18T04:26:01.886483+00:00","updated_at":"2026-05-18T04:26:01.886483+00:00"}