{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EN4E6O2UNNYMJ3LV4KYWUOHWJU","short_pith_number":"pith:EN4E6O2U","schema_version":"1.0","canonical_sha256":"23784f3b546b70c4ed75e2b16a38f64d17db05ebd9e205a4c9eadc0e81b0bf2c","source":{"kind":"arxiv","id":"2209.15486","version":3},"attestation_state":"computed","paper":{"title":"Graph Neural Networks for Link Prediction with Subgraph Sketching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Benjamin Paul Chamberlain, Emanuele Rossi, Fabrizio Frasca, Max Hansmire, Michael M. Bronstein, Nils Hammerla, Sergey Shirobokov, Thomas Markovich","submitted_at":"2022-09-30T14:20:07Z","abstract_excerpt":"Many Graph Neural Networks (GNNs) perform poorly compared to simple heuristics on Link Prediction (LP) tasks. This is due to limitations in expressive power such as the inability to count triangles (the backbone of most LP heuristics) and because they can not distinguish automorphic nodes (those having identical structural roles). Both expressiveness issues can be alleviated by learning link (rather than node) representations and incorporating structural features such as triangle counts. Since explicit link representations are often prohibitively expensive, recent works resorted to subgraph-ba"},"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":"2209.15486","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-09-30T14:20:07Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"246881cc7ec1f77300c653062e17e94f0d6c49b4647d977316941779c5f091df","abstract_canon_sha256":"62efdc5ea3dcc8c28460ae7443dfb288486dd43127f93d6017fe10f6e96d3b90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:03.337488Z","signature_b64":"xLQr+SXMVn+uM4+NaXdeKeEuI4+8EopFrjJiygbDEznYRvs+RpXfZflkzVm5EgqPY8ybeJNL0cP0Ao1yOR3UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23784f3b546b70c4ed75e2b16a38f64d17db05ebd9e205a4c9eadc0e81b0bf2c","last_reissued_at":"2026-07-05T06:06:03.336841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:03.336841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Networks for Link Prediction with Subgraph Sketching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Benjamin Paul Chamberlain, Emanuele Rossi, Fabrizio Frasca, Max Hansmire, Michael M. Bronstein, Nils Hammerla, Sergey Shirobokov, Thomas Markovich","submitted_at":"2022-09-30T14:20:07Z","abstract_excerpt":"Many Graph Neural Networks (GNNs) perform poorly compared to simple heuristics on Link Prediction (LP) tasks. This is due to limitations in expressive power such as the inability to count triangles (the backbone of most LP heuristics) and because they can not distinguish automorphic nodes (those having identical structural roles). Both expressiveness issues can be alleviated by learning link (rather than node) representations and incorporating structural features such as triangle counts. Since explicit link representations are often prohibitively expensive, recent works resorted to subgraph-ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.15486","kind":"arxiv","version":3},"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/2209.15486/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":"2209.15486","created_at":"2026-07-05T06:06:03.336918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.15486v3","created_at":"2026-07-05T06:06:03.336918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.15486","created_at":"2026-07-05T06:06:03.336918+00:00"},{"alias_kind":"pith_short_12","alias_value":"EN4E6O2UNNYM","created_at":"2026-07-05T06:06:03.336918+00:00"},{"alias_kind":"pith_short_16","alias_value":"EN4E6O2UNNYMJ3LV","created_at":"2026-07-05T06:06:03.336918+00:00"},{"alias_kind":"pith_short_8","alias_value":"EN4E6O2U","created_at":"2026-07-05T06:06:03.336918+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.12369","citing_title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16902","citing_title":"ArtifactLinker: Linking Scientific Artifacts for Automatic State-of-the-Art Discovery","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EN4E6O2UNNYMJ3LV4KYWUOHWJU","json":"https://pith.science/pith/EN4E6O2UNNYMJ3LV4KYWUOHWJU.json","graph_json":"https://pith.science/api/pith-number/EN4E6O2UNNYMJ3LV4KYWUOHWJU/graph.json","events_json":"https://pith.science/api/pith-number/EN4E6O2UNNYMJ3LV4KYWUOHWJU/events.json","paper":"https://pith.science/paper/EN4E6O2U"},"agent_actions":{"view_html":"https://pith.science/pith/EN4E6O2UNNYMJ3LV4KYWUOHWJU","download_json":"https://pith.science/pith/EN4E6O2UNNYMJ3LV4KYWUOHWJU.json","view_paper":"https://pith.science/paper/EN4E6O2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.15486&json=true","fetch_graph":"https://pith.science/api/pith-number/EN4E6O2UNNYMJ3LV4KYWUOHWJU/graph.json","fetch_events":"https://pith.science/api/pith-number/EN4E6O2UNNYMJ3LV4KYWUOHWJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EN4E6O2UNNYMJ3LV4KYWUOHWJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EN4E6O2UNNYMJ3LV4KYWUOHWJU/action/storage_attestation","attest_author":"https://pith.science/pith/EN4E6O2UNNYMJ3LV4KYWUOHWJU/action/author_attestation","sign_citation":"https://pith.science/pith/EN4E6O2UNNYMJ3LV4KYWUOHWJU/action/citation_signature","submit_replication":"https://pith.science/pith/EN4E6O2UNNYMJ3LV4KYWUOHWJU/action/replication_record"}},"created_at":"2026-07-05T06:06:03.336918+00:00","updated_at":"2026-07-05T06:06:03.336918+00:00"}