{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EYPUO6UHUX26VJOTPRHOAM7UGV","short_pith_number":"pith:EYPUO6UH","canonical_record":{"source":{"id":"1501.06663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-27T06:04:35Z","cross_cats_sorted":[],"title_canon_sha256":"9773720ad9d40e5c81bddf60d38d13cda44cc28e9e316fbea1347c97db26f991","abstract_canon_sha256":"7b103a7b091525f6896b41beab942b0174d003ab6102a9c7219f6b5524862721"},"schema_version":"1.0"},"canonical_sha256":"261f477a87a5f5eaa5d37c4ee033f4357a504d28b5e58ae12223fad79646f5c1","source":{"kind":"arxiv","id":"1501.06663","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06663","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06663v1","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06663","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"EYPUO6UHUX26","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EYPUO6UHUX26VJOT","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EYPUO6UH","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EYPUO6UHUX26VJOTPRHOAM7UGV","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-27T06:04:35Z","cross_cats_sorted":[],"title_canon_sha256":"9773720ad9d40e5c81bddf60d38d13cda44cc28e9e316fbea1347c97db26f991","abstract_canon_sha256":"7b103a7b091525f6896b41beab942b0174d003ab6102a9c7219f6b5524862721"},"schema_version":"1.0"},"canonical_sha256":"261f477a87a5f5eaa5d37c4ee033f4357a504d28b5e58ae12223fad79646f5c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:39.417004Z","signature_b64":"sf0bElcD1VXG5hr6U12EofUwTEdD10UUmif/4RvcK8Z8Nl6x/6jHDNndIrtMBXqOHGc4MyNoo56Mfeo9pC5DCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"261f477a87a5f5eaa5d37c4ee033f4357a504d28b5e58ae12223fad79646f5c1","last_reissued_at":"2026-05-18T02:28:39.416453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:39.416453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06663","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-18T02:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bhufO48OLrMDldeq4tOb9x+QlnXe/5O0KBoPPvTWmPl8fRuTaZFcUr5ovVziyMcusioseldDFVTQh5blkJgRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:56:15.569661Z"},"content_sha256":"39d8f7068cea838be575e5df62fb5d3e3097767c3487ce364e420a3c93b68cfb","schema_version":"1.0","event_id":"sha256:39d8f7068cea838be575e5df62fb5d3e3097767c3487ce364e420a3c93b68cfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EYPUO6UHUX26VJOTPRHOAM7UGV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Longest Repeat Queries Using GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bojian Xu, Yun Tian","submitted_at":"2015-01-27T06:04:35Z","abstract_excerpt":"Repeat finding in strings has important applications in subfields such as computational biology. The challenge of finding the longest repeats covering particular string positions was recently proposed and solved by \\.{I}leri et al., using a total of the optimal $O(n)$ time and space, where $n$ is the string size. However, their solution can only find the \\emph{leftmost} longest repeat for each of the $n$ string position. It is also not known how to parallelize their solution. In this paper, we propose a new solution for longest repeat finding, which although is theoretically suboptimal in time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06663","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-18T02:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cabAUyMVSTjQdk/aFYJwVpWqx1klqoExwn3nVj7DACR87q1LKmpxDCX37mkpvpTR8xNHiEyPHdHgRdV+cvZwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:56:15.570013Z"},"content_sha256":"88fde63e8a60c605769c23dbd77bcd2895d468a7a8a04bae5d0c1b832d5d9c69","schema_version":"1.0","event_id":"sha256:88fde63e8a60c605769c23dbd77bcd2895d468a7a8a04bae5d0c1b832d5d9c69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYPUO6UHUX26VJOTPRHOAM7UGV/bundle.json","state_url":"https://pith.science/pith/EYPUO6UHUX26VJOTPRHOAM7UGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYPUO6UHUX26VJOTPRHOAM7UGV/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-06-08T09:56:15Z","links":{"resolver":"https://pith.science/pith/EYPUO6UHUX26VJOTPRHOAM7UGV","bundle":"https://pith.science/pith/EYPUO6UHUX26VJOTPRHOAM7UGV/bundle.json","state":"https://pith.science/pith/EYPUO6UHUX26VJOTPRHOAM7UGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYPUO6UHUX26VJOTPRHOAM7UGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EYPUO6UHUX26VJOTPRHOAM7UGV","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":"7b103a7b091525f6896b41beab942b0174d003ab6102a9c7219f6b5524862721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-27T06:04:35Z","title_canon_sha256":"9773720ad9d40e5c81bddf60d38d13cda44cc28e9e316fbea1347c97db26f991"},"schema_version":"1.0","source":{"id":"1501.06663","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06663","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06663v1","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06663","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"EYPUO6UHUX26","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EYPUO6UHUX26VJOT","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EYPUO6UH","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:88fde63e8a60c605769c23dbd77bcd2895d468a7a8a04bae5d0c1b832d5d9c69","target":"graph","created_at":"2026-05-18T02:28:39Z","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":"Repeat finding in strings has important applications in subfields such as computational biology. The challenge of finding the longest repeats covering particular string positions was recently proposed and solved by \\.{I}leri et al., using a total of the optimal $O(n)$ time and space, where $n$ is the string size. However, their solution can only find the \\emph{leftmost} longest repeat for each of the $n$ string position. It is also not known how to parallelize their solution. In this paper, we propose a new solution for longest repeat finding, which although is theoretically suboptimal in time","authors_text":"Bojian Xu, Yun Tian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-27T06:04:35Z","title":"On Longest Repeat Queries Using GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06663","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:39d8f7068cea838be575e5df62fb5d3e3097767c3487ce364e420a3c93b68cfb","target":"record","created_at":"2026-05-18T02:28:39Z","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":"7b103a7b091525f6896b41beab942b0174d003ab6102a9c7219f6b5524862721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-27T06:04:35Z","title_canon_sha256":"9773720ad9d40e5c81bddf60d38d13cda44cc28e9e316fbea1347c97db26f991"},"schema_version":"1.0","source":{"id":"1501.06663","kind":"arxiv","version":1}},"canonical_sha256":"261f477a87a5f5eaa5d37c4ee033f4357a504d28b5e58ae12223fad79646f5c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"261f477a87a5f5eaa5d37c4ee033f4357a504d28b5e58ae12223fad79646f5c1","first_computed_at":"2026-05-18T02:28:39.416453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:39.416453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sf0bElcD1VXG5hr6U12EofUwTEdD10UUmif/4RvcK8Z8Nl6x/6jHDNndIrtMBXqOHGc4MyNoo56Mfeo9pC5DCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:39.417004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06663","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39d8f7068cea838be575e5df62fb5d3e3097767c3487ce364e420a3c93b68cfb","sha256:88fde63e8a60c605769c23dbd77bcd2895d468a7a8a04bae5d0c1b832d5d9c69"],"state_sha256":"a41f7d1572d78104a010b9842cdd795ee79019a5f8020f9548ed2368aa31390c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFXlg48HNOoZl7iqEtfRGOvQTSD+ivcjbiW6VFfiPpJp8+DNfTiKsw0n7sw7MmW0GOa638M4Dy1cBC0JMQQ1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:56:15.572339Z","bundle_sha256":"7c1ebb3b2b7adbec27fe0d33f8a68631e7f11cdf6cc0d700c5d97da3e6364f26"}}