{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5WOS6X2TNDPMANRJSMQOLGG7RQ","short_pith_number":"pith:5WOS6X2T","schema_version":"1.0","canonical_sha256":"ed9d2f5f5368dec036299320e598df8c0711b739a1f1e7e71619743b31fcfb54","source":{"kind":"arxiv","id":"1606.09375","version":3},"attestation_state":"computed","paper":{"title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Micha\\\"el Defferrard, Pierre Vandergheynst, Xavier Bresson","submitted_at":"2016-06-30T07:42:13Z","abstract_excerpt":"In this work, we are interested in generalizing convolutional neural networks (CNNs) from low-dimensional regular grids, where image, video and speech are represented, to high-dimensional irregular domains, such as social networks, brain connectomes or words' embedding, represented by graphs. We present a formulation of CNNs in the context of spectral graph theory, which provides the necessary mathematical background and efficient numerical schemes to design fast localized convolutional filters on graphs. Importantly, the proposed technique offers the same linear computational complexity and c"},"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":"1606.09375","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-30T07:42:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bdb8cebf49da71383c4c2d361c563b4a216ade1320740d8d1b3da58021803b6d","abstract_canon_sha256":"d509e5ed9841d7fd29023a2678ca58d95e72f02bef416f7d3517039121d1aa7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:25.533389Z","signature_b64":"DyrAfJNWUpICGyvABHeAAhRTXM2u7CBnIqlHJgkQMz0OnMsnzho9hmsACPfJ6f0dys79rASHxkNmm+K4G0q+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed9d2f5f5368dec036299320e598df8c0711b739a1f1e7e71619743b31fcfb54","last_reissued_at":"2026-05-18T00:51:25.532714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:25.532714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Micha\\\"el Defferrard, Pierre Vandergheynst, Xavier Bresson","submitted_at":"2016-06-30T07:42:13Z","abstract_excerpt":"In this work, we are interested in generalizing convolutional neural networks (CNNs) from low-dimensional regular grids, where image, video and speech are represented, to high-dimensional irregular domains, such as social networks, brain connectomes or words' embedding, represented by graphs. We present a formulation of CNNs in the context of spectral graph theory, which provides the necessary mathematical background and efficient numerical schemes to design fast localized convolutional filters on graphs. Importantly, the proposed technique offers the same linear computational complexity and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09375","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1606.09375","created_at":"2026-05-18T00:51:25.532815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.09375v3","created_at":"2026-05-18T00:51:25.532815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09375","created_at":"2026-05-18T00:51:25.532815+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WOS6X2TNDPM","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WOS6X2TNDPMANRJ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WOS6X2T","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2606.22429","citing_title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","ref_index":98,"is_internal_anchor":true},{"citing_arxiv_id":"2605.26984","citing_title":"TED: Related Party Transaction guided Tax Evasion Detection on Heterogeneous Graph","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26218","citing_title":"Dark Matter in Draco and Bo\\\"otes I: Hints of a Core in an Ultra-Faint Dwarf from Simulation-Based Inference","ref_index":69,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20248","citing_title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2512.07420","citing_title":"KIGNet: Physics-Motivated Multi-Graph Representation Learning for Explainable Jet Tagging","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09408","citing_title":"GravityGraphSAGE: Link Prediction in Directed Attributed Graphs","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01484","citing_title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","ref_index":171,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06448","citing_title":"From Load Tests to Live Streams: Graph Embedding-Based Anomaly Detection in Microservice Architectures","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17688","citing_title":"Dual-stream Spatio-Temporal GCN-Transformer Network for 3D Human Pose Estimation","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5WOS6X2TNDPMANRJSMQOLGG7RQ","json":"https://pith.science/pith/5WOS6X2TNDPMANRJSMQOLGG7RQ.json","graph_json":"https://pith.science/api/pith-number/5WOS6X2TNDPMANRJSMQOLGG7RQ/graph.json","events_json":"https://pith.science/api/pith-number/5WOS6X2TNDPMANRJSMQOLGG7RQ/events.json","paper":"https://pith.science/paper/5WOS6X2T"},"agent_actions":{"view_html":"https://pith.science/pith/5WOS6X2TNDPMANRJSMQOLGG7RQ","download_json":"https://pith.science/pith/5WOS6X2TNDPMANRJSMQOLGG7RQ.json","view_paper":"https://pith.science/paper/5WOS6X2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.09375&json=true","fetch_graph":"https://pith.science/api/pith-number/5WOS6X2TNDPMANRJSMQOLGG7RQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5WOS6X2TNDPMANRJSMQOLGG7RQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WOS6X2TNDPMANRJSMQOLGG7RQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WOS6X2TNDPMANRJSMQOLGG7RQ/action/storage_attestation","attest_author":"https://pith.science/pith/5WOS6X2TNDPMANRJSMQOLGG7RQ/action/author_attestation","sign_citation":"https://pith.science/pith/5WOS6X2TNDPMANRJSMQOLGG7RQ/action/citation_signature","submit_replication":"https://pith.science/pith/5WOS6X2TNDPMANRJSMQOLGG7RQ/action/replication_record"}},"created_at":"2026-05-18T00:51:25.532815+00:00","updated_at":"2026-05-18T00:51:25.532815+00:00"}