{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TPHYTWX57OHIJCRGZKZP34NK4F","short_pith_number":"pith:TPHYTWX5","canonical_record":{"source":{"id":"2402.08583","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T16:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"d673863a8aed57eef6b0bfcb65901a95e809418db61398821b00c560b9d9fba7","abstract_canon_sha256":"f1ca098be250c268966c71daf6c8b67fb76d073746419b67064cf91bf9f86021"},"schema_version":"1.0"},"canonical_sha256":"9bcf89dafdfb8e848a26cab2fdf1aae155dc676a05bd3868efdd593e425a2b50","source":{"kind":"arxiv","id":"2402.08583","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.08583","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"arxiv_version","alias_value":"2402.08583v2","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08583","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"pith_short_12","alias_value":"TPHYTWX57OHI","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"pith_short_16","alias_value":"TPHYTWX57OHIJCRG","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"pith_short_8","alias_value":"TPHYTWX5","created_at":"2026-07-05T09:55:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TPHYTWX57OHIJCRGZKZP34NK4F","target":"record","payload":{"canonical_record":{"source":{"id":"2402.08583","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T16:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"d673863a8aed57eef6b0bfcb65901a95e809418db61398821b00c560b9d9fba7","abstract_canon_sha256":"f1ca098be250c268966c71daf6c8b67fb76d073746419b67064cf91bf9f86021"},"schema_version":"1.0"},"canonical_sha256":"9bcf89dafdfb8e848a26cab2fdf1aae155dc676a05bd3868efdd593e425a2b50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:54.596604Z","signature_b64":"/cwhsd/Ea0oCF5ELQte+u2lYHjVKGfyUtS8co0O7HTDl8BDN87tBuLecbeCrRNm4xeT7NpNQLMGm2VK64RuQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bcf89dafdfb8e848a26cab2fdf1aae155dc676a05bd3868efdd593e425a2b50","last_reissued_at":"2026-07-05T09:55:54.596034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:54.596034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.08583","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-05T09:55:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVz12vqErO5wOZKzPzyxZOGvFMyhybPQBt9giXOeQqE68UZLPAbonKd7mUpsU4Z9b21YtFMvzfQh2MjIBsiODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T08:03:46.259222Z"},"content_sha256":"65644038f33ef5c17d7df1e0a50b12aca6c584446d70d2b31be1f42cbe28b3fa","schema_version":"1.0","event_id":"sha256:65644038f33ef5c17d7df1e0a50b12aca6c584446d70d2b31be1f42cbe28b3fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TPHYTWX57OHIJCRGZKZP34NK4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixture of Link Predictors on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haoyu Han, Harry Shomer, Hui Liu, Jiliang Tang, Juanhui Li, Li Ma, Xiaofeng Gao","submitted_at":"2024-02-13T16:36:50Z","abstract_excerpt":"Link prediction, which aims to forecast unseen connections in graphs, is a fundamental task in graph machine learning. Heuristic methods, leveraging a range of different pairwise measures such as common neighbors and shortest paths, often rival the performance of vanilla Graph Neural Networks (GNNs). Therefore, recent advancements in GNNs for link prediction (GNN4LP) have primarily focused on integrating one or a few types of pairwise information. In this work, we reveal that different node pairs within the same dataset necessitate varied pairwise information for accurate prediction and models"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08583","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/2402.08583/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-05T09:55:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhmwSPk/CR7XYVm9/xytXBOXaUC8g7p4fgyNSz1DRvSqpEiitfVdj070F5mB6IXobcjMpi0gkKu6YptWeZPYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T08:03:46.260021Z"},"content_sha256":"e8e68732cab0065be69fd40504bcdecc5c4a4825b2287189f4939a14a92389a0","schema_version":"1.0","event_id":"sha256:e8e68732cab0065be69fd40504bcdecc5c4a4825b2287189f4939a14a92389a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPHYTWX57OHIJCRGZKZP34NK4F/bundle.json","state_url":"https://pith.science/pith/TPHYTWX57OHIJCRGZKZP34NK4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPHYTWX57OHIJCRGZKZP34NK4F/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-12T08:03:46Z","links":{"resolver":"https://pith.science/pith/TPHYTWX57OHIJCRGZKZP34NK4F","bundle":"https://pith.science/pith/TPHYTWX57OHIJCRGZKZP34NK4F/bundle.json","state":"https://pith.science/pith/TPHYTWX57OHIJCRGZKZP34NK4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPHYTWX57OHIJCRGZKZP34NK4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TPHYTWX57OHIJCRGZKZP34NK4F","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":"f1ca098be250c268966c71daf6c8b67fb76d073746419b67064cf91bf9f86021","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T16:36:50Z","title_canon_sha256":"d673863a8aed57eef6b0bfcb65901a95e809418db61398821b00c560b9d9fba7"},"schema_version":"1.0","source":{"id":"2402.08583","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.08583","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"arxiv_version","alias_value":"2402.08583v2","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08583","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"pith_short_12","alias_value":"TPHYTWX57OHI","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"pith_short_16","alias_value":"TPHYTWX57OHIJCRG","created_at":"2026-07-05T09:55:54Z"},{"alias_kind":"pith_short_8","alias_value":"TPHYTWX5","created_at":"2026-07-05T09:55:54Z"}],"graph_snapshots":[{"event_id":"sha256:e8e68732cab0065be69fd40504bcdecc5c4a4825b2287189f4939a14a92389a0","target":"graph","created_at":"2026-07-05T09:55:54Z","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/2402.08583/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Link prediction, which aims to forecast unseen connections in graphs, is a fundamental task in graph machine learning. Heuristic methods, leveraging a range of different pairwise measures such as common neighbors and shortest paths, often rival the performance of vanilla Graph Neural Networks (GNNs). Therefore, recent advancements in GNNs for link prediction (GNN4LP) have primarily focused on integrating one or a few types of pairwise information. In this work, we reveal that different node pairs within the same dataset necessitate varied pairwise information for accurate prediction and models","authors_text":"Haoyu Han, Harry Shomer, Hui Liu, Jiliang Tang, Juanhui Li, Li Ma, Xiaofeng Gao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T16:36:50Z","title":"Mixture of Link Predictors on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08583","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:65644038f33ef5c17d7df1e0a50b12aca6c584446d70d2b31be1f42cbe28b3fa","target":"record","created_at":"2026-07-05T09:55:54Z","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":"f1ca098be250c268966c71daf6c8b67fb76d073746419b67064cf91bf9f86021","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T16:36:50Z","title_canon_sha256":"d673863a8aed57eef6b0bfcb65901a95e809418db61398821b00c560b9d9fba7"},"schema_version":"1.0","source":{"id":"2402.08583","kind":"arxiv","version":2}},"canonical_sha256":"9bcf89dafdfb8e848a26cab2fdf1aae155dc676a05bd3868efdd593e425a2b50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bcf89dafdfb8e848a26cab2fdf1aae155dc676a05bd3868efdd593e425a2b50","first_computed_at":"2026-07-05T09:55:54.596034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:54.596034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/cwhsd/Ea0oCF5ELQte+u2lYHjVKGfyUtS8co0O7HTDl8BDN87tBuLecbeCrRNm4xeT7NpNQLMGm2VK64RuQCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:54.596604Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.08583","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65644038f33ef5c17d7df1e0a50b12aca6c584446d70d2b31be1f42cbe28b3fa","sha256:e8e68732cab0065be69fd40504bcdecc5c4a4825b2287189f4939a14a92389a0"],"state_sha256":"4af8166525a90e6cb06f40b2065be90f03a9fe9518279cadda8ac57bfc4e93dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhG1CLF5J2jXJHiLWBwVj+Bt2FJ/uQ1LqmTIbpcTDexm+gcu4llovY2m3hmsTr0e/0h49rLR7g+KPQmUgsF4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T08:03:46.264595Z","bundle_sha256":"9dba55607293f2c6b0af1392981e5ac9058b86075689aa62f5a12817b26ce037"}}