{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CJTPNZNRBWTJO45LJIC734RNC5","short_pith_number":"pith:CJTPNZNR","schema_version":"1.0","canonical_sha256":"1266f6e5b10da69773ab4a05fdf22d1758b3f090c08c66ed5282425c2770f771","source":{"kind":"arxiv","id":"1203.3472","version":1},"attestation_state":"computed","paper":{"title":"Super-Samples from Kernel Herding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Smola, Max Welling, Yutian Chen","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"We extend the herding algorithm to continuous spaces by using the kernel trick. The resulting \"kernel herding\" algorithm is an infinite memory deterministic process that learns to approximate a PDF with a collection of samples. We show that kernel herding decreases the error of expectations of functions in the Hilbert space at a rate O(1/T) which is much faster than the usual O(1/pT) for iid random samples. We illustrate kernel herding by approximating Bayesian predictive distributions."},"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":"1203.3472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"84908646fdae840884cf07fecfe44de516605dbb85cac6de7484a747dd4aeb2a","abstract_canon_sha256":"49ad7882a19c62828bd2d44c9c7fece76e1483bb8cc5c1f168875a2ea213d87d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.472787Z","signature_b64":"5HXPgzTMrXk+AHiGG53IU+z8wDwSeUpZ1bAfFNODEatrlpoire2SZFCpa82FphmjFGBxRwTtIj8Ev4ymiP91BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1266f6e5b10da69773ab4a05fdf22d1758b3f090c08c66ed5282425c2770f771","last_reissued_at":"2026-05-18T04:00:00.472165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.472165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-Samples from Kernel Herding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Smola, Max Welling, Yutian Chen","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"We extend the herding algorithm to continuous spaces by using the kernel trick. The resulting \"kernel herding\" algorithm is an infinite memory deterministic process that learns to approximate a PDF with a collection of samples. We show that kernel herding decreases the error of expectations of functions in the Hilbert space at a rate O(1/T) which is much faster than the usual O(1/pT) for iid random samples. We illustrate kernel herding by approximating Bayesian predictive distributions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3472","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":"1203.3472","created_at":"2026-05-18T04:00:00.472274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3472v1","created_at":"2026-05-18T04:00:00.472274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3472","created_at":"2026-05-18T04:00:00.472274+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJTPNZNRBWTJ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJTPNZNRBWTJO45L","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJTPNZNR","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01942","citing_title":"OD3: Optimization-free Dataset Distillation for Object Detection","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08398","citing_title":"Exploring and Exploiting Stability in Latent Flow Matching","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08485","citing_title":"Sinkhorn Treatment Effects: A Causal Optimal Transport Measure","ref_index":96,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19698","citing_title":"On two ways to use determinantal point processes for Monte Carlo integration","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02647","citing_title":"ContextualJailbreak: Evolutionary Red-Teaming via Simulated Conversational Priming","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CJTPNZNRBWTJO45LJIC734RNC5","json":"https://pith.science/pith/CJTPNZNRBWTJO45LJIC734RNC5.json","graph_json":"https://pith.science/api/pith-number/CJTPNZNRBWTJO45LJIC734RNC5/graph.json","events_json":"https://pith.science/api/pith-number/CJTPNZNRBWTJO45LJIC734RNC5/events.json","paper":"https://pith.science/paper/CJTPNZNR"},"agent_actions":{"view_html":"https://pith.science/pith/CJTPNZNRBWTJO45LJIC734RNC5","download_json":"https://pith.science/pith/CJTPNZNRBWTJO45LJIC734RNC5.json","view_paper":"https://pith.science/paper/CJTPNZNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3472&json=true","fetch_graph":"https://pith.science/api/pith-number/CJTPNZNRBWTJO45LJIC734RNC5/graph.json","fetch_events":"https://pith.science/api/pith-number/CJTPNZNRBWTJO45LJIC734RNC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJTPNZNRBWTJO45LJIC734RNC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJTPNZNRBWTJO45LJIC734RNC5/action/storage_attestation","attest_author":"https://pith.science/pith/CJTPNZNRBWTJO45LJIC734RNC5/action/author_attestation","sign_citation":"https://pith.science/pith/CJTPNZNRBWTJO45LJIC734RNC5/action/citation_signature","submit_replication":"https://pith.science/pith/CJTPNZNRBWTJO45LJIC734RNC5/action/replication_record"}},"created_at":"2026-05-18T04:00:00.472274+00:00","updated_at":"2026-05-18T04:00:00.472274+00:00"}