{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YZCKC4OV6R63GBOYE26Y2CZ4WZ","short_pith_number":"pith:YZCKC4OV","schema_version":"1.0","canonical_sha256":"c644a171d5f47db305d826bd8d0b3cb6541d574613ddfea39678eb08679a61ec","source":{"kind":"arxiv","id":"1410.3348","version":1},"attestation_state":"computed","paper":{"title":"Fast Multilevel Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ilya Safro, Talayeh Razzaghi","submitted_at":"2014-10-13T15:27:45Z","abstract_excerpt":"Solving different types of optimization models (including parameters fitting) for support vector machines on large-scale training data is often an expensive computational task. This paper proposes a multilevel algorithmic framework that scales efficiently to very large data sets. Instead of solving the whole training set in one optimization process, the support vectors are obtained and gradually refined at multiple levels of coarseness of the data. The proposed framework includes: (a) construction of hierarchy of large-scale data coarse representations, and (b) a local processing of updating t"},"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":"1410.3348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-13T15:27:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"699d45d739dca70779054ca9bc9e45b62013164a68dd7d33ea1f77b0f74c5777","abstract_canon_sha256":"7c9dbd5280c6a3b39fa2e9ea8b679a58142ec00cc592b92f6e4df105c0ae798e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:11.508723Z","signature_b64":"JbrpnTg/HRVkdkdlGeP9hjIZqnVTzfFw0DzRo60IecTmg55DfliOUAL1xDso1JKjKMzYyvQpW1QqGvzfnHW2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c644a171d5f47db305d826bd8d0b3cb6541d574613ddfea39678eb08679a61ec","last_reissued_at":"2026-05-18T02:40:11.508048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:11.508048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Multilevel Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ilya Safro, Talayeh Razzaghi","submitted_at":"2014-10-13T15:27:45Z","abstract_excerpt":"Solving different types of optimization models (including parameters fitting) for support vector machines on large-scale training data is often an expensive computational task. This paper proposes a multilevel algorithmic framework that scales efficiently to very large data sets. Instead of solving the whole training set in one optimization process, the support vectors are obtained and gradually refined at multiple levels of coarseness of the data. The proposed framework includes: (a) construction of hierarchy of large-scale data coarse representations, and (b) a local processing of updating t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3348","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":"1410.3348","created_at":"2026-05-18T02:40:11.508163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3348v1","created_at":"2026-05-18T02:40:11.508163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3348","created_at":"2026-05-18T02:40:11.508163+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZCKC4OV6R63","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZCKC4OV6R63GBOY","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZCKC4OV","created_at":"2026-05-18T12:28:59.999130+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/YZCKC4OV6R63GBOYE26Y2CZ4WZ","json":"https://pith.science/pith/YZCKC4OV6R63GBOYE26Y2CZ4WZ.json","graph_json":"https://pith.science/api/pith-number/YZCKC4OV6R63GBOYE26Y2CZ4WZ/graph.json","events_json":"https://pith.science/api/pith-number/YZCKC4OV6R63GBOYE26Y2CZ4WZ/events.json","paper":"https://pith.science/paper/YZCKC4OV"},"agent_actions":{"view_html":"https://pith.science/pith/YZCKC4OV6R63GBOYE26Y2CZ4WZ","download_json":"https://pith.science/pith/YZCKC4OV6R63GBOYE26Y2CZ4WZ.json","view_paper":"https://pith.science/paper/YZCKC4OV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3348&json=true","fetch_graph":"https://pith.science/api/pith-number/YZCKC4OV6R63GBOYE26Y2CZ4WZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YZCKC4OV6R63GBOYE26Y2CZ4WZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZCKC4OV6R63GBOYE26Y2CZ4WZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZCKC4OV6R63GBOYE26Y2CZ4WZ/action/storage_attestation","attest_author":"https://pith.science/pith/YZCKC4OV6R63GBOYE26Y2CZ4WZ/action/author_attestation","sign_citation":"https://pith.science/pith/YZCKC4OV6R63GBOYE26Y2CZ4WZ/action/citation_signature","submit_replication":"https://pith.science/pith/YZCKC4OV6R63GBOYE26Y2CZ4WZ/action/replication_record"}},"created_at":"2026-05-18T02:40:11.508163+00:00","updated_at":"2026-05-18T02:40:11.508163+00:00"}