{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7CGNJLIZUXYHT4CAHF5QNQK5TW","short_pith_number":"pith:7CGNJLIZ","schema_version":"1.0","canonical_sha256":"f88cd4ad19a5f079f040397b06c15d9dafbadff0d06db93732aa842daaa35129","source":{"kind":"arxiv","id":"1704.07468","version":3},"attestation_state":"computed","paper":{"title":"GaKCo: a Fast GApped k-mer string Kernel using COunting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.CL","cs.DS"],"primary_cat":"cs.LG","authors_text":"Arshdeep Sekhon, Beilun Wang, Jack Lanchantin, Kamran Kowsari, Ritambhara Singh, Yanjun Qi","submitted_at":"2017-04-24T21:43:21Z","abstract_excerpt":"String Kernel (SK) techniques, especially those using gapped $k$-mers as features (gk), have obtained great success in classifying sequences like DNA, protein, and text. However, the state-of-the-art gk-SK runs extremely slow when we increase the dictionary size ($\\Sigma$) or allow more mismatches ($M$). This is because current gk-SK uses a trie-based algorithm to calculate co-occurrence of mismatched substrings resulting in a time cost proportional to $O(\\Sigma^{M})$. We propose a \\textbf{fast} algorithm for calculating \\underline{Ga}pped $k$-mer \\underline{K}ernel using \\underline{Co}unting "},"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":"1704.07468","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-24T21:43:21Z","cross_cats_sorted":["cs.AI","cs.CC","cs.CL","cs.DS"],"title_canon_sha256":"0018b9cac07a28fe659bb7e21080fbe390e1eb33d6533ee94aa44b79a8056c4a","abstract_canon_sha256":"642fa6dcf2197634a3db8ba224ddc0ee0c2200a4e973131644b97c8d1baf5f02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:04.361477Z","signature_b64":"9Ct5LErkt1MiM635JIlRmjLXLMDfj5Zw2dw5e5wmZIYeEOmO5TPHja5r/cb3HlZM3UyrvVA9LgKyiZAds08qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f88cd4ad19a5f079f040397b06c15d9dafbadff0d06db93732aa842daaa35129","last_reissued_at":"2026-05-18T00:35:04.360721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:04.360721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GaKCo: a Fast GApped k-mer string Kernel using COunting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.CL","cs.DS"],"primary_cat":"cs.LG","authors_text":"Arshdeep Sekhon, Beilun Wang, Jack Lanchantin, Kamran Kowsari, Ritambhara Singh, Yanjun Qi","submitted_at":"2017-04-24T21:43:21Z","abstract_excerpt":"String Kernel (SK) techniques, especially those using gapped $k$-mers as features (gk), have obtained great success in classifying sequences like DNA, protein, and text. However, the state-of-the-art gk-SK runs extremely slow when we increase the dictionary size ($\\Sigma$) or allow more mismatches ($M$). This is because current gk-SK uses a trie-based algorithm to calculate co-occurrence of mismatched substrings resulting in a time cost proportional to $O(\\Sigma^{M})$. We propose a \\textbf{fast} algorithm for calculating \\underline{Ga}pped $k$-mer \\underline{K}ernel using \\underline{Co}unting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07468","kind":"arxiv","version":3},"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":"1704.07468","created_at":"2026-05-18T00:35:04.360831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07468v3","created_at":"2026-05-18T00:35:04.360831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07468","created_at":"2026-05-18T00:35:04.360831+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CGNJLIZUXYH","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CGNJLIZUXYHT4CA","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CGNJLIZ","created_at":"2026-05-18T12:31:03.183658+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/7CGNJLIZUXYHT4CAHF5QNQK5TW","json":"https://pith.science/pith/7CGNJLIZUXYHT4CAHF5QNQK5TW.json","graph_json":"https://pith.science/api/pith-number/7CGNJLIZUXYHT4CAHF5QNQK5TW/graph.json","events_json":"https://pith.science/api/pith-number/7CGNJLIZUXYHT4CAHF5QNQK5TW/events.json","paper":"https://pith.science/paper/7CGNJLIZ"},"agent_actions":{"view_html":"https://pith.science/pith/7CGNJLIZUXYHT4CAHF5QNQK5TW","download_json":"https://pith.science/pith/7CGNJLIZUXYHT4CAHF5QNQK5TW.json","view_paper":"https://pith.science/paper/7CGNJLIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07468&json=true","fetch_graph":"https://pith.science/api/pith-number/7CGNJLIZUXYHT4CAHF5QNQK5TW/graph.json","fetch_events":"https://pith.science/api/pith-number/7CGNJLIZUXYHT4CAHF5QNQK5TW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CGNJLIZUXYHT4CAHF5QNQK5TW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CGNJLIZUXYHT4CAHF5QNQK5TW/action/storage_attestation","attest_author":"https://pith.science/pith/7CGNJLIZUXYHT4CAHF5QNQK5TW/action/author_attestation","sign_citation":"https://pith.science/pith/7CGNJLIZUXYHT4CAHF5QNQK5TW/action/citation_signature","submit_replication":"https://pith.science/pith/7CGNJLIZUXYHT4CAHF5QNQK5TW/action/replication_record"}},"created_at":"2026-05-18T00:35:04.360831+00:00","updated_at":"2026-05-18T00:35:04.360831+00:00"}