{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:77XCDBWWPEZIVVDR6RQGSPRIGL","short_pith_number":"pith:77XCDBWW","canonical_record":{"source":{"id":"2512.14213","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-12-16T09:10:13Z","cross_cats_sorted":[],"title_canon_sha256":"a08314206515f196a6bd9002b14200e472c7bf2771f247893562ccd86f547a51","abstract_canon_sha256":"27c175e2714c190b8d38cbe0565619af1bf0b85481b1bc13a36bbb410431b239"},"schema_version":"1.0"},"canonical_sha256":"ffee2186d679328ad471f460693e2832eb76092865bc828f5e36570113c8622e","source":{"kind":"arxiv","id":"2512.14213","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.14213","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"2512.14213v2","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.14213","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"77XCDBWWPEZI","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"pith_short_16","alias_value":"77XCDBWWPEZIVVDR","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"pith_short_8","alias_value":"77XCDBWW","created_at":"2026-05-27T01:04:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:77XCDBWWPEZIVVDR6RQGSPRIGL","target":"record","payload":{"canonical_record":{"source":{"id":"2512.14213","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-12-16T09:10:13Z","cross_cats_sorted":[],"title_canon_sha256":"a08314206515f196a6bd9002b14200e472c7bf2771f247893562ccd86f547a51","abstract_canon_sha256":"27c175e2714c190b8d38cbe0565619af1bf0b85481b1bc13a36bbb410431b239"},"schema_version":"1.0"},"canonical_sha256":"ffee2186d679328ad471f460693e2832eb76092865bc828f5e36570113c8622e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:04:53.812141Z","signature_b64":"rh/FJeWjJbQNx/8xDAiF87j5WfZQjQRPpE/MSDBHVd4dHAi2kdIq2hhIbAsrdZrG2xH1zsR7tX2BgranR8n0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffee2186d679328ad471f460693e2832eb76092865bc828f5e36570113c8622e","last_reissued_at":"2026-05-27T01:04:53.811641Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:04:53.811641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.14213","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-27T01:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QefwKsu2uf57shTiM96W1xOYJCrdaCdiQAIu5YSzoo2BotQokEUfnF3k+Hzqoz48FD2Q2wYjKOMor53EpJ+gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:07:32.607998Z"},"content_sha256":"3116b25136bef8084458685d711a32db37c9a6523d5bc28c342488b5fe480869","schema_version":"1.0","event_id":"sha256:3116b25136bef8084458685d711a32db37c9a6523d5bc28c342488b5fe480869"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:77XCDBWWPEZIVVDR6RQGSPRIGL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Signal Denoising Using Regularization by Denoising and Its Parameter Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Regularization by denoising adapts to graph signals when common denoisers meet its conditions, improving mean squared error over prior methods.","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Hayate Kojima, Hiroshi Higashi, Yuichi Tanaka","submitted_at":"2025-12-16T09:10:13Z","abstract_excerpt":"In this paper, we propose an interpretable denoising method for graph signals using regularization by denoising (RED). RED is a technique developed for image restoration that uses an efficient (and sometimes black-box) denoiser in the regularization term of the optimization problem. By using RED, optimization problems can be designed with the explicit use of the denoiser, and the gradient of the regularization term can be easily computed under mild conditions. We adapt RED for denoising of graph signals beyond image processing. We show that many graph signal denoisers, including graph neural n"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Denoising experiments for synthetic and real-world datasets show that our proposed method improves signal denoising accuracy in mean squared error compared to existing graph signal denoising methods.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That many graph signal denoisers, including graph neural networks, theoretically or practically satisfy the conditions required for the RED framework to apply.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"RED is adapted to graph signals with deep unrolling for parameter estimation, yielding lower MSE than prior graph denoising methods on synthetic and real data.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Regularization by denoising adapts to graph signals when common denoisers meet its conditions, improving mean squared error over prior methods.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e992ca70de6b506f30b3b784c8cfeef0f6abdf7c3408ab72749e67f895101cb4"},"source":{"id":"2512.14213","kind":"arxiv","version":2},"verdict":{"id":"8f8d4608-2da8-43d9-9fc6-edd3e036c49d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T22:16:02.421220Z","strongest_claim":"Denoising experiments for synthetic and real-world datasets show that our proposed method improves signal denoising accuracy in mean squared error compared to existing graph signal denoising methods.","one_line_summary":"RED is adapted to graph signals with deep unrolling for parameter estimation, yielding lower MSE than prior graph denoising methods on synthetic and real data.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That many graph signal denoisers, including graph neural networks, theoretically or practically satisfy the conditions required for the RED framework to apply.","pith_extraction_headline":"Regularization by denoising adapts to graph signals when common denoisers meet its conditions, improving mean squared error over prior methods."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.14213/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":39,"sample":[{"doi":"10.23919/eusipco63174.2024.10715194","year":2024,"title":"Interpretable Graph Signal Denoising Using Regularization by Denoising","work_id":"de0f2f04-58e1-4ba3-b22e-75731190a8f3","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/msp.2012","year":2012,"title":"The mnist database of handwritten digit images for machine learning research [best of the web].IEEE Signal Processing Magazine, 29(6):141–142","work_id":"98d1f15f-5300-4cb9-a35d-4e238c7cd2ef","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/jproc.2018","year":2018,"title":"Graph Signal Processing: Overview, Challenges, and Applications","work_id":"71d15e00-964a-41a5-9ff2-e2b1e9726889","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/msp.2020.3016908","year":2020,"title":"Sampling Signals on Graphs: From Theory to Applications","work_id":"506ebf9e-5bdb-4caa-8b42-c7a81199c93d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"A Graph Signal Processing Per- spective on Functional Brain Imaging","work_id":"3dcd1f8f-8f5f-4f0c-a0a7-01dc411cb770","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":39,"snapshot_sha256":"94219631df955798db83fd4db77c3556273dcd8b3d73f581594ca1f988f16a78","internal_anchors":2},"formal_canon":{"evidence_count":1,"snapshot_sha256":"fa64dfebd111dd709116b5eeca98d603066577a0e02f20cef280c154ae2f2366"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"8f8d4608-2da8-43d9-9fc6-edd3e036c49d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LF8Bs0EC/16luPB+0dqo4aGyRkgDOpUFcV2fcbHW1g1JWNLUNqKMVROQ7UA8k8GXx4QJdxY2mSkSaNJXzgGKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:07:32.609217Z"},"content_sha256":"6c6c465ab9b880a6329fd299b76149320edb5692a5fa988d84b1866391d746d5","schema_version":"1.0","event_id":"sha256:6c6c465ab9b880a6329fd299b76149320edb5692a5fa988d84b1866391d746d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77XCDBWWPEZIVVDR6RQGSPRIGL/bundle.json","state_url":"https://pith.science/pith/77XCDBWWPEZIVVDR6RQGSPRIGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77XCDBWWPEZIVVDR6RQGSPRIGL/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-06-06T08:07:32Z","links":{"resolver":"https://pith.science/pith/77XCDBWWPEZIVVDR6RQGSPRIGL","bundle":"https://pith.science/pith/77XCDBWWPEZIVVDR6RQGSPRIGL/bundle.json","state":"https://pith.science/pith/77XCDBWWPEZIVVDR6RQGSPRIGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77XCDBWWPEZIVVDR6RQGSPRIGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:77XCDBWWPEZIVVDR6RQGSPRIGL","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":"27c175e2714c190b8d38cbe0565619af1bf0b85481b1bc13a36bbb410431b239","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-12-16T09:10:13Z","title_canon_sha256":"a08314206515f196a6bd9002b14200e472c7bf2771f247893562ccd86f547a51"},"schema_version":"1.0","source":{"id":"2512.14213","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.14213","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"2512.14213v2","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.14213","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"77XCDBWWPEZI","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"pith_short_16","alias_value":"77XCDBWWPEZIVVDR","created_at":"2026-05-27T01:04:53Z"},{"alias_kind":"pith_short_8","alias_value":"77XCDBWW","created_at":"2026-05-27T01:04:53Z"}],"graph_snapshots":[{"event_id":"sha256:6c6c465ab9b880a6329fd299b76149320edb5692a5fa988d84b1866391d746d5","target":"graph","created_at":"2026-05-27T01:04:53Z","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":"Denoising experiments for synthetic and real-world datasets show that our proposed method improves signal denoising accuracy in mean squared error compared to existing graph signal denoising methods."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That many graph signal denoisers, including graph neural networks, theoretically or practically satisfy the conditions required for the RED framework to apply."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"RED is adapted to graph signals with deep unrolling for parameter estimation, yielding lower MSE than prior graph denoising methods on synthetic and real data."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Regularization by denoising adapts to graph signals when common denoisers meet its conditions, improving mean squared error over prior methods."}],"snapshot_sha256":"e992ca70de6b506f30b3b784c8cfeef0f6abdf7c3408ab72749e67f895101cb4"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"fa64dfebd111dd709116b5eeca98d603066577a0e02f20cef280c154ae2f2366"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.14213/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose an interpretable denoising method for graph signals using regularization by denoising (RED). RED is a technique developed for image restoration that uses an efficient (and sometimes black-box) denoiser in the regularization term of the optimization problem. By using RED, optimization problems can be designed with the explicit use of the denoiser, and the gradient of the regularization term can be easily computed under mild conditions. We adapt RED for denoising of graph signals beyond image processing. We show that many graph signal denoisers, including graph neural n","authors_text":"Hayate Kojima, Hiroshi Higashi, Yuichi Tanaka","cross_cats":[],"headline":"Regularization by denoising adapts to graph signals when common denoisers meet its conditions, improving mean squared error over prior methods.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-12-16T09:10:13Z","title":"Graph Signal Denoising Using Regularization by Denoising and Its Parameter Estimation"},"references":{"count":39,"internal_anchors":2,"resolved_work":39,"sample":[{"cited_arxiv_id":"","doi":"10.23919/eusipco63174.2024.10715194","is_internal_anchor":false,"ref_index":1,"title":"Interpretable Graph Signal Denoising Using Regularization by Denoising","work_id":"de0f2f04-58e1-4ba3-b22e-75731190a8f3","year":2024},{"cited_arxiv_id":"","doi":"10.1109/msp.2012","is_internal_anchor":false,"ref_index":2,"title":"The mnist database of handwritten digit images for machine learning research [best of the web].IEEE Signal Processing Magazine, 29(6):141–142","work_id":"98d1f15f-5300-4cb9-a35d-4e238c7cd2ef","year":2012},{"cited_arxiv_id":"","doi":"10.1109/jproc.2018","is_internal_anchor":false,"ref_index":3,"title":"Graph Signal Processing: Overview, Challenges, and Applications","work_id":"71d15e00-964a-41a5-9ff2-e2b1e9726889","year":2018},{"cited_arxiv_id":"","doi":"10.1109/msp.2020.3016908","is_internal_anchor":false,"ref_index":4,"title":"Sampling Signals on Graphs: From Theory to Applications","work_id":"506ebf9e-5bdb-4caa-8b42-c7a81199c93d","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A Graph Signal Processing Per- spective on Functional Brain Imaging","work_id":"3dcd1f8f-8f5f-4f0c-a0a7-01dc411cb770","year":2018}],"snapshot_sha256":"94219631df955798db83fd4db77c3556273dcd8b3d73f581594ca1f988f16a78"},"source":{"id":"2512.14213","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T22:16:02.421220Z","id":"8f8d4608-2da8-43d9-9fc6-edd3e036c49d","model_set":{"reader":"grok-4.3"},"one_line_summary":"RED is adapted to graph signals with deep unrolling for parameter estimation, yielding lower MSE than prior graph denoising methods on synthetic and real data.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Regularization by denoising adapts to graph signals when common denoisers meet its conditions, improving mean squared error over prior methods.","strongest_claim":"Denoising experiments for synthetic and real-world datasets show that our proposed method improves signal denoising accuracy in mean squared error compared to existing graph signal denoising methods.","weakest_assumption":"That many graph signal denoisers, including graph neural networks, theoretically or practically satisfy the conditions required for the RED framework to apply."}},"verdict_id":"8f8d4608-2da8-43d9-9fc6-edd3e036c49d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3116b25136bef8084458685d711a32db37c9a6523d5bc28c342488b5fe480869","target":"record","created_at":"2026-05-27T01:04:53Z","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":"27c175e2714c190b8d38cbe0565619af1bf0b85481b1bc13a36bbb410431b239","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-12-16T09:10:13Z","title_canon_sha256":"a08314206515f196a6bd9002b14200e472c7bf2771f247893562ccd86f547a51"},"schema_version":"1.0","source":{"id":"2512.14213","kind":"arxiv","version":2}},"canonical_sha256":"ffee2186d679328ad471f460693e2832eb76092865bc828f5e36570113c8622e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffee2186d679328ad471f460693e2832eb76092865bc828f5e36570113c8622e","first_computed_at":"2026-05-27T01:04:53.811641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:04:53.811641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rh/FJeWjJbQNx/8xDAiF87j5WfZQjQRPpE/MSDBHVd4dHAi2kdIq2hhIbAsrdZrG2xH1zsR7tX2BgranR8n0Ag==","signature_status":"signed_v1","signed_at":"2026-05-27T01:04:53.812141Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.14213","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3116b25136bef8084458685d711a32db37c9a6523d5bc28c342488b5fe480869","sha256:6c6c465ab9b880a6329fd299b76149320edb5692a5fa988d84b1866391d746d5"],"state_sha256":"29fb23c9d14e5592a56c7b554dcefcc3b06d981f3a5f0d1a28ba09569987716f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQ/H9P2e+eXUMTWZZu8CmfOZEYOnxx1i3VajfxIdhAGo/h9wUekU54FEEUba1is0JbpoyvFK1RtSZ7fnTlTuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:07:32.616643Z","bundle_sha256":"74e7fb2b5c2959cbdef9465ca0f2e0c0ad979c1bc7b64a762df8e58f5173e88d"}}