{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AG3D33M25TU7OPHFBBFMXFLYL2","short_pith_number":"pith:AG3D33M2","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"},"canonical_sha256":"01b63ded9aece9f73ce5084acb95785ea22489662cef6d36d6934cf16e2d0123","source":{"kind":"arxiv","id":"1712.09738","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09738","created_at":"2026-05-18T00:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09738v2","created_at":"2026-05-18T00:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09738","created_at":"2026-05-18T00:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"AG3D33M25TU7","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AG3D33M25TU7OPHF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AG3D33M2","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AG3D33M25TU7OPHFBBFMXFLYL2","target":"record","payload":{"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"},"canonical_sha256":"01b63ded9aece9f73ce5084acb95785ea22489662cef6d36d6934cf16e2d0123","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"},"source_kind":"arxiv","source_id":"1712.09738","source_version":2,"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-18T00:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dk6I2XslTMC75AnjXQl1FLbZGuj4x4MNLkEG68DJh+f+K/ahu/vwl0k38+1f7EWj0+/Jl9OkoQQUGvvw+x50Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:25:59.728845Z"},"content_sha256":"85c0a553f93648ca28ed3ee38d45087e03dffc9679dfaad74d0bf60c2127ee7b","schema_version":"1.0","event_id":"sha256:85c0a553f93648ca28ed3ee38d45087e03dffc9679dfaad74d0bf60c2127ee7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AG3D33M25TU7OPHFBBFMXFLYL2","target":"graph","payload":{"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"},"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-18T00:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6wWtheyRyI1paVAqhoGXJedtmfThOIjdVfO6cqP1ZEeZq42AjpipwplWTf7SHqC5RAPmCgRQmA1yDWC9hsvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:25:59.729494Z"},"content_sha256":"154dfb4826da6719adc49274d52a15bfe796ac68d3093c44f9bdeabd62668c57","schema_version":"1.0","event_id":"sha256:154dfb4826da6719adc49274d52a15bfe796ac68d3093c44f9bdeabd62668c57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2/bundle.json","state_url":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AG3D33M25TU7OPHFBBFMXFLYL2/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-06T00:25:59Z","links":{"resolver":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2","bundle":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2/bundle.json","state":"https://pith.science/pith/AG3D33M25TU7OPHFBBFMXFLYL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AG3D33M25TU7OPHFBBFMXFLYL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AG3D33M25TU7OPHFBBFMXFLYL2","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":"45d62a8e8e573b864008025cde626823bf0321d08591bb773a1bc3175b4b9331","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-28T02:17:49Z","title_canon_sha256":"663cbb4fa180d9fd2b0415deb34a28033df797d97d82754e96f66c9f7acc4837"},"schema_version":"1.0","source":{"id":"1712.09738","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09738","created_at":"2026-05-18T00:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09738v2","created_at":"2026-05-18T00:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09738","created_at":"2026-05-18T00:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"AG3D33M25TU7","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AG3D33M25TU7OPHF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AG3D33M2","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:154dfb4826da6719adc49274d52a15bfe796ac68d3093c44f9bdeabd62668c57","target":"graph","created_at":"2026-05-18T00:12:09Z","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":"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","authors_text":"Neng Huang, Xiaoming Sun, Xiaoyu He","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-28T02:17:49Z","title":"On the Decision Tree Complexity of String Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09738","kind":"arxiv","version":2},"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:85c0a553f93648ca28ed3ee38d45087e03dffc9679dfaad74d0bf60c2127ee7b","target":"record","created_at":"2026-05-18T00:12:09Z","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":"45d62a8e8e573b864008025cde626823bf0321d08591bb773a1bc3175b4b9331","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-28T02:17:49Z","title_canon_sha256":"663cbb4fa180d9fd2b0415deb34a28033df797d97d82754e96f66c9f7acc4837"},"schema_version":"1.0","source":{"id":"1712.09738","kind":"arxiv","version":2}},"canonical_sha256":"01b63ded9aece9f73ce5084acb95785ea22489662cef6d36d6934cf16e2d0123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01b63ded9aece9f73ce5084acb95785ea22489662cef6d36d6934cf16e2d0123","first_computed_at":"2026-05-18T00:12:09.007216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:09.007216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4nrD00/6k03LzAVr0QHuhnByKVydKha7rTh6gxK9fZ+U3cvBu5dNQMnMsPd0ilgJ3ipswEf/RndL26zOVVQzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:09.007702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09738","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85c0a553f93648ca28ed3ee38d45087e03dffc9679dfaad74d0bf60c2127ee7b","sha256:154dfb4826da6719adc49274d52a15bfe796ac68d3093c44f9bdeabd62668c57"],"state_sha256":"01a60aa0f21493972ec330111109f2c11313cfa45fa97862237961c7ed3f0197"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hWnVgzkAapKmurCYfJVtyHFoBLGOXNTJ6Lm3vom10N7RktzkEi5tNPePpQ377FfOxhax+9U7krSkDE/2UGWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:25:59.733449Z","bundle_sha256":"37da1e7056c77d84853408536ad04fa4d2e323b3d9b1d44e44a146ecf605b9fb"}}