{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VFFSDMMTWPDAN22HGWMMUFLYIN","short_pith_number":"pith:VFFSDMMT","schema_version":"1.0","canonical_sha256":"a94b21b193b3c606eb473598ca15784340ab153a11867272898f001a92b86a07","source":{"kind":"arxiv","id":"2106.09028","version":2},"attestation_state":"computed","paper":{"title":"Exponential Error Convergence in Data Classification with Optimized Random Features: Acceleration by Quantum Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Hayata Yamasaki, Sho Sonoda","submitted_at":"2021-06-16T18:00:00Z","abstract_excerpt":"Classification is a common task in machine learning. Random features (RFs) stand as a central technique for scalable learning algorithms based on kernel methods, and more recently proposed optimized random features, sampled depending on the model and the data distribution, can significantly reduce and provably minimize the required number of features. However, existing research on classification using optimized RFs has suffered from computational hardness in sampling each optimized RF; moreover, it has failed to achieve the exponentially fast error-convergence speed that other state-of-the-art"},"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":"2106.09028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-16T18:00:00Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"35989ed33cf622f3b08ef0071e7bd0d5ac16221597a5be5de0644f9e9973e938","abstract_canon_sha256":"15e15b3d1d63fd0d7686b36e51c2d6469db039ca55d6297a468d3d7ca3c31840"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:21.830770Z","signature_b64":"qhbCcudp1wKZ4QF+tCoaTJvjiQBLTXI+fhxJsmfIZUEfcWykLwt0TZNsnnuFz1fOvIy08cjCnjpU0bxr2WIrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a94b21b193b3c606eb473598ca15784340ab153a11867272898f001a92b86a07","last_reissued_at":"2026-07-05T04:31:21.830216Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:21.830216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Error Convergence in Data Classification with Optimized Random Features: Acceleration by Quantum Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Hayata Yamasaki, Sho Sonoda","submitted_at":"2021-06-16T18:00:00Z","abstract_excerpt":"Classification is a common task in machine learning. Random features (RFs) stand as a central technique for scalable learning algorithms based on kernel methods, and more recently proposed optimized random features, sampled depending on the model and the data distribution, can significantly reduce and provably minimize the required number of features. However, existing research on classification using optimized RFs has suffered from computational hardness in sampling each optimized RF; moreover, it has failed to achieve the exponentially fast error-convergence speed that other state-of-the-art"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.09028","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.09028/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.09028","created_at":"2026-07-05T04:31:21.830280+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.09028v2","created_at":"2026-07-05T04:31:21.830280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.09028","created_at":"2026-07-05T04:31:21.830280+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFFSDMMTWPDA","created_at":"2026-07-05T04:31:21.830280+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFFSDMMTWPDAN22H","created_at":"2026-07-05T04:31:21.830280+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFFSDMMT","created_at":"2026-07-05T04:31:21.830280+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18979","citing_title":"Transversal Surface-Code Game Powered by Neutral Atoms","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VFFSDMMTWPDAN22HGWMMUFLYIN","json":"https://pith.science/pith/VFFSDMMTWPDAN22HGWMMUFLYIN.json","graph_json":"https://pith.science/api/pith-number/VFFSDMMTWPDAN22HGWMMUFLYIN/graph.json","events_json":"https://pith.science/api/pith-number/VFFSDMMTWPDAN22HGWMMUFLYIN/events.json","paper":"https://pith.science/paper/VFFSDMMT"},"agent_actions":{"view_html":"https://pith.science/pith/VFFSDMMTWPDAN22HGWMMUFLYIN","download_json":"https://pith.science/pith/VFFSDMMTWPDAN22HGWMMUFLYIN.json","view_paper":"https://pith.science/paper/VFFSDMMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.09028&json=true","fetch_graph":"https://pith.science/api/pith-number/VFFSDMMTWPDAN22HGWMMUFLYIN/graph.json","fetch_events":"https://pith.science/api/pith-number/VFFSDMMTWPDAN22HGWMMUFLYIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFFSDMMTWPDAN22HGWMMUFLYIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFFSDMMTWPDAN22HGWMMUFLYIN/action/storage_attestation","attest_author":"https://pith.science/pith/VFFSDMMTWPDAN22HGWMMUFLYIN/action/author_attestation","sign_citation":"https://pith.science/pith/VFFSDMMTWPDAN22HGWMMUFLYIN/action/citation_signature","submit_replication":"https://pith.science/pith/VFFSDMMTWPDAN22HGWMMUFLYIN/action/replication_record"}},"created_at":"2026-07-05T04:31:21.830280+00:00","updated_at":"2026-07-05T04:31:21.830280+00:00"}