{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G3SHXP2WOYAYOKIFTEBST26BUN","short_pith_number":"pith:G3SHXP2W","schema_version":"1.0","canonical_sha256":"36e47bbf567601872905990329ebc1a3612fa843e999c9aa6be289aef984d7f4","source":{"kind":"arxiv","id":"1502.06370","version":1},"attestation_state":"computed","paper":{"title":"A framework for space-efficient string kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Fabio Cunial","submitted_at":"2015-02-23T10:18:16Z","abstract_excerpt":"String kernels are typically used to compare genome-scale sequences whose length makes alignment impractical, yet their computation is based on data structures that are either space-inefficient, or incur large slowdowns. We show that a number of exact string kernels, like the $k$-mer kernel, the substrings kernels, a number of length-weighted kernels, the minimal absent words kernel, and kernels with Markovian corrections, can all be computed in $O(nd)$ time and in $o(n)$ bits of space in addition to the input, using just a $\\mathtt{rangeDistinct}$ data structure on the Burrows-Wheeler transfo"},"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":"1502.06370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-23T10:18:16Z","cross_cats_sorted":[],"title_canon_sha256":"c423e90a195da463e9438a95f91dea4e3a4d4363e14855683a491773cc430821","abstract_canon_sha256":"51cdd9bc96675dfd26f5f77a7179d86f83e4d9c61a08668451035a4c4c46b581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:37.448126Z","signature_b64":"DNaVyTU9VIGmo/hxhZy1pshm4neKT9BSdq+P74dvhJlhpso891ArRDh8gMIxmmm7FqlGd2PQGuTZWUysISlPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36e47bbf567601872905990329ebc1a3612fa843e999c9aa6be289aef984d7f4","last_reissued_at":"2026-05-18T02:26:37.447672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:37.447672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A framework for space-efficient string kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Fabio Cunial","submitted_at":"2015-02-23T10:18:16Z","abstract_excerpt":"String kernels are typically used to compare genome-scale sequences whose length makes alignment impractical, yet their computation is based on data structures that are either space-inefficient, or incur large slowdowns. We show that a number of exact string kernels, like the $k$-mer kernel, the substrings kernels, a number of length-weighted kernels, the minimal absent words kernel, and kernels with Markovian corrections, can all be computed in $O(nd)$ time and in $o(n)$ bits of space in addition to the input, using just a $\\mathtt{rangeDistinct}$ data structure on the Burrows-Wheeler transfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06370","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":"1502.06370","created_at":"2026-05-18T02:26:37.447741+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06370v1","created_at":"2026-05-18T02:26:37.447741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06370","created_at":"2026-05-18T02:26:37.447741+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3SHXP2WOYAY","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3SHXP2WOYAYOKIF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3SHXP2W","created_at":"2026-05-18T12:29:22.688609+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/G3SHXP2WOYAYOKIFTEBST26BUN","json":"https://pith.science/pith/G3SHXP2WOYAYOKIFTEBST26BUN.json","graph_json":"https://pith.science/api/pith-number/G3SHXP2WOYAYOKIFTEBST26BUN/graph.json","events_json":"https://pith.science/api/pith-number/G3SHXP2WOYAYOKIFTEBST26BUN/events.json","paper":"https://pith.science/paper/G3SHXP2W"},"agent_actions":{"view_html":"https://pith.science/pith/G3SHXP2WOYAYOKIFTEBST26BUN","download_json":"https://pith.science/pith/G3SHXP2WOYAYOKIFTEBST26BUN.json","view_paper":"https://pith.science/paper/G3SHXP2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06370&json=true","fetch_graph":"https://pith.science/api/pith-number/G3SHXP2WOYAYOKIFTEBST26BUN/graph.json","fetch_events":"https://pith.science/api/pith-number/G3SHXP2WOYAYOKIFTEBST26BUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3SHXP2WOYAYOKIFTEBST26BUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3SHXP2WOYAYOKIFTEBST26BUN/action/storage_attestation","attest_author":"https://pith.science/pith/G3SHXP2WOYAYOKIFTEBST26BUN/action/author_attestation","sign_citation":"https://pith.science/pith/G3SHXP2WOYAYOKIFTEBST26BUN/action/citation_signature","submit_replication":"https://pith.science/pith/G3SHXP2WOYAYOKIFTEBST26BUN/action/replication_record"}},"created_at":"2026-05-18T02:26:37.447741+00:00","updated_at":"2026-05-18T02:26:37.447741+00:00"}