{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:67ZNIMIVAVXQZEFEM2MIXYSQLT","short_pith_number":"pith:67ZNIMIV","schema_version":"1.0","canonical_sha256":"f7f2d43115056f0c90a466988be2505cc63d4693ecdcb7f307929eb3befc554b","source":{"kind":"arxiv","id":"1502.07776","version":1},"attestation_state":"computed","paper":{"title":"Efficient Geometric-based Computation of the String Subsequence Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Djelloul Ziadi, Hadda Cherroun, Slimane Bellaouar","submitted_at":"2015-02-26T22:12:22Z","abstract_excerpt":"Kernel methods are powerful tools in machine learning. They have to be computationally efficient. In this paper, we present a novel Geometric-based approach to compute efficiently the string subsequence kernel (SSK). Our main idea is that the SSK computation reduces to range query problem. We started by the construction of a match list $L(s,t)=\\{(i,j):s_{i}=t_{j}\\}$ where $s$ and $t$ are the strings to be compared; such match list contains only the required data that contribute to the result. To compute efficiently the SSK, we extended the layered range tree data structure to a layered range 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":"1502.07776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-26T22:12:22Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"d25d056c393e5701abddc40e763bdfae469d68da1e20f61c0fe71e933887616d","abstract_canon_sha256":"8dabea925973c9ffdb48865168e527641905707daaafcc12b5e0904f585c460c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:02.212527Z","signature_b64":"f9pMqFJ32e//9qDPOLSgM4csHa0o629SGHoIBglGc/K6TAsIC5gvJ94sQvAgtcHOHkh6SeZ391HdsxGWCc8IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7f2d43115056f0c90a466988be2505cc63d4693ecdcb7f307929eb3befc554b","last_reissued_at":"2026-05-18T02:26:02.212107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:02.212107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Geometric-based Computation of the String Subsequence Kernel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.LG","authors_text":"Djelloul Ziadi, Hadda Cherroun, Slimane Bellaouar","submitted_at":"2015-02-26T22:12:22Z","abstract_excerpt":"Kernel methods are powerful tools in machine learning. They have to be computationally efficient. In this paper, we present a novel Geometric-based approach to compute efficiently the string subsequence kernel (SSK). Our main idea is that the SSK computation reduces to range query problem. We started by the construction of a match list $L(s,t)=\\{(i,j):s_{i}=t_{j}\\}$ where $s$ and $t$ are the strings to be compared; such match list contains only the required data that contribute to the result. To compute efficiently the SSK, we extended the layered range tree data structure to a layered range s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07776","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.07776","created_at":"2026-05-18T02:26:02.212167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07776v1","created_at":"2026-05-18T02:26:02.212167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07776","created_at":"2026-05-18T02:26:02.212167+00:00"},{"alias_kind":"pith_short_12","alias_value":"67ZNIMIVAVXQ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"67ZNIMIVAVXQZEFE","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"67ZNIMIV","created_at":"2026-05-18T12:29:07.941421+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/67ZNIMIVAVXQZEFEM2MIXYSQLT","json":"https://pith.science/pith/67ZNIMIVAVXQZEFEM2MIXYSQLT.json","graph_json":"https://pith.science/api/pith-number/67ZNIMIVAVXQZEFEM2MIXYSQLT/graph.json","events_json":"https://pith.science/api/pith-number/67ZNIMIVAVXQZEFEM2MIXYSQLT/events.json","paper":"https://pith.science/paper/67ZNIMIV"},"agent_actions":{"view_html":"https://pith.science/pith/67ZNIMIVAVXQZEFEM2MIXYSQLT","download_json":"https://pith.science/pith/67ZNIMIVAVXQZEFEM2MIXYSQLT.json","view_paper":"https://pith.science/paper/67ZNIMIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07776&json=true","fetch_graph":"https://pith.science/api/pith-number/67ZNIMIVAVXQZEFEM2MIXYSQLT/graph.json","fetch_events":"https://pith.science/api/pith-number/67ZNIMIVAVXQZEFEM2MIXYSQLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67ZNIMIVAVXQZEFEM2MIXYSQLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67ZNIMIVAVXQZEFEM2MIXYSQLT/action/storage_attestation","attest_author":"https://pith.science/pith/67ZNIMIVAVXQZEFEM2MIXYSQLT/action/author_attestation","sign_citation":"https://pith.science/pith/67ZNIMIVAVXQZEFEM2MIXYSQLT/action/citation_signature","submit_replication":"https://pith.science/pith/67ZNIMIVAVXQZEFEM2MIXYSQLT/action/replication_record"}},"created_at":"2026-05-18T02:26:02.212167+00:00","updated_at":"2026-05-18T02:26:02.212167+00:00"}