{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O7ED7BWQBEXXDCBPWOR6YIDTSV","short_pith_number":"pith:O7ED7BWQ","schema_version":"1.0","canonical_sha256":"77c83f86d0092f71882fb3a3ec207395780d7f1209917b926089bd1637da9f15","source":{"kind":"arxiv","id":"1812.01410","version":1},"attestation_state":"computed","paper":{"title":"Compressive Classification (Machine Learning without learning)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Laurent Jacques, Vincent Schellekens","submitted_at":"2018-12-04T13:50:11Z","abstract_excerpt":"Compressive learning is a framework where (so far unsupervised) learning tasks use not the entire dataset but a compressed summary (sketch) of it. We propose a compressive learning classification method, and a novel sketch function for images."},"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":"1812.01410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-04T13:50:11Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"2230ef9440e18980bb678a3f919ce8d2d960071161408f1dd2bebb434590fc9e","abstract_canon_sha256":"03ca9362cbb17dbdbcb5a6ae1e1c38e10924c5b9920ce9f6d202192a087d06a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:12.555264Z","signature_b64":"wwJ3jC2cmI4GTyn0suzCdTnFK5nJRNhcwj5tcVe/bnW5C+55rCk5JOx/6amgQNvtLBS1tHcNOnsrgo9KopM+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77c83f86d0092f71882fb3a3ec207395780d7f1209917b926089bd1637da9f15","last_reissued_at":"2026-05-17T23:59:12.554683Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:12.554683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressive Classification (Machine Learning without learning)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Laurent Jacques, Vincent Schellekens","submitted_at":"2018-12-04T13:50:11Z","abstract_excerpt":"Compressive learning is a framework where (so far unsupervised) learning tasks use not the entire dataset but a compressed summary (sketch) of it. We propose a compressive learning classification method, and a novel sketch function for images."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01410","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":"1812.01410","created_at":"2026-05-17T23:59:12.554756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01410v1","created_at":"2026-05-17T23:59:12.554756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01410","created_at":"2026-05-17T23:59:12.554756+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/O7ED7BWQBEXXDCBPWOR6YIDTSV","json":"https://pith.science/pith/O7ED7BWQBEXXDCBPWOR6YIDTSV.json","graph_json":"https://pith.science/api/pith-number/O7ED7BWQBEXXDCBPWOR6YIDTSV/graph.json","events_json":"https://pith.science/api/pith-number/O7ED7BWQBEXXDCBPWOR6YIDTSV/events.json","paper":"https://pith.science/paper/O7ED7BWQ"},"agent_actions":{"view_html":"https://pith.science/pith/O7ED7BWQBEXXDCBPWOR6YIDTSV","download_json":"https://pith.science/pith/O7ED7BWQBEXXDCBPWOR6YIDTSV.json","view_paper":"https://pith.science/paper/O7ED7BWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01410&json=true","fetch_graph":"https://pith.science/api/pith-number/O7ED7BWQBEXXDCBPWOR6YIDTSV/graph.json","fetch_events":"https://pith.science/api/pith-number/O7ED7BWQBEXXDCBPWOR6YIDTSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7ED7BWQBEXXDCBPWOR6YIDTSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7ED7BWQBEXXDCBPWOR6YIDTSV/action/storage_attestation","attest_author":"https://pith.science/pith/O7ED7BWQBEXXDCBPWOR6YIDTSV/action/author_attestation","sign_citation":"https://pith.science/pith/O7ED7BWQBEXXDCBPWOR6YIDTSV/action/citation_signature","submit_replication":"https://pith.science/pith/O7ED7BWQBEXXDCBPWOR6YIDTSV/action/replication_record"}},"created_at":"2026-05-17T23:59:12.554756+00:00","updated_at":"2026-05-17T23:59:12.554756+00:00"}