{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UMBTOHTL63YOKJPGZ3FXONHKBI","short_pith_number":"pith:UMBTOHTL","canonical_record":{"source":{"id":"1004.0902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-06T17:20:03Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"29cd78381a54c8a99b7dab0962f0077ae7b834522b5c0211b1ce007917bfb9c0","abstract_canon_sha256":"135a2b1b7efd48479ee766ec153f5c863cea1944883f06337667d623fc4a2152"},"schema_version":"1.0"},"canonical_sha256":"a303371e6bf6f0e525e6cecb7734ea0a34741a9243accfa2c9eae393b07275a4","source":{"kind":"arxiv","id":"1004.0902","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0902","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0902v2","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0902","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"UMBTOHTL63YO","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UMBTOHTL63YOKJPG","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UMBTOHTL","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UMBTOHTL63YOKJPGZ3FXONHKBI","target":"record","payload":{"canonical_record":{"source":{"id":"1004.0902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-06T17:20:03Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"29cd78381a54c8a99b7dab0962f0077ae7b834522b5c0211b1ce007917bfb9c0","abstract_canon_sha256":"135a2b1b7efd48479ee766ec153f5c863cea1944883f06337667d623fc4a2152"},"schema_version":"1.0"},"canonical_sha256":"a303371e6bf6f0e525e6cecb7734ea0a34741a9243accfa2c9eae393b07275a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:00.608381Z","signature_b64":"4/sEQN04CiGyfb/ALK5VIZQu3YbgasIb2EEqYaatWYeRP5n8Drx9Vv1ML3tjpiFp27bn3KSi3Z9L67SC+eIHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a303371e6bf6f0e525e6cecb7734ea0a34741a9243accfa2c9eae393b07275a4","last_reissued_at":"2026-05-18T04:40:00.607979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:00.607979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.0902","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-18T04:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEVhba8zHAHIZw7YJ6yJl5diaSrkR+yY+j+z4KYz9w69G+gi4wcfSzpVByeZUoqFAi0Z8leJ9GzGdd9c838LAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:17:35.828495Z"},"content_sha256":"a995f44bfaa74bb105fc8e220fafaf8f3b89c11c333e2ab13d4b90652e84a379","schema_version":"1.0","event_id":"sha256:a995f44bfaa74bb105fc8e220fafaf8f3b89c11c333e2ab13d4b90652e84a379"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UMBTOHTL63YOKJPGZ3FXONHKBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On building minimal automaton for subset matching queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.FL","authors_text":"Kimmo Fredriksson","submitted_at":"2010-04-06T17:20:03Z","abstract_excerpt":"We address the problem of building an index for a set $D$ of $n$ strings, where each string location is a subset of some finite integer alphabet of size $\\sigma$, so that we can answer efficiently if a given simple query string (where each string location is a single symbol) $p$ occurs in the set. That is, we need to efficiently find a string $d \\in D$ such that $p[i] \\in d[i]$ for every $i$. We show how to build such index in $O(n^{\\log_{\\sigma/\\Delta}(\\sigma)}\\log(n))$ average time, where $\\Delta$ is the average size of the subsets. Our methods have applications e.g.\\ in computational biolog"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0902","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-18T04:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JsDm8gx0cb+A5J+Esk8zV2JeZv/auuRnCnyg1R/bfE+LyXllNjuAeZyMArbBwSrk4wJDWlhfV10PTnhbvZVZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:17:35.829158Z"},"content_sha256":"2ba7ad7d8456d0001a13bf0b21d19da932c6eaa2cfe081bb10d0c0441b4bf187","schema_version":"1.0","event_id":"sha256:2ba7ad7d8456d0001a13bf0b21d19da932c6eaa2cfe081bb10d0c0441b4bf187"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMBTOHTL63YOKJPGZ3FXONHKBI/bundle.json","state_url":"https://pith.science/pith/UMBTOHTL63YOKJPGZ3FXONHKBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMBTOHTL63YOKJPGZ3FXONHKBI/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-01T00:17:35Z","links":{"resolver":"https://pith.science/pith/UMBTOHTL63YOKJPGZ3FXONHKBI","bundle":"https://pith.science/pith/UMBTOHTL63YOKJPGZ3FXONHKBI/bundle.json","state":"https://pith.science/pith/UMBTOHTL63YOKJPGZ3FXONHKBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMBTOHTL63YOKJPGZ3FXONHKBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UMBTOHTL63YOKJPGZ3FXONHKBI","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":"135a2b1b7efd48479ee766ec153f5c863cea1944883f06337667d623fc4a2152","cross_cats_sorted":["cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-06T17:20:03Z","title_canon_sha256":"29cd78381a54c8a99b7dab0962f0077ae7b834522b5c0211b1ce007917bfb9c0"},"schema_version":"1.0","source":{"id":"1004.0902","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0902","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0902v2","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0902","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"UMBTOHTL63YO","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UMBTOHTL63YOKJPG","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UMBTOHTL","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:2ba7ad7d8456d0001a13bf0b21d19da932c6eaa2cfe081bb10d0c0441b4bf187","target":"graph","created_at":"2026-05-18T04:40:00Z","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 address the problem of building an index for a set $D$ of $n$ strings, where each string location is a subset of some finite integer alphabet of size $\\sigma$, so that we can answer efficiently if a given simple query string (where each string location is a single symbol) $p$ occurs in the set. That is, we need to efficiently find a string $d \\in D$ such that $p[i] \\in d[i]$ for every $i$. We show how to build such index in $O(n^{\\log_{\\sigma/\\Delta}(\\sigma)}\\log(n))$ average time, where $\\Delta$ is the average size of the subsets. Our methods have applications e.g.\\ in computational biolog","authors_text":"Kimmo Fredriksson","cross_cats":["cs.DS","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-06T17:20:03Z","title":"On building minimal automaton for subset matching queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0902","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:a995f44bfaa74bb105fc8e220fafaf8f3b89c11c333e2ab13d4b90652e84a379","target":"record","created_at":"2026-05-18T04:40:00Z","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":"135a2b1b7efd48479ee766ec153f5c863cea1944883f06337667d623fc4a2152","cross_cats_sorted":["cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-06T17:20:03Z","title_canon_sha256":"29cd78381a54c8a99b7dab0962f0077ae7b834522b5c0211b1ce007917bfb9c0"},"schema_version":"1.0","source":{"id":"1004.0902","kind":"arxiv","version":2}},"canonical_sha256":"a303371e6bf6f0e525e6cecb7734ea0a34741a9243accfa2c9eae393b07275a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a303371e6bf6f0e525e6cecb7734ea0a34741a9243accfa2c9eae393b07275a4","first_computed_at":"2026-05-18T04:40:00.607979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:00.607979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4/sEQN04CiGyfb/ALK5VIZQu3YbgasIb2EEqYaatWYeRP5n8Drx9Vv1ML3tjpiFp27bn3KSi3Z9L67SC+eIHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:00.608381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0902","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a995f44bfaa74bb105fc8e220fafaf8f3b89c11c333e2ab13d4b90652e84a379","sha256:2ba7ad7d8456d0001a13bf0b21d19da932c6eaa2cfe081bb10d0c0441b4bf187"],"state_sha256":"675b4d5cc09c6fe5df5261da34b175cacb8ebd97a61b8a38e0d526cdcdba571e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qC9vAg+KthyHuH8vfPlOxCoAHciaCGmoTD30F7iiAKE1SfUmcOpH8Nf9FaJEXiwMAKebcjDGy2u2MHTZ1Hp7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:17:35.832016Z","bundle_sha256":"2d7ef3babdbcfdd785cdf646220e6eca08ecc569dfbebbaf0223bbb9afb04837"}}