{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:76PVJEQGPQGCRKYVOUACWSXIDZ","short_pith_number":"pith:76PVJEQG","canonical_record":{"source":{"id":"2412.00261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-29T21:22:35Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"d982cc45502e82777d691227e3a5a4f9852d24b8ba6c6237940d8fabc59786b7","abstract_canon_sha256":"2b22c4a59d07d020796a7161665f7059d08f9e69e7e8cff7611736176eae5397"},"schema_version":"1.0"},"canonical_sha256":"ff9f5492067c0c28ab1575002b4ae81e46c5543a03592e4726d00c0a84efc93a","source":{"kind":"arxiv","id":"2412.00261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00261","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00261v1","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00261","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"76PVJEQGPQGC","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"pith_short_16","alias_value":"76PVJEQGPQGCRKYV","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"pith_short_8","alias_value":"76PVJEQG","created_at":"2026-07-05T09:42:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:76PVJEQGPQGCRKYVOUACWSXIDZ","target":"record","payload":{"canonical_record":{"source":{"id":"2412.00261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-29T21:22:35Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"d982cc45502e82777d691227e3a5a4f9852d24b8ba6c6237940d8fabc59786b7","abstract_canon_sha256":"2b22c4a59d07d020796a7161665f7059d08f9e69e7e8cff7611736176eae5397"},"schema_version":"1.0"},"canonical_sha256":"ff9f5492067c0c28ab1575002b4ae81e46c5543a03592e4726d00c0a84efc93a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:38.506275Z","signature_b64":"rOfJkx6uy4TzIvjr5UwmeiltxdXlARTQNmC07m9nWxNfdIlbpMrTiQ9sRpVdUq1Tx+1KRlCH2k+uXOGl/doXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9f5492067c0c28ab1575002b4ae81e46c5543a03592e4726d00c0a84efc93a","last_reissued_at":"2026-07-05T09:42:38.505755Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:38.505755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.00261","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-07-05T09:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lbQXIvGWYqEob6yNlMIXjE2fE78+pumilvJVcXRjywiS477bjahWfmCJM5TyPkrIcV1D3IbUxFczlWdDOMIbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:50:38.614238Z"},"content_sha256":"fa4a2cce1e87fcb2a63fb97055b8640d6899653c822c6f8706c2ad0bdeb8ca3c","schema_version":"1.0","event_id":"sha256:fa4a2cce1e87fcb2a63fb97055b8640d6899653c822c6f8706c2ad0bdeb8ca3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:76PVJEQGPQGCRKYVOUACWSXIDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attribute-Enhanced Similarity Ranking for Sparse Link Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Ambuj Singh, Arlei Silva, Jo\\~ao Mattos, Mert Kosan, Zexi Huang","submitted_at":"2024-11-29T21:22:35Z","abstract_excerpt":"Link prediction is a fundamental problem in graph data. In its most realistic setting, the problem consists of predicting missing or future links between random pairs of nodes from the set of disconnected pairs. Graph Neural Networks (GNNs) have become the predominant framework for link prediction. GNN-based methods treat link prediction as a binary classification problem and handle the extreme class imbalance -- real graphs are very sparse -- by sampling (uniformly at random) a balanced number of disconnected pairs not only for training but also for evaluation. However, we show that the repor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00261","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.00261/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:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KM3VoGgsKBjaDLPIEoKqAWEWjMEva50niyzN/pFxxSgkulKY2+b9Xu0Dx5wsTaGlIJRLgRbrq0Zn6YRNXIxxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:50:38.615223Z"},"content_sha256":"29a1f268047bada7b6beba2a0cca8218c101ff209585d8be9ddd0106072a8a14","schema_version":"1.0","event_id":"sha256:29a1f268047bada7b6beba2a0cca8218c101ff209585d8be9ddd0106072a8a14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/bundle.json","state_url":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/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-14T12:50:38Z","links":{"resolver":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ","bundle":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/bundle.json","state":"https://pith.science/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76PVJEQGPQGCRKYVOUACWSXIDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:76PVJEQGPQGCRKYVOUACWSXIDZ","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":"2b22c4a59d07d020796a7161665f7059d08f9e69e7e8cff7611736176eae5397","cross_cats_sorted":["cs.AI","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-29T21:22:35Z","title_canon_sha256":"d982cc45502e82777d691227e3a5a4f9852d24b8ba6c6237940d8fabc59786b7"},"schema_version":"1.0","source":{"id":"2412.00261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00261","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00261v1","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00261","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"76PVJEQGPQGC","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"pith_short_16","alias_value":"76PVJEQGPQGCRKYV","created_at":"2026-07-05T09:42:38Z"},{"alias_kind":"pith_short_8","alias_value":"76PVJEQG","created_at":"2026-07-05T09:42:38Z"}],"graph_snapshots":[{"event_id":"sha256:29a1f268047bada7b6beba2a0cca8218c101ff209585d8be9ddd0106072a8a14","target":"graph","created_at":"2026-07-05T09:42:38Z","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/2412.00261/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Link prediction is a fundamental problem in graph data. In its most realistic setting, the problem consists of predicting missing or future links between random pairs of nodes from the set of disconnected pairs. Graph Neural Networks (GNNs) have become the predominant framework for link prediction. GNN-based methods treat link prediction as a binary classification problem and handle the extreme class imbalance -- real graphs are very sparse -- by sampling (uniformly at random) a balanced number of disconnected pairs not only for training but also for evaluation. However, we show that the repor","authors_text":"Ambuj Singh, Arlei Silva, Jo\\~ao Mattos, Mert Kosan, Zexi Huang","cross_cats":["cs.AI","cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-29T21:22:35Z","title":"Attribute-Enhanced Similarity Ranking for Sparse Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00261","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:fa4a2cce1e87fcb2a63fb97055b8640d6899653c822c6f8706c2ad0bdeb8ca3c","target":"record","created_at":"2026-07-05T09:42:38Z","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":"2b22c4a59d07d020796a7161665f7059d08f9e69e7e8cff7611736176eae5397","cross_cats_sorted":["cs.AI","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-29T21:22:35Z","title_canon_sha256":"d982cc45502e82777d691227e3a5a4f9852d24b8ba6c6237940d8fabc59786b7"},"schema_version":"1.0","source":{"id":"2412.00261","kind":"arxiv","version":1}},"canonical_sha256":"ff9f5492067c0c28ab1575002b4ae81e46c5543a03592e4726d00c0a84efc93a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff9f5492067c0c28ab1575002b4ae81e46c5543a03592e4726d00c0a84efc93a","first_computed_at":"2026-07-05T09:42:38.505755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:38.505755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rOfJkx6uy4TzIvjr5UwmeiltxdXlARTQNmC07m9nWxNfdIlbpMrTiQ9sRpVdUq1Tx+1KRlCH2k+uXOGl/doXDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:38.506275Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.00261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa4a2cce1e87fcb2a63fb97055b8640d6899653c822c6f8706c2ad0bdeb8ca3c","sha256:29a1f268047bada7b6beba2a0cca8218c101ff209585d8be9ddd0106072a8a14"],"state_sha256":"a8a21608b1fcb767bfeb22df826f91373e2481d11b0cd040855b6e491bee9048"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndeLEurFyxKkYVfeTWHCT4ZA22X11irtKO6N4S4KFBrbO7vqZlnJYkylyKPLJB+RfwJ6TzbDJpHTONZkqGuvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T12:50:38.620607Z","bundle_sha256":"da514c6ded44bb7d3a871cc7d7e6259e37633cfde2782dbeeacc9df7ae852bcf"}}