{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VZVWK5RRKP32TYAAFZCKCL4T4D","short_pith_number":"pith:VZVWK5RR","schema_version":"1.0","canonical_sha256":"ae6b65763153f7a9e0002e44a12f93e0fadca5540e71b1a17a16a68b669d2388","source":{"kind":"arxiv","id":"1801.07321","version":2},"attestation_state":"computed","paper":{"title":"Exploring the Topological Entropy of Formal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Florian Starke","submitted_at":"2018-01-22T21:07:10Z","abstract_excerpt":"We introduce the notions of topological entropy of a formal language and of a topological automaton. We show that the entropy function is surjective and bound the entropy of languages accepted by deterministic {\\epsilon}-free push-down automata with an arbitrary amount of stacks."},"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":"1801.07321","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-01-22T21:07:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6fa7873cc12466026cbd0f19fd07055a33b3bf61a23b22bb6ac2e04e44c70cf2","abstract_canon_sha256":"8e4a3d967195a795ac15014306a4bf59b6859bafd880d677665ec23f029c024c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:52.898566Z","signature_b64":"hIT+JEtbRLHAygcrFlJPnn+YjnF5/v7EYltyEFPPF03K3qc4uOqsE3nakVOdXTYad/DAHZ5aYIgMJzUXtGhBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae6b65763153f7a9e0002e44a12f93e0fadca5540e71b1a17a16a68b669d2388","last_reissued_at":"2026-05-17T23:47:52.898037Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:52.898037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the Topological Entropy of Formal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Florian Starke","submitted_at":"2018-01-22T21:07:10Z","abstract_excerpt":"We introduce the notions of topological entropy of a formal language and of a topological automaton. We show that the entropy function is surjective and bound the entropy of languages accepted by deterministic {\\epsilon}-free push-down automata with an arbitrary amount of stacks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07321","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":"1801.07321","created_at":"2026-05-17T23:47:52.898122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07321v2","created_at":"2026-05-17T23:47:52.898122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07321","created_at":"2026-05-17T23:47:52.898122+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZVWK5RRKP32","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZVWK5RRKP32TYAA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZVWK5RR","created_at":"2026-05-18T12:32:59.047623+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/VZVWK5RRKP32TYAAFZCKCL4T4D","json":"https://pith.science/pith/VZVWK5RRKP32TYAAFZCKCL4T4D.json","graph_json":"https://pith.science/api/pith-number/VZVWK5RRKP32TYAAFZCKCL4T4D/graph.json","events_json":"https://pith.science/api/pith-number/VZVWK5RRKP32TYAAFZCKCL4T4D/events.json","paper":"https://pith.science/paper/VZVWK5RR"},"agent_actions":{"view_html":"https://pith.science/pith/VZVWK5RRKP32TYAAFZCKCL4T4D","download_json":"https://pith.science/pith/VZVWK5RRKP32TYAAFZCKCL4T4D.json","view_paper":"https://pith.science/paper/VZVWK5RR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07321&json=true","fetch_graph":"https://pith.science/api/pith-number/VZVWK5RRKP32TYAAFZCKCL4T4D/graph.json","fetch_events":"https://pith.science/api/pith-number/VZVWK5RRKP32TYAAFZCKCL4T4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZVWK5RRKP32TYAAFZCKCL4T4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZVWK5RRKP32TYAAFZCKCL4T4D/action/storage_attestation","attest_author":"https://pith.science/pith/VZVWK5RRKP32TYAAFZCKCL4T4D/action/author_attestation","sign_citation":"https://pith.science/pith/VZVWK5RRKP32TYAAFZCKCL4T4D/action/citation_signature","submit_replication":"https://pith.science/pith/VZVWK5RRKP32TYAAFZCKCL4T4D/action/replication_record"}},"created_at":"2026-05-17T23:47:52.898122+00:00","updated_at":"2026-05-17T23:47:52.898122+00:00"}