{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RUVZVELKSTH2FEBHQDB4IAKIT3","short_pith_number":"pith:RUVZVELK","schema_version":"1.0","canonical_sha256":"8d2b9a916a94cfa2902780c3c401489ed2720795e8db0d3189c7cc65c6e9e197","source":{"kind":"arxiv","id":"1507.03393","version":2},"attestation_state":"computed","paper":{"title":"Topological Entropy of Formal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Daniel Borchmann, Friedrich Martin Schneider","submitted_at":"2015-07-13T11:07:34Z","abstract_excerpt":"We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode congruence relation, we are able to compute the topological entropies of certain example languages. Those examples suggest that the notion of a \"simple\" formal language coincides with the language having zero entropy."},"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":"1507.03393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-07-13T11:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"8576ee66477016feab1976309554e094d71f00852e2eb8d36e2c1cbaccd3bc1e","abstract_canon_sha256":"28410e74b853f517c811a04fa9021bb93d84368ca2b020407da12b91f7443eb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:29.850217Z","signature_b64":"zt6NCYl4V9PJ1BMSX5nrk87JRANC96FUbj3ZnnZxU3EcKKBydA3OGbCD9a532voRoNjr+UvXFeUCs3a7iYkOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d2b9a916a94cfa2902780c3c401489ed2720795e8db0d3189c7cc65c6e9e197","last_reissued_at":"2026-05-18T00:03:29.849447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:29.849447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological Entropy of Formal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Daniel Borchmann, Friedrich Martin Schneider","submitted_at":"2015-07-13T11:07:34Z","abstract_excerpt":"We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode congruence relation, we are able to compute the topological entropies of certain example languages. Those examples suggest that the notion of a \"simple\" formal language coincides with the language having zero entropy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03393","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":"1507.03393","created_at":"2026-05-18T00:03:29.849561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03393v2","created_at":"2026-05-18T00:03:29.849561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03393","created_at":"2026-05-18T00:03:29.849561+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUVZVELKSTH2","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUVZVELKSTH2FEBH","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUVZVELK","created_at":"2026-05-18T12:29:39.896362+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/RUVZVELKSTH2FEBHQDB4IAKIT3","json":"https://pith.science/pith/RUVZVELKSTH2FEBHQDB4IAKIT3.json","graph_json":"https://pith.science/api/pith-number/RUVZVELKSTH2FEBHQDB4IAKIT3/graph.json","events_json":"https://pith.science/api/pith-number/RUVZVELKSTH2FEBHQDB4IAKIT3/events.json","paper":"https://pith.science/paper/RUVZVELK"},"agent_actions":{"view_html":"https://pith.science/pith/RUVZVELKSTH2FEBHQDB4IAKIT3","download_json":"https://pith.science/pith/RUVZVELKSTH2FEBHQDB4IAKIT3.json","view_paper":"https://pith.science/paper/RUVZVELK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03393&json=true","fetch_graph":"https://pith.science/api/pith-number/RUVZVELKSTH2FEBHQDB4IAKIT3/graph.json","fetch_events":"https://pith.science/api/pith-number/RUVZVELKSTH2FEBHQDB4IAKIT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUVZVELKSTH2FEBHQDB4IAKIT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUVZVELKSTH2FEBHQDB4IAKIT3/action/storage_attestation","attest_author":"https://pith.science/pith/RUVZVELKSTH2FEBHQDB4IAKIT3/action/author_attestation","sign_citation":"https://pith.science/pith/RUVZVELKSTH2FEBHQDB4IAKIT3/action/citation_signature","submit_replication":"https://pith.science/pith/RUVZVELKSTH2FEBHQDB4IAKIT3/action/replication_record"}},"created_at":"2026-05-18T00:03:29.849561+00:00","updated_at":"2026-05-18T00:03:29.849561+00:00"}