{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XQXXBKEHLQVUXC76LNQDHYVX3L","short_pith_number":"pith:XQXXBKEH","schema_version":"1.0","canonical_sha256":"bc2f70a8875c2b4b8bfe5b6033e2b7daf8ddf99e9e03a3cca27bfde3e81d1b03","source":{"kind":"arxiv","id":"1406.0597","version":3},"attestation_state":"computed","paper":{"title":"Maximum margin classifier working in a set of strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Hitoshi Koyano, Morihiro Hayashida, Tatsuya Akutsu","submitted_at":"2014-06-03T06:58:33Z","abstract_excerpt":"Numbers and numerical vectors account for a large portion of data. However, recently the amount of string data generated has increased dramatically. Consequently, classifying string data is a common problem in many fields. The most widely used approach to this problem is to convert strings into numerical vectors using string kernels and subsequently apply a support vector machine that works in a numerical vector space. However, this non-one-to-one conversion involves a loss of information and makes it impossible to evaluate, using probability theory, the generalization error of a learning mach"},"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":"1406.0597","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-03T06:58:33Z","cross_cats_sorted":[],"title_canon_sha256":"2159ed91badff735e2263cfc0596607df0d3665910110113b072baea8a74dd27","abstract_canon_sha256":"fc2213963b40776e831175f3c33b81306f1922acfb9daf44790572030161dadb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:12.327965Z","signature_b64":"DaJXC6GJyv5PjkdavzZYElpltdtpwfvo1Te8YDFkt7QiWkNZZe4LVaKSt2vwnbW3It761escdkda5L40S1uzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc2f70a8875c2b4b8bfe5b6033e2b7daf8ddf99e9e03a3cca27bfde3e81d1b03","last_reissued_at":"2026-05-18T01:20:12.327417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:12.327417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum margin classifier working in a set of strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Hitoshi Koyano, Morihiro Hayashida, Tatsuya Akutsu","submitted_at":"2014-06-03T06:58:33Z","abstract_excerpt":"Numbers and numerical vectors account for a large portion of data. However, recently the amount of string data generated has increased dramatically. Consequently, classifying string data is a common problem in many fields. The most widely used approach to this problem is to convert strings into numerical vectors using string kernels and subsequently apply a support vector machine that works in a numerical vector space. However, this non-one-to-one conversion involves a loss of information and makes it impossible to evaluate, using probability theory, the generalization error of a learning mach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0597","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":"1406.0597","created_at":"2026-05-18T01:20:12.327522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0597v3","created_at":"2026-05-18T01:20:12.327522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0597","created_at":"2026-05-18T01:20:12.327522+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQXXBKEHLQVU","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQXXBKEHLQVUXC76","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQXXBKEH","created_at":"2026-05-18T12:28:57.508820+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/XQXXBKEHLQVUXC76LNQDHYVX3L","json":"https://pith.science/pith/XQXXBKEHLQVUXC76LNQDHYVX3L.json","graph_json":"https://pith.science/api/pith-number/XQXXBKEHLQVUXC76LNQDHYVX3L/graph.json","events_json":"https://pith.science/api/pith-number/XQXXBKEHLQVUXC76LNQDHYVX3L/events.json","paper":"https://pith.science/paper/XQXXBKEH"},"agent_actions":{"view_html":"https://pith.science/pith/XQXXBKEHLQVUXC76LNQDHYVX3L","download_json":"https://pith.science/pith/XQXXBKEHLQVUXC76LNQDHYVX3L.json","view_paper":"https://pith.science/paper/XQXXBKEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0597&json=true","fetch_graph":"https://pith.science/api/pith-number/XQXXBKEHLQVUXC76LNQDHYVX3L/graph.json","fetch_events":"https://pith.science/api/pith-number/XQXXBKEHLQVUXC76LNQDHYVX3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQXXBKEHLQVUXC76LNQDHYVX3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQXXBKEHLQVUXC76LNQDHYVX3L/action/storage_attestation","attest_author":"https://pith.science/pith/XQXXBKEHLQVUXC76LNQDHYVX3L/action/author_attestation","sign_citation":"https://pith.science/pith/XQXXBKEHLQVUXC76LNQDHYVX3L/action/citation_signature","submit_replication":"https://pith.science/pith/XQXXBKEHLQVUXC76LNQDHYVX3L/action/replication_record"}},"created_at":"2026-05-18T01:20:12.327522+00:00","updated_at":"2026-05-18T01:20:12.327522+00:00"}