{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YQYFSONXS3J3BUCHHMUAMDXDYK","short_pith_number":"pith:YQYFSONX","schema_version":"1.0","canonical_sha256":"c4305939b796d3b0d0473b28060ee3c28322aed65b9057b8cf5b9d54c6da1733","source":{"kind":"arxiv","id":"2408.08583","version":1},"attestation_state":"computed","paper":{"title":"GrassNet: State Space Model Meets Graph Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Congyan Lang, Gongpei Zhao, Haibin Ling, Tao Wang, Yidong Li, Yi Jin","submitted_at":"2024-08-16T07:33:58Z","abstract_excerpt":"Designing spectral convolutional networks is a formidable task in graph learning. In traditional spectral graph neural networks (GNNs), polynomial-based methods are commonly used to design filters via the Laplacian matrix. In practical applications, however, these polynomial methods encounter inherent limitations, which primarily arise from the the low-order truncation of polynomial filters and the lack of overall modeling of the graph spectrum. This leads to poor performance of existing spectral approaches on real-world graph data, especially when the spectrum is highly concentrated or contai"},"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":"2408.08583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-16T07:33:58Z","cross_cats_sorted":[],"title_canon_sha256":"3a726aa66569a593b62a04befaf0ce5d5a1ccae8642417653c149775faa9dbeb","abstract_canon_sha256":"8d1c0e0d226572fe26ec3cfa9b4b1492b72d7ec8fda221a88221f102150f9547"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:55:56.960724Z","signature_b64":"6utrgpUsV6/T83L6OykD+MoEA9yUKfNYLS/xr9K4qZY1Rhyt467BIGXqIAp+pJUeCjAaKK0ktKSwQSShqqBdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4305939b796d3b0d0473b28060ee3c28322aed65b9057b8cf5b9d54c6da1733","last_reissued_at":"2026-07-05T08:55:56.960306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:55:56.960306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GrassNet: State Space Model Meets Graph Neural Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Congyan Lang, Gongpei Zhao, Haibin Ling, Tao Wang, Yidong Li, Yi Jin","submitted_at":"2024-08-16T07:33:58Z","abstract_excerpt":"Designing spectral convolutional networks is a formidable task in graph learning. In traditional spectral graph neural networks (GNNs), polynomial-based methods are commonly used to design filters via the Laplacian matrix. In practical applications, however, these polynomial methods encounter inherent limitations, which primarily arise from the the low-order truncation of polynomial filters and the lack of overall modeling of the graph spectrum. This leads to poor performance of existing spectral approaches on real-world graph data, especially when the spectrum is highly concentrated or contai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08583","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/2408.08583/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":"2408.08583","created_at":"2026-07-05T08:55:56.960374+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.08583v1","created_at":"2026-07-05T08:55:56.960374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08583","created_at":"2026-07-05T08:55:56.960374+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQYFSONXS3J3","created_at":"2026-07-05T08:55:56.960374+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQYFSONXS3J3BUCH","created_at":"2026-07-05T08:55:56.960374+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQYFSONX","created_at":"2026-07-05T08:55:56.960374+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18728","citing_title":"Message-Passing State-Space Models: Improving Graph Learning with Modern Sequence Modeling","ref_index":121,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YQYFSONXS3J3BUCHHMUAMDXDYK","json":"https://pith.science/pith/YQYFSONXS3J3BUCHHMUAMDXDYK.json","graph_json":"https://pith.science/api/pith-number/YQYFSONXS3J3BUCHHMUAMDXDYK/graph.json","events_json":"https://pith.science/api/pith-number/YQYFSONXS3J3BUCHHMUAMDXDYK/events.json","paper":"https://pith.science/paper/YQYFSONX"},"agent_actions":{"view_html":"https://pith.science/pith/YQYFSONXS3J3BUCHHMUAMDXDYK","download_json":"https://pith.science/pith/YQYFSONXS3J3BUCHHMUAMDXDYK.json","view_paper":"https://pith.science/paper/YQYFSONX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.08583&json=true","fetch_graph":"https://pith.science/api/pith-number/YQYFSONXS3J3BUCHHMUAMDXDYK/graph.json","fetch_events":"https://pith.science/api/pith-number/YQYFSONXS3J3BUCHHMUAMDXDYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQYFSONXS3J3BUCHHMUAMDXDYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQYFSONXS3J3BUCHHMUAMDXDYK/action/storage_attestation","attest_author":"https://pith.science/pith/YQYFSONXS3J3BUCHHMUAMDXDYK/action/author_attestation","sign_citation":"https://pith.science/pith/YQYFSONXS3J3BUCHHMUAMDXDYK/action/citation_signature","submit_replication":"https://pith.science/pith/YQYFSONXS3J3BUCHHMUAMDXDYK/action/replication_record"}},"created_at":"2026-07-05T08:55:56.960374+00:00","updated_at":"2026-07-05T08:55:56.960374+00:00"}