{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GE46KO4GJJFLOZ34KHMMA5UGP6","short_pith_number":"pith:GE46KO4G","schema_version":"1.0","canonical_sha256":"3139e53b864a4ab7677c51d8c076867f9eb468483b21598e0396bbfd59d597b8","source":{"kind":"arxiv","id":"1808.03004","version":1},"attestation_state":"computed","paper":{"title":"Advances in Distributed Graph Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Elvin Isufi, Geert Leus, Mario Coutino","submitted_at":"2018-08-09T03:01:44Z","abstract_excerpt":"Graph filters are one of the core tools in graph signal processing. A central aspect of them is their direct distributed implementation. However, the filtering performance is often traded with distributed communication and computational savings. To improve this tradeoff, this work generalizes state-of-the-art distributed graph filters to filters where every node weights the signal of its neighbors with different values while keeping the aggregation operation linear. This new implementation, labeled as edge-variant graph filter, yields a significant reduction in terms of communication rounds wh"},"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":"1808.03004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-08-09T03:01:44Z","cross_cats_sorted":[],"title_canon_sha256":"eb4f39cf4ebb17d59f4779a46c9f8b62eaf92f07a8611c00fb835c2d8fa47e92","abstract_canon_sha256":"c8fba066f8d3247b13885325770c1cfa8f922b53d1f5e9b3b2f019167eda71e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:20.667991Z","signature_b64":"g8WdH+SrsYu9Tdg4/2HsiFuma7mJtqhiQJ0P/vnIjJg8eYTB0yqbapkErG2C2u08ocaN0f4VANAQvaCB+9BIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3139e53b864a4ab7677c51d8c076867f9eb468483b21598e0396bbfd59d597b8","last_reissued_at":"2026-05-17T23:47:20.667520Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:20.667520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advances in Distributed Graph Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Elvin Isufi, Geert Leus, Mario Coutino","submitted_at":"2018-08-09T03:01:44Z","abstract_excerpt":"Graph filters are one of the core tools in graph signal processing. A central aspect of them is their direct distributed implementation. However, the filtering performance is often traded with distributed communication and computational savings. To improve this tradeoff, this work generalizes state-of-the-art distributed graph filters to filters where every node weights the signal of its neighbors with different values while keeping the aggregation operation linear. This new implementation, labeled as edge-variant graph filter, yields a significant reduction in terms of communication rounds wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03004","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":""},"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":"1808.03004","created_at":"2026-05-17T23:47:20.667590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03004v1","created_at":"2026-05-17T23:47:20.667590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03004","created_at":"2026-05-17T23:47:20.667590+00:00"},{"alias_kind":"pith_short_12","alias_value":"GE46KO4GJJFL","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GE46KO4GJJFLOZ34","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GE46KO4G","created_at":"2026-05-18T12:32:25.280505+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/GE46KO4GJJFLOZ34KHMMA5UGP6","json":"https://pith.science/pith/GE46KO4GJJFLOZ34KHMMA5UGP6.json","graph_json":"https://pith.science/api/pith-number/GE46KO4GJJFLOZ34KHMMA5UGP6/graph.json","events_json":"https://pith.science/api/pith-number/GE46KO4GJJFLOZ34KHMMA5UGP6/events.json","paper":"https://pith.science/paper/GE46KO4G"},"agent_actions":{"view_html":"https://pith.science/pith/GE46KO4GJJFLOZ34KHMMA5UGP6","download_json":"https://pith.science/pith/GE46KO4GJJFLOZ34KHMMA5UGP6.json","view_paper":"https://pith.science/paper/GE46KO4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03004&json=true","fetch_graph":"https://pith.science/api/pith-number/GE46KO4GJJFLOZ34KHMMA5UGP6/graph.json","fetch_events":"https://pith.science/api/pith-number/GE46KO4GJJFLOZ34KHMMA5UGP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GE46KO4GJJFLOZ34KHMMA5UGP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GE46KO4GJJFLOZ34KHMMA5UGP6/action/storage_attestation","attest_author":"https://pith.science/pith/GE46KO4GJJFLOZ34KHMMA5UGP6/action/author_attestation","sign_citation":"https://pith.science/pith/GE46KO4GJJFLOZ34KHMMA5UGP6/action/citation_signature","submit_replication":"https://pith.science/pith/GE46KO4GJJFLOZ34KHMMA5UGP6/action/replication_record"}},"created_at":"2026-05-17T23:47:20.667590+00:00","updated_at":"2026-05-17T23:47:20.667590+00:00"}