{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5ICUNZISL34SC6DWUTHOCC2DBZ","short_pith_number":"pith:5ICUNZIS","canonical_record":{"source":{"id":"1604.06002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:30:36Z","cross_cats_sorted":[],"title_canon_sha256":"3a771f12a05f5ae69b6ace692fa2f9072dfff282617c0cb6b98c826729e8d147","abstract_canon_sha256":"3088e448de10bd64b494f7a71dd1c1b74573f90a3f4f42f2853d04ef247ee6db"},"schema_version":"1.0"},"canonical_sha256":"ea0546e5125ef9217876a4cee10b430e4d419ef62f5a6a7845bbef5a40490c96","source":{"kind":"arxiv","id":"1604.06002","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06002","created_at":"2026-05-18T01:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06002v2","created_at":"2026-05-18T01:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06002","created_at":"2026-05-18T01:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"5ICUNZISL34S","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5ICUNZISL34SC6DW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5ICUNZIS","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5ICUNZISL34SC6DWUTHOCC2DBZ","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:30:36Z","cross_cats_sorted":[],"title_canon_sha256":"3a771f12a05f5ae69b6ace692fa2f9072dfff282617c0cb6b98c826729e8d147","abstract_canon_sha256":"3088e448de10bd64b494f7a71dd1c1b74573f90a3f4f42f2853d04ef247ee6db"},"schema_version":"1.0"},"canonical_sha256":"ea0546e5125ef9217876a4cee10b430e4d419ef62f5a6a7845bbef5a40490c96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:32.625883Z","signature_b64":"QBHmjcJMVjdxk9+IJNjq62abQsXj1tpQj9v1a56b4uAJK9eVcrc+xhdsQdz/G6MNS+qAIjKAnMDghY9jfwRpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea0546e5125ef9217876a4cee10b430e4d419ef62f5a6a7845bbef5a40490c96","last_reissued_at":"2026-05-18T01:16:32.625281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:32.625281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06002","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-18T01:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/GamX1Oqdsf6hoK6iQKFNGCZB/7JYRhCVvmbZnYuOblzYT3A+8Q/+BEfyyO4vAA2d6ynz3bPeI89+C+u5H8vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:51:03.668557Z"},"content_sha256":"0678dd810e12fbdefd4c37afdc2c9248f3b30e676daa94cd71b49f349409f53c","schema_version":"1.0","event_id":"sha256:0678dd810e12fbdefd4c37afdc2c9248f3b30e676daa94cd71b49f349409f53c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5ICUNZISL34SC6DWUTHOCC2DBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical combinations of repetition-aware data structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Fabio Cunial, Mathieu Raffinot, Nicola Prezza, Travis Gagie","submitted_at":"2016-04-20T15:30:36Z","abstract_excerpt":"Highly-repetitive collections of strings are increasingly being amassed by genome sequencing and genetic variation experiments, as well as by storing all versions of human-generated files, like webpages and source code. Existing indexes for locating all the exact occurrences of a pattern in a highly-repetitive string take advantage of a single measure of repetition. However, multiple, distinct measures of repetition all grow sublinearly in the length of a highly-repetitive string. In this paper we explore the practical advantages of combining data structures whose size depends on distinct meas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06002","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-18T01:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vAm/RcqQVSyb9jCQLa+d7YQKQpMRbCX9TesPmqeCnuTmX7stjlMCb1/klXx3kISq7UfxqXBu2MdajbTmc8YsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:51:03.669172Z"},"content_sha256":"81dee346acf484b1327da23ea65c728876b8c7a4a271f956ebdefe268aba8a46","schema_version":"1.0","event_id":"sha256:81dee346acf484b1327da23ea65c728876b8c7a4a271f956ebdefe268aba8a46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ICUNZISL34SC6DWUTHOCC2DBZ/bundle.json","state_url":"https://pith.science/pith/5ICUNZISL34SC6DWUTHOCC2DBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ICUNZISL34SC6DWUTHOCC2DBZ/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-26T18:51:03Z","links":{"resolver":"https://pith.science/pith/5ICUNZISL34SC6DWUTHOCC2DBZ","bundle":"https://pith.science/pith/5ICUNZISL34SC6DWUTHOCC2DBZ/bundle.json","state":"https://pith.science/pith/5ICUNZISL34SC6DWUTHOCC2DBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ICUNZISL34SC6DWUTHOCC2DBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5ICUNZISL34SC6DWUTHOCC2DBZ","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":"3088e448de10bd64b494f7a71dd1c1b74573f90a3f4f42f2853d04ef247ee6db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:30:36Z","title_canon_sha256":"3a771f12a05f5ae69b6ace692fa2f9072dfff282617c0cb6b98c826729e8d147"},"schema_version":"1.0","source":{"id":"1604.06002","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06002","created_at":"2026-05-18T01:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06002v2","created_at":"2026-05-18T01:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06002","created_at":"2026-05-18T01:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"5ICUNZISL34S","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5ICUNZISL34SC6DW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5ICUNZIS","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:81dee346acf484b1327da23ea65c728876b8c7a4a271f956ebdefe268aba8a46","target":"graph","created_at":"2026-05-18T01:16:32Z","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":"Highly-repetitive collections of strings are increasingly being amassed by genome sequencing and genetic variation experiments, as well as by storing all versions of human-generated files, like webpages and source code. Existing indexes for locating all the exact occurrences of a pattern in a highly-repetitive string take advantage of a single measure of repetition. However, multiple, distinct measures of repetition all grow sublinearly in the length of a highly-repetitive string. In this paper we explore the practical advantages of combining data structures whose size depends on distinct meas","authors_text":"Djamal Belazzougui, Fabio Cunial, Mathieu Raffinot, Nicola Prezza, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:30:36Z","title":"Practical combinations of repetition-aware data structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06002","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:0678dd810e12fbdefd4c37afdc2c9248f3b30e676daa94cd71b49f349409f53c","target":"record","created_at":"2026-05-18T01:16:32Z","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":"3088e448de10bd64b494f7a71dd1c1b74573f90a3f4f42f2853d04ef247ee6db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:30:36Z","title_canon_sha256":"3a771f12a05f5ae69b6ace692fa2f9072dfff282617c0cb6b98c826729e8d147"},"schema_version":"1.0","source":{"id":"1604.06002","kind":"arxiv","version":2}},"canonical_sha256":"ea0546e5125ef9217876a4cee10b430e4d419ef62f5a6a7845bbef5a40490c96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea0546e5125ef9217876a4cee10b430e4d419ef62f5a6a7845bbef5a40490c96","first_computed_at":"2026-05-18T01:16:32.625281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:32.625281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QBHmjcJMVjdxk9+IJNjq62abQsXj1tpQj9v1a56b4uAJK9eVcrc+xhdsQdz/G6MNS+qAIjKAnMDghY9jfwRpAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:32.625883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06002","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0678dd810e12fbdefd4c37afdc2c9248f3b30e676daa94cd71b49f349409f53c","sha256:81dee346acf484b1327da23ea65c728876b8c7a4a271f956ebdefe268aba8a46"],"state_sha256":"92b6470603b420401d917d108f246ce2615d19f7db3bd74225a9e8b5310373ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wz6e6vVUUSM2psFBIvaGhltZSbI/xhJqi2ZPHWU0Fm1xfRiVm6gSNLI+wvWebo7bDkdA19aRtjNVLkdoIy8ACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:51:03.672041Z","bundle_sha256":"6f4159edbd4d587fee3c5ba31baad15754297c05e78f7e227b64eb71db1a8ed5"}}