{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QXFEGS56MFYGCXHOXZ3WGPLQDU","short_pith_number":"pith:QXFEGS56","schema_version":"1.0","canonical_sha256":"85ca434bbe6170615ceebe77633d701d2011ccb3c62d17c30082a55b1dcb8996","source":{"kind":"arxiv","id":"2210.12067","version":1},"attestation_state":"computed","paper":{"title":"Efficient Dataset Distillation Using Random Feature Approximation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Amini, Daniela Rus, Noel Loo, Ramin Hasani","submitted_at":"2022-10-21T15:56:13Z","abstract_excerpt":"Dataset distillation compresses large datasets into smaller synthetic coresets which retain performance with the aim of reducing the storage and computational burden of processing the entire dataset. Today's best-performing algorithm, \\textit{Kernel Inducing Points} (KIP), which makes use of the correspondence between infinite-width neural networks and kernel-ridge regression, is prohibitively slow due to the exact computation of the neural tangent kernel matrix, scaling $O(|S|^2)$, with $|S|$ being the coreset size. To improve this, we propose a novel algorithm that uses a random feature appr"},"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":"2210.12067","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-21T15:56:13Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"7d4b7e5dcc57c9445689cb132cd5a1c1d2a3e81e2045ec612edacec368c7aa3f","abstract_canon_sha256":"8b1aefe68c91bfa004e1a05a25c55063a2e9f2bdce83fe9dabc3f90ea63b1e22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:08.897929Z","signature_b64":"CFSWOjVTlcWflOsZ5etSHrv9zB4QcbDmf9ycsQzfKR2+w8hj41yig7YuQRYBgd5Y9tEMBgzpA1mM9E/66uqhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85ca434bbe6170615ceebe77633d701d2011ccb3c62d17c30082a55b1dcb8996","last_reissued_at":"2026-07-05T05:09:08.897485Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:08.897485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Dataset Distillation Using Random Feature Approximation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Amini, Daniela Rus, Noel Loo, Ramin Hasani","submitted_at":"2022-10-21T15:56:13Z","abstract_excerpt":"Dataset distillation compresses large datasets into smaller synthetic coresets which retain performance with the aim of reducing the storage and computational burden of processing the entire dataset. Today's best-performing algorithm, \\textit{Kernel Inducing Points} (KIP), which makes use of the correspondence between infinite-width neural networks and kernel-ridge regression, is prohibitively slow due to the exact computation of the neural tangent kernel matrix, scaling $O(|S|^2)$, with $|S|$ being the coreset size. To improve this, we propose a novel algorithm that uses a random feature appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.12067","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.12067/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":"2210.12067","created_at":"2026-07-05T05:09:08.897543+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.12067v1","created_at":"2026-07-05T05:09:08.897543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.12067","created_at":"2026-07-05T05:09:08.897543+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXFEGS56MFYG","created_at":"2026-07-05T05:09:08.897543+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXFEGS56MFYGCXHO","created_at":"2026-07-05T05:09:08.897543+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXFEGS56","created_at":"2026-07-05T05:09:08.897543+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/QXFEGS56MFYGCXHOXZ3WGPLQDU","json":"https://pith.science/pith/QXFEGS56MFYGCXHOXZ3WGPLQDU.json","graph_json":"https://pith.science/api/pith-number/QXFEGS56MFYGCXHOXZ3WGPLQDU/graph.json","events_json":"https://pith.science/api/pith-number/QXFEGS56MFYGCXHOXZ3WGPLQDU/events.json","paper":"https://pith.science/paper/QXFEGS56"},"agent_actions":{"view_html":"https://pith.science/pith/QXFEGS56MFYGCXHOXZ3WGPLQDU","download_json":"https://pith.science/pith/QXFEGS56MFYGCXHOXZ3WGPLQDU.json","view_paper":"https://pith.science/paper/QXFEGS56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.12067&json=true","fetch_graph":"https://pith.science/api/pith-number/QXFEGS56MFYGCXHOXZ3WGPLQDU/graph.json","fetch_events":"https://pith.science/api/pith-number/QXFEGS56MFYGCXHOXZ3WGPLQDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXFEGS56MFYGCXHOXZ3WGPLQDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXFEGS56MFYGCXHOXZ3WGPLQDU/action/storage_attestation","attest_author":"https://pith.science/pith/QXFEGS56MFYGCXHOXZ3WGPLQDU/action/author_attestation","sign_citation":"https://pith.science/pith/QXFEGS56MFYGCXHOXZ3WGPLQDU/action/citation_signature","submit_replication":"https://pith.science/pith/QXFEGS56MFYGCXHOXZ3WGPLQDU/action/replication_record"}},"created_at":"2026-07-05T05:09:08.897543+00:00","updated_at":"2026-07-05T05:09:08.897543+00:00"}