{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WFVT46YVP6FWRYQBUFALBWM6JQ","short_pith_number":"pith:WFVT46YV","schema_version":"1.0","canonical_sha256":"b16b3e7b157f8b68e201a140b0d99e4c176fe7031e5ae450e1cbdc580907f794","source":{"kind":"arxiv","id":"1710.10370","version":5},"attestation_state":"computed","paper":{"title":"Topology Adaptive Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Guanhang Wu, Jian Du, Jose M. F. Moura, Shanghang Zhang, Soummya Kar","submitted_at":"2017-10-28T02:12:51Z","abstract_excerpt":"Spectral graph convolutional neural networks (CNNs) require approximation to the convolution to alleviate the computational complexity, resulting in performance loss. This paper proposes the topology adaptive graph convolutional network (TAGCN), a novel graph convolutional network defined in the vertex domain. We provide a systematic way to design a set of fixed-size learnable filters to perform convolutions on graphs. The topologies of these filters are adaptive to the topology of the graph when they scan the graph to perform convolution. The TAGCN not only inherits the properties of convolut"},"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":"1710.10370","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-28T02:12:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0a240064dc53c9e5ba603e013b7be8ea4ddf21fbfb92ea1fa478e1d90bf2c903","abstract_canon_sha256":"c252538d6cf5ee0d3666051379bcd77b5a5bc77ff6c6fceae5ba5ec2f1ae356e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:52.711121Z","signature_b64":"SaciwRVVMt3wy3Iq5Uvlru145myqnXSr5A4wDXcQCpHlP/v8FBMR/aGVk5v6bxs8a8lfP+39MixFjrt7iX+/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b16b3e7b157f8b68e201a140b0d99e4c176fe7031e5ae450e1cbdc580907f794","last_reissued_at":"2026-05-18T00:23:52.710440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:52.710440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topology Adaptive Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Guanhang Wu, Jian Du, Jose M. F. Moura, Shanghang Zhang, Soummya Kar","submitted_at":"2017-10-28T02:12:51Z","abstract_excerpt":"Spectral graph convolutional neural networks (CNNs) require approximation to the convolution to alleviate the computational complexity, resulting in performance loss. This paper proposes the topology adaptive graph convolutional network (TAGCN), a novel graph convolutional network defined in the vertex domain. We provide a systematic way to design a set of fixed-size learnable filters to perform convolutions on graphs. The topologies of these filters are adaptive to the topology of the graph when they scan the graph to perform convolution. The TAGCN not only inherits the properties of convolut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10370","kind":"arxiv","version":5},"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":"1710.10370","created_at":"2026-05-18T00:23:52.710543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10370v5","created_at":"2026-05-18T00:23:52.710543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10370","created_at":"2026-05-18T00:23:52.710543+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFVT46YVP6FW","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFVT46YVP6FWRYQB","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFVT46YV","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2605.27880","citing_title":"Confident Learning-based Network for Detecting Bug-Inducing Commits on SZZ with Noisy Labels","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2605.29926","citing_title":"A Triple-Modal Contrastive Learning Framework with Sequence, Graph, and 3D Features for Drug-Target Interaction Prediction","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23708","citing_title":"Learning Dynamic Stability Landscapes in Synchronization Networks","ref_index":175,"is_internal_anchor":true},{"citing_arxiv_id":"2510.22048","citing_title":"PF$\\Delta$: A Benchmark Dataset for Power Flow under Load, Generation, and Topology Variations","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFVT46YVP6FWRYQBUFALBWM6JQ","json":"https://pith.science/pith/WFVT46YVP6FWRYQBUFALBWM6JQ.json","graph_json":"https://pith.science/api/pith-number/WFVT46YVP6FWRYQBUFALBWM6JQ/graph.json","events_json":"https://pith.science/api/pith-number/WFVT46YVP6FWRYQBUFALBWM6JQ/events.json","paper":"https://pith.science/paper/WFVT46YV"},"agent_actions":{"view_html":"https://pith.science/pith/WFVT46YVP6FWRYQBUFALBWM6JQ","download_json":"https://pith.science/pith/WFVT46YVP6FWRYQBUFALBWM6JQ.json","view_paper":"https://pith.science/paper/WFVT46YV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10370&json=true","fetch_graph":"https://pith.science/api/pith-number/WFVT46YVP6FWRYQBUFALBWM6JQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WFVT46YVP6FWRYQBUFALBWM6JQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFVT46YVP6FWRYQBUFALBWM6JQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFVT46YVP6FWRYQBUFALBWM6JQ/action/storage_attestation","attest_author":"https://pith.science/pith/WFVT46YVP6FWRYQBUFALBWM6JQ/action/author_attestation","sign_citation":"https://pith.science/pith/WFVT46YVP6FWRYQBUFALBWM6JQ/action/citation_signature","submit_replication":"https://pith.science/pith/WFVT46YVP6FWRYQBUFALBWM6JQ/action/replication_record"}},"created_at":"2026-05-18T00:23:52.710543+00:00","updated_at":"2026-05-18T00:23:52.710543+00:00"}