{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A7YYBEEZPCC2THIIJDNEZT2Q6C","short_pith_number":"pith:A7YYBEEZ","schema_version":"1.0","canonical_sha256":"07f18090997885a99d0848da4ccf50f0bad2c19ee8352788e6470d335b1d25ba","source":{"kind":"arxiv","id":"2309.00976","version":4},"attestation_state":"computed","paper":{"title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR","cs.SI"],"primary_cat":"cs.LG","authors_text":"Kaiwen Dong, Nitesh V. Chawla, Zhichun Guo","submitted_at":"2023-09-02T16:20:41Z","abstract_excerpt":"Message Passing Neural Networks (MPNNs) have emerged as the {\\em de facto} standard in graph representation learning. However, when it comes to link prediction, they often struggle, surpassed by simple heuristics such as Common Neighbor (CN). This discrepancy stems from a fundamental limitation: while MPNNs excel in node-level representation, they stumble with encoding the joint structural features essential to link prediction, like CN. To bridge this gap, we posit that, by harnessing the orthogonality of input vectors, pure message-passing can indeed capture joint structural features. Specifi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2309.00976","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-02T16:20:41Z","cross_cats_sorted":["cs.IR","cs.SI"],"title_canon_sha256":"90ccce16480e5b29d36cdc041ba67062bd4b86d3fa71052d96a150c6f4a8517f","abstract_canon_sha256":"93933c38998785ac973ec2c78ffce16a35712a29206f0a167c571b15be409cef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:51.873036Z","signature_b64":"eSJiRMtGH5mj/B58WSVthk+kryh8mnpBVckMy2CuANhht2dQiSTZcq15fTZvgTe8XZxJehgSQz+HUIa2GQpJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07f18090997885a99d0848da4ccf50f0bad2c19ee8352788e6470d335b1d25ba","last_reissued_at":"2026-07-05T09:19:51.872526Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:51.872526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR","cs.SI"],"primary_cat":"cs.LG","authors_text":"Kaiwen Dong, Nitesh V. Chawla, Zhichun Guo","submitted_at":"2023-09-02T16:20:41Z","abstract_excerpt":"Message Passing Neural Networks (MPNNs) have emerged as the {\\em de facto} standard in graph representation learning. However, when it comes to link prediction, they often struggle, surpassed by simple heuristics such as Common Neighbor (CN). This discrepancy stems from a fundamental limitation: while MPNNs excel in node-level representation, they stumble with encoding the joint structural features essential to link prediction, like CN. To bridge this gap, we posit that, by harnessing the orthogonality of input vectors, pure message-passing can indeed capture joint structural features. Specifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.00976","kind":"arxiv","version":4},"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/2309.00976/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2309.00976","created_at":"2026-07-05T09:19:51.872594+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.00976v4","created_at":"2026-07-05T09:19:51.872594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.00976","created_at":"2026-07-05T09:19:51.872594+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7YYBEEZPCC2","created_at":"2026-07-05T09:19:51.872594+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7YYBEEZPCC2THII","created_at":"2026-07-05T09:19:51.872594+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7YYBEEZ","created_at":"2026-07-05T09:19:51.872594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09234","citing_title":"Transaction Categorization with Relational Deep Learning in QuickBooks","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A7YYBEEZPCC2THIIJDNEZT2Q6C","json":"https://pith.science/pith/A7YYBEEZPCC2THIIJDNEZT2Q6C.json","graph_json":"https://pith.science/api/pith-number/A7YYBEEZPCC2THIIJDNEZT2Q6C/graph.json","events_json":"https://pith.science/api/pith-number/A7YYBEEZPCC2THIIJDNEZT2Q6C/events.json","paper":"https://pith.science/paper/A7YYBEEZ"},"agent_actions":{"view_html":"https://pith.science/pith/A7YYBEEZPCC2THIIJDNEZT2Q6C","download_json":"https://pith.science/pith/A7YYBEEZPCC2THIIJDNEZT2Q6C.json","view_paper":"https://pith.science/paper/A7YYBEEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.00976&json=true","fetch_graph":"https://pith.science/api/pith-number/A7YYBEEZPCC2THIIJDNEZT2Q6C/graph.json","fetch_events":"https://pith.science/api/pith-number/A7YYBEEZPCC2THIIJDNEZT2Q6C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7YYBEEZPCC2THIIJDNEZT2Q6C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7YYBEEZPCC2THIIJDNEZT2Q6C/action/storage_attestation","attest_author":"https://pith.science/pith/A7YYBEEZPCC2THIIJDNEZT2Q6C/action/author_attestation","sign_citation":"https://pith.science/pith/A7YYBEEZPCC2THIIJDNEZT2Q6C/action/citation_signature","submit_replication":"https://pith.science/pith/A7YYBEEZPCC2THIIJDNEZT2Q6C/action/replication_record"}},"created_at":"2026-07-05T09:19:51.872594+00:00","updated_at":"2026-07-05T09:19:51.872594+00:00"}