{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5IRNULHW5OHKS4AVMZK35TFRBH","short_pith_number":"pith:5IRNULHW","canonical_record":{"source":{"id":"1303.6481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-26T13:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"d5cc83d3afffa57971c5064b6a5e01d2eb6949893775ab6c632c5427873ef92c","abstract_canon_sha256":"2026cb9e1c6b856c271bbf8e16088f8b0de7b4eb190705aa5a678c782b643ed8"},"schema_version":"1.0"},"canonical_sha256":"ea22da2cf6eb8ea970156655beccb109ec8d8df6c02bd27bb4002b53e088115f","source":{"kind":"arxiv","id":"1303.6481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6481","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6481v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6481","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"5IRNULHW5OHK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5IRNULHW5OHKS4AV","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5IRNULHW","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5IRNULHW5OHKS4AVMZK35TFRBH","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-26T13:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"d5cc83d3afffa57971c5064b6a5e01d2eb6949893775ab6c632c5427873ef92c","abstract_canon_sha256":"2026cb9e1c6b856c271bbf8e16088f8b0de7b4eb190705aa5a678c782b643ed8"},"schema_version":"1.0"},"canonical_sha256":"ea22da2cf6eb8ea970156655beccb109ec8d8df6c02bd27bb4002b53e088115f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:49.344909Z","signature_b64":"4kTTqy4Yg6XFDTTDFx/o7uWylY2uVUapaXYE9NcojPMZ0i731xzAXqoHgYUhgcREJ7BZuEswmC/8iggLLNd/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea22da2cf6eb8ea970156655beccb109ec8d8df6c02bd27bb4002b53e088115f","last_reissued_at":"2026-05-18T03:29:49.344075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:49.344075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6481","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-05-18T03:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4KC+yw11mUbZ823FuepF66P+fMvI7xFbCJmL8oCnVcMZhUoYZ+0yBQSzb8gFZwTnTAl/HIjUtb6yqIF69bKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:18:42.892568Z"},"content_sha256":"64afdab235a0a5ac7838a4defb94271fef9a4aecbaf0ee44d39256af760b43f4","schema_version":"1.0","event_id":"sha256:64afdab235a0a5ac7838a4defb94271fef9a4aecbaf0ee44d39256af760b43f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5IRNULHW5OHKS4AVMZK35TFRBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alistair Moffat, Andrew Turpin, Anthony Wirth, J. Shane Culpepper, Simon Gog","submitted_at":"2013-03-26T13:28:31Z","abstract_excerpt":"The suffix array is an efficient data structure for in-memory pattern search. Suffix arrays can also be used for external-memory pattern search, via two-level structures that use an internal index to identify the correct block of suffix pointers. In this paper we describe a new two-level suffix array-based index structure that requires significantly less disk space than previous approaches. Key to the saving is the use of disk blocks that are based on prefixes rather than the more usual uniform-sampling approach, allowing reductions between blocks and subparts of other blocks. We also describe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6481","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":""},"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:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+cPm3/247pBSWdCDMSWU6aYnAHNLthsSSFYCxvkiViHGeed2/syG0cjsfftP1HH3XpQoR8Y9CKrG+vqRbfyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:18:42.892912Z"},"content_sha256":"e124a1d55497229983a26027b7872e10794fc862454ca3e436cc5bb0ac3c3e1e","schema_version":"1.0","event_id":"sha256:e124a1d55497229983a26027b7872e10794fc862454ca3e436cc5bb0ac3c3e1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IRNULHW5OHKS4AVMZK35TFRBH/bundle.json","state_url":"https://pith.science/pith/5IRNULHW5OHKS4AVMZK35TFRBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IRNULHW5OHKS4AVMZK35TFRBH/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-28T01:18:42Z","links":{"resolver":"https://pith.science/pith/5IRNULHW5OHKS4AVMZK35TFRBH","bundle":"https://pith.science/pith/5IRNULHW5OHKS4AVMZK35TFRBH/bundle.json","state":"https://pith.science/pith/5IRNULHW5OHKS4AVMZK35TFRBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IRNULHW5OHKS4AVMZK35TFRBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5IRNULHW5OHKS4AVMZK35TFRBH","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":"2026cb9e1c6b856c271bbf8e16088f8b0de7b4eb190705aa5a678c782b643ed8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-26T13:28:31Z","title_canon_sha256":"d5cc83d3afffa57971c5064b6a5e01d2eb6949893775ab6c632c5427873ef92c"},"schema_version":"1.0","source":{"id":"1303.6481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6481","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6481v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6481","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"5IRNULHW5OHK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5IRNULHW5OHKS4AV","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5IRNULHW","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:e124a1d55497229983a26027b7872e10794fc862454ca3e436cc5bb0ac3c3e1e","target":"graph","created_at":"2026-05-18T03:29:49Z","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":"The suffix array is an efficient data structure for in-memory pattern search. Suffix arrays can also be used for external-memory pattern search, via two-level structures that use an internal index to identify the correct block of suffix pointers. In this paper we describe a new two-level suffix array-based index structure that requires significantly less disk space than previous approaches. Key to the saving is the use of disk blocks that are based on prefixes rather than the more usual uniform-sampling approach, allowing reductions between blocks and subparts of other blocks. We also describe","authors_text":"Alistair Moffat, Andrew Turpin, Anthony Wirth, J. Shane Culpepper, Simon Gog","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-26T13:28:31Z","title":"Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6481","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:64afdab235a0a5ac7838a4defb94271fef9a4aecbaf0ee44d39256af760b43f4","target":"record","created_at":"2026-05-18T03:29:49Z","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":"2026cb9e1c6b856c271bbf8e16088f8b0de7b4eb190705aa5a678c782b643ed8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-26T13:28:31Z","title_canon_sha256":"d5cc83d3afffa57971c5064b6a5e01d2eb6949893775ab6c632c5427873ef92c"},"schema_version":"1.0","source":{"id":"1303.6481","kind":"arxiv","version":1}},"canonical_sha256":"ea22da2cf6eb8ea970156655beccb109ec8d8df6c02bd27bb4002b53e088115f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea22da2cf6eb8ea970156655beccb109ec8d8df6c02bd27bb4002b53e088115f","first_computed_at":"2026-05-18T03:29:49.344075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:49.344075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4kTTqy4Yg6XFDTTDFx/o7uWylY2uVUapaXYE9NcojPMZ0i731xzAXqoHgYUhgcREJ7BZuEswmC/8iggLLNd/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:49.344909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64afdab235a0a5ac7838a4defb94271fef9a4aecbaf0ee44d39256af760b43f4","sha256:e124a1d55497229983a26027b7872e10794fc862454ca3e436cc5bb0ac3c3e1e"],"state_sha256":"21ebf74526d05dc3c1ab690feda30d7522533eef031373211e171b45640c1fc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AO6JsLXTqwRFMz/j2/Jpdahq0PmyL/dRSSbSvs/qW83EgWojRd/pcnddLzC+oVkXlWgc1RqDuYfXQTqkEQwZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:18:42.894981Z","bundle_sha256":"a9e441db391b495d88fce55e6df08e47c9b9649486032a97e7479c5ef71034c7"}}