{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7ZPFSJ67LS6EERTJQ7NJ4CEVBJ","short_pith_number":"pith:7ZPFSJ67","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"},"canonical_sha256":"fe5e5927df5cbc42466987da9e08950a5d5274d923d310e108513b8effbf54ae","source":{"kind":"arxiv","id":"1601.00238","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00238","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00238v2","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00238","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"7ZPFSJ67LS6E","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7ZPFSJ67LS6EERTJ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7ZPFSJ67","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7ZPFSJ67LS6EERTJQ7NJ4CEVBJ","target":"record","payload":{"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"},"canonical_sha256":"fe5e5927df5cbc42466987da9e08950a5d5274d923d310e108513b8effbf54ae","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"},"source_kind":"arxiv","source_id":"1601.00238","source_version":2,"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-18T01:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vy1siBTt73xhA0yC1xJIP8GzasmpTtp/k2T/91ofjmeH03J2LRyxt5waoJzwALWLYePal5OgTqIrXb9iaToCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:12:51.157120Z"},"content_sha256":"9a04f776660d8e608faf874a6aa66f050052fbf7c38ba6695938ad2edb6b4362","schema_version":"1.0","event_id":"sha256:9a04f776660d8e608faf874a6aa66f050052fbf7c38ba6695938ad2edb6b4362"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7ZPFSJ67LS6EERTJQ7NJ4CEVBJ","target":"graph","payload":{"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"},"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-18T01:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRdtQxXrDTEp+Bd7YuIh5jdwfyxUPN5l8S4MV8CdT8OJeay6oBZVI4OUbjFIHuE06qc2SWtrD4HRiaKvYCY4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:12:51.157764Z"},"content_sha256":"c95bd602a0ad34aabc1155a3f0a912192b15453d7ee4b0fd9accd2700bb1226a","schema_version":"1.0","event_id":"sha256:c95bd602a0ad34aabc1155a3f0a912192b15453d7ee4b0fd9accd2700bb1226a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/bundle.json","state_url":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/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-31T17:12:51Z","links":{"resolver":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ","bundle":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/bundle.json","state":"https://pith.science/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZPFSJ67LS6EERTJQ7NJ4CEVBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7ZPFSJ67LS6EERTJQ7NJ4CEVBJ","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":"7badf871e3f477983f7c4f6b3ca258717f066d1c5adfab795b9879d26930ad01","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-03T01:17:04Z","title_canon_sha256":"6a726a00d9097a843b52e54a629faaa01b3b540ec0af555bcf46b92a22ac2356"},"schema_version":"1.0","source":{"id":"1601.00238","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00238","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00238v2","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00238","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"7ZPFSJ67LS6E","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7ZPFSJ67LS6EERTJ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7ZPFSJ67","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:c95bd602a0ad34aabc1155a3f0a912192b15453d7ee4b0fd9accd2700bb1226a","target":"graph","created_at":"2026-05-18T01:16:24Z","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":"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","authors_text":"Dacheng Tao, Dong Xu, Tongliang Liu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-03T01:17:04Z","title":"Dimensionality-Dependent Generalization Bounds for $k$-Dimensional Coding Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00238","kind":"arxiv","version":2},"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:9a04f776660d8e608faf874a6aa66f050052fbf7c38ba6695938ad2edb6b4362","target":"record","created_at":"2026-05-18T01:16:24Z","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":"7badf871e3f477983f7c4f6b3ca258717f066d1c5adfab795b9879d26930ad01","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-03T01:17:04Z","title_canon_sha256":"6a726a00d9097a843b52e54a629faaa01b3b540ec0af555bcf46b92a22ac2356"},"schema_version":"1.0","source":{"id":"1601.00238","kind":"arxiv","version":2}},"canonical_sha256":"fe5e5927df5cbc42466987da9e08950a5d5274d923d310e108513b8effbf54ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe5e5927df5cbc42466987da9e08950a5d5274d923d310e108513b8effbf54ae","first_computed_at":"2026-05-18T01:16:24.402012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:24.402012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X8doQwOFjvmu6OpeMg9NFVGQ/meAWy5MUW2ugWz9Q3DYy5Dts28RzfR7NujcjRb8/0PRP76RtJNK2PCiHgZ6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:24.402591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00238","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a04f776660d8e608faf874a6aa66f050052fbf7c38ba6695938ad2edb6b4362","sha256:c95bd602a0ad34aabc1155a3f0a912192b15453d7ee4b0fd9accd2700bb1226a"],"state_sha256":"89391b0b8e585a6532d810718a94824274b9157a072504e3798f02e16d845c06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4EJ0TOTYr7OV+PH+ZNF2Hgda0towg+RzLUNWWq8vkw3PUbO3gFEYEphYtAlQkFL28qojQ/BrOoyG91RxP4yAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:12:51.161669Z","bundle_sha256":"f84cfcd5ff409e9338b7f12113a0d91f7a4f08fbb5ffc4ce821ddeea46e91d0f"}}