{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MDN7CP3DCDJEI53PZU6N6RDR24","short_pith_number":"pith:MDN7CP3D","canonical_record":{"source":{"id":"1110.5236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-24T13:57:08Z","cross_cats_sorted":[],"title_canon_sha256":"e356a3d902b7ba9d1e72e9a9ed7fca28d1f6cdd1f3aee9d33267ea0fd64bb8c4","abstract_canon_sha256":"3f7098e21c3b8df901fa7d552eb1b3f7ad137eacb751410d1949b1f648b16716"},"schema_version":"1.0"},"canonical_sha256":"60dbf13f6310d244776fcd3cdf4471d719f567435eb2899ebd5c385700a05225","source":{"kind":"arxiv","id":"1110.5236","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5236","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5236v2","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5236","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"MDN7CP3DCDJE","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MDN7CP3DCDJEI53P","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MDN7CP3D","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MDN7CP3DCDJEI53PZU6N6RDR24","target":"record","payload":{"canonical_record":{"source":{"id":"1110.5236","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-24T13:57:08Z","cross_cats_sorted":[],"title_canon_sha256":"e356a3d902b7ba9d1e72e9a9ed7fca28d1f6cdd1f3aee9d33267ea0fd64bb8c4","abstract_canon_sha256":"3f7098e21c3b8df901fa7d552eb1b3f7ad137eacb751410d1949b1f648b16716"},"schema_version":"1.0"},"canonical_sha256":"60dbf13f6310d244776fcd3cdf4471d719f567435eb2899ebd5c385700a05225","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:15.254306Z","signature_b64":"9ScvL0OxJulgwJuZLUf+rOXH9E0MPnehfN0pG2G4ose+WTBeZfzc25BCVFuGFFe5P5upQfxBAxtTq8rkj24ECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60dbf13f6310d244776fcd3cdf4471d719f567435eb2899ebd5c385700a05225","last_reissued_at":"2026-05-18T03:46:15.253670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:15.253670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.5236","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-18T03:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6bGrn25wvmjy8KmJBzUwRVQZrw7KJMkwUVAaNMwkrmaaIYagJt3G5NjrLncwfBSd99OhApmX78MPlXuIfBeMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:25:01.132244Z"},"content_sha256":"bac58fd10a471c230e178cdfc60fcc5b73cc294692efbadd2182a07957396487","schema_version":"1.0","event_id":"sha256:bac58fd10a471c230e178cdfc60fcc5b73cc294692efbadd2182a07957396487"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MDN7CP3DCDJEI53PZU6N6RDR24","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"String Indexing for Patterns with Wildcards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hjalte Wedel Vildh{\\o}j, Inge Li Goertz, Philip Bille, S{\\o}ren Vind","submitted_at":"2011-10-24T13:57:08Z","abstract_excerpt":"We consider the problem of indexing a string $t$ of length $n$ to report the occurrences of a query pattern $p$ containing $m$ characters and $j$ wildcards. Let $occ$ be the number of occurrences of $p$ in $t$, and $\\sigma$ the size of the alphabet. We obtain the following results.\n  - A linear space index with query time $O(m+\\sigma^j \\log \\log n + occ)$. This significantly improves the previously best known linear space index by Lam et al. [ISAAC 2007], which requires query time $\\Theta(jn)$ in the worst case.\n  - An index with query time $O(m+j+occ)$ using space $O(\\sigma^{k^2} n \\log^k \\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5236","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-18T03:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9SRkZBC2tOx3QDoFQF2uQHYnjkfZrGbNkhNLAoICH5QaCHKKs/I5JXd9BDMPQiIzjHTdMKh4w3XjPCCbA5ZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:25:01.132941Z"},"content_sha256":"ca78e091c804ecd7bb15fa786ab112e2ca6809c42d59c90c55b1dca7b82eaf35","schema_version":"1.0","event_id":"sha256:ca78e091c804ecd7bb15fa786ab112e2ca6809c42d59c90c55b1dca7b82eaf35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDN7CP3DCDJEI53PZU6N6RDR24/bundle.json","state_url":"https://pith.science/pith/MDN7CP3DCDJEI53PZU6N6RDR24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDN7CP3DCDJEI53PZU6N6RDR24/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-05-27T13:25:01Z","links":{"resolver":"https://pith.science/pith/MDN7CP3DCDJEI53PZU6N6RDR24","bundle":"https://pith.science/pith/MDN7CP3DCDJEI53PZU6N6RDR24/bundle.json","state":"https://pith.science/pith/MDN7CP3DCDJEI53PZU6N6RDR24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDN7CP3DCDJEI53PZU6N6RDR24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MDN7CP3DCDJEI53PZU6N6RDR24","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":"3f7098e21c3b8df901fa7d552eb1b3f7ad137eacb751410d1949b1f648b16716","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-24T13:57:08Z","title_canon_sha256":"e356a3d902b7ba9d1e72e9a9ed7fca28d1f6cdd1f3aee9d33267ea0fd64bb8c4"},"schema_version":"1.0","source":{"id":"1110.5236","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5236","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5236v2","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5236","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"MDN7CP3DCDJE","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MDN7CP3DCDJEI53P","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MDN7CP3D","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:ca78e091c804ecd7bb15fa786ab112e2ca6809c42d59c90c55b1dca7b82eaf35","target":"graph","created_at":"2026-05-18T03:46:15Z","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 consider the problem of indexing a string $t$ of length $n$ to report the occurrences of a query pattern $p$ containing $m$ characters and $j$ wildcards. Let $occ$ be the number of occurrences of $p$ in $t$, and $\\sigma$ the size of the alphabet. We obtain the following results.\n  - A linear space index with query time $O(m+\\sigma^j \\log \\log n + occ)$. This significantly improves the previously best known linear space index by Lam et al. [ISAAC 2007], which requires query time $\\Theta(jn)$ in the worst case.\n  - An index with query time $O(m+j+occ)$ using space $O(\\sigma^{k^2} n \\log^k \\lo","authors_text":"Hjalte Wedel Vildh{\\o}j, Inge Li Goertz, Philip Bille, S{\\o}ren Vind","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-24T13:57:08Z","title":"String Indexing for Patterns with Wildcards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5236","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:bac58fd10a471c230e178cdfc60fcc5b73cc294692efbadd2182a07957396487","target":"record","created_at":"2026-05-18T03:46:15Z","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":"3f7098e21c3b8df901fa7d552eb1b3f7ad137eacb751410d1949b1f648b16716","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-24T13:57:08Z","title_canon_sha256":"e356a3d902b7ba9d1e72e9a9ed7fca28d1f6cdd1f3aee9d33267ea0fd64bb8c4"},"schema_version":"1.0","source":{"id":"1110.5236","kind":"arxiv","version":2}},"canonical_sha256":"60dbf13f6310d244776fcd3cdf4471d719f567435eb2899ebd5c385700a05225","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60dbf13f6310d244776fcd3cdf4471d719f567435eb2899ebd5c385700a05225","first_computed_at":"2026-05-18T03:46:15.253670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:15.253670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ScvL0OxJulgwJuZLUf+rOXH9E0MPnehfN0pG2G4ose+WTBeZfzc25BCVFuGFFe5P5upQfxBAxtTq8rkj24ECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:15.254306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5236","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bac58fd10a471c230e178cdfc60fcc5b73cc294692efbadd2182a07957396487","sha256:ca78e091c804ecd7bb15fa786ab112e2ca6809c42d59c90c55b1dca7b82eaf35"],"state_sha256":"7f97b529af4322f8bb55aa3253b75140c819722d01d32e51ad89c7d028fa5713"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"si6/V/i71cdxkt46s1cjkhEI4KVwhWoiUWhJ756+070Go+72epx/miv8BZDiMJGqO1l0Korj4JYEmd7PA/gFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:25:01.136228Z","bundle_sha256":"1acf1a226f48d92b1dd54432ca5c30a53a6a0d29d817b958d485519a5a12303d"}}