{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NRQPMBUDFL7SYIVK2ZDJ7STIDK","short_pith_number":"pith:NRQPMBUD","schema_version":"1.0","canonical_sha256":"6c60f606832aff2c22aad6469fca681aa611bf8bca145eaeedb397e00a6cd2da","source":{"kind":"arxiv","id":"1910.09706","version":2},"attestation_state":"computed","paper":{"title":"Collaborative Graph Walk for Semi-supervised Multi-Label Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Han Yufei, Qiannan Zhang, Uchenna Akujuobi, Xiangliang Zhang","submitted_at":"2019-10-22T00:20:47Z","abstract_excerpt":"In this work, we study semi-supervised multi-label node classification problem in attributed graphs. Classic solutions to multi-label node classification follow two steps, first learn node embedding and then build a node classifier on the learned embedding. To improve the discriminating power of the node embedding, we propose a novel collaborative graph walk, named Multi-Label-Graph-Walk, to finely tune node representations with the available label assignments in attributed graphs via reinforcement learning. The proposed method formulates the multi-label node classification task as simultaneou"},"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":"1910.09706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-22T00:20:47Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"8768ff446973b0072c5700bd302d6e50f359d81122d70ca2072825e97ae62ff6","abstract_canon_sha256":"aeb992f20d347cdd3bfdfc63f673e9074ea21c8a4f3b65534d0cc632e950a520"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:17.101996Z","signature_b64":"4UbmjhhV12Bn+9gIrLcsnK7TnnC6BXt1fbehBCuy1AH9lLt6T2CeNRdOWKY4VIfYzkJDVFxOn8oqsyEIojNPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c60f606832aff2c22aad6469fca681aa611bf8bca145eaeedb397e00a6cd2da","last_reissued_at":"2026-07-05T07:55:17.101450Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:17.101450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collaborative Graph Walk for Semi-supervised Multi-Label Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Han Yufei, Qiannan Zhang, Uchenna Akujuobi, Xiangliang Zhang","submitted_at":"2019-10-22T00:20:47Z","abstract_excerpt":"In this work, we study semi-supervised multi-label node classification problem in attributed graphs. Classic solutions to multi-label node classification follow two steps, first learn node embedding and then build a node classifier on the learned embedding. To improve the discriminating power of the node embedding, we propose a novel collaborative graph walk, named Multi-Label-Graph-Walk, to finely tune node representations with the available label assignments in attributed graphs via reinforcement learning. The proposed method formulates the multi-label node classification task as simultaneou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.09706","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.09706/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.09706","created_at":"2026-07-05T07:55:17.101513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.09706v2","created_at":"2026-07-05T07:55:17.101513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09706","created_at":"2026-07-05T07:55:17.101513+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRQPMBUDFL7S","created_at":"2026-07-05T07:55:17.101513+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRQPMBUDFL7SYIVK","created_at":"2026-07-05T07:55:17.101513+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRQPMBUD","created_at":"2026-07-05T07:55:17.101513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14094","citing_title":"GNN-MultiFix: Addressing the pitfalls for GNNs for multi-label node classification","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK","json":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK.json","graph_json":"https://pith.science/api/pith-number/NRQPMBUDFL7SYIVK2ZDJ7STIDK/graph.json","events_json":"https://pith.science/api/pith-number/NRQPMBUDFL7SYIVK2ZDJ7STIDK/events.json","paper":"https://pith.science/paper/NRQPMBUD"},"agent_actions":{"view_html":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK","download_json":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK.json","view_paper":"https://pith.science/paper/NRQPMBUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.09706&json=true","fetch_graph":"https://pith.science/api/pith-number/NRQPMBUDFL7SYIVK2ZDJ7STIDK/graph.json","fetch_events":"https://pith.science/api/pith-number/NRQPMBUDFL7SYIVK2ZDJ7STIDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/action/storage_attestation","attest_author":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/action/author_attestation","sign_citation":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/action/citation_signature","submit_replication":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/action/replication_record"}},"created_at":"2026-07-05T07:55:17.101513+00:00","updated_at":"2026-07-05T07:55:17.101513+00:00"}