{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q7QWPHWUFO2XEYU3HVJ4OYJSJW","short_pith_number":"pith:Q7QWPHWU","schema_version":"1.0","canonical_sha256":"87e1679ed42bb572629b3d53c761324dac6f3f872b4e85c97682d3b0a6bcec10","source":{"kind":"arxiv","id":"2012.06660","version":4},"attestation_state":"computed","paper":{"title":"Understanding Spectral Graph Neural Network","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Xinye Chen","submitted_at":"2020-12-11T22:09:14Z","abstract_excerpt":"Graph neural networks have developed by leaps and bounds in recent years due to the restriction of traditional convolutional filters on non-Euclidean structured data. Spectral graph theory mainly studies fundamental graph properties using algebraic methods to analyze the spectrum of the adjacency matrix or Laplacian matrix of a graph, which lays the foundation of graph convolutional neural networks. This report is more than notes and self-contained which comes from my Ph.D. first-year report literature review part, it illustrates how the graph convolutional neural network model is motivated by"},"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":"2012.06660","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.SP","submitted_at":"2020-12-11T22:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"98597e3652a172798de5524096a287dfd9d2767e24a714c9a62dbf0e208c9369","abstract_canon_sha256":"17365f0d96fd853e41596d43646571edd98da9e8943fd5d2fb563ccf0d3a4c52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:48:22.207778Z","signature_b64":"IGrGbuPoU3NS2FypM/TAwWMNiiLcgg/znQI0B5xipJngO59EVdUKGueIiIUsTNu+cJteovRlH9bKle/RLYToDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e1679ed42bb572629b3d53c761324dac6f3f872b4e85c97682d3b0a6bcec10","last_reissued_at":"2026-07-05T06:48:22.207300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:48:22.207300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding Spectral Graph Neural Network","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Xinye Chen","submitted_at":"2020-12-11T22:09:14Z","abstract_excerpt":"Graph neural networks have developed by leaps and bounds in recent years due to the restriction of traditional convolutional filters on non-Euclidean structured data. Spectral graph theory mainly studies fundamental graph properties using algebraic methods to analyze the spectrum of the adjacency matrix or Laplacian matrix of a graph, which lays the foundation of graph convolutional neural networks. This report is more than notes and self-contained which comes from my Ph.D. first-year report literature review part, it illustrates how the graph convolutional neural network model is motivated by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.06660","kind":"arxiv","version":4},"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/2012.06660/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":"2012.06660","created_at":"2026-07-05T06:48:22.207365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.06660v4","created_at":"2026-07-05T06:48:22.207365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.06660","created_at":"2026-07-05T06:48:22.207365+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7QWPHWUFO2X","created_at":"2026-07-05T06:48:22.207365+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7QWPHWUFO2XEYU3","created_at":"2026-07-05T06:48:22.207365+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7QWPHWU","created_at":"2026-07-05T06:48:22.207365+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05640","citing_title":"Learnable quantum spectral filters for hybrid graph neural networks","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q7QWPHWUFO2XEYU3HVJ4OYJSJW","json":"https://pith.science/pith/Q7QWPHWUFO2XEYU3HVJ4OYJSJW.json","graph_json":"https://pith.science/api/pith-number/Q7QWPHWUFO2XEYU3HVJ4OYJSJW/graph.json","events_json":"https://pith.science/api/pith-number/Q7QWPHWUFO2XEYU3HVJ4OYJSJW/events.json","paper":"https://pith.science/paper/Q7QWPHWU"},"agent_actions":{"view_html":"https://pith.science/pith/Q7QWPHWUFO2XEYU3HVJ4OYJSJW","download_json":"https://pith.science/pith/Q7QWPHWUFO2XEYU3HVJ4OYJSJW.json","view_paper":"https://pith.science/paper/Q7QWPHWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.06660&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7QWPHWUFO2XEYU3HVJ4OYJSJW/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7QWPHWUFO2XEYU3HVJ4OYJSJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7QWPHWUFO2XEYU3HVJ4OYJSJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7QWPHWUFO2XEYU3HVJ4OYJSJW/action/storage_attestation","attest_author":"https://pith.science/pith/Q7QWPHWUFO2XEYU3HVJ4OYJSJW/action/author_attestation","sign_citation":"https://pith.science/pith/Q7QWPHWUFO2XEYU3HVJ4OYJSJW/action/citation_signature","submit_replication":"https://pith.science/pith/Q7QWPHWUFO2XEYU3HVJ4OYJSJW/action/replication_record"}},"created_at":"2026-07-05T06:48:22.207365+00:00","updated_at":"2026-07-05T06:48:22.207365+00:00"}