{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:U3OSWYIAX64GTUZ6BEBEMV5PUY","short_pith_number":"pith:U3OSWYIA","canonical_record":{"source":{"id":"1705.10382","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-29T20:24:07Z","cross_cats_sorted":[],"title_canon_sha256":"1bd51b79d383ae0f71a8a81564287e0c99593c5873983e8103511fcbaa5a4d93","abstract_canon_sha256":"b5f134394fc271313d42e18fe2b4e334c4f6da72707eb8503cc65e18bc939c17"},"schema_version":"1.0"},"canonical_sha256":"a6dd2b6100bfb869d33e09024657afa632fb529011163fd5fe83ed022911c1af","source":{"kind":"arxiv","id":"1705.10382","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10382","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10382v4","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10382","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"U3OSWYIAX64G","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U3OSWYIAX64GTUZ6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U3OSWYIA","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:U3OSWYIAX64GTUZ6BEBEMV5PUY","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10382","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-29T20:24:07Z","cross_cats_sorted":[],"title_canon_sha256":"1bd51b79d383ae0f71a8a81564287e0c99593c5873983e8103511fcbaa5a4d93","abstract_canon_sha256":"b5f134394fc271313d42e18fe2b4e334c4f6da72707eb8503cc65e18bc939c17"},"schema_version":"1.0"},"canonical_sha256":"a6dd2b6100bfb869d33e09024657afa632fb529011163fd5fe83ed022911c1af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:28.320867Z","signature_b64":"uIyMeovGki/DJQsTk5+/YeXTA0gEFKAKVfLCZxkqK8/ySYNzb9mIpDdBzlSUCaRRuYP8EZWzFIgHDrtBydLqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6dd2b6100bfb869d33e09024657afa632fb529011163fd5fe83ed022911c1af","last_reissued_at":"2026-05-18T00:40:28.320279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:28.320279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10382","source_version":4,"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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"np4D3nnJzkhhie/uugRTJvfidPpEMFm8GSsdkp/lR9xT5BeqNSUwG/NYhKJVPx04snnuKOST+eqY44A/RXkKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:28:53.760459Z"},"content_sha256":"16a7b34c2828f5124f5e2dfa0cf9340bdb756cd58828cfd49d74421cfd022b0b","schema_version":"1.0","event_id":"sha256:16a7b34c2828f5124f5e2dfa0cf9340bdb756cd58828cfd49d74421cfd022b0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:U3OSWYIAX64GTUZ6BEBEMV5PUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal-Time Text Indexing in BWT-runs Bounded Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Nicola Prezza, Travis Gagie","submitted_at":"2017-05-29T20:24:07Z","abstract_excerpt":"Indexing highly repetitive texts --- such as genomic databases, software repositories and versioned text collections --- has become an important problem since the turn of the millennium. A relevant compressibility measure for repetitive texts is $r$, the number of runs in their Burrows-Wheeler Transform (BWT). One of the earliest indexes for repetitive collections, the Run-Length FM-index, used $O(r)$ space and was able to efficiently count the number of occurrences of a pattern of length $m$ in the text (in loglogarithmic time per pattern symbol, with current techniques). However, it was unab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10382","kind":"arxiv","version":4},"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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6nJM41986mV1G5AQXjuZrDl0Gb4RE082KCbIn3Pl4GDpk/a34+JVh08x/QR0qtkntDoTvbtO+MlwGJQgMBkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:28:53.760813Z"},"content_sha256":"5f0e429463444dccf53efbf625b648d5ce69115e1dde933217c552cc585b70a2","schema_version":"1.0","event_id":"sha256:5f0e429463444dccf53efbf625b648d5ce69115e1dde933217c552cc585b70a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/bundle.json","state_url":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/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-27T00:28:53Z","links":{"resolver":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY","bundle":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/bundle.json","state":"https://pith.science/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3OSWYIAX64GTUZ6BEBEMV5PUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:U3OSWYIAX64GTUZ6BEBEMV5PUY","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":"b5f134394fc271313d42e18fe2b4e334c4f6da72707eb8503cc65e18bc939c17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-29T20:24:07Z","title_canon_sha256":"1bd51b79d383ae0f71a8a81564287e0c99593c5873983e8103511fcbaa5a4d93"},"schema_version":"1.0","source":{"id":"1705.10382","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10382","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10382v4","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10382","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"U3OSWYIAX64G","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U3OSWYIAX64GTUZ6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U3OSWYIA","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:5f0e429463444dccf53efbf625b648d5ce69115e1dde933217c552cc585b70a2","target":"graph","created_at":"2026-05-18T00:40:28Z","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":"Indexing highly repetitive texts --- such as genomic databases, software repositories and versioned text collections --- has become an important problem since the turn of the millennium. A relevant compressibility measure for repetitive texts is $r$, the number of runs in their Burrows-Wheeler Transform (BWT). One of the earliest indexes for repetitive collections, the Run-Length FM-index, used $O(r)$ space and was able to efficiently count the number of occurrences of a pattern of length $m$ in the text (in loglogarithmic time per pattern symbol, with current techniques). However, it was unab","authors_text":"Gonzalo Navarro, Nicola Prezza, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-29T20:24:07Z","title":"Optimal-Time Text Indexing in BWT-runs Bounded Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10382","kind":"arxiv","version":4},"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:16a7b34c2828f5124f5e2dfa0cf9340bdb756cd58828cfd49d74421cfd022b0b","target":"record","created_at":"2026-05-18T00:40:28Z","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":"b5f134394fc271313d42e18fe2b4e334c4f6da72707eb8503cc65e18bc939c17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-29T20:24:07Z","title_canon_sha256":"1bd51b79d383ae0f71a8a81564287e0c99593c5873983e8103511fcbaa5a4d93"},"schema_version":"1.0","source":{"id":"1705.10382","kind":"arxiv","version":4}},"canonical_sha256":"a6dd2b6100bfb869d33e09024657afa632fb529011163fd5fe83ed022911c1af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6dd2b6100bfb869d33e09024657afa632fb529011163fd5fe83ed022911c1af","first_computed_at":"2026-05-18T00:40:28.320279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:28.320279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uIyMeovGki/DJQsTk5+/YeXTA0gEFKAKVfLCZxkqK8/ySYNzb9mIpDdBzlSUCaRRuYP8EZWzFIgHDrtBydLqDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:28.320867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10382","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16a7b34c2828f5124f5e2dfa0cf9340bdb756cd58828cfd49d74421cfd022b0b","sha256:5f0e429463444dccf53efbf625b648d5ce69115e1dde933217c552cc585b70a2"],"state_sha256":"593e14b73c5c934f02aa9e65b6fd1d70d73b41917b45fa8dd2c949de44b65b85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0MjvQKBE9c+CvxhVWQFiokb9Feujk6qK1pdHLmDxg9IONZ+aJP/Xt5+66Zk/sWJETpp8AAY6DMLzwlfRJWJBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:28:53.763490Z","bundle_sha256":"04643c4ce7975834ad95f136ee1a60333a853c95d0d90549267b2a772a329c47"}}