{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:NYUL7VPENHC772IGV3MORXN644","short_pith_number":"pith:NYUL7VPE","canonical_record":{"source":{"id":"2204.08242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-18T10:18:51Z","cross_cats_sorted":[],"title_canon_sha256":"83006a23b49dcf2a3f17a16262c8e67c8df56cc37e22918b40bd2d69fab2a029","abstract_canon_sha256":"be13c7b17245b5ee0a6788a4a675433f9add610c35e493c46ae498a6157b64db"},"schema_version":"1.0"},"canonical_sha256":"6e28bfd5e469c5ffe906aed8e8ddbee737e16eb1f59bff9ccfd7ab676e230ebc","source":{"kind":"arxiv","id":"2204.08242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.08242","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"arxiv_version","alias_value":"2204.08242v1","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.08242","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"pith_short_12","alias_value":"NYUL7VPENHC7","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"pith_short_16","alias_value":"NYUL7VPENHC772IG","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"pith_short_8","alias_value":"NYUL7VPE","created_at":"2026-07-05T04:15:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:NYUL7VPENHC772IGV3MORXN644","target":"record","payload":{"canonical_record":{"source":{"id":"2204.08242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-18T10:18:51Z","cross_cats_sorted":[],"title_canon_sha256":"83006a23b49dcf2a3f17a16262c8e67c8df56cc37e22918b40bd2d69fab2a029","abstract_canon_sha256":"be13c7b17245b5ee0a6788a4a675433f9add610c35e493c46ae498a6157b64db"},"schema_version":"1.0"},"canonical_sha256":"6e28bfd5e469c5ffe906aed8e8ddbee737e16eb1f59bff9ccfd7ab676e230ebc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:15:23.871305Z","signature_b64":"Teem158qBWWfh4Q1QSrvrq/35lyB3KfSZpLPnOtZlMO1a8FCrtIGvUm6PEdueuk4O219Ei75jJjHET19SJ0nBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e28bfd5e469c5ffe906aed8e8ddbee737e16eb1f59bff9ccfd7ab676e230ebc","last_reissued_at":"2026-07-05T04:15:23.870873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:15:23.870873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.08242","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-07-05T04:15:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tF4CqTmkZHk7cWnfOBSASRtcx1TEg0UbOToWBb+zngU1/tuPkCjsdgO31vYwXTrlUprm+KY5LRjmf8MkMtvJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:35:24.170566Z"},"content_sha256":"9854a3f591e74fc016a8d0dbfca3493e906188618355e62c29b4de85d1a2a02b","schema_version":"1.0","event_id":"sha256:9854a3f591e74fc016a8d0dbfca3493e906188618355e62c29b4de85d1a2a02b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:NYUL7VPENHC772IGV3MORXN644","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast optimization of common basis for matrix set through Common Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jarek Duda","submitted_at":"2022-04-18T10:18:51Z","abstract_excerpt":"SVD (singular value decomposition) is one of the basic tools of machine learning, allowing to optimize basis for a given matrix. However, sometimes we have a set of matrices $\\{A_k\\}_k$ instead, and would like to optimize a single common basis for them: find orthogonal matrices $U$, $V$, such that $\\{U^T A_k V\\}$ set of matrices is somehow simpler. For example DCT-II is orthonormal basis of functions commonly used in image/video compression - as discussed here, this kind of basis can be quickly automatically optimized for a given dataset. While also discussed gradient descent optimization migh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.08242","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.08242/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:15:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uV8MGtfuvbbAJqkxFDXYCoklkxhiLMntHrPAXrwgV+5dLD0WNvBUKFZ0iDoQGF74rl/Ea5i2cAFxt4tIhX/VCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:35:24.171076Z"},"content_sha256":"d1efe58ec30d71c593d19f06519263d77d5588dc2a4e3590d2d24a3324d0f9d3","schema_version":"1.0","event_id":"sha256:d1efe58ec30d71c593d19f06519263d77d5588dc2a4e3590d2d24a3324d0f9d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYUL7VPENHC772IGV3MORXN644/bundle.json","state_url":"https://pith.science/pith/NYUL7VPENHC772IGV3MORXN644/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYUL7VPENHC772IGV3MORXN644/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-08-23T22:35:24Z","links":{"resolver":"https://pith.science/pith/NYUL7VPENHC772IGV3MORXN644","bundle":"https://pith.science/pith/NYUL7VPENHC772IGV3MORXN644/bundle.json","state":"https://pith.science/pith/NYUL7VPENHC772IGV3MORXN644/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYUL7VPENHC772IGV3MORXN644/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NYUL7VPENHC772IGV3MORXN644","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":"be13c7b17245b5ee0a6788a4a675433f9add610c35e493c46ae498a6157b64db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-18T10:18:51Z","title_canon_sha256":"83006a23b49dcf2a3f17a16262c8e67c8df56cc37e22918b40bd2d69fab2a029"},"schema_version":"1.0","source":{"id":"2204.08242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.08242","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"arxiv_version","alias_value":"2204.08242v1","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.08242","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"pith_short_12","alias_value":"NYUL7VPENHC7","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"pith_short_16","alias_value":"NYUL7VPENHC772IG","created_at":"2026-07-05T04:15:23Z"},{"alias_kind":"pith_short_8","alias_value":"NYUL7VPE","created_at":"2026-07-05T04:15:23Z"}],"graph_snapshots":[{"event_id":"sha256:d1efe58ec30d71c593d19f06519263d77d5588dc2a4e3590d2d24a3324d0f9d3","target":"graph","created_at":"2026-07-05T04:15:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2204.08242/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"SVD (singular value decomposition) is one of the basic tools of machine learning, allowing to optimize basis for a given matrix. However, sometimes we have a set of matrices $\\{A_k\\}_k$ instead, and would like to optimize a single common basis for them: find orthogonal matrices $U$, $V$, such that $\\{U^T A_k V\\}$ set of matrices is somehow simpler. For example DCT-II is orthonormal basis of functions commonly used in image/video compression - as discussed here, this kind of basis can be quickly automatically optimized for a given dataset. While also discussed gradient descent optimization migh","authors_text":"Jarek Duda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-18T10:18:51Z","title":"Fast optimization of common basis for matrix set through Common Singular Value Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.08242","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:9854a3f591e74fc016a8d0dbfca3493e906188618355e62c29b4de85d1a2a02b","target":"record","created_at":"2026-07-05T04:15:23Z","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":"be13c7b17245b5ee0a6788a4a675433f9add610c35e493c46ae498a6157b64db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-04-18T10:18:51Z","title_canon_sha256":"83006a23b49dcf2a3f17a16262c8e67c8df56cc37e22918b40bd2d69fab2a029"},"schema_version":"1.0","source":{"id":"2204.08242","kind":"arxiv","version":1}},"canonical_sha256":"6e28bfd5e469c5ffe906aed8e8ddbee737e16eb1f59bff9ccfd7ab676e230ebc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e28bfd5e469c5ffe906aed8e8ddbee737e16eb1f59bff9ccfd7ab676e230ebc","first_computed_at":"2026-07-05T04:15:23.870873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:15:23.870873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Teem158qBWWfh4Q1QSrvrq/35lyB3KfSZpLPnOtZlMO1a8FCrtIGvUm6PEdueuk4O219Ei75jJjHET19SJ0nBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:15:23.871305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.08242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9854a3f591e74fc016a8d0dbfca3493e906188618355e62c29b4de85d1a2a02b","sha256:d1efe58ec30d71c593d19f06519263d77d5588dc2a4e3590d2d24a3324d0f9d3"],"state_sha256":"cdd36f3b687952ecfede68d8cfbe03b4d582f898bf39ce417870437f6ba6aeb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrxTFT8K7Vs3FEPZ6s2XWhkewcZP7ZY4JtTCDSC5QQ9ivBOn+3cWxDW4hKbzbobx35QVV+fga4TWmCdnWUSoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T22:35:24.176027Z","bundle_sha256":"95f9e0168b18f5e7331fb844b3090d2e58a2e3b04946d83a71cb46c3f4131475"}}