{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3BRKET7BWZ2VJ7HCIVWBN4JIAQ","short_pith_number":"pith:3BRKET7B","canonical_record":{"source":{"id":"2402.07738","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T15:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"ebcb67fbaeb564e9f7ea822189e80aeafd30f629787e0d8496b1e0758c34cbca","abstract_canon_sha256":"2430cdde951dc1b18379e76309a65938d32ee84324833d982a59a05c21dd85d2"},"schema_version":"1.0"},"canonical_sha256":"d862a24fe1b67554fce2456c16f1280405bd4420599c31bd16bd5120594dc499","source":{"kind":"arxiv","id":"2402.07738","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.07738","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"arxiv_version","alias_value":"2402.07738v2","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07738","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"pith_short_12","alias_value":"3BRKET7BWZ2V","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"pith_short_16","alias_value":"3BRKET7BWZ2VJ7HC","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"pith_short_8","alias_value":"3BRKET7B","created_at":"2026-07-05T07:45:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3BRKET7BWZ2VJ7HCIVWBN4JIAQ","target":"record","payload":{"canonical_record":{"source":{"id":"2402.07738","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T15:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"ebcb67fbaeb564e9f7ea822189e80aeafd30f629787e0d8496b1e0758c34cbca","abstract_canon_sha256":"2430cdde951dc1b18379e76309a65938d32ee84324833d982a59a05c21dd85d2"},"schema_version":"1.0"},"canonical_sha256":"d862a24fe1b67554fce2456c16f1280405bd4420599c31bd16bd5120594dc499","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:33.528870Z","signature_b64":"ixAaZ9UJ67Z7cL+JQd8JHN8vt7Rmf8XIIt/rK7oMksIN20AG0/vhSfZId6/jbxfRu5X+n0QSJFFLXT2M7i3TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d862a24fe1b67554fce2456c16f1280405bd4420599c31bd16bd5120594dc499","last_reissued_at":"2026-07-05T07:45:33.528388Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:33.528388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.07738","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:45:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4F5ZAoqhweXa9wd77GL+1sF9lwd4assmnToOzWVPIea/G/RRVx6wYUECov9SwH+9WM3JWAdqLOJr2IWze981Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T02:47:44.557655Z"},"content_sha256":"8283a2b8138b3cf1d80916b9c93b3e54ffb39470321cd1016559027d2cb73a6a","schema_version":"1.0","event_id":"sha256:8283a2b8138b3cf1d80916b9c93b3e54ffb39470321cd1016559027d2cb73a6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3BRKET7BWZ2VJ7HCIVWBN4JIAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Link Predictor By In-Context Learning on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haitao Mao, Kaiwen Dong, Nitesh V. Chawla, Zhichun Guo","submitted_at":"2024-02-12T15:52:27Z","abstract_excerpt":"Link prediction is a crucial task in graph machine learning, where the goal is to infer missing or future links within a graph. Traditional approaches leverage heuristic methods based on widely observed connectivity patterns, offering broad applicability and generalizability without the need for model training. Despite their utility, these methods are limited by their reliance on human-derived heuristics and lack the adaptability of data-driven approaches. Conversely, parametric link predictors excel in automatically learning the connectivity patterns from data and achieving state-of-the-art b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07738","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.07738/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:45:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rhl3tbgSH6hjw17NMFynSK6oi7pg3WdXqGf+fL+2GPtkXIYpQGnhib45SoGf0LlbrsoTOA5SmuynFjYAYdyEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T02:47:44.558206Z"},"content_sha256":"1f92b30e926e07bdcf7827ddec64d0cff80c59333a0170525274cb9f92a070fe","schema_version":"1.0","event_id":"sha256:1f92b30e926e07bdcf7827ddec64d0cff80c59333a0170525274cb9f92a070fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BRKET7BWZ2VJ7HCIVWBN4JIAQ/bundle.json","state_url":"https://pith.science/pith/3BRKET7BWZ2VJ7HCIVWBN4JIAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BRKET7BWZ2VJ7HCIVWBN4JIAQ/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-19T02:47:44Z","links":{"resolver":"https://pith.science/pith/3BRKET7BWZ2VJ7HCIVWBN4JIAQ","bundle":"https://pith.science/pith/3BRKET7BWZ2VJ7HCIVWBN4JIAQ/bundle.json","state":"https://pith.science/pith/3BRKET7BWZ2VJ7HCIVWBN4JIAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BRKET7BWZ2VJ7HCIVWBN4JIAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3BRKET7BWZ2VJ7HCIVWBN4JIAQ","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":"2430cdde951dc1b18379e76309a65938d32ee84324833d982a59a05c21dd85d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T15:52:27Z","title_canon_sha256":"ebcb67fbaeb564e9f7ea822189e80aeafd30f629787e0d8496b1e0758c34cbca"},"schema_version":"1.0","source":{"id":"2402.07738","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.07738","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"arxiv_version","alias_value":"2402.07738v2","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07738","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"pith_short_12","alias_value":"3BRKET7BWZ2V","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"pith_short_16","alias_value":"3BRKET7BWZ2VJ7HC","created_at":"2026-07-05T07:45:33Z"},{"alias_kind":"pith_short_8","alias_value":"3BRKET7B","created_at":"2026-07-05T07:45:33Z"}],"graph_snapshots":[{"event_id":"sha256:1f92b30e926e07bdcf7827ddec64d0cff80c59333a0170525274cb9f92a070fe","target":"graph","created_at":"2026-07-05T07:45:33Z","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.07738/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Link prediction is a crucial task in graph machine learning, where the goal is to infer missing or future links within a graph. Traditional approaches leverage heuristic methods based on widely observed connectivity patterns, offering broad applicability and generalizability without the need for model training. Despite their utility, these methods are limited by their reliance on human-derived heuristics and lack the adaptability of data-driven approaches. Conversely, parametric link predictors excel in automatically learning the connectivity patterns from data and achieving state-of-the-art b","authors_text":"Haitao Mao, Kaiwen Dong, Nitesh V. Chawla, Zhichun Guo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T15:52:27Z","title":"Universal Link Predictor By In-Context Learning on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07738","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:8283a2b8138b3cf1d80916b9c93b3e54ffb39470321cd1016559027d2cb73a6a","target":"record","created_at":"2026-07-05T07:45:33Z","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":"2430cdde951dc1b18379e76309a65938d32ee84324833d982a59a05c21dd85d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T15:52:27Z","title_canon_sha256":"ebcb67fbaeb564e9f7ea822189e80aeafd30f629787e0d8496b1e0758c34cbca"},"schema_version":"1.0","source":{"id":"2402.07738","kind":"arxiv","version":2}},"canonical_sha256":"d862a24fe1b67554fce2456c16f1280405bd4420599c31bd16bd5120594dc499","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d862a24fe1b67554fce2456c16f1280405bd4420599c31bd16bd5120594dc499","first_computed_at":"2026-07-05T07:45:33.528388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:45:33.528388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ixAaZ9UJ67Z7cL+JQd8JHN8vt7Rmf8XIIt/rK7oMksIN20AG0/vhSfZId6/jbxfRu5X+n0QSJFFLXT2M7i3TBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:45:33.528870Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.07738","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8283a2b8138b3cf1d80916b9c93b3e54ffb39470321cd1016559027d2cb73a6a","sha256:1f92b30e926e07bdcf7827ddec64d0cff80c59333a0170525274cb9f92a070fe"],"state_sha256":"11209705fb9697621b7506a3735f5bfdbd9b7a158861122ceb93aa8cb71c774b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRBLXCuDmrZcICSMQT6QcSujs52Mal6BkqAvJlKLbHZsESWle9JZ+w6vTlWfft9VmEGxD4MjxheHKNtVplAPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T02:47:44.564212Z","bundle_sha256":"07eabbadd623e2effddfbdf124fbbb71924301d92571a5fcb2ed0dfe18d56795"}}