{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QHFIGDMEYLTLAXUFJ6CEDKI4OY","short_pith_number":"pith:QHFIGDME","schema_version":"1.0","canonical_sha256":"81ca830d84c2e6b05e854f8441a91c763a60ffccb3916714b0fc5f92c8e55478","source":{"kind":"arxiv","id":"1502.02973","version":1},"attestation_state":"computed","paper":{"title":"A Distributed Tracking Algorithm for Reconstruction of Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mengdi Wang, Xiaohan Wang, Yuantao Gu","submitted_at":"2015-02-10T16:33:33Z","abstract_excerpt":"The rapid development of signal processing on graphs provides a new perspective for processing large-scale data associated with irregular domains. In many practical applications, it is necessary to handle massive data sets through complex networks, in which most nodes have limited computing power. Designing efficient distributed algorithms is critical for this task. This paper focuses on the distributed reconstruction of a time-varying bandlimited graph signal based on observations sampled at a subset of selected nodes. A distributed least square reconstruction (DLSR) algorithm is proposed to "},"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":"1502.02973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T16:33:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b9d671535e763fcc0fb25903bf2d5c53d4428a72d019f5276c1b45f154e81139","abstract_canon_sha256":"56c4d49ad9232af9002dd88bd5cf6bfecd7ee1f210ccfcc8c00a9898bfa777f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:46.458370Z","signature_b64":"32j1ZgFi3IdvYWqZgbDh0n/EqSXq4MpgcLVpZ9o6IcnU0ro3gaj8mR/dVKplDgiVmfzsZpA6OdCsGtDJLYWqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81ca830d84c2e6b05e854f8441a91c763a60ffccb3916714b0fc5f92c8e55478","last_reissued_at":"2026-07-05T06:31:46.457923Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:46.457923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Tracking Algorithm for Reconstruction of Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mengdi Wang, Xiaohan Wang, Yuantao Gu","submitted_at":"2015-02-10T16:33:33Z","abstract_excerpt":"The rapid development of signal processing on graphs provides a new perspective for processing large-scale data associated with irregular domains. In many practical applications, it is necessary to handle massive data sets through complex networks, in which most nodes have limited computing power. Designing efficient distributed algorithms is critical for this task. This paper focuses on the distributed reconstruction of a time-varying bandlimited graph signal based on observations sampled at a subset of selected nodes. A distributed least square reconstruction (DLSR) algorithm is proposed to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02973","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/1502.02973/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":"1502.02973","created_at":"2026-07-05T06:31:46.457996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02973v1","created_at":"2026-07-05T06:31:46.457996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02973","created_at":"2026-07-05T06:31:46.457996+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHFIGDMEYLTL","created_at":"2026-07-05T06:31:46.457996+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHFIGDMEYLTLAXUF","created_at":"2026-07-05T06:31:46.457996+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHFIGDME","created_at":"2026-07-05T06:31:46.457996+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/QHFIGDMEYLTLAXUFJ6CEDKI4OY","json":"https://pith.science/pith/QHFIGDMEYLTLAXUFJ6CEDKI4OY.json","graph_json":"https://pith.science/api/pith-number/QHFIGDMEYLTLAXUFJ6CEDKI4OY/graph.json","events_json":"https://pith.science/api/pith-number/QHFIGDMEYLTLAXUFJ6CEDKI4OY/events.json","paper":"https://pith.science/paper/QHFIGDME"},"agent_actions":{"view_html":"https://pith.science/pith/QHFIGDMEYLTLAXUFJ6CEDKI4OY","download_json":"https://pith.science/pith/QHFIGDMEYLTLAXUFJ6CEDKI4OY.json","view_paper":"https://pith.science/paper/QHFIGDME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02973&json=true","fetch_graph":"https://pith.science/api/pith-number/QHFIGDMEYLTLAXUFJ6CEDKI4OY/graph.json","fetch_events":"https://pith.science/api/pith-number/QHFIGDMEYLTLAXUFJ6CEDKI4OY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHFIGDMEYLTLAXUFJ6CEDKI4OY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHFIGDMEYLTLAXUFJ6CEDKI4OY/action/storage_attestation","attest_author":"https://pith.science/pith/QHFIGDMEYLTLAXUFJ6CEDKI4OY/action/author_attestation","sign_citation":"https://pith.science/pith/QHFIGDMEYLTLAXUFJ6CEDKI4OY/action/citation_signature","submit_replication":"https://pith.science/pith/QHFIGDMEYLTLAXUFJ6CEDKI4OY/action/replication_record"}},"created_at":"2026-07-05T06:31:46.457996+00:00","updated_at":"2026-07-05T06:31:46.457996+00:00"}