{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KABJIOMQKRDVYOFS6F7VMUKVGY","short_pith_number":"pith:KABJIOMQ","schema_version":"1.0","canonical_sha256":"500294399054475c38b2f17f565155363ef87a0f7e071a59a72957999a3bf599","source":{"kind":"arxiv","id":"2011.04055","version":2},"attestation_state":"computed","paper":{"title":"Fourier-based and Rational Graph Filters for Spectral Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.LG","authors_text":"Giuseppe Patan\\`e","submitted_at":"2020-11-08T19:02:52Z","abstract_excerpt":"Data are represented as graphs in a wide range of applications, such as Computer Vision (e.g., images) and Graphics (e.g., 3D meshes), network analysis (e.g., social networks), and bio-informatics (e.g., molecules). In this context, our overall goal is the definition of novel Fourier-based and graph filters induced by rational polynomials for graph processing, which generalise polynomial filters and the Fourier transform to non-Euclidean domains. For the efficient evaluation of discrete spectral Fourier-based and wavelet operators, we introduce a spectrum-free approach, which requires the solu"},"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":"2011.04055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-08T19:02:52Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"69c904aa61943fb2982c7be43acf0b1d95ab36090628535f5c0d1ad716fecaca","abstract_canon_sha256":"206bc1cb56446ae6000401db52b0917ea579571fef3ad006aed7390f2782e147"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:43.235484Z","signature_b64":"vGQjt3BndHdXjBFhHnXxf1X5aXjGWWjH1uQmuSt98zs5VnDCFsma8YBIV8lVA6OvHnl3dzgbScya7SBw4OwLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"500294399054475c38b2f17f565155363ef87a0f7e071a59a72957999a3bf599","last_reissued_at":"2026-07-05T02:34:43.234995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:43.234995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fourier-based and Rational Graph Filters for Spectral Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.LG","authors_text":"Giuseppe Patan\\`e","submitted_at":"2020-11-08T19:02:52Z","abstract_excerpt":"Data are represented as graphs in a wide range of applications, such as Computer Vision (e.g., images) and Graphics (e.g., 3D meshes), network analysis (e.g., social networks), and bio-informatics (e.g., molecules). In this context, our overall goal is the definition of novel Fourier-based and graph filters induced by rational polynomials for graph processing, which generalise polynomial filters and the Fourier transform to non-Euclidean domains. For the efficient evaluation of discrete spectral Fourier-based and wavelet operators, we introduce a spectrum-free approach, which requires the solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04055","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.04055/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":"2011.04055","created_at":"2026-07-05T02:34:43.235050+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.04055v2","created_at":"2026-07-05T02:34:43.235050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04055","created_at":"2026-07-05T02:34:43.235050+00:00"},{"alias_kind":"pith_short_12","alias_value":"KABJIOMQKRDV","created_at":"2026-07-05T02:34:43.235050+00:00"},{"alias_kind":"pith_short_16","alias_value":"KABJIOMQKRDVYOFS","created_at":"2026-07-05T02:34:43.235050+00:00"},{"alias_kind":"pith_short_8","alias_value":"KABJIOMQ","created_at":"2026-07-05T02:34:43.235050+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KABJIOMQKRDVYOFS6F7VMUKVGY","json":"https://pith.science/pith/KABJIOMQKRDVYOFS6F7VMUKVGY.json","graph_json":"https://pith.science/api/pith-number/KABJIOMQKRDVYOFS6F7VMUKVGY/graph.json","events_json":"https://pith.science/api/pith-number/KABJIOMQKRDVYOFS6F7VMUKVGY/events.json","paper":"https://pith.science/paper/KABJIOMQ"},"agent_actions":{"view_html":"https://pith.science/pith/KABJIOMQKRDVYOFS6F7VMUKVGY","download_json":"https://pith.science/pith/KABJIOMQKRDVYOFS6F7VMUKVGY.json","view_paper":"https://pith.science/paper/KABJIOMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.04055&json=true","fetch_graph":"https://pith.science/api/pith-number/KABJIOMQKRDVYOFS6F7VMUKVGY/graph.json","fetch_events":"https://pith.science/api/pith-number/KABJIOMQKRDVYOFS6F7VMUKVGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KABJIOMQKRDVYOFS6F7VMUKVGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KABJIOMQKRDVYOFS6F7VMUKVGY/action/storage_attestation","attest_author":"https://pith.science/pith/KABJIOMQKRDVYOFS6F7VMUKVGY/action/author_attestation","sign_citation":"https://pith.science/pith/KABJIOMQKRDVYOFS6F7VMUKVGY/action/citation_signature","submit_replication":"https://pith.science/pith/KABJIOMQKRDVYOFS6F7VMUKVGY/action/replication_record"}},"created_at":"2026-07-05T02:34:43.235050+00:00","updated_at":"2026-07-05T02:34:43.235050+00:00"}