{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NVVSX57JD5DT33LJP2EVOTKWCY","short_pith_number":"pith:NVVSX57J","canonical_record":{"source":{"id":"1902.09294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-25T14:35:31Z","cross_cats_sorted":["cs.IR","cs.SI","stat.ML"],"title_canon_sha256":"cc562947d47bbff35042c27d343f2eab2cb07e541a5e0f0b891f07d707c6d3b4","abstract_canon_sha256":"b3d3297ea969524a4627c7975b8cabca86bb3860d726571fc36c345fbf44b098"},"schema_version":"1.0"},"canonical_sha256":"6d6b2bf7e91f473ded697e89574d561612caef7a2fc948a091c7505f18dbd554","source":{"kind":"arxiv","id":"1902.09294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09294","created_at":"2026-05-17T23:52:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09294v1","created_at":"2026-05-17T23:52:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09294","created_at":"2026-05-17T23:52:46Z"},{"alias_kind":"pith_short_12","alias_value":"NVVSX57JD5DT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NVVSX57JD5DT33LJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NVVSX57J","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NVVSX57JD5DT33LJP2EVOTKWCY","target":"record","payload":{"canonical_record":{"source":{"id":"1902.09294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-25T14:35:31Z","cross_cats_sorted":["cs.IR","cs.SI","stat.ML"],"title_canon_sha256":"cc562947d47bbff35042c27d343f2eab2cb07e541a5e0f0b891f07d707c6d3b4","abstract_canon_sha256":"b3d3297ea969524a4627c7975b8cabca86bb3860d726571fc36c345fbf44b098"},"schema_version":"1.0"},"canonical_sha256":"6d6b2bf7e91f473ded697e89574d561612caef7a2fc948a091c7505f18dbd554","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:46.120769Z","signature_b64":"UmMjBujpt+JhjwyYbc7za7o026m6QCjx6kdKTtKgKKiWtHEK9NcxUjI8tKS3LU/ZGkk1otHKCU5jccH7eTLUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d6b2bf7e91f473ded697e89574d561612caef7a2fc948a091c7505f18dbd554","last_reissued_at":"2026-05-17T23:52:46.120093Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:46.120093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.09294","source_version":1,"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-05-17T23:52:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Z8TzBaWLBKRUyuOy8c0dICXTh7lCy+0aVCykLw8/LkPOP88p60XvGLZVIyhHU/uEb1/qXuNHYkkpRUQZoAYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:36:33.147813Z"},"content_sha256":"392c4b68d4047832ddb9508f4e3df267aa6fef538474b1136ecad362c79e69a3","schema_version":"1.0","event_id":"sha256:392c4b68d4047832ddb9508f4e3df267aa6fef538474b1136ecad362c79e69a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NVVSX57JD5DT33LJP2EVOTKWCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Label Network Classification via Weighted Personalized Factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmed Rashed, Josif Grabocka, Lars Schmidt-Thieme","submitted_at":"2019-02-25T14:35:31Z","abstract_excerpt":"Multi-label network classification is a well-known task that is being used in a wide variety of web-based and non-web-based domains. It can be formalized as a multi-relational learning task for predicting nodes labels based on their relations within the network. In sparse networks, this prediction task can be very challenging when only implicit feedback information is available such as in predicting user interests in social networks. Current approaches rely on learning per-node latent representations by utilizing the network structure, however, implicit feedback relations are naturally sparse "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09294","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"},"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-05-17T23:52:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pl4dEfCq9Bp4GhSavb2EkH5tQSeJr+WGX/BlZnrE9gOHS4aa6W6KTD3UUYPXbi8HLpLCljnD1FL5mTmP1EWsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:36:33.148484Z"},"content_sha256":"ad8202c5009a23556d8ae29c90abf66e7257aa9301d6d0115975304a7d9dcb42","schema_version":"1.0","event_id":"sha256:ad8202c5009a23556d8ae29c90abf66e7257aa9301d6d0115975304a7d9dcb42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVVSX57JD5DT33LJP2EVOTKWCY/bundle.json","state_url":"https://pith.science/pith/NVVSX57JD5DT33LJP2EVOTKWCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVVSX57JD5DT33LJP2EVOTKWCY/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-05-31T06:36:33Z","links":{"resolver":"https://pith.science/pith/NVVSX57JD5DT33LJP2EVOTKWCY","bundle":"https://pith.science/pith/NVVSX57JD5DT33LJP2EVOTKWCY/bundle.json","state":"https://pith.science/pith/NVVSX57JD5DT33LJP2EVOTKWCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVVSX57JD5DT33LJP2EVOTKWCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NVVSX57JD5DT33LJP2EVOTKWCY","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":"b3d3297ea969524a4627c7975b8cabca86bb3860d726571fc36c345fbf44b098","cross_cats_sorted":["cs.IR","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-25T14:35:31Z","title_canon_sha256":"cc562947d47bbff35042c27d343f2eab2cb07e541a5e0f0b891f07d707c6d3b4"},"schema_version":"1.0","source":{"id":"1902.09294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09294","created_at":"2026-05-17T23:52:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09294v1","created_at":"2026-05-17T23:52:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09294","created_at":"2026-05-17T23:52:46Z"},{"alias_kind":"pith_short_12","alias_value":"NVVSX57JD5DT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NVVSX57JD5DT33LJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NVVSX57J","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:ad8202c5009a23556d8ae29c90abf66e7257aa9301d6d0115975304a7d9dcb42","target":"graph","created_at":"2026-05-17T23:52:46Z","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"},"paper":{"abstract_excerpt":"Multi-label network classification is a well-known task that is being used in a wide variety of web-based and non-web-based domains. It can be formalized as a multi-relational learning task for predicting nodes labels based on their relations within the network. In sparse networks, this prediction task can be very challenging when only implicit feedback information is available such as in predicting user interests in social networks. Current approaches rely on learning per-node latent representations by utilizing the network structure, however, implicit feedback relations are naturally sparse ","authors_text":"Ahmed Rashed, Josif Grabocka, Lars Schmidt-Thieme","cross_cats":["cs.IR","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-25T14:35:31Z","title":"Multi-Label Network Classification via Weighted Personalized Factorizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09294","kind":"arxiv","version":1},"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:392c4b68d4047832ddb9508f4e3df267aa6fef538474b1136ecad362c79e69a3","target":"record","created_at":"2026-05-17T23:52:46Z","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":"b3d3297ea969524a4627c7975b8cabca86bb3860d726571fc36c345fbf44b098","cross_cats_sorted":["cs.IR","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-25T14:35:31Z","title_canon_sha256":"cc562947d47bbff35042c27d343f2eab2cb07e541a5e0f0b891f07d707c6d3b4"},"schema_version":"1.0","source":{"id":"1902.09294","kind":"arxiv","version":1}},"canonical_sha256":"6d6b2bf7e91f473ded697e89574d561612caef7a2fc948a091c7505f18dbd554","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d6b2bf7e91f473ded697e89574d561612caef7a2fc948a091c7505f18dbd554","first_computed_at":"2026-05-17T23:52:46.120093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:46.120093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UmMjBujpt+JhjwyYbc7za7o026m6QCjx6kdKTtKgKKiWtHEK9NcxUjI8tKS3LU/ZGkk1otHKCU5jccH7eTLUCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:46.120769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.09294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:392c4b68d4047832ddb9508f4e3df267aa6fef538474b1136ecad362c79e69a3","sha256:ad8202c5009a23556d8ae29c90abf66e7257aa9301d6d0115975304a7d9dcb42"],"state_sha256":"fb872d3cc55560ea8a3767b0137a81fedaf870000035ff7dae30fcd85a5d8ae6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iX+WD1pLzgVpScbzOlBNExmkUPHJNHr3UNE+Xo+RPy+UmkP/1aNQu+0hOV3b0AxV6y7nNJP5N0zbFr5QMP5uAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:36:33.152110Z","bundle_sha256":"57e3eb9cc14a8d226927093d556bcfdf8b45c9bc35192f1c83672b9eaacd80e2"}}