{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HFSXQ6JOKW3EHEQJEJF747ODYB","short_pith_number":"pith:HFSXQ6JO","canonical_record":{"source":{"id":"1502.00592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-02-02T19:39:46Z","cross_cats_sorted":["cs.CV","cs.MM","cs.NA","stat.AP"],"title_canon_sha256":"5deb1d11fe95e5efe19bc977c8ec993cc46e0c080b48e671f941b1a6bb35b02d","abstract_canon_sha256":"b2c5b612bdca2304c4dae1c2612b2571e121b569785c1b280037881b81e44b9d"},"schema_version":"1.0"},"canonical_sha256":"396578792e55b6439209224bfe7dc3c060a92877cb679e6f339f20a345597d62","source":{"kind":"arxiv","id":"1502.00592","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00592","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00592v2","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00592","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"HFSXQ6JOKW3E","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HFSXQ6JOKW3EHEQJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HFSXQ6JO","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HFSXQ6JOKW3EHEQJEJF747ODYB","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-02-02T19:39:46Z","cross_cats_sorted":["cs.CV","cs.MM","cs.NA","stat.AP"],"title_canon_sha256":"5deb1d11fe95e5efe19bc977c8ec993cc46e0c080b48e671f941b1a6bb35b02d","abstract_canon_sha256":"b2c5b612bdca2304c4dae1c2612b2571e121b569785c1b280037881b81e44b9d"},"schema_version":"1.0"},"canonical_sha256":"396578792e55b6439209224bfe7dc3c060a92877cb679e6f339f20a345597d62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:00.252973Z","signature_b64":"Y6FvxBIGXN9BMr55sNYASJWeZdcBwz0ReHcF5lIHe+v2syc9aMuehAZs4874HxJvQbsUPIxTyd97WsaH6THGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"396578792e55b6439209224bfe7dc3c060a92877cb679e6f339f20a345597d62","last_reissued_at":"2026-05-18T01:11:00.252370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:00.252370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00592","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:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5FsAxa/Izjm0Px1ibXR06RWvM3sHWum/o6nrjlQuYK7/2mstaFuGnNsrJ9Lps7XjcpSYl62JaFqCIqS09PIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:52:23.650047Z"},"content_sha256":"3dd482c706f403a5e879dec75e2f9860d7067f13dce520718ad801bf33fc8434","schema_version":"1.0","event_id":"sha256:3dd482c706f403a5e879dec75e2f9860d7067f13dce520718ad801bf33fc8434"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HFSXQ6JOKW3EHEQJEJF747ODYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Class of DCT Approximations Based on the Feig-Winograd Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.MM","cs.NA","stat.AP"],"primary_cat":"stat.ME","authors_text":"C. J. Tablada, F. M. Bayer, R. J. Cintra","submitted_at":"2015-02-02T19:39:46Z","abstract_excerpt":"A new class of matrices based on a parametrization of the Feig-Winograd factorization of 8-point DCT is proposed. Such parametrization induces a matrix subspace, which unifies a number of existing methods for DCT approximation. By solving a comprehensive multicriteria optimization problem, we identified several new DCT approximations. Obtained solutions were sought to possess the following properties: (i) low multiplierless computational complexity, (ii) orthogonality or near orthogonality, (iii) low complexity invertibility, and (iv) close proximity and performance to the exact DCT. Proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00592","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:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UleApZILQ0AKBd/ANiaKcr/C9BRT6m8ku3NxgtR9BapL2srrj/S/jvujlybfvKLLi8AiFS+HsayXHjt1v/IfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:52:23.650757Z"},"content_sha256":"11bc1d5ede4e8693a184fc12c518564a432a0ba69b5fa9786eec28788bf5ae1d","schema_version":"1.0","event_id":"sha256:11bc1d5ede4e8693a184fc12c518564a432a0ba69b5fa9786eec28788bf5ae1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/bundle.json","state_url":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/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-26T06:52:23Z","links":{"resolver":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB","bundle":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/bundle.json","state":"https://pith.science/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFSXQ6JOKW3EHEQJEJF747ODYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HFSXQ6JOKW3EHEQJEJF747ODYB","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":"b2c5b612bdca2304c4dae1c2612b2571e121b569785c1b280037881b81e44b9d","cross_cats_sorted":["cs.CV","cs.MM","cs.NA","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-02-02T19:39:46Z","title_canon_sha256":"5deb1d11fe95e5efe19bc977c8ec993cc46e0c080b48e671f941b1a6bb35b02d"},"schema_version":"1.0","source":{"id":"1502.00592","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00592","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00592v2","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00592","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"HFSXQ6JOKW3E","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HFSXQ6JOKW3EHEQJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HFSXQ6JO","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:11bc1d5ede4e8693a184fc12c518564a432a0ba69b5fa9786eec28788bf5ae1d","target":"graph","created_at":"2026-05-18T01:11:00Z","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":"A new class of matrices based on a parametrization of the Feig-Winograd factorization of 8-point DCT is proposed. Such parametrization induces a matrix subspace, which unifies a number of existing methods for DCT approximation. By solving a comprehensive multicriteria optimization problem, we identified several new DCT approximations. Obtained solutions were sought to possess the following properties: (i) low multiplierless computational complexity, (ii) orthogonality or near orthogonality, (iii) low complexity invertibility, and (iv) close proximity and performance to the exact DCT. Proposed ","authors_text":"C. J. Tablada, F. M. Bayer, R. J. Cintra","cross_cats":["cs.CV","cs.MM","cs.NA","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-02-02T19:39:46Z","title":"A Class of DCT Approximations Based on the Feig-Winograd Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00592","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:3dd482c706f403a5e879dec75e2f9860d7067f13dce520718ad801bf33fc8434","target":"record","created_at":"2026-05-18T01:11:00Z","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":"b2c5b612bdca2304c4dae1c2612b2571e121b569785c1b280037881b81e44b9d","cross_cats_sorted":["cs.CV","cs.MM","cs.NA","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-02-02T19:39:46Z","title_canon_sha256":"5deb1d11fe95e5efe19bc977c8ec993cc46e0c080b48e671f941b1a6bb35b02d"},"schema_version":"1.0","source":{"id":"1502.00592","kind":"arxiv","version":2}},"canonical_sha256":"396578792e55b6439209224bfe7dc3c060a92877cb679e6f339f20a345597d62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"396578792e55b6439209224bfe7dc3c060a92877cb679e6f339f20a345597d62","first_computed_at":"2026-05-18T01:11:00.252370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:00.252370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y6FvxBIGXN9BMr55sNYASJWeZdcBwz0ReHcF5lIHe+v2syc9aMuehAZs4874HxJvQbsUPIxTyd97WsaH6THGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:00.252973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00592","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dd482c706f403a5e879dec75e2f9860d7067f13dce520718ad801bf33fc8434","sha256:11bc1d5ede4e8693a184fc12c518564a432a0ba69b5fa9786eec28788bf5ae1d"],"state_sha256":"e318962070801493fb81213795e106a475d086a8c16612b258188454b7716f35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vtq9rK0/RI5vJg9f4uxzlwTvhpBsM/oXTScxPA8miclnJLew/d6OLSFwAu4jAyW55HMciOQgpUNGcGjZB06UBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:52:23.654509Z","bundle_sha256":"8555b83bdda9e9f55a163e6e79b25424145d5d1b8a1481b0cbb43cc7666e6430"}}