{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YVSAJFI3OJNBZX7X6RIVFAHHSB","short_pith_number":"pith:YVSAJFI3","schema_version":"1.0","canonical_sha256":"c56404951b725a1cdff7f4515280e7907733379cf05fe129a04e0965d18999c9","source":{"kind":"arxiv","id":"1512.00378","version":1},"attestation_state":"computed","paper":{"title":"An In-place Framework for Exact and Approximate Shortest Unique Substring Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bojian Xu, Sharma V. Thankachan, Wing-Kai Hon","submitted_at":"2015-12-01T18:34:23Z","abstract_excerpt":"We revisit the exact shortest unique substring (SUS) finding problem, and propose its approximate version where mismatches are allowed, due to its applications in subfields such as computational biology. We design a generic in-place framework that fits to solve both the exact and approximate $k$-mismatch SUS finding, using the minimum $2n$ memory words plus $n$ bytes space, where $n$ is the input string size. By using the in-place framework, we can find the exact and approximate $k$-mismatch SUS for every string position using a total of $O(n)$ and $O(n^2)$ time, respectively, regardless of th"},"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":"1512.00378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T18:34:23Z","cross_cats_sorted":[],"title_canon_sha256":"2a7f27151f02423314ea22674d3117a9b35f7abc40b8cf97dc60c6aa7708f7f0","abstract_canon_sha256":"c01a61cb966ca91813e4514f2b52be686358b2d195e3fa6eb16df0660b0d65bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:32.081311Z","signature_b64":"eMAqRcMGhBfUqXdv8tIeGQAfnHW/8VSR2MJybvBE18wXKEqPtz7tkBJyZ66UG16i+WCA5e4IZFQCtWJTFAC2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c56404951b725a1cdff7f4515280e7907733379cf05fe129a04e0965d18999c9","last_reissued_at":"2026-05-18T01:25:32.080719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:32.080719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An In-place Framework for Exact and Approximate Shortest Unique Substring Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bojian Xu, Sharma V. Thankachan, Wing-Kai Hon","submitted_at":"2015-12-01T18:34:23Z","abstract_excerpt":"We revisit the exact shortest unique substring (SUS) finding problem, and propose its approximate version where mismatches are allowed, due to its applications in subfields such as computational biology. We design a generic in-place framework that fits to solve both the exact and approximate $k$-mismatch SUS finding, using the minimum $2n$ memory words plus $n$ bytes space, where $n$ is the input string size. By using the in-place framework, we can find the exact and approximate $k$-mismatch SUS for every string position using a total of $O(n)$ and $O(n^2)$ time, respectively, regardless of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00378","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":"1512.00378","created_at":"2026-05-18T01:25:32.080800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.00378v1","created_at":"2026-05-18T01:25:32.080800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00378","created_at":"2026-05-18T01:25:32.080800+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVSAJFI3OJNB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVSAJFI3OJNBZX7X","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVSAJFI3","created_at":"2026-05-18T12:29:52.810259+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/YVSAJFI3OJNBZX7X6RIVFAHHSB","json":"https://pith.science/pith/YVSAJFI3OJNBZX7X6RIVFAHHSB.json","graph_json":"https://pith.science/api/pith-number/YVSAJFI3OJNBZX7X6RIVFAHHSB/graph.json","events_json":"https://pith.science/api/pith-number/YVSAJFI3OJNBZX7X6RIVFAHHSB/events.json","paper":"https://pith.science/paper/YVSAJFI3"},"agent_actions":{"view_html":"https://pith.science/pith/YVSAJFI3OJNBZX7X6RIVFAHHSB","download_json":"https://pith.science/pith/YVSAJFI3OJNBZX7X6RIVFAHHSB.json","view_paper":"https://pith.science/paper/YVSAJFI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.00378&json=true","fetch_graph":"https://pith.science/api/pith-number/YVSAJFI3OJNBZX7X6RIVFAHHSB/graph.json","fetch_events":"https://pith.science/api/pith-number/YVSAJFI3OJNBZX7X6RIVFAHHSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVSAJFI3OJNBZX7X6RIVFAHHSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVSAJFI3OJNBZX7X6RIVFAHHSB/action/storage_attestation","attest_author":"https://pith.science/pith/YVSAJFI3OJNBZX7X6RIVFAHHSB/action/author_attestation","sign_citation":"https://pith.science/pith/YVSAJFI3OJNBZX7X6RIVFAHHSB/action/citation_signature","submit_replication":"https://pith.science/pith/YVSAJFI3OJNBZX7X6RIVFAHHSB/action/replication_record"}},"created_at":"2026-05-18T01:25:32.080800+00:00","updated_at":"2026-05-18T01:25:32.080800+00:00"}