{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LKBOZYZHMO6NZN53AKGGCQILJ4","short_pith_number":"pith:LKBOZYZH","schema_version":"1.0","canonical_sha256":"5a82ece32763bcdcb7bb028c61410b4f0ae13c4d60ed1c7ae395859bd5a762e4","source":{"kind":"arxiv","id":"2605.25348","version":1},"attestation_state":"computed","paper":{"title":"Parameter-Efficient CT Reconstruction via Deep Graph Laplacian Regularization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG","cs.SC"],"primary_cat":"eess.IV","authors_text":"Chinthaka Dinesh, Qurat-ul-Ain Azim, Veera Varuni Radhakrishnan","submitted_at":"2026-05-25T02:04:29Z","abstract_excerpt":"Low-dose computed tomography (LDCT) reconstruction faces a critical tradeoff between reconstruction quality and resource requirements. While recent deep learning methods achieve state-of-the-art performance, they typically rely on over 500,000 parameters trained on large-scale datasets exceeding 35,000 scans. This work investigates whether graph-based regularization can provide meaningful noise reduction under strict resource constraints. We propose Deep Graph Laplacian Regularization (Deep GLR), integrating quadratic graph regularization into a Proximal Forward-Backward Splitting optimization"},"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":"2605.25348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.IV","submitted_at":"2026-05-25T02:04:29Z","cross_cats_sorted":["cs.AI","cs.CV","cs.LG","cs.SC"],"title_canon_sha256":"c7aaca689863a5788cb57755efc38494b8c553d379e34b341b1c61cba0a4f3dc","abstract_canon_sha256":"f973d9af23fb6efada8db8c4364005ffa82b1948bfb1e7c3574a2eb10ff47245"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:30.340070Z","signature_b64":"5FfsXmqJwnxFepxWPTzvfPlCdF+r/tBdvv3YUfaEweOBq7+jCYyeQkL23xE8S5kooT99eGAkp+W1Ir0QyIr3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a82ece32763bcdcb7bb028c61410b4f0ae13c4d60ed1c7ae395859bd5a762e4","last_reissued_at":"2026-05-26T02:04:30.339385Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:30.339385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameter-Efficient CT Reconstruction via Deep Graph Laplacian Regularization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG","cs.SC"],"primary_cat":"eess.IV","authors_text":"Chinthaka Dinesh, Qurat-ul-Ain Azim, Veera Varuni Radhakrishnan","submitted_at":"2026-05-25T02:04:29Z","abstract_excerpt":"Low-dose computed tomography (LDCT) reconstruction faces a critical tradeoff between reconstruction quality and resource requirements. While recent deep learning methods achieve state-of-the-art performance, they typically rely on over 500,000 parameters trained on large-scale datasets exceeding 35,000 scans. This work investigates whether graph-based regularization can provide meaningful noise reduction under strict resource constraints. We propose Deep Graph Laplacian Regularization (Deep GLR), integrating quadratic graph regularization into a Proximal Forward-Backward Splitting optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25348","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/2605.25348/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":"2605.25348","created_at":"2026-05-26T02:04:30.339492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25348v1","created_at":"2026-05-26T02:04:30.339492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25348","created_at":"2026-05-26T02:04:30.339492+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKBOZYZHMO6N","created_at":"2026-05-26T02:04:30.339492+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKBOZYZHMO6NZN53","created_at":"2026-05-26T02:04:30.339492+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKBOZYZH","created_at":"2026-05-26T02:04:30.339492+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/LKBOZYZHMO6NZN53AKGGCQILJ4","json":"https://pith.science/pith/LKBOZYZHMO6NZN53AKGGCQILJ4.json","graph_json":"https://pith.science/api/pith-number/LKBOZYZHMO6NZN53AKGGCQILJ4/graph.json","events_json":"https://pith.science/api/pith-number/LKBOZYZHMO6NZN53AKGGCQILJ4/events.json","paper":"https://pith.science/paper/LKBOZYZH"},"agent_actions":{"view_html":"https://pith.science/pith/LKBOZYZHMO6NZN53AKGGCQILJ4","download_json":"https://pith.science/pith/LKBOZYZHMO6NZN53AKGGCQILJ4.json","view_paper":"https://pith.science/paper/LKBOZYZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25348&json=true","fetch_graph":"https://pith.science/api/pith-number/LKBOZYZHMO6NZN53AKGGCQILJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/LKBOZYZHMO6NZN53AKGGCQILJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKBOZYZHMO6NZN53AKGGCQILJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKBOZYZHMO6NZN53AKGGCQILJ4/action/storage_attestation","attest_author":"https://pith.science/pith/LKBOZYZHMO6NZN53AKGGCQILJ4/action/author_attestation","sign_citation":"https://pith.science/pith/LKBOZYZHMO6NZN53AKGGCQILJ4/action/citation_signature","submit_replication":"https://pith.science/pith/LKBOZYZHMO6NZN53AKGGCQILJ4/action/replication_record"}},"created_at":"2026-05-26T02:04:30.339492+00:00","updated_at":"2026-05-26T02:04:30.339492+00:00"}