{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UANRAB2YH3RAHVWSZK675R2ZKB","short_pith_number":"pith:UANRAB2Y","schema_version":"1.0","canonical_sha256":"a01b1007583ee203d6d2cabdfec759504307439db7d808de14e4cb6ec2162de0","source":{"kind":"arxiv","id":"1902.00812","version":1},"attestation_state":"computed","paper":{"title":"Planar digraphs for automatic complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.LO"],"primary_cat":"cs.FL","authors_text":"Achilles A. Beros, Bj{\\o}rn Kjos-Hanssen, Daylan Kaui Yogi","submitted_at":"2019-02-02T23:25:32Z","abstract_excerpt":"We show that the digraph of a nondeterministic finite automaton witnessing the automatic complexity of a word can always be taken to be planar. In the case of total transition functions studied by Shallit and Wang, planarity can fail.\n  Let $s_q(n)$ be the number of binary words $x$ of length $n$ having nondeterministic automatic complexity $A_N(x)=q$. We show that $s_q$ is eventually constant for each $q$ and that the eventual constant value of $s_q$ is computable."},"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":"1902.00812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-02T23:25:32Z","cross_cats_sorted":["math.CO","math.LO"],"title_canon_sha256":"eeca7014b609fea14362d9221d9760869286b4120de10be9fee992527f138df0","abstract_canon_sha256":"412a44ce07b9581635140caa26407960c6bc8b4eb5b36ca99062e5530f956ec5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:52.072955Z","signature_b64":"/h+PO1kkqe6WnINfKA5A+E2S7BMyvX3aaEmKfN4uPJCWt7+8NAKMC1AwzY0TeAjWYotWVf1/9z/Vm2y5PDhpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a01b1007583ee203d6d2cabdfec759504307439db7d808de14e4cb6ec2162de0","last_reissued_at":"2026-05-17T23:54:52.072588Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:52.072588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar digraphs for automatic complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.LO"],"primary_cat":"cs.FL","authors_text":"Achilles A. Beros, Bj{\\o}rn Kjos-Hanssen, Daylan Kaui Yogi","submitted_at":"2019-02-02T23:25:32Z","abstract_excerpt":"We show that the digraph of a nondeterministic finite automaton witnessing the automatic complexity of a word can always be taken to be planar. In the case of total transition functions studied by Shallit and Wang, planarity can fail.\n  Let $s_q(n)$ be the number of binary words $x$ of length $n$ having nondeterministic automatic complexity $A_N(x)=q$. We show that $s_q$ is eventually constant for each $q$ and that the eventual constant value of $s_q$ is computable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00812","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":"1902.00812","created_at":"2026-05-17T23:54:52.072645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00812v1","created_at":"2026-05-17T23:54:52.072645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00812","created_at":"2026-05-17T23:54:52.072645+00:00"},{"alias_kind":"pith_short_12","alias_value":"UANRAB2YH3RA","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UANRAB2YH3RAHVWS","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UANRAB2Y","created_at":"2026-05-18T12:33:30.264802+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/UANRAB2YH3RAHVWSZK675R2ZKB","json":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB.json","graph_json":"https://pith.science/api/pith-number/UANRAB2YH3RAHVWSZK675R2ZKB/graph.json","events_json":"https://pith.science/api/pith-number/UANRAB2YH3RAHVWSZK675R2ZKB/events.json","paper":"https://pith.science/paper/UANRAB2Y"},"agent_actions":{"view_html":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB","download_json":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB.json","view_paper":"https://pith.science/paper/UANRAB2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00812&json=true","fetch_graph":"https://pith.science/api/pith-number/UANRAB2YH3RAHVWSZK675R2ZKB/graph.json","fetch_events":"https://pith.science/api/pith-number/UANRAB2YH3RAHVWSZK675R2ZKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB/action/storage_attestation","attest_author":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB/action/author_attestation","sign_citation":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB/action/citation_signature","submit_replication":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB/action/replication_record"}},"created_at":"2026-05-17T23:54:52.072645+00:00","updated_at":"2026-05-17T23:54:52.072645+00:00"}