{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NRQPMBUDFL7SYIVK2ZDJ7STIDK","short_pith_number":"pith:NRQPMBUD","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"},"canonical_sha256":"6c60f606832aff2c22aad6469fca681aa611bf8bca145eaeedb397e00a6cd2da","source":{"kind":"arxiv","id":"1910.09706","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.09706","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"1910.09706v2","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09706","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"NRQPMBUDFL7S","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_16","alias_value":"NRQPMBUDFL7SYIVK","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_8","alias_value":"NRQPMBUD","created_at":"2026-07-05T07:55:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NRQPMBUDFL7SYIVK2ZDJ7STIDK","target":"record","payload":{"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"},"canonical_sha256":"6c60f606832aff2c22aad6469fca681aa611bf8bca145eaeedb397e00a6cd2da","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"},"source_kind":"arxiv","source_id":"1910.09706","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UjanCkrTI9QvZaNpRfvyPoSwtp7LaAON/fPOOW1v/346G8cB+cnriLIQfK5EXwoutravPu127xmyETnGPUtYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:39:11.239320Z"},"content_sha256":"978d772a0d974ccd4a6f9f5bf120bd2498aa79732cdc7f3c0788eb0b8172614a","schema_version":"1.0","event_id":"sha256:978d772a0d974ccd4a6f9f5bf120bd2498aa79732cdc7f3c0788eb0b8172614a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NRQPMBUDFL7SYIVK2ZDJ7STIDK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:55:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEszKm68CGVP4cxHtDoiZ2ptOuMdQnGGNFm5BNU5fn6otbVEtt3tV7Ltcn/GYntqjYtSYibHPTtVUu1E/KAtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:39:11.239881Z"},"content_sha256":"efe1fceaf241706ad5ee36b24658890c2b8603b1d829b48ee68bf45db94615f3","schema_version":"1.0","event_id":"sha256:efe1fceaf241706ad5ee36b24658890c2b8603b1d829b48ee68bf45db94615f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/bundle.json","state_url":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T01:39:11Z","links":{"resolver":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK","bundle":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/bundle.json","state":"https://pith.science/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRQPMBUDFL7SYIVK2ZDJ7STIDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NRQPMBUDFL7SYIVK2ZDJ7STIDK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aeb992f20d347cdd3bfdfc63f673e9074ea21c8a4f3b65534d0cc632e950a520","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-22T00:20:47Z","title_canon_sha256":"8768ff446973b0072c5700bd302d6e50f359d81122d70ca2072825e97ae62ff6"},"schema_version":"1.0","source":{"id":"1910.09706","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.09706","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"arxiv_version","alias_value":"1910.09706v2","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09706","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_12","alias_value":"NRQPMBUDFL7S","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_16","alias_value":"NRQPMBUDFL7SYIVK","created_at":"2026-07-05T07:55:17Z"},{"alias_kind":"pith_short_8","alias_value":"NRQPMBUD","created_at":"2026-07-05T07:55:17Z"}],"graph_snapshots":[{"event_id":"sha256:efe1fceaf241706ad5ee36b24658890c2b8603b1d829b48ee68bf45db94615f3","target":"graph","created_at":"2026-07-05T07:55:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.09706/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Han Yufei, Qiannan Zhang, Uchenna Akujuobi, Xiangliang Zhang","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-22T00:20:47Z","title":"Collaborative Graph Walk for Semi-supervised Multi-Label Node Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.09706","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:978d772a0d974ccd4a6f9f5bf120bd2498aa79732cdc7f3c0788eb0b8172614a","target":"record","created_at":"2026-07-05T07:55:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aeb992f20d347cdd3bfdfc63f673e9074ea21c8a4f3b65534d0cc632e950a520","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-22T00:20:47Z","title_canon_sha256":"8768ff446973b0072c5700bd302d6e50f359d81122d70ca2072825e97ae62ff6"},"schema_version":"1.0","source":{"id":"1910.09706","kind":"arxiv","version":2}},"canonical_sha256":"6c60f606832aff2c22aad6469fca681aa611bf8bca145eaeedb397e00a6cd2da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c60f606832aff2c22aad6469fca681aa611bf8bca145eaeedb397e00a6cd2da","first_computed_at":"2026-07-05T07:55:17.101450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:55:17.101450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4UbmjhhV12Bn+9gIrLcsnK7TnnC6BXt1fbehBCuy1AH9lLt6T2CeNRdOWKY4VIfYzkJDVFxOn8oqsyEIojNPBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:55:17.101996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.09706","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:978d772a0d974ccd4a6f9f5bf120bd2498aa79732cdc7f3c0788eb0b8172614a","sha256:efe1fceaf241706ad5ee36b24658890c2b8603b1d829b48ee68bf45db94615f3"],"state_sha256":"5e6e99f8bc5c0903b25de3079ce2adc3f83382844541233ff4a1a74aa59349df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uq7jYAMMtdUbjttYxp68Ke7kjEzsB3s7zBcOCoCIud9oPpjv724dnDTgr8zudoT9xZeGOExmCQGRof9y7AWIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:39:11.245678Z","bundle_sha256":"99b109298254faeafad671ff82bd8d5fd458ac39c16ecaec9aee385cf5e1d919"}}