{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5TFJVZMFJKGHTT2KJHHZXPQZKE","short_pith_number":"pith:5TFJVZMF","schema_version":"1.0","canonical_sha256":"ecca9ae5854a8c79cf4a49cf9bbe195123e62098175a734057f61952502796f1","source":{"kind":"arxiv","id":"1512.08168","version":5},"attestation_state":"computed","paper":{"title":"Quick Brown Fox in Formal Languages","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Kazuhiro Inaba","submitted_at":"2015-12-27T03:55:18Z","abstract_excerpt":"Given a finite alphabet $\\Sigma$ and a deterministic finite automaton on $\\Sigma$, the problem of determining whether the language recognized by the automaton contains any pangram is \\NP-complete. Various other language classes and problems around pangrams are analyzed."},"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":"1512.08168","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.FL","submitted_at":"2015-12-27T03:55:18Z","cross_cats_sorted":[],"title_canon_sha256":"8f0cf9310866ec541f9ebcdc5cb61268224fefac465fa66986c9e0adf6f8203f","abstract_canon_sha256":"9502512250e03885076f51dbb20a3c508a0f942571d9ff6faadba36999eb1193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:58.716089Z","signature_b64":"qqU0cpaI4E3QdzlX4sjZB/e0UQRRSPXkIdsg0aZb8scqvZvOghsq0f4ysBEbCOcbtGF0St/Ptpw2D07SqSSuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecca9ae5854a8c79cf4a49cf9bbe195123e62098175a734057f61952502796f1","last_reissued_at":"2026-05-18T01:20:58.715597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:58.715597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quick Brown Fox in Formal Languages","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Kazuhiro Inaba","submitted_at":"2015-12-27T03:55:18Z","abstract_excerpt":"Given a finite alphabet $\\Sigma$ and a deterministic finite automaton on $\\Sigma$, the problem of determining whether the language recognized by the automaton contains any pangram is \\NP-complete. Various other language classes and problems around pangrams are analyzed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08168","kind":"arxiv","version":5},"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":"1512.08168","created_at":"2026-05-18T01:20:58.715662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08168v5","created_at":"2026-05-18T01:20:58.715662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08168","created_at":"2026-05-18T01:20:58.715662+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TFJVZMFJKGH","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TFJVZMFJKGHTT2K","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TFJVZMF","created_at":"2026-05-18T12:29:07.941421+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/5TFJVZMFJKGHTT2KJHHZXPQZKE","json":"https://pith.science/pith/5TFJVZMFJKGHTT2KJHHZXPQZKE.json","graph_json":"https://pith.science/api/pith-number/5TFJVZMFJKGHTT2KJHHZXPQZKE/graph.json","events_json":"https://pith.science/api/pith-number/5TFJVZMFJKGHTT2KJHHZXPQZKE/events.json","paper":"https://pith.science/paper/5TFJVZMF"},"agent_actions":{"view_html":"https://pith.science/pith/5TFJVZMFJKGHTT2KJHHZXPQZKE","download_json":"https://pith.science/pith/5TFJVZMFJKGHTT2KJHHZXPQZKE.json","view_paper":"https://pith.science/paper/5TFJVZMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08168&json=true","fetch_graph":"https://pith.science/api/pith-number/5TFJVZMFJKGHTT2KJHHZXPQZKE/graph.json","fetch_events":"https://pith.science/api/pith-number/5TFJVZMFJKGHTT2KJHHZXPQZKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TFJVZMFJKGHTT2KJHHZXPQZKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TFJVZMFJKGHTT2KJHHZXPQZKE/action/storage_attestation","attest_author":"https://pith.science/pith/5TFJVZMFJKGHTT2KJHHZXPQZKE/action/author_attestation","sign_citation":"https://pith.science/pith/5TFJVZMFJKGHTT2KJHHZXPQZKE/action/citation_signature","submit_replication":"https://pith.science/pith/5TFJVZMFJKGHTT2KJHHZXPQZKE/action/replication_record"}},"created_at":"2026-05-18T01:20:58.715662+00:00","updated_at":"2026-05-18T01:20:58.715662+00:00"}