{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:CMOLK5YSUM6ZS36WNYGMIFEBOA","short_pith_number":"pith:CMOLK5YS","canonical_record":{"source":{"id":"cs/0306046","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2003-06-11T09:13:39Z","cross_cats_sorted":[],"title_canon_sha256":"44a659400c7094a657862a17705d6760c81f697fd8b473f8846bf2652b1c1375","abstract_canon_sha256":"e9b1b82c1cfa67bfde0ea30e3f9a5160242b280c530333c527f4c54d5aa4f9b9"},"schema_version":"1.0"},"canonical_sha256":"131cb57712a33d996fd66e0cc41481701c18796d93c56fa7cdc45f1c0e4c339d","source":{"kind":"arxiv","id":"cs/0306046","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0306046","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0306046v1","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0306046","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"CMOLK5YSUM6Z","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"pith_short_16","alias_value":"CMOLK5YSUM6ZS36W","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"pith_short_8","alias_value":"CMOLK5YS","created_at":"2026-07-04T14:24:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:CMOLK5YSUM6ZS36WNYGMIFEBOA","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0306046","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2003-06-11T09:13:39Z","cross_cats_sorted":[],"title_canon_sha256":"44a659400c7094a657862a17705d6760c81f697fd8b473f8846bf2652b1c1375","abstract_canon_sha256":"e9b1b82c1cfa67bfde0ea30e3f9a5160242b280c530333c527f4c54d5aa4f9b9"},"schema_version":"1.0"},"canonical_sha256":"131cb57712a33d996fd66e0cc41481701c18796d93c56fa7cdc45f1c0e4c339d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:33.199342Z","signature_b64":"CoEJ4GvAWk5Tob62rV9aa5ONCiDDkDlXkdFTQIAZGcW/m8DJgP0vHOFLtnN7s7Ony+yEkgdcgVjkij/8q3D9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"131cb57712a33d996fd66e0cc41481701c18796d93c56fa7cdc45f1c0e4c339d","last_reissued_at":"2026-07-04T14:24:33.198978Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:33.198978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0306046","source_version":1,"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-07-04T14:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InsbIx30djZ1Iv31ukXGpI3QajYEVb913+mln1iTlnsCnPXWO2hmRlGTPKzNt012urdc5oXK9XUkhkduzmPgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:25:00.684351Z"},"content_sha256":"33326c4b125f7f86e73b7a3c306ba7e1ffc30a034529ff3c00f8d5b0eb4c3859","schema_version":"1.0","event_id":"sha256:33326c4b125f7f86e73b7a3c306ba7e1ffc30a034529ff3c00f8d5b0eb4c3859"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:CMOLK5YSUM6ZS36WNYGMIFEBOA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Paolo Boldi, Sebastiano Vigna","submitted_at":"2003-06-11T09:13:39Z","abstract_excerpt":"We propose a very simple randomised data structure that stores an approximation from above of a lattice-valued function. Computing the function value requires a constant number of steps, and the error probability can be balanced with space usage, much like in Bloom filters. The structure is particularly well suited for functions that are bottom on most of their domain. We then show how to use our methods to store in a compact way the bad-character shift function for variants of the Boyer-Moore text search algorithms. As a result, we obtain practical implementations of these algorithms that can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0306046","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0306046/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RavRWzFDT5nJ4GvQTeunoAfq+NwQocMgJsjQtlGnAbWCGUmIg8We22DNGIPuytaS+M3dIqA0gcovlkA5RgzNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T10:25:00.684917Z"},"content_sha256":"e41d05a350f85a9db9ecaf3d9412e08a279aa5f07ebcb944d1457d5924b4ac5e","schema_version":"1.0","event_id":"sha256:e41d05a350f85a9db9ecaf3d9412e08a279aa5f07ebcb944d1457d5924b4ac5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMOLK5YSUM6ZS36WNYGMIFEBOA/bundle.json","state_url":"https://pith.science/pith/CMOLK5YSUM6ZS36WNYGMIFEBOA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMOLK5YSUM6ZS36WNYGMIFEBOA/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-08-23T10:25:00Z","links":{"resolver":"https://pith.science/pith/CMOLK5YSUM6ZS36WNYGMIFEBOA","bundle":"https://pith.science/pith/CMOLK5YSUM6ZS36WNYGMIFEBOA/bundle.json","state":"https://pith.science/pith/CMOLK5YSUM6ZS36WNYGMIFEBOA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMOLK5YSUM6ZS36WNYGMIFEBOA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:CMOLK5YSUM6ZS36WNYGMIFEBOA","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":"e9b1b82c1cfa67bfde0ea30e3f9a5160242b280c530333c527f4c54d5aa4f9b9","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2003-06-11T09:13:39Z","title_canon_sha256":"44a659400c7094a657862a17705d6760c81f697fd8b473f8846bf2652b1c1375"},"schema_version":"1.0","source":{"id":"cs/0306046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0306046","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0306046v1","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0306046","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"CMOLK5YSUM6Z","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"pith_short_16","alias_value":"CMOLK5YSUM6ZS36W","created_at":"2026-07-04T14:24:33Z"},{"alias_kind":"pith_short_8","alias_value":"CMOLK5YS","created_at":"2026-07-04T14:24:33Z"}],"graph_snapshots":[{"event_id":"sha256:e41d05a350f85a9db9ecaf3d9412e08a279aa5f07ebcb944d1457d5924b4ac5e","target":"graph","created_at":"2026-07-04T14:24:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0306046/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a very simple randomised data structure that stores an approximation from above of a lattice-valued function. Computing the function value requires a constant number of steps, and the error probability can be balanced with space usage, much like in Bloom filters. The structure is particularly well suited for functions that are bottom on most of their domain. We then show how to use our methods to store in a compact way the bad-character shift function for variants of the Boyer-Moore text search algorithms. As a result, we obtain practical implementations of these algorithms that can","authors_text":"Paolo Boldi, Sebastiano Vigna","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2003-06-11T09:13:39Z","title":"Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0306046","kind":"arxiv","version":1},"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:33326c4b125f7f86e73b7a3c306ba7e1ffc30a034529ff3c00f8d5b0eb4c3859","target":"record","created_at":"2026-07-04T14:24:33Z","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":"e9b1b82c1cfa67bfde0ea30e3f9a5160242b280c530333c527f4c54d5aa4f9b9","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2003-06-11T09:13:39Z","title_canon_sha256":"44a659400c7094a657862a17705d6760c81f697fd8b473f8846bf2652b1c1375"},"schema_version":"1.0","source":{"id":"cs/0306046","kind":"arxiv","version":1}},"canonical_sha256":"131cb57712a33d996fd66e0cc41481701c18796d93c56fa7cdc45f1c0e4c339d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"131cb57712a33d996fd66e0cc41481701c18796d93c56fa7cdc45f1c0e4c339d","first_computed_at":"2026-07-04T14:24:33.198978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:33.198978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CoEJ4GvAWk5Tob62rV9aa5ONCiDDkDlXkdFTQIAZGcW/m8DJgP0vHOFLtnN7s7Ony+yEkgdcgVjkij/8q3D9Cg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:33.199342Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0306046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33326c4b125f7f86e73b7a3c306ba7e1ffc30a034529ff3c00f8d5b0eb4c3859","sha256:e41d05a350f85a9db9ecaf3d9412e08a279aa5f07ebcb944d1457d5924b4ac5e"],"state_sha256":"2032ade1214543848b628baaea6ee283acaf27fb3f0022aee432f20322e32d0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zu5Xfh8zR+ZZLFPus8I4PnUMUQPnLEcH5Dj04SpIZyt36QMjZWkpLRUhZE/84KvRNQMC5xtTyGVgdXmqmrjDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T10:25:00.688928Z","bundle_sha256":"7b79ab33bcb0acffb0fe329033b8db36a25a23e6d6b74dd837efe3bd9a3468ab"}}