{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MIIFCC56HXDTRD53FCKUHUEDMN","short_pith_number":"pith:MIIFCC56","canonical_record":{"source":{"id":"1511.02393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-07T20:11:33Z","cross_cats_sorted":[],"title_canon_sha256":"6a2e0ed3a2fb1db747350cb383c2465007e65bf25e000738370161678f898d38","abstract_canon_sha256":"ffc861f6b27cf976b4a203c8bb55bb32c7e250349abe843ac7a2641e46f522f5"},"schema_version":"1.0"},"canonical_sha256":"6210510bbe3dc7388fbb289543d08363477526375b702bea4b04ea4e5bd9c53b","source":{"kind":"arxiv","id":"1511.02393","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02393","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02393v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02393","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"MIIFCC56HXDT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MIIFCC56HXDTRD53","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MIIFCC56","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MIIFCC56HXDTRD53FCKUHUEDMN","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-07T20:11:33Z","cross_cats_sorted":[],"title_canon_sha256":"6a2e0ed3a2fb1db747350cb383c2465007e65bf25e000738370161678f898d38","abstract_canon_sha256":"ffc861f6b27cf976b4a203c8bb55bb32c7e250349abe843ac7a2641e46f522f5"},"schema_version":"1.0"},"canonical_sha256":"6210510bbe3dc7388fbb289543d08363477526375b702bea4b04ea4e5bd9c53b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:30.415570Z","signature_b64":"BSH21qWn7tn2gYbe+9l6t9XmytpHc7gRvtn8n5KnRhpnXrvi8CLKutErNiDEe/JsRuMHRL3lDztKFF+AAhBRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6210510bbe3dc7388fbb289543d08363477526375b702bea4b04ea4e5bd9c53b","last_reissued_at":"2026-05-18T01:27:30.414809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:30.414809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02393","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-18T01:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rld4lQi39DmNUMZHLluyj3TnnTX1tnh5vFpLeUuDwNOrt/J8VyJbjhLq8gKJNQjo2hTSMFD2HZqRootZ/MoqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:32:05.043795Z"},"content_sha256":"bba642a155df2f2215ce06cf947bf731c712578f277320627b9f86b94aa625f5","schema_version":"1.0","event_id":"sha256:bba642a155df2f2215ce06cf947bf731c712578f277320627b9f86b94aa625f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MIIFCC56HXDTRD53FCKUHUEDMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Stabbing Queries for Generalized Longest Repeat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bojian Xu","submitted_at":"2015-11-07T20:11:33Z","abstract_excerpt":"A longest repeat query on a string, motivated by its applications in many subfields including computational biology, asks for the longest repetitive substring(s) covering a particular string position (point query). In this paper, we extend the longest repeat query from point query to \\emph{interval query}, allowing the search for longest repeat(s) covering any position interval, and thus significantly improve the usability of the solution. Our method for interval query takes a different approach using the insight from a recent work on \\emph{shortest unique substrings} [1], as the prior work's "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02393","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-18T01:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+PvJ+X1N0VOBVUN++MwtC0MVPsd6odhztVBcAn3SMCFIehvQsbcDAuTThxINSSIkGVS4XYROzsbDKM0QLjiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:32:05.044137Z"},"content_sha256":"0e39f0565a850a33249790aa04dc28dd1e2df8de1fe4f34638929f8486470efc","schema_version":"1.0","event_id":"sha256:0e39f0565a850a33249790aa04dc28dd1e2df8de1fe4f34638929f8486470efc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN/bundle.json","state_url":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIIFCC56HXDTRD53FCKUHUEDMN/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-26T11:32:05Z","links":{"resolver":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN","bundle":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN/bundle.json","state":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIIFCC56HXDTRD53FCKUHUEDMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MIIFCC56HXDTRD53FCKUHUEDMN","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":"ffc861f6b27cf976b4a203c8bb55bb32c7e250349abe843ac7a2641e46f522f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-07T20:11:33Z","title_canon_sha256":"6a2e0ed3a2fb1db747350cb383c2465007e65bf25e000738370161678f898d38"},"schema_version":"1.0","source":{"id":"1511.02393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02393","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02393v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02393","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"MIIFCC56HXDT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MIIFCC56HXDTRD53","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MIIFCC56","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:0e39f0565a850a33249790aa04dc28dd1e2df8de1fe4f34638929f8486470efc","target":"graph","created_at":"2026-05-18T01:27:30Z","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":"A longest repeat query on a string, motivated by its applications in many subfields including computational biology, asks for the longest repetitive substring(s) covering a particular string position (point query). In this paper, we extend the longest repeat query from point query to \\emph{interval query}, allowing the search for longest repeat(s) covering any position interval, and thus significantly improve the usability of the solution. Our method for interval query takes a different approach using the insight from a recent work on \\emph{shortest unique substrings} [1], as the prior work's ","authors_text":"Bojian Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-07T20:11:33Z","title":"On Stabbing Queries for Generalized Longest Repeat"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02393","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:bba642a155df2f2215ce06cf947bf731c712578f277320627b9f86b94aa625f5","target":"record","created_at":"2026-05-18T01:27:30Z","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":"ffc861f6b27cf976b4a203c8bb55bb32c7e250349abe843ac7a2641e46f522f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-07T20:11:33Z","title_canon_sha256":"6a2e0ed3a2fb1db747350cb383c2465007e65bf25e000738370161678f898d38"},"schema_version":"1.0","source":{"id":"1511.02393","kind":"arxiv","version":1}},"canonical_sha256":"6210510bbe3dc7388fbb289543d08363477526375b702bea4b04ea4e5bd9c53b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6210510bbe3dc7388fbb289543d08363477526375b702bea4b04ea4e5bd9c53b","first_computed_at":"2026-05-18T01:27:30.414809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:30.414809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BSH21qWn7tn2gYbe+9l6t9XmytpHc7gRvtn8n5KnRhpnXrvi8CLKutErNiDEe/JsRuMHRL3lDztKFF+AAhBRBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:30.415570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bba642a155df2f2215ce06cf947bf731c712578f277320627b9f86b94aa625f5","sha256:0e39f0565a850a33249790aa04dc28dd1e2df8de1fe4f34638929f8486470efc"],"state_sha256":"4995353853c50aec6efd06882b6166b2552ea0e3bfbb86cf21b53c0d1a93b0e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slnhM8KFHMeuVDGdH3HGkRj/695hnJemjOjK7btN3IltJkMsTgqLVNw8gHoTOP2AOUMTDXMHxWEbINWtYrlxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:32:05.046379Z","bundle_sha256":"0149e3b0bc600b43fbe09d0b0203816eb5b307c8ca38675c1ebf740dc3a07a6b"}}