{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YNWP6DOWNMEFVV4S74Z4VHUUMU","short_pith_number":"pith:YNWP6DOW","canonical_record":{"source":{"id":"1904.02276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-04T00:00:59Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"8ac0443bbaa7da20902dc2572257c49d59a7eb514cf70bfcd600dea586577f92","abstract_canon_sha256":"8e9c9ccf87075eb9b257f3c2912c931a2ad1b7d9919080dba6411d82449a91ea"},"schema_version":"1.0"},"canonical_sha256":"c36cff0dd66b085ad792ff33ca9e946530af04f1df3b3cfda3e259364422b8a4","source":{"kind":"arxiv","id":"1904.02276","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02276","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02276v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02276","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"YNWP6DOWNMEF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YNWP6DOWNMEFVV4S","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YNWP6DOW","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YNWP6DOWNMEFVV4S74Z4VHUUMU","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-04T00:00:59Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"8ac0443bbaa7da20902dc2572257c49d59a7eb514cf70bfcd600dea586577f92","abstract_canon_sha256":"8e9c9ccf87075eb9b257f3c2912c931a2ad1b7d9919080dba6411d82449a91ea"},"schema_version":"1.0"},"canonical_sha256":"c36cff0dd66b085ad792ff33ca9e946530af04f1df3b3cfda3e259364422b8a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.865373Z","signature_b64":"YiVrXJ7lSkLKBt+3WvDX3G/DYojD04Z5TW/OzQIxhz/L3EWJpz2ZrG0vk/yVkBcQr8HIy8xsV1O0sJ7lB+k5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c36cff0dd66b085ad792ff33ca9e946530af04f1df3b3cfda3e259364422b8a4","last_reissued_at":"2026-05-17T23:45:03.864898Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.864898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02276","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSjik2qXZ53kEKXsbODa23eXCn59Mo90SiUE0G9o0/Z8REHHKpNZzTeGcYU2fzx/AlKrunovmVidWoscIqgpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:30.465272Z"},"content_sha256":"0bc9f5243d5fe11b625fddecdcb08d47eb0bf01e6c0577e6c2e2bf8f0b873111","schema_version":"1.0","event_id":"sha256:0bc9f5243d5fe11b625fddecdcb08d47eb0bf01e6c0577e6c2e2bf8f0b873111"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YNWP6DOWNMEFVV4S74Z4VHUUMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear quantum algorithms for training linear and kernel-based classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"Shouvanik Chakrabarti, Tongyang Li, Xiaodi Wu","submitted_at":"2019-04-04T00:00:59Z","abstract_excerpt":"We investigate quantum algorithms for classification, a fundamental problem in machine learning, with provable guarantees. Given $n$ $d$-dimensional data points, the state-of-the-art (and optimal) classical algorithm for training classifiers with constant margin runs in $\\tilde{O}(n+d)$ time. We design sublinear quantum algorithms for the same task running in $\\tilde{O}(\\sqrt{n} +\\sqrt{d})$ time, a quadratic improvement in both $n$ and $d$. Moreover, our algorithms use the standard quantization of the classical input and generate the same classical output, suggesting minimal overheads when use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02276","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgQ4zEPi07bnQQUFNxRc+L/QHGZ7QH9wIvXQbd1IQ7QEZoky0CSsTRIPYCdofN1ImUY1q05XP/EE221mEOYFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:30.465785Z"},"content_sha256":"0fc5403f8042aab86953418e53cf19270735ab6be7daccf5f4707ef7a036b3a4","schema_version":"1.0","event_id":"sha256:0fc5403f8042aab86953418e53cf19270735ab6be7daccf5f4707ef7a036b3a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNWP6DOWNMEFVV4S74Z4VHUUMU/bundle.json","state_url":"https://pith.science/pith/YNWP6DOWNMEFVV4S74Z4VHUUMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNWP6DOWNMEFVV4S74Z4VHUUMU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T14:37:30Z","links":{"resolver":"https://pith.science/pith/YNWP6DOWNMEFVV4S74Z4VHUUMU","bundle":"https://pith.science/pith/YNWP6DOWNMEFVV4S74Z4VHUUMU/bundle.json","state":"https://pith.science/pith/YNWP6DOWNMEFVV4S74Z4VHUUMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNWP6DOWNMEFVV4S74Z4VHUUMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YNWP6DOWNMEFVV4S74Z4VHUUMU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8e9c9ccf87075eb9b257f3c2912c931a2ad1b7d9919080dba6411d82449a91ea","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-04T00:00:59Z","title_canon_sha256":"8ac0443bbaa7da20902dc2572257c49d59a7eb514cf70bfcd600dea586577f92"},"schema_version":"1.0","source":{"id":"1904.02276","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02276","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02276v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02276","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"YNWP6DOWNMEF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YNWP6DOWNMEFVV4S","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YNWP6DOW","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:0fc5403f8042aab86953418e53cf19270735ab6be7daccf5f4707ef7a036b3a4","target":"graph","created_at":"2026-05-17T23:45:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We investigate quantum algorithms for classification, a fundamental problem in machine learning, with provable guarantees. Given $n$ $d$-dimensional data points, the state-of-the-art (and optimal) classical algorithm for training classifiers with constant margin runs in $\\tilde{O}(n+d)$ time. We design sublinear quantum algorithms for the same task running in $\\tilde{O}(\\sqrt{n} +\\sqrt{d})$ time, a quadratic improvement in both $n$ and $d$. Moreover, our algorithms use the standard quantization of the classical input and generate the same classical output, suggesting minimal overheads when use","authors_text":"Shouvanik Chakrabarti, Tongyang Li, Xiaodi Wu","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-04T00:00:59Z","title":"Sublinear quantum algorithms for training linear and kernel-based classifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02276","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0bc9f5243d5fe11b625fddecdcb08d47eb0bf01e6c0577e6c2e2bf8f0b873111","target":"record","created_at":"2026-05-17T23:45:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8e9c9ccf87075eb9b257f3c2912c931a2ad1b7d9919080dba6411d82449a91ea","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-04T00:00:59Z","title_canon_sha256":"8ac0443bbaa7da20902dc2572257c49d59a7eb514cf70bfcd600dea586577f92"},"schema_version":"1.0","source":{"id":"1904.02276","kind":"arxiv","version":1}},"canonical_sha256":"c36cff0dd66b085ad792ff33ca9e946530af04f1df3b3cfda3e259364422b8a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c36cff0dd66b085ad792ff33ca9e946530af04f1df3b3cfda3e259364422b8a4","first_computed_at":"2026-05-17T23:45:03.864898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.864898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YiVrXJ7lSkLKBt+3WvDX3G/DYojD04Z5TW/OzQIxhz/L3EWJpz2ZrG0vk/yVkBcQr8HIy8xsV1O0sJ7lB+k5DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.865373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02276","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bc9f5243d5fe11b625fddecdcb08d47eb0bf01e6c0577e6c2e2bf8f0b873111","sha256:0fc5403f8042aab86953418e53cf19270735ab6be7daccf5f4707ef7a036b3a4"],"state_sha256":"30463ce86614e92bf3396cbfe76191009f2c3b0e3903b5dcec1ff97baccd6269"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPLtoUtaKtJ32Ds4eUvmeoA5Tl0IOSegaDvL79fxGrfxOYid1VvcX2AJCytr7kQ0hAOrXTMw3sdE+po9e45CCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:37:30.469162Z","bundle_sha256":"aa4741a21a92ac9d58ba9318971f60f5c28a59da4afdaee2e362458805b36e4e"}}