{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UANRAB2YH3RAHVWSZK675R2ZKB","short_pith_number":"pith:UANRAB2Y","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"},"canonical_sha256":"a01b1007583ee203d6d2cabdfec759504307439db7d808de14e4cb6ec2162de0","source":{"kind":"arxiv","id":"1902.00812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00812","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00812v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00812","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"UANRAB2YH3RA","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UANRAB2YH3RAHVWS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UANRAB2Y","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UANRAB2YH3RAHVWSZK675R2ZKB","target":"record","payload":{"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"},"canonical_sha256":"a01b1007583ee203d6d2cabdfec759504307439db7d808de14e4cb6ec2162de0","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"},"source_kind":"arxiv","source_id":"1902.00812","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6OfCEwXlB/hVnMLXpF90MV3xSi7wrwzWCAPiuX3HzbGCMPMgh+IZXbPPlvRR2NTq7uzFBzjGEN/FVKEypF7BAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:15:52.706058Z"},"content_sha256":"4d7fc0b407e559a802915fdba7c57d95a9f52bc52bd6569fbb0f56d81bdb0c70","schema_version":"1.0","event_id":"sha256:4d7fc0b407e559a802915fdba7c57d95a9f52bc52bd6569fbb0f56d81bdb0c70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UANRAB2YH3RAHVWSZK675R2ZKB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKoJk0v/9TVFeJUzLRAMGi4ngh3mrk83luUuut7UtAJ+2znykrOu8cdQtYjIVtRCk1Dkr4sJMuoGgTqi8RvgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:15:52.706440Z"},"content_sha256":"2a9d0c0533e3a6793725c72f5e70c1ad04a0cfefee65bfaa0c9c9ffadab5af0d","schema_version":"1.0","event_id":"sha256:2a9d0c0533e3a6793725c72f5e70c1ad04a0cfefee65bfaa0c9c9ffadab5af0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB/bundle.json","state_url":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UANRAB2YH3RAHVWSZK675R2ZKB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T05:15:52Z","links":{"resolver":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB","bundle":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB/bundle.json","state":"https://pith.science/pith/UANRAB2YH3RAHVWSZK675R2ZKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UANRAB2YH3RAHVWSZK675R2ZKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UANRAB2YH3RAHVWSZK675R2ZKB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"412a44ce07b9581635140caa26407960c6bc8b4eb5b36ca99062e5530f956ec5","cross_cats_sorted":["math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-02T23:25:32Z","title_canon_sha256":"eeca7014b609fea14362d9221d9760869286b4120de10be9fee992527f138df0"},"schema_version":"1.0","source":{"id":"1902.00812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00812","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00812v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00812","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"UANRAB2YH3RA","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UANRAB2YH3RAHVWS","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UANRAB2Y","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:2a9d0c0533e3a6793725c72f5e70c1ad04a0cfefee65bfaa0c9c9ffadab5af0d","target":"graph","created_at":"2026-05-17T23:54:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Achilles A. Beros, Bj{\\o}rn Kjos-Hanssen, Daylan Kaui Yogi","cross_cats":["math.CO","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-02T23:25:32Z","title":"Planar digraphs for automatic complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00812","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4d7fc0b407e559a802915fdba7c57d95a9f52bc52bd6569fbb0f56d81bdb0c70","target":"record","created_at":"2026-05-17T23:54:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"412a44ce07b9581635140caa26407960c6bc8b4eb5b36ca99062e5530f956ec5","cross_cats_sorted":["math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-02T23:25:32Z","title_canon_sha256":"eeca7014b609fea14362d9221d9760869286b4120de10be9fee992527f138df0"},"schema_version":"1.0","source":{"id":"1902.00812","kind":"arxiv","version":1}},"canonical_sha256":"a01b1007583ee203d6d2cabdfec759504307439db7d808de14e4cb6ec2162de0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a01b1007583ee203d6d2cabdfec759504307439db7d808de14e4cb6ec2162de0","first_computed_at":"2026-05-17T23:54:52.072588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:52.072588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/h+PO1kkqe6WnINfKA5A+E2S7BMyvX3aaEmKfN4uPJCWt7+8NAKMC1AwzY0TeAjWYotWVf1/9z/Vm2y5PDhpAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:52.072955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d7fc0b407e559a802915fdba7c57d95a9f52bc52bd6569fbb0f56d81bdb0c70","sha256:2a9d0c0533e3a6793725c72f5e70c1ad04a0cfefee65bfaa0c9c9ffadab5af0d"],"state_sha256":"72e022eeeeea677af35281692fc6eaf7c1fdac31c078e03317a6c445452d5967"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5YoomcbY5hEfzPKqOmN2sfrMnZhRFbMrhKrS7OJSwwOFPqTric0jPx/PzuLraikkkHfGwnG0PzBpb3OF25gAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:15:52.708616Z","bundle_sha256":"43ec78c5e593326998d341f74aa1de1d2c308931c05515c0e7c54d83f6c5e294"}}