{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FXHPK4AT72WRRXJ42SNYI7KKDJ","short_pith_number":"pith:FXHPK4AT","schema_version":"1.0","canonical_sha256":"2dcef57013fead18dd3cd49b847d4a1a7371787b96fbe63fcf9aa657e4429ddb","source":{"kind":"arxiv","id":"2403.16358","version":2},"attestation_state":"computed","paper":{"title":"ChebMixer: Efficient Graph Representation Learning with MLP Mixer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Beiji Zou, Haonan Yan, Liming Chen, Qinsong Li, Xiaoyan Kui","submitted_at":"2024-03-25T01:44:34Z","abstract_excerpt":"Graph neural networks have achieved remarkable success in learning graph representations, especially graph Transformer, which has recently shown superior performance on various graph mining tasks. However, graph Transformer generally treats nodes as tokens, which results in quadratic complexity regarding the number of nodes during self-attention computation. The graph MLP Mixer addresses this challenge by using the efficient MLP Mixer technique from computer vision. However, the time-consuming process of extracting graph tokens limits its performance. In this paper, we present a novel architec"},"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":"2403.16358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-03-25T01:44:34Z","cross_cats_sorted":[],"title_canon_sha256":"48a15d522821ea016c740a998fdf6550684ae6bd37ca074ebf049f1ee66714f9","abstract_canon_sha256":"ae38e1b12939b4ac4de84a5563045b54d86e477b75cde742063640d29c480eb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:07.051878Z","signature_b64":"OmyrtdH4DCWgks/NlINthT2VwAPS9rU94nuKGUqkEsC+6FeutndOKicvzHrX9wRnKPrq8HQy646nfRVlKa4WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dcef57013fead18dd3cd49b847d4a1a7371787b96fbe63fcf9aa657e4429ddb","last_reissued_at":"2026-07-05T08:27:07.051472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:07.051472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ChebMixer: Efficient Graph Representation Learning with MLP Mixer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Beiji Zou, Haonan Yan, Liming Chen, Qinsong Li, Xiaoyan Kui","submitted_at":"2024-03-25T01:44:34Z","abstract_excerpt":"Graph neural networks have achieved remarkable success in learning graph representations, especially graph Transformer, which has recently shown superior performance on various graph mining tasks. However, graph Transformer generally treats nodes as tokens, which results in quadratic complexity regarding the number of nodes during self-attention computation. The graph MLP Mixer addresses this challenge by using the efficient MLP Mixer technique from computer vision. However, the time-consuming process of extracting graph tokens limits its performance. In this paper, we present a novel architec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.16358","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/2403.16358/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":"2403.16358","created_at":"2026-07-05T08:27:07.051529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.16358v2","created_at":"2026-07-05T08:27:07.051529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.16358","created_at":"2026-07-05T08:27:07.051529+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXHPK4AT72WR","created_at":"2026-07-05T08:27:07.051529+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXHPK4AT72WRRXJ4","created_at":"2026-07-05T08:27:07.051529+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXHPK4AT","created_at":"2026-07-05T08:27:07.051529+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/FXHPK4AT72WRRXJ42SNYI7KKDJ","json":"https://pith.science/pith/FXHPK4AT72WRRXJ42SNYI7KKDJ.json","graph_json":"https://pith.science/api/pith-number/FXHPK4AT72WRRXJ42SNYI7KKDJ/graph.json","events_json":"https://pith.science/api/pith-number/FXHPK4AT72WRRXJ42SNYI7KKDJ/events.json","paper":"https://pith.science/paper/FXHPK4AT"},"agent_actions":{"view_html":"https://pith.science/pith/FXHPK4AT72WRRXJ42SNYI7KKDJ","download_json":"https://pith.science/pith/FXHPK4AT72WRRXJ42SNYI7KKDJ.json","view_paper":"https://pith.science/paper/FXHPK4AT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.16358&json=true","fetch_graph":"https://pith.science/api/pith-number/FXHPK4AT72WRRXJ42SNYI7KKDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FXHPK4AT72WRRXJ42SNYI7KKDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXHPK4AT72WRRXJ42SNYI7KKDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXHPK4AT72WRRXJ42SNYI7KKDJ/action/storage_attestation","attest_author":"https://pith.science/pith/FXHPK4AT72WRRXJ42SNYI7KKDJ/action/author_attestation","sign_citation":"https://pith.science/pith/FXHPK4AT72WRRXJ42SNYI7KKDJ/action/citation_signature","submit_replication":"https://pith.science/pith/FXHPK4AT72WRRXJ42SNYI7KKDJ/action/replication_record"}},"created_at":"2026-07-05T08:27:07.051529+00:00","updated_at":"2026-07-05T08:27:07.051529+00:00"}