{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LZT3AYQO5BOYLZWXFQVGL7RC23","short_pith_number":"pith:LZT3AYQO","schema_version":"1.0","canonical_sha256":"5e67b0620ee85d85e6d72c2a65fe22d6f3643ec9332790babd34577ca23e1b16","source":{"kind":"arxiv","id":"2503.04822","version":1},"attestation_state":"computed","paper":{"title":"HeTGB: A Comprehensive Benchmark for Heterophilic Text-Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chuan Shi, Shujie Li, Yuan Fang, Yuxia Wu","submitted_at":"2025-03-05T02:00:32Z","abstract_excerpt":"Graph neural networks (GNNs) have demonstrated success in modeling relational data primarily under the assumption of homophily. However, many real-world graphs exhibit heterophily, where linked nodes belong to different categories or possess diverse attributes. Additionally, nodes in many domains are associated with textual descriptions, forming heterophilic text-attributed graphs (TAGs). Despite their significance, the study of heterophilic TAGs remains underexplored due to the lack of comprehensive benchmarks. To address this gap, we introduce the Heterophilic Text-attributed Graph Benchmark"},"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":"2503.04822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-03-05T02:00:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2d01471f74e58ae5fe817da0af54f450f1ec7469f15719c0437f7d38ab712818","abstract_canon_sha256":"70648e4b4d0958c8102e1b3175ac11319a6c1fe20df179c7a4dfcc87a0ff456a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:25:49.791372Z","signature_b64":"mrfYmCKOTJe2DZHgB9+B/Mk9hetU5uoWz6O5hGwgQw4/JmCrApp038aE2udF/6l4TsGH/z/GDUH2cC8Vqx5vAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e67b0620ee85d85e6d72c2a65fe22d6f3643ec9332790babd34577ca23e1b16","last_reissued_at":"2026-07-05T10:25:49.790867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:25:49.790867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HeTGB: A Comprehensive Benchmark for Heterophilic Text-Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chuan Shi, Shujie Li, Yuan Fang, Yuxia Wu","submitted_at":"2025-03-05T02:00:32Z","abstract_excerpt":"Graph neural networks (GNNs) have demonstrated success in modeling relational data primarily under the assumption of homophily. However, many real-world graphs exhibit heterophily, where linked nodes belong to different categories or possess diverse attributes. Additionally, nodes in many domains are associated with textual descriptions, forming heterophilic text-attributed graphs (TAGs). Despite their significance, the study of heterophilic TAGs remains underexplored due to the lack of comprehensive benchmarks. To address this gap, we introduce the Heterophilic Text-attributed Graph Benchmark"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.04822","kind":"arxiv","version":1},"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/2503.04822/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":"2503.04822","created_at":"2026-07-05T10:25:49.790926+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.04822v1","created_at":"2026-07-05T10:25:49.790926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.04822","created_at":"2026-07-05T10:25:49.790926+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZT3AYQO5BOY","created_at":"2026-07-05T10:25:49.790926+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZT3AYQO5BOYLZWX","created_at":"2026-07-05T10:25:49.790926+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZT3AYQO","created_at":"2026-07-05T10:25:49.790926+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00513","citing_title":"ControBench: An Interaction-Aware Benchmark for Controversial Discourse Analysis on Social Networks","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZT3AYQO5BOYLZWXFQVGL7RC23","json":"https://pith.science/pith/LZT3AYQO5BOYLZWXFQVGL7RC23.json","graph_json":"https://pith.science/api/pith-number/LZT3AYQO5BOYLZWXFQVGL7RC23/graph.json","events_json":"https://pith.science/api/pith-number/LZT3AYQO5BOYLZWXFQVGL7RC23/events.json","paper":"https://pith.science/paper/LZT3AYQO"},"agent_actions":{"view_html":"https://pith.science/pith/LZT3AYQO5BOYLZWXFQVGL7RC23","download_json":"https://pith.science/pith/LZT3AYQO5BOYLZWXFQVGL7RC23.json","view_paper":"https://pith.science/paper/LZT3AYQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.04822&json=true","fetch_graph":"https://pith.science/api/pith-number/LZT3AYQO5BOYLZWXFQVGL7RC23/graph.json","fetch_events":"https://pith.science/api/pith-number/LZT3AYQO5BOYLZWXFQVGL7RC23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZT3AYQO5BOYLZWXFQVGL7RC23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZT3AYQO5BOYLZWXFQVGL7RC23/action/storage_attestation","attest_author":"https://pith.science/pith/LZT3AYQO5BOYLZWXFQVGL7RC23/action/author_attestation","sign_citation":"https://pith.science/pith/LZT3AYQO5BOYLZWXFQVGL7RC23/action/citation_signature","submit_replication":"https://pith.science/pith/LZT3AYQO5BOYLZWXFQVGL7RC23/action/replication_record"}},"created_at":"2026-07-05T10:25:49.790926+00:00","updated_at":"2026-07-05T10:25:49.790926+00:00"}