{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DGTHZKCYVQHPMC6LHUVEFC5HTV","short_pith_number":"pith:DGTHZKCY","schema_version":"1.0","canonical_sha256":"19a67ca858ac0ef60bcb3d2a428ba79d57d803c42837b3d4bdebd4f5173885a9","source":{"kind":"arxiv","id":"1805.12528","version":5},"attestation_state":"computed","paper":{"title":"Fusion Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Balaraman Ravindran, Mitesh M. Khapra, Priyesh Vijayan, Srinivasan Parthasarathy, Yash Chandak","submitted_at":"2018-05-31T15:57:33Z","abstract_excerpt":"Semi-supervised node classification in attributed graphs, i.e., graphs with node features, involves learning to classify unlabeled nodes given a partially labeled graph. Label predictions are made by jointly modeling the node and its' neighborhood features. State-of-the-art models for node classification on such attributed graphs use differentiable recursive functions that enable aggregation and filtering of neighborhood information from multiple hops. In this work, we analyze the representation capacity of these models to regulate information from multiple hops independently. From our analysi"},"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":"1805.12528","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-31T15:57:33Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"be48a83d82b1009da3fdc77ad0bbbb3a938d7ed79550be2b4f353d9e79b8edf2","abstract_canon_sha256":"3ca0c1bab808dde20f554b664d3377d2cdf60038e45953fdf30ada02a25f3df6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:13.985656Z","signature_b64":"PWlyDLl6qowoalVRYPROsSElZ/cwOn0o8mEQGZstCr3ObtoFvqHQG1dop9CrnAJsGDoGxpkbMS58jjK/vxFoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a67ca858ac0ef60bcb3d2a428ba79d57d803c42837b3d4bdebd4f5173885a9","last_reissued_at":"2026-05-18T00:05:13.985154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:13.985154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fusion Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Balaraman Ravindran, Mitesh M. Khapra, Priyesh Vijayan, Srinivasan Parthasarathy, Yash Chandak","submitted_at":"2018-05-31T15:57:33Z","abstract_excerpt":"Semi-supervised node classification in attributed graphs, i.e., graphs with node features, involves learning to classify unlabeled nodes given a partially labeled graph. Label predictions are made by jointly modeling the node and its' neighborhood features. State-of-the-art models for node classification on such attributed graphs use differentiable recursive functions that enable aggregation and filtering of neighborhood information from multiple hops. In this work, we analyze the representation capacity of these models to regulate information from multiple hops independently. From our analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.12528","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":"1805.12528","created_at":"2026-05-18T00:05:13.985243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.12528v5","created_at":"2026-05-18T00:05:13.985243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.12528","created_at":"2026-05-18T00:05:13.985243+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGTHZKCYVQHP","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGTHZKCYVQHPMC6L","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGTHZKCY","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGTHZKCYVQHPMC6LHUVEFC5HTV","json":"https://pith.science/pith/DGTHZKCYVQHPMC6LHUVEFC5HTV.json","graph_json":"https://pith.science/api/pith-number/DGTHZKCYVQHPMC6LHUVEFC5HTV/graph.json","events_json":"https://pith.science/api/pith-number/DGTHZKCYVQHPMC6LHUVEFC5HTV/events.json","paper":"https://pith.science/paper/DGTHZKCY"},"agent_actions":{"view_html":"https://pith.science/pith/DGTHZKCYVQHPMC6LHUVEFC5HTV","download_json":"https://pith.science/pith/DGTHZKCYVQHPMC6LHUVEFC5HTV.json","view_paper":"https://pith.science/paper/DGTHZKCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.12528&json=true","fetch_graph":"https://pith.science/api/pith-number/DGTHZKCYVQHPMC6LHUVEFC5HTV/graph.json","fetch_events":"https://pith.science/api/pith-number/DGTHZKCYVQHPMC6LHUVEFC5HTV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGTHZKCYVQHPMC6LHUVEFC5HTV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGTHZKCYVQHPMC6LHUVEFC5HTV/action/storage_attestation","attest_author":"https://pith.science/pith/DGTHZKCYVQHPMC6LHUVEFC5HTV/action/author_attestation","sign_citation":"https://pith.science/pith/DGTHZKCYVQHPMC6LHUVEFC5HTV/action/citation_signature","submit_replication":"https://pith.science/pith/DGTHZKCYVQHPMC6LHUVEFC5HTV/action/replication_record"}},"created_at":"2026-05-18T00:05:13.985243+00:00","updated_at":"2026-05-18T00:05:13.985243+00:00"}