{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7ZPFSJ67LS6EERTJQ7NJ4CEVBJ","short_pith_number":"pith:7ZPFSJ67","schema_version":"1.0","canonical_sha256":"fe5e5927df5cbc42466987da9e08950a5d5274d923d310e108513b8effbf54ae","source":{"kind":"arxiv","id":"1601.00238","version":2},"attestation_state":"computed","paper":{"title":"Dimensionality-Dependent Generalization Bounds for $k$-Dimensional Coding Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Dacheng Tao, Dong Xu, Tongliang Liu","submitted_at":"2016-01-03T01:17:04Z","abstract_excerpt":"The $k$-dimensional coding schemes refer to a collection of methods that attempt to represent data using a set of representative $k$-dimensional vectors, and include non-negative matrix factorization, dictionary learning, sparse coding, $k$-means clustering and vector quantization as special cases. Previous generalization bounds for the reconstruction error of the $k$-dimensional coding schemes are mainly dimensionality independent. A major advantage of these bounds is that they can be used to analyze the generalization error when data is mapped into an infinite- or high-dimensional feature sp"},"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":"1601.00238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-03T01:17:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6a726a00d9097a843b52e54a629faaa01b3b540ec0af555bcf46b92a22ac2356","abstract_canon_sha256":"7badf871e3f477983f7c4f6b3ca258717f066d1c5adfab795b9879d26930ad01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:24.402591Z","signature_b64":"X8doQwOFjvmu6OpeMg9NFVGQ/meAWy5MUW2ugWz9Q3DYy5Dts28RzfR7NujcjRb8/0PRP76RtJNK2PCiHgZ6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe5e5927df5cbc42466987da9e08950a5d5274d923d310e108513b8effbf54ae","last_reissued_at":"2026-05-18T01:16:24.402012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:24.402012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dimensionality-Dependent Generalization Bounds for $k$-Dimensional Coding Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Dacheng Tao, Dong Xu, Tongliang Liu","submitted_at":"2016-01-03T01:17:04Z","abstract_excerpt":"The $k$-dimensional coding schemes refer to a collection of methods that attempt to represent data using a set of representative $k$-dimensional vectors, and include non-negative matrix factorization, dictionary learning, sparse coding, $k$-means clustering and vector quantization as special cases. Previous generalization bounds for the reconstruction error of the $k$-dimensional coding schemes are mainly dimensionality independent. A major advantage of these bounds is that they can be used to analyze the generalization error when data is mapped into an infinite- or high-dimensional feature sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00238","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":""},"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":"1601.00238","created_at":"2026-05-18T01:16:24.402095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00238v2","created_at":"2026-05-18T01:16:24.402095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00238","created_at":"2026-05-18T01:16:24.402095+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZPFSJ67LS6E","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZPFSJ67LS6EERTJ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZPFSJ67","created_at":"2026-05-18T12:30:04.600751+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/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ","json":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ.json","graph_json":"https://pith.science/api/pith-number/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/graph.json","events_json":"https://pith.science/api/pith-number/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/events.json","paper":"https://pith.science/paper/7ZPFSJ67"},"agent_actions":{"view_html":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ","download_json":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ.json","view_paper":"https://pith.science/paper/7ZPFSJ67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00238&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/action/storage_attestation","attest_author":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/action/author_attestation","sign_citation":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/action/citation_signature","submit_replication":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/action/replication_record"}},"created_at":"2026-05-18T01:16:24.402095+00:00","updated_at":"2026-05-18T01:16:24.402095+00:00"}