{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BUPKNNMVXFGLABMBB2KAQP4R3W","short_pith_number":"pith:BUPKNNMV","schema_version":"1.0","canonical_sha256":"0d1ea6b595b94cb005810e94083f91dd8148100b3e3ca7003780eac63635371b","source":{"kind":"arxiv","id":"2411.03845","version":4},"attestation_state":"computed","paper":{"title":"Reconsidering the Performance of GAE in Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Muhan Zhang, Weishuo Ma, Xiyuan Wang, Yanbo Wang","submitted_at":"2024-11-06T11:29:47Z","abstract_excerpt":"Recent advancements in graph neural networks (GNNs) for link prediction have introduced sophisticated training techniques and model architectures. However, reliance on outdated baselines may exaggerate the benefits of these new approaches. To tackle this issue, we systematically explore Graph Autoencoders (GAEs) by applying model-agnostic tricks in recent methods and tuning hyperparameters. We find that a well-tuned GAE can match the performance of recent sophisticated models while offering superior computational efficiency on widely-used link prediction benchmarks. Our approach delivers subst"},"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":"2411.03845","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-06T11:29:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"15745fa737b86e062809ab95bedda35206e336018d1ce7e58afb07a53d28c985","abstract_canon_sha256":"8dbc582a49b2cd302a3a17fd7c1655a364b0b2735193aa022c2eb44e6206c7eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:44.649767Z","signature_b64":"mmc8OaxQRyQXgb5cooCRoSsqfKQu37BiY68HnxSvlOjLa8gNBS8W6TdWGhhNEe9Q4gZMmaO1wli4p9M0Es/cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d1ea6b595b94cb005810e94083f91dd8148100b3e3ca7003780eac63635371b","last_reissued_at":"2026-07-05T12:00:44.649287Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:44.649287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconsidering the Performance of GAE in Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Muhan Zhang, Weishuo Ma, Xiyuan Wang, Yanbo Wang","submitted_at":"2024-11-06T11:29:47Z","abstract_excerpt":"Recent advancements in graph neural networks (GNNs) for link prediction have introduced sophisticated training techniques and model architectures. However, reliance on outdated baselines may exaggerate the benefits of these new approaches. To tackle this issue, we systematically explore Graph Autoencoders (GAEs) by applying model-agnostic tricks in recent methods and tuning hyperparameters. We find that a well-tuned GAE can match the performance of recent sophisticated models while offering superior computational efficiency on widely-used link prediction benchmarks. Our approach delivers subst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03845","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/2411.03845/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":"2411.03845","created_at":"2026-07-05T12:00:44.649352+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03845v4","created_at":"2026-07-05T12:00:44.649352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03845","created_at":"2026-07-05T12:00:44.649352+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUPKNNMVXFGL","created_at":"2026-07-05T12:00:44.649352+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUPKNNMVXFGLABMB","created_at":"2026-07-05T12:00:44.649352+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUPKNNMV","created_at":"2026-07-05T12:00:44.649352+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14114","citing_title":"Evaluating Loss Functions for Graph Neural Networks: Towards Pretraining and Generalization","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BUPKNNMVXFGLABMBB2KAQP4R3W","json":"https://pith.science/pith/BUPKNNMVXFGLABMBB2KAQP4R3W.json","graph_json":"https://pith.science/api/pith-number/BUPKNNMVXFGLABMBB2KAQP4R3W/graph.json","events_json":"https://pith.science/api/pith-number/BUPKNNMVXFGLABMBB2KAQP4R3W/events.json","paper":"https://pith.science/paper/BUPKNNMV"},"agent_actions":{"view_html":"https://pith.science/pith/BUPKNNMVXFGLABMBB2KAQP4R3W","download_json":"https://pith.science/pith/BUPKNNMVXFGLABMBB2KAQP4R3W.json","view_paper":"https://pith.science/paper/BUPKNNMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03845&json=true","fetch_graph":"https://pith.science/api/pith-number/BUPKNNMVXFGLABMBB2KAQP4R3W/graph.json","fetch_events":"https://pith.science/api/pith-number/BUPKNNMVXFGLABMBB2KAQP4R3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUPKNNMVXFGLABMBB2KAQP4R3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUPKNNMVXFGLABMBB2KAQP4R3W/action/storage_attestation","attest_author":"https://pith.science/pith/BUPKNNMVXFGLABMBB2KAQP4R3W/action/author_attestation","sign_citation":"https://pith.science/pith/BUPKNNMVXFGLABMBB2KAQP4R3W/action/citation_signature","submit_replication":"https://pith.science/pith/BUPKNNMVXFGLABMBB2KAQP4R3W/action/replication_record"}},"created_at":"2026-07-05T12:00:44.649352+00:00","updated_at":"2026-07-05T12:00:44.649352+00:00"}