{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EBFHJHDERZRYAAZC7J4Y3P3ZUD","short_pith_number":"pith:EBFHJHDE","schema_version":"1.0","canonical_sha256":"204a749c648e63800322fa798dbf79a0efa2e82382249569771564627c507392","source":{"kind":"arxiv","id":"1312.6203","version":3},"attestation_state":"computed","paper":{"title":"Spectral Networks and Locally Connected Networks on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"Arthur Szlam, Joan Bruna, Wojciech Zaremba, Yann LeCun","submitted_at":"2013-12-21T04:25:53Z","abstract_excerpt":"Convolutional Neural Networks are extremely efficient architectures in image and audio recognition tasks, thanks to their ability to exploit the local translational invariance of signal classes over their domain. In this paper we consider possible generalizations of CNNs to signals defined on more general domains without the action of a translation group. In particular, we propose two constructions, one based upon a hierarchical clustering of the domain, and another based on the spectrum of the graph Laplacian. We show through experiments that for low-dimensional graphs it is possible to learn"},"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":"1312.6203","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-21T04:25:53Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"fb07ca11374de4d7ef7cb2015b13e8a3046fbe044273c3bb312575aabc45cd6e","abstract_canon_sha256":"f305efc333aa45bf1c724eb2294e54383414fb0d4fb2aaae8e49f0cb5ad9aa18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:24.054396Z","signature_b64":"v1zOAyTihlueuJbX5fXCGhvYdd5hCDClRf4V3ZUMQXQYHJp96hyCbSu6ocMx+0AkN3JwgaaVNzhN51Hg34FbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"204a749c648e63800322fa798dbf79a0efa2e82382249569771564627c507392","last_reissued_at":"2026-05-18T02:51:24.053742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:24.053742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Networks and Locally Connected Networks on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"Arthur Szlam, Joan Bruna, Wojciech Zaremba, Yann LeCun","submitted_at":"2013-12-21T04:25:53Z","abstract_excerpt":"Convolutional Neural Networks are extremely efficient architectures in image and audio recognition tasks, thanks to their ability to exploit the local translational invariance of signal classes over their domain. In this paper we consider possible generalizations of CNNs to signals defined on more general domains without the action of a translation group. In particular, we propose two constructions, one based upon a hierarchical clustering of the domain, and another based on the spectrum of the graph Laplacian. We show through experiments that for low-dimensional graphs it is possible to learn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6203","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":"1312.6203","created_at":"2026-05-18T02:51:24.053848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6203v3","created_at":"2026-05-18T02:51:24.053848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6203","created_at":"2026-05-18T02:51:24.053848+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBFHJHDERZRY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBFHJHDERZRYAAZC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBFHJHDE","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":9,"sample":[{"citing_arxiv_id":"1907.04444","citing_title":"A review on deep learning techniques for 3D sensed data classification","ref_index":115,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08822","citing_title":"PH-GCN: Person Re-identification with Part-based Hierarchical Graph Convolutional Network","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"1909.01315","citing_title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20248","citing_title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16054","citing_title":"Ada-Diffuser: Latent-Aware Adaptive Diffusion for Decision-Making","ref_index":100,"is_internal_anchor":true},{"citing_arxiv_id":"2505.23875","citing_title":"A Benchmark Dataset for Graph Regression with Homogeneous and Multi-Relational Variants","ref_index":76,"is_internal_anchor":true},{"citing_arxiv_id":"2506.02618","citing_title":"Rodrigues Network for Learning Robot Actions","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2511.16767","citing_title":"When Structure Doesn't Help: LLMs Do Not Read Text-Attributed Graphs as Effectively as We Expected","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2603.05301","citing_title":"Uniform Inductive Spatio-Temporal Kriging","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2603.29148","citing_title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22549","citing_title":"ASPIRE: Make Spectral Graph Collaborative Filtering Great Again via Adaptive Filter Learning","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10113","citing_title":"FlexVector: A SpMM Vector Processor with Flexible VRF for GCNs on Varying-Sparsity Graphs","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00789","citing_title":"Make Your LVLM KV Cache More Lightweight","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EBFHJHDERZRYAAZC7J4Y3P3ZUD","json":"https://pith.science/pith/EBFHJHDERZRYAAZC7J4Y3P3ZUD.json","graph_json":"https://pith.science/api/pith-number/EBFHJHDERZRYAAZC7J4Y3P3ZUD/graph.json","events_json":"https://pith.science/api/pith-number/EBFHJHDERZRYAAZC7J4Y3P3ZUD/events.json","paper":"https://pith.science/paper/EBFHJHDE"},"agent_actions":{"view_html":"https://pith.science/pith/EBFHJHDERZRYAAZC7J4Y3P3ZUD","download_json":"https://pith.science/pith/EBFHJHDERZRYAAZC7J4Y3P3ZUD.json","view_paper":"https://pith.science/paper/EBFHJHDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6203&json=true","fetch_graph":"https://pith.science/api/pith-number/EBFHJHDERZRYAAZC7J4Y3P3ZUD/graph.json","fetch_events":"https://pith.science/api/pith-number/EBFHJHDERZRYAAZC7J4Y3P3ZUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBFHJHDERZRYAAZC7J4Y3P3ZUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBFHJHDERZRYAAZC7J4Y3P3ZUD/action/storage_attestation","attest_author":"https://pith.science/pith/EBFHJHDERZRYAAZC7J4Y3P3ZUD/action/author_attestation","sign_citation":"https://pith.science/pith/EBFHJHDERZRYAAZC7J4Y3P3ZUD/action/citation_signature","submit_replication":"https://pith.science/pith/EBFHJHDERZRYAAZC7J4Y3P3ZUD/action/replication_record"}},"created_at":"2026-05-18T02:51:24.053848+00:00","updated_at":"2026-05-18T02:51:24.053848+00:00"}