{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YQ757QSXGMDIYC3WZRTAUUND2J","short_pith_number":"pith:YQ757QSX","canonical_record":{"source":{"id":"1710.06763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T14:59:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fb41fc3487406b886545af7d13b74359ccced0e7cbfa1d131212c2e8971a3899","abstract_canon_sha256":"ce93b66f5942835021d28f25b7d8e29b7e87ceb39bc714a69bbcf27141ee8e83"},"schema_version":"1.0"},"canonical_sha256":"c43fdfc25733068c0b76cc660a51a3d253608e88c3c81a09a185bd93f5ea4fc9","source":{"kind":"arxiv","id":"1710.06763","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06763","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06763v1","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06763","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"YQ757QSXGMDI","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQ757QSXGMDIYC3W","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQ757QSX","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YQ757QSXGMDIYC3WZRTAUUND2J","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T14:59:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fb41fc3487406b886545af7d13b74359ccced0e7cbfa1d131212c2e8971a3899","abstract_canon_sha256":"ce93b66f5942835021d28f25b7d8e29b7e87ceb39bc714a69bbcf27141ee8e83"},"schema_version":"1.0"},"canonical_sha256":"c43fdfc25733068c0b76cc660a51a3d253608e88c3c81a09a185bd93f5ea4fc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.674763Z","signature_b64":"T6qdq/6bZIFcFMoe6Nfn//9j4KrtT9U8djeZeDdjtEHYbnXne80qnlv2PpRp5+Ken6jvgjaT8ayM8VD4K08vDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c43fdfc25733068c0b76cc660a51a3d253608e88c3c81a09a185bd93f5ea4fc9","last_reissued_at":"2026-05-17T23:45:15.674157Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.674157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06763","source_version":1,"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-17T23:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aO24CnL0uflgxG6PJd5zXPHuRXtZn77f44NfIgCl0IuygFBnuDNCjIQovJCYhjehW2zc7aQ5JR+Yfwb3fVDVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:27:28.259980Z"},"content_sha256":"be2053d77803b6c43acfbed5ed5ae5a7a204af6fba48f13a80c11c92600eaa32","schema_version":"1.0","event_id":"sha256:be2053d77803b6c43acfbed5ed5ae5a7a204af6fba48f13a80c11c92600eaa32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YQ757QSXGMDIYC3WZRTAUUND2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A complete characterization of optimal dictionaries for least squares representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Debasish Chatterjee, Mohammed Rayyan Sheriff","submitted_at":"2017-10-18T14:59:58Z","abstract_excerpt":"Dictionaries are collections of vectors used for representations of elements in Euclidean spaces. While recent research on optimal dictionaries is focussed on providing sparse (i.e., $\\ell_0$-optimal,) representations, here we consider the problem of finding optimal dictionaries such that representations of samples of a random vector are optimal in an $\\ell_2$-sense. For us, optimality of representation is equivalent to minimization of the average $\\ell_2$-norm of the coefficients used to represent the random vector, with the lengths of the dictionary vectors being specified a priori. With the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06763","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"},"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-17T23:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdUOCHBXAMAx0JH2Z9lNJ9ePpsIAf+JWyDdlH0b6Gj06DOI/uHscM23b1I/jcBbtxxxvoWMeBwsOJl30OcEYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:27:28.260449Z"},"content_sha256":"4fcac9d550da40ab7df487a8365ef0976665e6fb5768ff6c27f582eb88db5a6c","schema_version":"1.0","event_id":"sha256:4fcac9d550da40ab7df487a8365ef0976665e6fb5768ff6c27f582eb88db5a6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQ757QSXGMDIYC3WZRTAUUND2J/bundle.json","state_url":"https://pith.science/pith/YQ757QSXGMDIYC3WZRTAUUND2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQ757QSXGMDIYC3WZRTAUUND2J/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-28T15:27:28Z","links":{"resolver":"https://pith.science/pith/YQ757QSXGMDIYC3WZRTAUUND2J","bundle":"https://pith.science/pith/YQ757QSXGMDIYC3WZRTAUUND2J/bundle.json","state":"https://pith.science/pith/YQ757QSXGMDIYC3WZRTAUUND2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQ757QSXGMDIYC3WZRTAUUND2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YQ757QSXGMDIYC3WZRTAUUND2J","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":"ce93b66f5942835021d28f25b7d8e29b7e87ceb39bc714a69bbcf27141ee8e83","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T14:59:58Z","title_canon_sha256":"fb41fc3487406b886545af7d13b74359ccced0e7cbfa1d131212c2e8971a3899"},"schema_version":"1.0","source":{"id":"1710.06763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06763","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06763v1","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06763","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"YQ757QSXGMDI","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQ757QSXGMDIYC3W","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQ757QSX","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:4fcac9d550da40ab7df487a8365ef0976665e6fb5768ff6c27f582eb88db5a6c","target":"graph","created_at":"2026-05-17T23:45:15Z","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":"Dictionaries are collections of vectors used for representations of elements in Euclidean spaces. While recent research on optimal dictionaries is focussed on providing sparse (i.e., $\\ell_0$-optimal,) representations, here we consider the problem of finding optimal dictionaries such that representations of samples of a random vector are optimal in an $\\ell_2$-sense. For us, optimality of representation is equivalent to minimization of the average $\\ell_2$-norm of the coefficients used to represent the random vector, with the lengths of the dictionary vectors being specified a priori. With the","authors_text":"Debasish Chatterjee, Mohammed Rayyan Sheriff","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T14:59:58Z","title":"A complete characterization of optimal dictionaries for least squares representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06763","kind":"arxiv","version":1},"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:be2053d77803b6c43acfbed5ed5ae5a7a204af6fba48f13a80c11c92600eaa32","target":"record","created_at":"2026-05-17T23:45:15Z","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":"ce93b66f5942835021d28f25b7d8e29b7e87ceb39bc714a69bbcf27141ee8e83","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T14:59:58Z","title_canon_sha256":"fb41fc3487406b886545af7d13b74359ccced0e7cbfa1d131212c2e8971a3899"},"schema_version":"1.0","source":{"id":"1710.06763","kind":"arxiv","version":1}},"canonical_sha256":"c43fdfc25733068c0b76cc660a51a3d253608e88c3c81a09a185bd93f5ea4fc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c43fdfc25733068c0b76cc660a51a3d253608e88c3c81a09a185bd93f5ea4fc9","first_computed_at":"2026-05-17T23:45:15.674157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:15.674157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T6qdq/6bZIFcFMoe6Nfn//9j4KrtT9U8djeZeDdjtEHYbnXne80qnlv2PpRp5+Ken6jvgjaT8ayM8VD4K08vDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:15.674763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be2053d77803b6c43acfbed5ed5ae5a7a204af6fba48f13a80c11c92600eaa32","sha256:4fcac9d550da40ab7df487a8365ef0976665e6fb5768ff6c27f582eb88db5a6c"],"state_sha256":"4707409d2a24c83f8a7b52edf0f063ed1f583be61aab370b91e1c9c0bf3a08af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlFtGffOwOl96VqodDm2dBYfcaQECuovFgsbgdJ0k44dY2b/bBTn/lztQxN6s5WAe231wvVYhAKU3uFkolXvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:27:28.263004Z","bundle_sha256":"f98d888f56738b5c95e114c8b6c800b9062059a1d4473b29fed73f4faaad4e60"}}