{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RXYI4O6O6LZ5ZJNZ6CDF5FNQFM","short_pith_number":"pith:RXYI4O6O","schema_version":"1.0","canonical_sha256":"8df08e3bcef2f3dca5b9f0865e95b02b060fd72f1ffa4bce97a9bd673b1aa3f4","source":{"kind":"arxiv","id":"2111.04840","version":3},"attestation_state":"computed","paper":{"title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Edward W Huang, Karthik Subbian, Nikhil Rao, Sumeet Katariya, Wenqing Zheng, Zhangyang Wang","submitted_at":"2021-11-08T21:29:25Z","abstract_excerpt":"Graph Neural Networks (GNNs) have achieved state-of-the-art performance in node classification, regression, and recommendation tasks. GNNs work well when rich and high-quality connections are available. However, their effectiveness is often jeopardized in many real-world graphs in which node degrees have power-law distributions. The extreme case of this situation, where a node may have no neighbors, is called Strict Cold Start (SCS). SCS forces the prediction to rely completely on the node's own features. We propose Cold Brew, a teacher-student distillation approach to address the SCS and nois"},"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":"2111.04840","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-08T21:29:25Z","cross_cats_sorted":[],"title_canon_sha256":"611a3ac15abc838876c8de22aea2d4a9cfb81597955a8482195452756e7a20d1","abstract_canon_sha256":"fd030334c8f9b9f970fb33bb3bd93e8bf99bcabbc3139e9afbbee9c1fb85be29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:04:43.339289Z","signature_b64":"msscp3oKkMxF6reW1FeLVCAwwoZh55XGJkeW1hf9VQZWDNO2iC//ZF9Vhz5cL3HkU1HsOD/4QjxbnJQu91jvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8df08e3bcef2f3dca5b9f0865e95b02b060fd72f1ffa4bce97a9bd673b1aa3f4","last_reissued_at":"2026-07-05T04:04:43.338794Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:04:43.338794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Edward W Huang, Karthik Subbian, Nikhil Rao, Sumeet Katariya, Wenqing Zheng, Zhangyang Wang","submitted_at":"2021-11-08T21:29:25Z","abstract_excerpt":"Graph Neural Networks (GNNs) have achieved state-of-the-art performance in node classification, regression, and recommendation tasks. GNNs work well when rich and high-quality connections are available. However, their effectiveness is often jeopardized in many real-world graphs in which node degrees have power-law distributions. The extreme case of this situation, where a node may have no neighbors, is called Strict Cold Start (SCS). SCS forces the prediction to rely completely on the node's own features. We propose Cold Brew, a teacher-student distillation approach to address the SCS and nois"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.04840","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/2111.04840/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":"2111.04840","created_at":"2026-07-05T04:04:43.338857+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.04840v3","created_at":"2026-07-05T04:04:43.338857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.04840","created_at":"2026-07-05T04:04:43.338857+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXYI4O6O6LZ5","created_at":"2026-07-05T04:04:43.338857+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXYI4O6O6LZ5ZJNZ","created_at":"2026-07-05T04:04:43.338857+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXYI4O6O","created_at":"2026-07-05T04:04:43.338857+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20840","citing_title":"Aggregation Buffer: Revisiting DropEdge with a New Parameter Block","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM","json":"https://pith.science/pith/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM.json","graph_json":"https://pith.science/api/pith-number/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM/graph.json","events_json":"https://pith.science/api/pith-number/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM/events.json","paper":"https://pith.science/paper/RXYI4O6O"},"agent_actions":{"view_html":"https://pith.science/pith/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM","download_json":"https://pith.science/pith/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM.json","view_paper":"https://pith.science/paper/RXYI4O6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.04840&json=true","fetch_graph":"https://pith.science/api/pith-number/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM/graph.json","fetch_events":"https://pith.science/api/pith-number/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM/action/storage_attestation","attest_author":"https://pith.science/pith/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM/action/author_attestation","sign_citation":"https://pith.science/pith/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM/action/citation_signature","submit_replication":"https://pith.science/pith/RXYI4O6O6LZ5ZJNZ6CDF5FNQFM/action/replication_record"}},"created_at":"2026-07-05T04:04:43.338857+00:00","updated_at":"2026-07-05T04:04:43.338857+00:00"}