{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AG3D33M25TU7OPHFBBFMXFLYL2","short_pith_number":"pith:AG3D33M2","schema_version":"1.0","canonical_sha256":"01b63ded9aece9f73ce5084acb95785ea22489662cef6d36d6934cf16e2d0123","source":{"kind":"arxiv","id":"1712.09738","version":2},"attestation_state":"computed","paper":{"title":"On the Decision Tree Complexity of String Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Neng Huang, Xiaoming Sun, Xiaoyu He","submitted_at":"2017-12-28T02:17:49Z","abstract_excerpt":"String matching is one of the most fundamental problems in computer science. A natural problem is to determine the number of characters that need to be queried (i.e. the decision tree complexity) in a string in order to decide whether this string contains a certain pattern. Rivest showed that for every pattern $p$, in the worst case any deterministic algorithm needs to query at least $n-|p|+1$ characters, where $n$ is the length of the string and $|p|$ is the length of the pattern. He further conjectured that this bound is tight. By using the adversary method, Tuza disproved this conjecture an"},"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":"1712.09738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-28T02:17:49Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"663cbb4fa180d9fd2b0415deb34a28033df797d97d82754e96f66c9f7acc4837","abstract_canon_sha256":"45d62a8e8e573b864008025cde626823bf0321d08591bb773a1bc3175b4b9331"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:09.007702Z","signature_b64":"4nrD00/6k03LzAVr0QHuhnByKVydKha7rTh6gxK9fZ+U3cvBu5dNQMnMsPd0ilgJ3ipswEf/RndL26zOVVQzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01b63ded9aece9f73ce5084acb95785ea22489662cef6d36d6934cf16e2d0123","last_reissued_at":"2026-05-18T00:12:09.007216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:09.007216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Decision Tree Complexity of String Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Neng Huang, Xiaoming Sun, Xiaoyu He","submitted_at":"2017-12-28T02:17:49Z","abstract_excerpt":"String matching is one of the most fundamental problems in computer science. A natural problem is to determine the number of characters that need to be queried (i.e. the decision tree complexity) in a string in order to decide whether this string contains a certain pattern. Rivest showed that for every pattern $p$, in the worst case any deterministic algorithm needs to query at least $n-|p|+1$ characters, where $n$ is the length of the string and $|p|$ is the length of the pattern. He further conjectured that this bound is tight. By using the adversary method, Tuza disproved this conjecture an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09738","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":"1712.09738","created_at":"2026-05-18T00:12:09.007300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09738v2","created_at":"2026-05-18T00:12:09.007300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09738","created_at":"2026-05-18T00:12:09.007300+00:00"},{"alias_kind":"pith_short_12","alias_value":"AG3D33M25TU7","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AG3D33M25TU7OPHF","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AG3D33M2","created_at":"2026-05-18T12:31:05.417338+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/AG3D33M25TU7OPHFBBFMXFLYL2","json":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2.json","graph_json":"https://pith.science/api/pith-number/AG3D33M25TU7OPHFBBFMXFLYL2/graph.json","events_json":"https://pith.science/api/pith-number/AG3D33M25TU7OPHFBBFMXFLYL2/events.json","paper":"https://pith.science/paper/AG3D33M2"},"agent_actions":{"view_html":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2","download_json":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2.json","view_paper":"https://pith.science/paper/AG3D33M2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09738&json=true","fetch_graph":"https://pith.science/api/pith-number/AG3D33M25TU7OPHFBBFMXFLYL2/graph.json","fetch_events":"https://pith.science/api/pith-number/AG3D33M25TU7OPHFBBFMXFLYL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2/action/storage_attestation","attest_author":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2/action/author_attestation","sign_citation":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2/action/citation_signature","submit_replication":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2/action/replication_record"}},"created_at":"2026-05-18T00:12:09.007300+00:00","updated_at":"2026-05-18T00:12:09.007300+00:00"}