{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MLJD76SLC5IM3FGFNJSMMOZBPV","short_pith_number":"pith:MLJD76SL","canonical_record":{"source":{"id":"2605.15086","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-14T17:08:16Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"64425464d993df606cc7fc6ed995be1bdfc2981b5bd8b3935f2df2fce82a1915","abstract_canon_sha256":"e707a7a8d3972a515746bf548f4366c9700f094b5ddc9d65d9e5d489498bdab7"},"schema_version":"1.0"},"canonical_sha256":"62d23ffa4b1750cd94c56a64c63b217d7b1515c2ca3930b1b4b07f35d8e88265","source":{"kind":"arxiv","id":"2605.15086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15086","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15086v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"MLJD76SLC5IM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MLJD76SLC5IM3FGF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MLJD76SL","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MLJD76SLC5IM3FGFNJSMMOZBPV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15086","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-14T17:08:16Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"64425464d993df606cc7fc6ed995be1bdfc2981b5bd8b3935f2df2fce82a1915","abstract_canon_sha256":"e707a7a8d3972a515746bf548f4366c9700f094b5ddc9d65d9e5d489498bdab7"},"schema_version":"1.0"},"canonical_sha256":"62d23ffa4b1750cd94c56a64c63b217d7b1515c2ca3930b1b4b07f35d8e88265","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.2","canonical_sha256":"62d23ffa4b1750cd94c56a64c63b217d7b1515c2ca3930b1b4b07f35d8e88265","last_reissued_at":"2026-05-17T21:57:19.265601Z","signature_status":"unsigned_v0","first_computed_at":"2026-05-17T21:40:25.953441Z"},"source_kind":"arxiv","source_id":"2605.15086","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-17T21:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4o6mIIKK9oezMEpG5LJ+vXHYg9LGCzRWffyWXq+nS3GZbqw/Y/fTwSodfBTP8UkhPyCBTjsNdMYgnKi0WOG5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:58:18.901953Z"},"content_sha256":"5b77d6b1b0eb0e55c9249fd57a6fa8aca93d88fe229ab8ba2b75fbbac5e58d17","schema_version":"1.0","event_id":"sha256:5b77d6b1b0eb0e55c9249fd57a6fa8aca93d88fe229ab8ba2b75fbbac5e58d17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MLJD76SLC5IM3FGFNJSMMOZBPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FaSST: Fast Sparsifying Secondary Transform","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"FaSST factorizes data-driven secondary transforms into mode-adaptive Givens rotations to match LFNST performance at far lower complexity.","cross_cats":["eess.SP"],"primary_cat":"eess.IV","authors_text":"Antonio Ortega, Darukeesan Pakiyarajah, Debargha Mukherjee, Eduardo Pavez, Samuel Fern\\'andez-Mendui\\~na","submitted_at":"2026-05-14T17:08:16Z","abstract_excerpt":"Data-dependent secondary transforms, which aim to decorrelate coefficients of a separable primary transform, can improve residual coding efficiency; however, their deployment is often constrained by computational complexity. Recent video codecs use variants of the low-frequency non-separable transform (LFNST), which discards some high-frequency secondary transform coefficients, limiting achievable coding gains. Moreover, existing data-dependent secondary transforms lack explicit rate-distortion (RD) optimal design criteria. In this work, we propose a framework for designing low-complexity data"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Mode-adaptive FaSST matches the RD performance of LFNST while reducing the number of computations by 83.67%. Moreover, by avoiding fixed-coefficient truncation, FaSST achieves up to 1.80% BD-rate savings relative to LFNST while operating at 66.24% lower complexity.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the alternating-minimization procedure combined with approximate Givens factorization produces transforms whose rate-distortion performance remains close to the original data-driven SOTs across the full range of intra prediction modes and content types used in AV2 testing.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FaSST approximates sparse orthonormal transforms with mode-adaptive Givens rotation sequences to produce low-complexity secondary transforms for AV2 intra residuals that match LFNST rate-distortion performance at 83.67% lower complexity and deliver up to 1.80% BD-rate savings.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"FaSST factorizes data-driven secondary transforms into mode-adaptive Givens rotations to match LFNST performance at far lower complexity.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9d04983890736f6c84e8b21bfd60f00facf8c6e9981956fbaa99798245f39f96"},"source":{"id":"2605.15086","kind":"arxiv","version":1},"verdict":{"id":"5faa7d63-ed01-46d1-93fa-4c4686ae032f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:14:30.967662Z","strongest_claim":"Mode-adaptive FaSST matches the RD performance of LFNST while reducing the number of computations by 83.67%. Moreover, by avoiding fixed-coefficient truncation, FaSST achieves up to 1.80% BD-rate savings relative to LFNST while operating at 66.24% lower complexity.","one_line_summary":"FaSST approximates sparse orthonormal transforms with mode-adaptive Givens rotation sequences to produce low-complexity secondary transforms for AV2 intra residuals that match LFNST rate-distortion performance at 83.67% lower complexity and deliver up to 1.80% BD-rate savings.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the alternating-minimization procedure combined with approximate Givens factorization produces transforms whose rate-distortion performance remains close to the original data-driven SOTs across the full range of intra prediction modes and content types used in AV2 testing.","pith_extraction_headline":"FaSST factorizes data-driven secondary transforms into mode-adaptive Givens rotations to match LFNST performance at far lower complexity."},"references":{"count":31,"sample":[{"doi":"","year":2026,"title":"FaSST: Fast Sparsifying Secondary Transform","work_id":"6485b07b-2706-4655-b1ba-080584dd46b6","ref_index":1,"cited_arxiv_id":"2605.15086","is_internal_anchor":true},{"doi":"","year":null,"title":"coefficient dropping","work_id":"daa4b745-907a-46a8-a1e7-8be3268033a8","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Moreover, KLTs and their approx- imations do not account for quantization effects","work_id":"32914eb2-603e-4dc4-997e-77857707104a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"given the coefficients{ ˆyi}me i=1, we optimize the transform: min SJ meX i=1 ∥ˆxi −S J ˆyi∥2 2 s.t.S J = JY j=1 G(mj, nj, θj).(6) It can be shown that the above problem is equivalent to max SJ tr(ΓSJ","work_id":"2a6613c9-a683-432d-bf02-6fb652829533","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Specifically, images from the CLIC dataset [20] are compressed using A V2, and residual blocks of sizes 8×8,16×16, and32×32are collected","work_id":"f1d6bab2-57ce-4e98-9619-0aa7ba28d155","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"2f10db13debd16dbfe3be60d95cebdb9199a07adaded0922e528887e3888c443","internal_anchors":2},"formal_canon":{"evidence_count":1,"snapshot_sha256":"5a2efaceeaa4261c92f30b97800c9d4a7be0ac38f6d969ee960551c4a30b75df"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"5faa7d63-ed01-46d1-93fa-4c4686ae032f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T21:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTmmSf3CB5vjrd7NNNuuNnILYXSbKgZHlXyezx9l+TyvzzHuJtk89nnIzQrHFSvru+jx0y77QUUtFzTdLUtcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:58:18.902619Z"},"content_sha256":"fa81b1260abf495d94a0032c48bf63ddfff5ba2d4e8777e246f19e801a67382b","schema_version":"1.0","event_id":"sha256:fa81b1260abf495d94a0032c48bf63ddfff5ba2d4e8777e246f19e801a67382b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLJD76SLC5IM3FGFNJSMMOZBPV/bundle.json","state_url":"https://pith.science/pith/MLJD76SLC5IM3FGFNJSMMOZBPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLJD76SLC5IM3FGFNJSMMOZBPV/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-20T06:58:18Z","links":{"resolver":"https://pith.science/pith/MLJD76SLC5IM3FGFNJSMMOZBPV","bundle":"https://pith.science/pith/MLJD76SLC5IM3FGFNJSMMOZBPV/bundle.json","state":"https://pith.science/pith/MLJD76SLC5IM3FGFNJSMMOZBPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLJD76SLC5IM3FGFNJSMMOZBPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MLJD76SLC5IM3FGFNJSMMOZBPV","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":"e707a7a8d3972a515746bf548f4366c9700f094b5ddc9d65d9e5d489498bdab7","cross_cats_sorted":["eess.SP"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-14T17:08:16Z","title_canon_sha256":"64425464d993df606cc7fc6ed995be1bdfc2981b5bd8b3935f2df2fce82a1915"},"schema_version":"1.0","source":{"id":"2605.15086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15086","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15086v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"MLJD76SLC5IM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MLJD76SLC5IM3FGF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MLJD76SL","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:fa81b1260abf495d94a0032c48bf63ddfff5ba2d4e8777e246f19e801a67382b","target":"graph","created_at":"2026-05-17T21:57:19Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Mode-adaptive FaSST matches the RD performance of LFNST while reducing the number of computations by 83.67%. Moreover, by avoiding fixed-coefficient truncation, FaSST achieves up to 1.80% BD-rate savings relative to LFNST while operating at 66.24% lower complexity."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the alternating-minimization procedure combined with approximate Givens factorization produces transforms whose rate-distortion performance remains close to the original data-driven SOTs across the full range of intra prediction modes and content types used in AV2 testing."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FaSST approximates sparse orthonormal transforms with mode-adaptive Givens rotation sequences to produce low-complexity secondary transforms for AV2 intra residuals that match LFNST rate-distortion performance at 83.67% lower complexity and deliver up to 1.80% BD-rate savings."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"FaSST factorizes data-driven secondary transforms into mode-adaptive Givens rotations to match LFNST performance at far lower complexity."}],"snapshot_sha256":"9d04983890736f6c84e8b21bfd60f00facf8c6e9981956fbaa99798245f39f96"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"5a2efaceeaa4261c92f30b97800c9d4a7be0ac38f6d969ee960551c4a30b75df"},"paper":{"abstract_excerpt":"Data-dependent secondary transforms, which aim to decorrelate coefficients of a separable primary transform, can improve residual coding efficiency; however, their deployment is often constrained by computational complexity. Recent video codecs use variants of the low-frequency non-separable transform (LFNST), which discards some high-frequency secondary transform coefficients, limiting achievable coding gains. Moreover, existing data-dependent secondary transforms lack explicit rate-distortion (RD) optimal design criteria. In this work, we propose a framework for designing low-complexity data","authors_text":"Antonio Ortega, Darukeesan Pakiyarajah, Debargha Mukherjee, Eduardo Pavez, Samuel Fern\\'andez-Mendui\\~na","cross_cats":["eess.SP"],"headline":"FaSST factorizes data-driven secondary transforms into mode-adaptive Givens rotations to match LFNST performance at far lower complexity.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-14T17:08:16Z","title":"FaSST: Fast Sparsifying Secondary Transform"},"references":{"count":31,"internal_anchors":2,"resolved_work":31,"sample":[{"cited_arxiv_id":"2605.15086","doi":"","is_internal_anchor":true,"ref_index":1,"title":"FaSST: Fast Sparsifying Secondary Transform","work_id":"6485b07b-2706-4655-b1ba-080584dd46b6","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"coefficient dropping","work_id":"daa4b745-907a-46a8-a1e7-8be3268033a8","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Moreover, KLTs and their approx- imations do not account for quantization effects","work_id":"32914eb2-603e-4dc4-997e-77857707104a","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"given the coefficients{ ˆyi}me i=1, we optimize the transform: min SJ meX i=1 ∥ˆxi −S J ˆyi∥2 2 s.t.S J = JY j=1 G(mj, nj, θj).(6) It can be shown that the above problem is equivalent to max SJ tr(ΓSJ","work_id":"2a6613c9-a683-432d-bf02-6fb652829533","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Specifically, images from the CLIC dataset [20] are compressed using A V2, and residual blocks of sizes 8×8,16×16, and32×32are collected","work_id":"f1d6bab2-57ce-4e98-9619-0aa7ba28d155","year":null}],"snapshot_sha256":"2f10db13debd16dbfe3be60d95cebdb9199a07adaded0922e528887e3888c443"},"source":{"id":"2605.15086","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:14:30.967662Z","id":"5faa7d63-ed01-46d1-93fa-4c4686ae032f","model_set":{"reader":"grok-4.3"},"one_line_summary":"FaSST approximates sparse orthonormal transforms with mode-adaptive Givens rotation sequences to produce low-complexity secondary transforms for AV2 intra residuals that match LFNST rate-distortion performance at 83.67% lower complexity and deliver up to 1.80% BD-rate savings.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"FaSST factorizes data-driven secondary transforms into mode-adaptive Givens rotations to match LFNST performance at far lower complexity.","strongest_claim":"Mode-adaptive FaSST matches the RD performance of LFNST while reducing the number of computations by 83.67%. Moreover, by avoiding fixed-coefficient truncation, FaSST achieves up to 1.80% BD-rate savings relative to LFNST while operating at 66.24% lower complexity.","weakest_assumption":"That the alternating-minimization procedure combined with approximate Givens factorization produces transforms whose rate-distortion performance remains close to the original data-driven SOTs across the full range of intra prediction modes and content types used in AV2 testing."}},"verdict_id":"5faa7d63-ed01-46d1-93fa-4c4686ae032f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5b77d6b1b0eb0e55c9249fd57a6fa8aca93d88fe229ab8ba2b75fbbac5e58d17","target":"record","created_at":"2026-05-17T21:18:33Z","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":"e707a7a8d3972a515746bf548f4366c9700f094b5ddc9d65d9e5d489498bdab7","cross_cats_sorted":["eess.SP"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-14T17:08:16Z","title_canon_sha256":"64425464d993df606cc7fc6ed995be1bdfc2981b5bd8b3935f2df2fce82a1915"},"schema_version":"1.0","source":{"id":"2605.15086","kind":"arxiv","version":1}},"canonical_sha256":"62d23ffa4b1750cd94c56a64c63b217d7b1515c2ca3930b1b4b07f35d8e88265","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62d23ffa4b1750cd94c56a64c63b217d7b1515c2ca3930b1b4b07f35d8e88265","first_computed_at":"2026-05-17T21:40:25.953441Z","kind":"pith_receipt","last_reissued_at":"2026-05-17T21:57:19.265601Z","receipt_version":"0.2","signature_status":"unsigned_v0"},"source_id":"2605.15086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b77d6b1b0eb0e55c9249fd57a6fa8aca93d88fe229ab8ba2b75fbbac5e58d17","sha256:fa81b1260abf495d94a0032c48bf63ddfff5ba2d4e8777e246f19e801a67382b"],"state_sha256":"d61f4d4f20ab1ff5e987e444522e1ad15b5ac47d27287ae4c2eba77a573fc381"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0Bah+0CfmLG+SSGOlhnnnNHhE+Be9DdxDbUjUnCzntRgGcAc4X9YfpUKrAOJEITZ82/3GvZI8BV0MudzLOHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T06:58:18.905266Z","bundle_sha256":"cfd6c6c4d4d99d2c712ee4d46bcda30ec92fc6cf1f474a21f69cba72d1f5febf"}}