{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4L2XWKUFAZAK6WGDIJ6Z76AUNJ","short_pith_number":"pith:4L2XWKUF","canonical_record":{"source":{"id":"1602.04436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-14T10:14:54Z","cross_cats_sorted":["cs.SY","stat.ML"],"title_canon_sha256":"34b140ba897a181a4e3f9c83e09e775840cc8ba1de72fec119bc5b2143e1d4ed","abstract_canon_sha256":"4bfcd166743c45cc818f03d159e80b6e881f4c1690f2a021ae8c64a21cc7068a"},"schema_version":"1.0"},"canonical_sha256":"e2f57b2a850640af58c3427d9ff8146a4f0c7664480871a679f144618190d3d7","source":{"kind":"arxiv","id":"1602.04436","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04436","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04436v2","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04436","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"pith_short_12","alias_value":"4L2XWKUFAZAK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4L2XWKUFAZAK6WGD","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4L2XWKUF","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4L2XWKUFAZAK6WGDIJ6Z76AUNJ","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-14T10:14:54Z","cross_cats_sorted":["cs.SY","stat.ML"],"title_canon_sha256":"34b140ba897a181a4e3f9c83e09e775840cc8ba1de72fec119bc5b2143e1d4ed","abstract_canon_sha256":"4bfcd166743c45cc818f03d159e80b6e881f4c1690f2a021ae8c64a21cc7068a"},"schema_version":"1.0"},"canonical_sha256":"e2f57b2a850640af58c3427d9ff8146a4f0c7664480871a679f144618190d3d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:09.523304Z","signature_b64":"pjRHImbWO9SZOOYfhJq8yUhN1GCyn5iJRsTg4Mg1UMURmNMj3tZRG5Je/N5pa4jeCayflzXQooPssMv9CKVTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2f57b2a850640af58c3427d9ff8146a4f0c7664480871a679f144618190d3d7","last_reissued_at":"2026-05-18T00:35:09.522845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:09.522845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04436","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+c89cI7j8GiMDh6dXqrCERQU6iys9eTwk8SsNDRAVGTBmvNLjzsCsXOr6DsomGJDQv3GaB2jkNPrkNbL88OCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:07:09.225100Z"},"content_sha256":"a9d6072046b628a98926b22d53f5425c2133f2d80f143b4d0180524e9f367e66","schema_version":"1.0","event_id":"sha256:a9d6072046b628a98926b22d53f5425c2133f2d80f143b4d0180524e9f367e66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4L2XWKUFAZAK6WGDIJ6Z76AUNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Autoregressive Moving Average Graph Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrea Simonetto, Andreas Loukas, Elvin Isufi, Geert Leus","submitted_at":"2016-02-14T10:14:54Z","abstract_excerpt":"One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design philosophy, which allows us to design the ARMA coefficients independently from the underlying graph, rende"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04436","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FonPfb2OW9VpbxAlycGRtRbAO8MQKljQSOHx1xmz6SY8Xlbn2ZZWukt9/bna0LpPi0sRecaAUb9yeWml+JjlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:07:09.225483Z"},"content_sha256":"d9fe3f42afaaf2e97dd14cd135ff3dc7e140c5381c68d313dae450a1ab10e92d","schema_version":"1.0","event_id":"sha256:d9fe3f42afaaf2e97dd14cd135ff3dc7e140c5381c68d313dae450a1ab10e92d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4L2XWKUFAZAK6WGDIJ6Z76AUNJ/bundle.json","state_url":"https://pith.science/pith/4L2XWKUFAZAK6WGDIJ6Z76AUNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4L2XWKUFAZAK6WGDIJ6Z76AUNJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T16:07:09Z","links":{"resolver":"https://pith.science/pith/4L2XWKUFAZAK6WGDIJ6Z76AUNJ","bundle":"https://pith.science/pith/4L2XWKUFAZAK6WGDIJ6Z76AUNJ/bundle.json","state":"https://pith.science/pith/4L2XWKUFAZAK6WGDIJ6Z76AUNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4L2XWKUFAZAK6WGDIJ6Z76AUNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4L2XWKUFAZAK6WGDIJ6Z76AUNJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4bfcd166743c45cc818f03d159e80b6e881f4c1690f2a021ae8c64a21cc7068a","cross_cats_sorted":["cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-14T10:14:54Z","title_canon_sha256":"34b140ba897a181a4e3f9c83e09e775840cc8ba1de72fec119bc5b2143e1d4ed"},"schema_version":"1.0","source":{"id":"1602.04436","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04436","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04436v2","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04436","created_at":"2026-05-18T00:35:09Z"},{"alias_kind":"pith_short_12","alias_value":"4L2XWKUFAZAK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4L2XWKUFAZAK6WGD","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4L2XWKUF","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:d9fe3f42afaaf2e97dd14cd135ff3dc7e140c5381c68d313dae450a1ab10e92d","target":"graph","created_at":"2026-05-18T00:35:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design philosophy, which allows us to design the ARMA coefficients independently from the underlying graph, rende","authors_text":"Andrea Simonetto, Andreas Loukas, Elvin Isufi, Geert Leus","cross_cats":["cs.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-14T10:14:54Z","title":"Autoregressive Moving Average Graph Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04436","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a9d6072046b628a98926b22d53f5425c2133f2d80f143b4d0180524e9f367e66","target":"record","created_at":"2026-05-18T00:35:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4bfcd166743c45cc818f03d159e80b6e881f4c1690f2a021ae8c64a21cc7068a","cross_cats_sorted":["cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-14T10:14:54Z","title_canon_sha256":"34b140ba897a181a4e3f9c83e09e775840cc8ba1de72fec119bc5b2143e1d4ed"},"schema_version":"1.0","source":{"id":"1602.04436","kind":"arxiv","version":2}},"canonical_sha256":"e2f57b2a850640af58c3427d9ff8146a4f0c7664480871a679f144618190d3d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2f57b2a850640af58c3427d9ff8146a4f0c7664480871a679f144618190d3d7","first_computed_at":"2026-05-18T00:35:09.522845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:09.522845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pjRHImbWO9SZOOYfhJq8yUhN1GCyn5iJRsTg4Mg1UMURmNMj3tZRG5Je/N5pa4jeCayflzXQooPssMv9CKVTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:09.523304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04436","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9d6072046b628a98926b22d53f5425c2133f2d80f143b4d0180524e9f367e66","sha256:d9fe3f42afaaf2e97dd14cd135ff3dc7e140c5381c68d313dae450a1ab10e92d"],"state_sha256":"241d9fc753f603e2ecee2e500767a000ae9a7421f3b14a40e23d2c7a44d8ad0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxVksRCWYy2fWUm2iyqReehnWNsTXnvA8Yedx3RNuUmmZ73Gm0HYVck15rAymN5op3nhymlLBgS2CUFypyOGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:07:09.227456Z","bundle_sha256":"e66f3c41a5f45f0c5872c1f4b8272a2fa760969c976120ac6f48edccec8754f1"}}