{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SCZPR5CE4UOEJK42KGOQCWNSNQ","short_pith_number":"pith:SCZPR5CE","schema_version":"1.0","canonical_sha256":"90b2f8f444e51c44ab9a519d0159b26c03223a000f61d76fcc740777104cbc6d","source":{"kind":"arxiv","id":"2101.00079","version":1},"attestation_state":"computed","paper":{"title":"Graph Networks with Spectral Message Passing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jonathan Godwin, Kimberly Stachenfeld, Peter Battaglia","submitted_at":"2020-12-31T21:33:17Z","abstract_excerpt":"Graph Neural Networks (GNNs) are the subject of intense focus by the machine learning community for problems involving relational reasoning. GNNs can be broadly divided into spatial and spectral approaches. Spatial approaches use a form of learned message-passing, in which interactions among vertices are computed locally, and information propagates over longer distances on the graph with greater numbers of message-passing steps. Spectral approaches use eigendecompositions of the graph Laplacian to produce a generalization of spatial convolutions to graph structured data which access informatio"},"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":"2101.00079","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2020-12-31T21:33:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"99d20271cc5885f213f19719e4a8a4c51b14132ec1a5677e8b352851b9698c0f","abstract_canon_sha256":"d0ac6995b78078d3d0b1aa905757a87714355c5a4e38d2d8e57a6247bc6ab09b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:15.353168Z","signature_b64":"RCgOoq29L1knNgdtLnIhrxTJMPnKubwY52sgFH5ZS0S5MEYlC4hxLeS3tBjNjNsh6H05z9ZvOtpISpl5P9GZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90b2f8f444e51c44ab9a519d0159b26c03223a000f61d76fcc740777104cbc6d","last_reissued_at":"2026-07-05T02:04:15.352751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:15.352751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Networks with Spectral Message Passing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jonathan Godwin, Kimberly Stachenfeld, Peter Battaglia","submitted_at":"2020-12-31T21:33:17Z","abstract_excerpt":"Graph Neural Networks (GNNs) are the subject of intense focus by the machine learning community for problems involving relational reasoning. GNNs can be broadly divided into spatial and spectral approaches. Spatial approaches use a form of learned message-passing, in which interactions among vertices are computed locally, and information propagates over longer distances on the graph with greater numbers of message-passing steps. Spectral approaches use eigendecompositions of the graph Laplacian to produce a generalization of spatial convolutions to graph structured data which access informatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00079","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/2101.00079/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":"2101.00079","created_at":"2026-07-05T02:04:15.352811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.00079v1","created_at":"2026-07-05T02:04:15.352811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00079","created_at":"2026-07-05T02:04:15.352811+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCZPR5CE4UOE","created_at":"2026-07-05T02:04:15.352811+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCZPR5CE4UOEJK42","created_at":"2026-07-05T02:04:15.352811+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCZPR5CE","created_at":"2026-07-05T02:04:15.352811+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":86,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08679","citing_title":"Attention-based graph neural networks: a survey","ref_index":180,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SCZPR5CE4UOEJK42KGOQCWNSNQ","json":"https://pith.science/pith/SCZPR5CE4UOEJK42KGOQCWNSNQ.json","graph_json":"https://pith.science/api/pith-number/SCZPR5CE4UOEJK42KGOQCWNSNQ/graph.json","events_json":"https://pith.science/api/pith-number/SCZPR5CE4UOEJK42KGOQCWNSNQ/events.json","paper":"https://pith.science/paper/SCZPR5CE"},"agent_actions":{"view_html":"https://pith.science/pith/SCZPR5CE4UOEJK42KGOQCWNSNQ","download_json":"https://pith.science/pith/SCZPR5CE4UOEJK42KGOQCWNSNQ.json","view_paper":"https://pith.science/paper/SCZPR5CE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.00079&json=true","fetch_graph":"https://pith.science/api/pith-number/SCZPR5CE4UOEJK42KGOQCWNSNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SCZPR5CE4UOEJK42KGOQCWNSNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCZPR5CE4UOEJK42KGOQCWNSNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCZPR5CE4UOEJK42KGOQCWNSNQ/action/storage_attestation","attest_author":"https://pith.science/pith/SCZPR5CE4UOEJK42KGOQCWNSNQ/action/author_attestation","sign_citation":"https://pith.science/pith/SCZPR5CE4UOEJK42KGOQCWNSNQ/action/citation_signature","submit_replication":"https://pith.science/pith/SCZPR5CE4UOEJK42KGOQCWNSNQ/action/replication_record"}},"created_at":"2026-07-05T02:04:15.352811+00:00","updated_at":"2026-07-05T02:04:15.352811+00:00"}