{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3LVLRK2X3UTJRHW3E7EMUESCAM","short_pith_number":"pith:3LVLRK2X","schema_version":"1.0","canonical_sha256":"daeab8ab57dd26989edb27c8ca124203317f4dec7374cb8b22b5e790c2429188","source":{"kind":"arxiv","id":"2312.16936","version":2},"attestation_state":"computed","paper":{"title":"A data-dependent regularization method based on the graph Laplacian","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Davide Bianchi, Davide Evangelista, Elena Loli Piccolomini, Marco Donatelli, Stefano Aleotti, Wenbin Li","submitted_at":"2023-12-28T10:13:15Z","abstract_excerpt":"We investigate a variational method for ill-posed problems, named $\\texttt{graphLa+}\\Psi$, which embeds a graph Laplacian operator in the regularization term. The novelty of this method lies in constructing the graph Laplacian based on a preliminary approximation of the solution, which is obtained using any existing reconstruction method $\\Psi$ from the literature. As a result, the regularization term is both dependent on and adaptive to the observed data and noise. We demonstrate that $\\texttt{graphLa+}\\Psi$ is a regularization method and rigorously establish both its convergence and stabilit"},"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":"2312.16936","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2023-12-28T10:13:15Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"29bbfcc31811d44447b9abbdebc81a926a6ef762054bbbfee43fff764c506f97","abstract_canon_sha256":"f3a0d2f0482cf55935ea9c11be0bbea38631e9479c22d05a4573df30302e9953"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:02.058860Z","signature_b64":"CZETfNR6jBOBmPi+kxkVyHq2kaTJ/1INZBc9I6SQJjVGo6AA13n872zeKRy52nVZLlo95h4/pdBKq2iHs9s1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daeab8ab57dd26989edb27c8ca124203317f4dec7374cb8b22b5e790c2429188","last_reissued_at":"2026-07-05T09:23:02.058363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:02.058363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A data-dependent regularization method based on the graph Laplacian","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Davide Bianchi, Davide Evangelista, Elena Loli Piccolomini, Marco Donatelli, Stefano Aleotti, Wenbin Li","submitted_at":"2023-12-28T10:13:15Z","abstract_excerpt":"We investigate a variational method for ill-posed problems, named $\\texttt{graphLa+}\\Psi$, which embeds a graph Laplacian operator in the regularization term. The novelty of this method lies in constructing the graph Laplacian based on a preliminary approximation of the solution, which is obtained using any existing reconstruction method $\\Psi$ from the literature. As a result, the regularization term is both dependent on and adaptive to the observed data and noise. We demonstrate that $\\texttt{graphLa+}\\Psi$ is a regularization method and rigorously establish both its convergence and stabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16936","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.16936/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":"2312.16936","created_at":"2026-07-05T09:23:02.058426+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.16936v2","created_at":"2026-07-05T09:23:02.058426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16936","created_at":"2026-07-05T09:23:02.058426+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LVLRK2X3UTJ","created_at":"2026-07-05T09:23:02.058426+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LVLRK2X3UTJRHW3","created_at":"2026-07-05T09:23:02.058426+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LVLRK2X","created_at":"2026-07-05T09:23:02.058426+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09845","citing_title":"Adaptive Weighted Total Variation boosted by learning techniques in few-view tomographic imaging","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3LVLRK2X3UTJRHW3E7EMUESCAM","json":"https://pith.science/pith/3LVLRK2X3UTJRHW3E7EMUESCAM.json","graph_json":"https://pith.science/api/pith-number/3LVLRK2X3UTJRHW3E7EMUESCAM/graph.json","events_json":"https://pith.science/api/pith-number/3LVLRK2X3UTJRHW3E7EMUESCAM/events.json","paper":"https://pith.science/paper/3LVLRK2X"},"agent_actions":{"view_html":"https://pith.science/pith/3LVLRK2X3UTJRHW3E7EMUESCAM","download_json":"https://pith.science/pith/3LVLRK2X3UTJRHW3E7EMUESCAM.json","view_paper":"https://pith.science/paper/3LVLRK2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.16936&json=true","fetch_graph":"https://pith.science/api/pith-number/3LVLRK2X3UTJRHW3E7EMUESCAM/graph.json","fetch_events":"https://pith.science/api/pith-number/3LVLRK2X3UTJRHW3E7EMUESCAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LVLRK2X3UTJRHW3E7EMUESCAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LVLRK2X3UTJRHW3E7EMUESCAM/action/storage_attestation","attest_author":"https://pith.science/pith/3LVLRK2X3UTJRHW3E7EMUESCAM/action/author_attestation","sign_citation":"https://pith.science/pith/3LVLRK2X3UTJRHW3E7EMUESCAM/action/citation_signature","submit_replication":"https://pith.science/pith/3LVLRK2X3UTJRHW3E7EMUESCAM/action/replication_record"}},"created_at":"2026-07-05T09:23:02.058426+00:00","updated_at":"2026-07-05T09:23:02.058426+00:00"}