{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MIIFCC56HXDTRD53FCKUHUEDMN","short_pith_number":"pith:MIIFCC56","schema_version":"1.0","canonical_sha256":"6210510bbe3dc7388fbb289543d08363477526375b702bea4b04ea4e5bd9c53b","source":{"kind":"arxiv","id":"1511.02393","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.02393","created_at":"2026-05-18T01:27:30.414927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02393v1","created_at":"2026-05-18T01:27:30.414927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02393","created_at":"2026-05-18T01:27:30.414927+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIIFCC56HXDT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIIFCC56HXDTRD53","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIIFCC56","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN","json":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN.json","graph_json":"https://pith.science/api/pith-number/MIIFCC56HXDTRD53FCKUHUEDMN/graph.json","events_json":"https://pith.science/api/pith-number/MIIFCC56HXDTRD53FCKUHUEDMN/events.json","paper":"https://pith.science/paper/MIIFCC56"},"agent_actions":{"view_html":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN","download_json":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN.json","view_paper":"https://pith.science/paper/MIIFCC56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02393&json=true","fetch_graph":"https://pith.science/api/pith-number/MIIFCC56HXDTRD53FCKUHUEDMN/graph.json","fetch_events":"https://pith.science/api/pith-number/MIIFCC56HXDTRD53FCKUHUEDMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN/action/storage_attestation","attest_author":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN/action/author_attestation","sign_citation":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN/action/citation_signature","submit_replication":"https://pith.science/pith/MIIFCC56HXDTRD53FCKUHUEDMN/action/replication_record"}},"created_at":"2026-05-18T01:27:30.414927+00:00","updated_at":"2026-05-18T01:27:30.414927+00:00"}