{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DDXL5BJBITXUMPY2BDQC47R5RI","short_pith_number":"pith:DDXL5BJB","schema_version":"1.0","canonical_sha256":"18eebe852144ef463f1a08e02e7e3d8a3e5d78b79d785c50ad73706f7adfb189","source":{"kind":"arxiv","id":"2404.04559","version":1},"attestation_state":"computed","paper":{"title":"Spectral GNN via Two-dimensional (2-D) Graph Convolution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","eess.SP","math.NA"],"primary_cat":"cs.LG","authors_text":"Dongsheng Luo, Guoming Li, Jian Yang, Shangsong Liang","submitted_at":"2024-04-06T08:53:26Z","abstract_excerpt":"Spectral Graph Neural Networks (GNNs) have achieved tremendous success in graph learning. As an essential part of spectral GNNs, spectral graph convolution extracts crucial frequency information in graph data, leading to superior performance of spectral GNNs in downstream tasks. However, in this paper, we show that existing spectral GNNs remain critical drawbacks in performing the spectral graph convolution. Specifically, considering the spectral graph convolution as a construction operation towards target output, we prove that existing popular convolution paradigms cannot construct the target"},"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":"2404.04559","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-06T08:53:26Z","cross_cats_sorted":["cs.NA","eess.SP","math.NA"],"title_canon_sha256":"871bd82e0bee960fd8bb91ede3d36442827489c3864bbdf4b2e08cee707c5483","abstract_canon_sha256":"64698bd637f583ae7ab440b7ac5d6c5f209e099e5eafb380e464cc6bd078d73d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:05:18.408372Z","signature_b64":"dNaNNqGZJ2O65KCs4AUDu8nznyfVchnQDVnlAD/58E34pd77f+iiKZe7ly5dPcb33+IhOfNVd0Og83w1bj0hBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18eebe852144ef463f1a08e02e7e3d8a3e5d78b79d785c50ad73706f7adfb189","last_reissued_at":"2026-07-05T08:05:18.407995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:05:18.407995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral GNN via Two-dimensional (2-D) Graph Convolution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","eess.SP","math.NA"],"primary_cat":"cs.LG","authors_text":"Dongsheng Luo, Guoming Li, Jian Yang, Shangsong Liang","submitted_at":"2024-04-06T08:53:26Z","abstract_excerpt":"Spectral Graph Neural Networks (GNNs) have achieved tremendous success in graph learning. As an essential part of spectral GNNs, spectral graph convolution extracts crucial frequency information in graph data, leading to superior performance of spectral GNNs in downstream tasks. However, in this paper, we show that existing spectral GNNs remain critical drawbacks in performing the spectral graph convolution. Specifically, considering the spectral graph convolution as a construction operation towards target output, we prove that existing popular convolution paradigms cannot construct the target"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04559","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/2404.04559/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":"2404.04559","created_at":"2026-07-05T08:05:18.408047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.04559v1","created_at":"2026-07-05T08:05:18.408047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04559","created_at":"2026-07-05T08:05:18.408047+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDXL5BJBITXU","created_at":"2026-07-05T08:05:18.408047+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDXL5BJBITXUMPY2","created_at":"2026-07-05T08:05:18.408047+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDXL5BJB","created_at":"2026-07-05T08:05:18.408047+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14033","citing_title":"Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDXL5BJBITXUMPY2BDQC47R5RI","json":"https://pith.science/pith/DDXL5BJBITXUMPY2BDQC47R5RI.json","graph_json":"https://pith.science/api/pith-number/DDXL5BJBITXUMPY2BDQC47R5RI/graph.json","events_json":"https://pith.science/api/pith-number/DDXL5BJBITXUMPY2BDQC47R5RI/events.json","paper":"https://pith.science/paper/DDXL5BJB"},"agent_actions":{"view_html":"https://pith.science/pith/DDXL5BJBITXUMPY2BDQC47R5RI","download_json":"https://pith.science/pith/DDXL5BJBITXUMPY2BDQC47R5RI.json","view_paper":"https://pith.science/paper/DDXL5BJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.04559&json=true","fetch_graph":"https://pith.science/api/pith-number/DDXL5BJBITXUMPY2BDQC47R5RI/graph.json","fetch_events":"https://pith.science/api/pith-number/DDXL5BJBITXUMPY2BDQC47R5RI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDXL5BJBITXUMPY2BDQC47R5RI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDXL5BJBITXUMPY2BDQC47R5RI/action/storage_attestation","attest_author":"https://pith.science/pith/DDXL5BJBITXUMPY2BDQC47R5RI/action/author_attestation","sign_citation":"https://pith.science/pith/DDXL5BJBITXUMPY2BDQC47R5RI/action/citation_signature","submit_replication":"https://pith.science/pith/DDXL5BJBITXUMPY2BDQC47R5RI/action/replication_record"}},"created_at":"2026-07-05T08:05:18.408047+00:00","updated_at":"2026-07-05T08:05:18.408047+00:00"}