{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:S7VMHE7XHZMDR4OJF5BF4EDJVB","short_pith_number":"pith:S7VMHE7X","schema_version":"1.0","canonical_sha256":"97eac393f73e5838f1c92f425e1069a850fed7e9d88abfb81cdc6ccde985cb82","source":{"kind":"arxiv","id":"2007.11491","version":1},"attestation_state":"computed","paper":{"title":"Preconditioned Gradient Descent Algorithm for Inverse Filtering on Spatially Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Cheng cheng, Nazar Emirov, Qiyu Sun","submitted_at":"2020-07-22T15:29:00Z","abstract_excerpt":"Graph filters and their inverses have been widely used in denoising, smoothing, sampling, interpolating and learning. Implementation of an inverse filtering procedure on spatially distributed networks (SDNs) is a remarkable challenge, as each agent on an SDN is equipped with a data processing subsystem with limited capacity and a communication subsystem with confined range due to engineering limitations. In this letter, we introduce a preconditioned gradient descent algorithm to implement the inverse filtering procedure associated with a graph filter having small geodesic-width. The proposed a"},"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":"2007.11491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-22T15:29:00Z","cross_cats_sorted":["cs.NA","math.IT","math.NA"],"title_canon_sha256":"a17621a3049d7d6d462d8d4f4ecc1e57cfde0291b0bb38c082cf36d4973ce2cc","abstract_canon_sha256":"2f30dd55b8df4f27036b5353641d1884514a7253b1c3b99e286f62e5fa600795"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:11:56.537067Z","signature_b64":"ITxbcwkEIdjID+qCb/mB0PDhuMzZ0KYJU77iA0etc8RRGKkuhxlQSAgr6tHnoohJLyxR1hFdiDJ/w3cUrXwkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97eac393f73e5838f1c92f425e1069a850fed7e9d88abfb81cdc6ccde985cb82","last_reissued_at":"2026-07-05T02:11:56.536488Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:11:56.536488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preconditioned Gradient Descent Algorithm for Inverse Filtering on Spatially Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Cheng cheng, Nazar Emirov, Qiyu Sun","submitted_at":"2020-07-22T15:29:00Z","abstract_excerpt":"Graph filters and their inverses have been widely used in denoising, smoothing, sampling, interpolating and learning. Implementation of an inverse filtering procedure on spatially distributed networks (SDNs) is a remarkable challenge, as each agent on an SDN is equipped with a data processing subsystem with limited capacity and a communication subsystem with confined range due to engineering limitations. In this letter, we introduce a preconditioned gradient descent algorithm to implement the inverse filtering procedure associated with a graph filter having small geodesic-width. The proposed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11491","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/2007.11491/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":"2007.11491","created_at":"2026-07-05T02:11:56.536570+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.11491v1","created_at":"2026-07-05T02:11:56.536570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11491","created_at":"2026-07-05T02:11:56.536570+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7VMHE7XHZMD","created_at":"2026-07-05T02:11:56.536570+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7VMHE7XHZMDR4OJ","created_at":"2026-07-05T02:11:56.536570+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7VMHE7X","created_at":"2026-07-05T02:11:56.536570+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/S7VMHE7XHZMDR4OJF5BF4EDJVB","json":"https://pith.science/pith/S7VMHE7XHZMDR4OJF5BF4EDJVB.json","graph_json":"https://pith.science/api/pith-number/S7VMHE7XHZMDR4OJF5BF4EDJVB/graph.json","events_json":"https://pith.science/api/pith-number/S7VMHE7XHZMDR4OJF5BF4EDJVB/events.json","paper":"https://pith.science/paper/S7VMHE7X"},"agent_actions":{"view_html":"https://pith.science/pith/S7VMHE7XHZMDR4OJF5BF4EDJVB","download_json":"https://pith.science/pith/S7VMHE7XHZMDR4OJF5BF4EDJVB.json","view_paper":"https://pith.science/paper/S7VMHE7X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.11491&json=true","fetch_graph":"https://pith.science/api/pith-number/S7VMHE7XHZMDR4OJF5BF4EDJVB/graph.json","fetch_events":"https://pith.science/api/pith-number/S7VMHE7XHZMDR4OJF5BF4EDJVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7VMHE7XHZMDR4OJF5BF4EDJVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7VMHE7XHZMDR4OJF5BF4EDJVB/action/storage_attestation","attest_author":"https://pith.science/pith/S7VMHE7XHZMDR4OJF5BF4EDJVB/action/author_attestation","sign_citation":"https://pith.science/pith/S7VMHE7XHZMDR4OJF5BF4EDJVB/action/citation_signature","submit_replication":"https://pith.science/pith/S7VMHE7XHZMDR4OJF5BF4EDJVB/action/replication_record"}},"created_at":"2026-07-05T02:11:56.536570+00:00","updated_at":"2026-07-05T02:11:56.536570+00:00"}