{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M6UKABCTWW6TDQNH7GKSMGWWM4","short_pith_number":"pith:M6UKABCT","schema_version":"1.0","canonical_sha256":"67a8a00453b5bd31c1a7f995261ad667372259a164aefabf51fc1f18cc24488e","source":{"kind":"arxiv","id":"1701.06751","version":1},"attestation_state":"computed","paper":{"title":"Collective Vertex Classification Using Recursive Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Chenchen Xu, Lizhen Qu, Qing Wang, Qiongkai Xu","submitted_at":"2017-01-24T07:07:15Z","abstract_excerpt":"Collective classification of vertices is a task of assigning categories to each vertex in a graph based on both vertex attributes and link structure. Nevertheless, some existing approaches do not use the features of neighbouring vertices properly, due to the noise introduced by these features. In this paper, we propose a graph-based recursive neural network framework for collective vertex classification. In this framework, we generate hidden representations from both attributes of vertices and representations of neighbouring vertices via recursive neural networks. Under this framework, we expl"},"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":"1701.06751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-01-24T07:07:15Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"3d19a5ffce2679216413c01a8365d7b0ed6a951099a0908b8433ac888c9e9260","abstract_canon_sha256":"bfc8bc2d75ebc12d69fe476d5125a8c6a30cc215f77ea48d2c7d997e7e9630e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:12.244976Z","signature_b64":"GfwDkXBCyMr+9EeSuW4+tTqjpeXYjNJ/vdFdGLzM4+BVVAWXlshRq68JmZu2/BsT1MkUdTjxpNNiThcA1R2EDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67a8a00453b5bd31c1a7f995261ad667372259a164aefabf51fc1f18cc24488e","last_reissued_at":"2026-05-18T00:52:12.244547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:12.244547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collective Vertex Classification Using Recursive Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Chenchen Xu, Lizhen Qu, Qing Wang, Qiongkai Xu","submitted_at":"2017-01-24T07:07:15Z","abstract_excerpt":"Collective classification of vertices is a task of assigning categories to each vertex in a graph based on both vertex attributes and link structure. Nevertheless, some existing approaches do not use the features of neighbouring vertices properly, due to the noise introduced by these features. In this paper, we propose a graph-based recursive neural network framework for collective vertex classification. In this framework, we generate hidden representations from both attributes of vertices and representations of neighbouring vertices via recursive neural networks. Under this framework, we expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06751","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":""},"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":"1701.06751","created_at":"2026-05-18T00:52:12.244624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06751v1","created_at":"2026-05-18T00:52:12.244624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06751","created_at":"2026-05-18T00:52:12.244624+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6UKABCTWW6T","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6UKABCTWW6TDQNH","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6UKABCT","created_at":"2026-05-18T12:31:31.346846+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/M6UKABCTWW6TDQNH7GKSMGWWM4","json":"https://pith.science/pith/M6UKABCTWW6TDQNH7GKSMGWWM4.json","graph_json":"https://pith.science/api/pith-number/M6UKABCTWW6TDQNH7GKSMGWWM4/graph.json","events_json":"https://pith.science/api/pith-number/M6UKABCTWW6TDQNH7GKSMGWWM4/events.json","paper":"https://pith.science/paper/M6UKABCT"},"agent_actions":{"view_html":"https://pith.science/pith/M6UKABCTWW6TDQNH7GKSMGWWM4","download_json":"https://pith.science/pith/M6UKABCTWW6TDQNH7GKSMGWWM4.json","view_paper":"https://pith.science/paper/M6UKABCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06751&json=true","fetch_graph":"https://pith.science/api/pith-number/M6UKABCTWW6TDQNH7GKSMGWWM4/graph.json","fetch_events":"https://pith.science/api/pith-number/M6UKABCTWW6TDQNH7GKSMGWWM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6UKABCTWW6TDQNH7GKSMGWWM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6UKABCTWW6TDQNH7GKSMGWWM4/action/storage_attestation","attest_author":"https://pith.science/pith/M6UKABCTWW6TDQNH7GKSMGWWM4/action/author_attestation","sign_citation":"https://pith.science/pith/M6UKABCTWW6TDQNH7GKSMGWWM4/action/citation_signature","submit_replication":"https://pith.science/pith/M6UKABCTWW6TDQNH7GKSMGWWM4/action/replication_record"}},"created_at":"2026-05-18T00:52:12.244624+00:00","updated_at":"2026-05-18T00:52:12.244624+00:00"}