{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IJSHGTACK5IPNN5R6YATQKBXKO","short_pith_number":"pith:IJSHGTAC","schema_version":"1.0","canonical_sha256":"4264734c025750f6b7b1f6013828375383c27e9a4c8f5d36b4966d68176dce1d","source":{"kind":"arxiv","id":"2607.17313","version":1},"attestation_state":"computed","paper":{"title":"Iterated graph Laplacian for image restoration problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Davide Bianchi, Florian Bossmann, Marco Donatelli, Pietro Maurino, Stefano Aleotti","submitted_at":"2026-07-19T15:59:30Z","abstract_excerpt":"We study the graph Laplacian operator as a regularizer in a generalized Tikhonov framework for linear ill-posed problems. The Laplacian is updated iteratively from the current reconstruction, so that progressively sharper structural information about the solution is fed into the regularization term. We introduce three schemes: a standard one that rebuilds the Laplacian from each new iterate; an error-equation scheme that, following the error-based formulation of iterated Tikhonov regularization, builds the Laplacian from an estimate of the reconstruction error rather than of the image itself; "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.17313","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-19T15:59:30Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"f36ba59a91bc837d71398d11fb780fb6f0603ef1ccf89c586ba2ad3fcd667797","abstract_canon_sha256":"381265d03af6277da1f6bbf91abae29cc0dbb7d9ba2cbdbadd27849dd2bf71e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:26.840942Z","signature_b64":"9jYmMoMNl5soz/QafDqc/GnjmiTPo5y5lW0qKy5x8s0ARxxYlDz7tjiiEEGlRWgfkPUnx+jNn9YwfgphvCETCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4264734c025750f6b7b1f6013828375383c27e9a4c8f5d36b4966d68176dce1d","last_reissued_at":"2026-07-21T01:21:26.840095Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:26.840095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterated graph Laplacian for image restoration problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Davide Bianchi, Florian Bossmann, Marco Donatelli, Pietro Maurino, Stefano Aleotti","submitted_at":"2026-07-19T15:59:30Z","abstract_excerpt":"We study the graph Laplacian operator as a regularizer in a generalized Tikhonov framework for linear ill-posed problems. The Laplacian is updated iteratively from the current reconstruction, so that progressively sharper structural information about the solution is fed into the regularization term. We introduce three schemes: a standard one that rebuilds the Laplacian from each new iterate; an error-equation scheme that, following the error-based formulation of iterated Tikhonov regularization, builds the Laplacian from an estimate of the reconstruction error rather than of the image itself; "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17313","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/2607.17313/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.17313","created_at":"2026-07-21T01:21:26.840539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.17313v1","created_at":"2026-07-21T01:21:26.840539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17313","created_at":"2026-07-21T01:21:26.840539+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJSHGTACK5IP","created_at":"2026-07-21T01:21:26.840539+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJSHGTACK5IPNN5R","created_at":"2026-07-21T01:21:26.840539+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJSHGTAC","created_at":"2026-07-21T01:21:26.840539+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IJSHGTACK5IPNN5R6YATQKBXKO","json":"https://pith.science/pith/IJSHGTACK5IPNN5R6YATQKBXKO.json","graph_json":"https://pith.science/api/pith-number/IJSHGTACK5IPNN5R6YATQKBXKO/graph.json","events_json":"https://pith.science/api/pith-number/IJSHGTACK5IPNN5R6YATQKBXKO/events.json","paper":"https://pith.science/paper/IJSHGTAC"},"agent_actions":{"view_html":"https://pith.science/pith/IJSHGTACK5IPNN5R6YATQKBXKO","download_json":"https://pith.science/pith/IJSHGTACK5IPNN5R6YATQKBXKO.json","view_paper":"https://pith.science/paper/IJSHGTAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.17313&json=true","fetch_graph":"https://pith.science/api/pith-number/IJSHGTACK5IPNN5R6YATQKBXKO/graph.json","fetch_events":"https://pith.science/api/pith-number/IJSHGTACK5IPNN5R6YATQKBXKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJSHGTACK5IPNN5R6YATQKBXKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJSHGTACK5IPNN5R6YATQKBXKO/action/storage_attestation","attest_author":"https://pith.science/pith/IJSHGTACK5IPNN5R6YATQKBXKO/action/author_attestation","sign_citation":"https://pith.science/pith/IJSHGTACK5IPNN5R6YATQKBXKO/action/citation_signature","submit_replication":"https://pith.science/pith/IJSHGTACK5IPNN5R6YATQKBXKO/action/replication_record"}},"created_at":"2026-07-21T01:21:26.840539+00:00","updated_at":"2026-07-21T01:21:26.840539+00:00"}