{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FSASDSINFIBEXVJRXHYLGVE6CG","short_pith_number":"pith:FSASDSIN","schema_version":"1.0","canonical_sha256":"2c8121c90d2a024bd531b9f0b3549e119423d27ee594dbe810a4292edf5b8ea2","source":{"kind":"arxiv","id":"2411.04356","version":1},"attestation_state":"computed","paper":{"title":"GaGSL: Global-augmented Graph Structure Learning via Graph Information Bottleneck","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Baoming Zhang, Chongjun Wang, Gaoli Ruan, Jiangqing Song, Junyuan Xie, Shuangjie Li","submitted_at":"2024-11-07T01:23:48Z","abstract_excerpt":"Graph neural networks (GNNs) are prominent for their effectiveness in processing graph data for semi-supervised node classification tasks. Most works of GNNs assume that the observed structure accurately represents the underlying node relationships. However, the graph structure is inevitably noisy or incomplete in reality, which can degrade the quality of graph representations. Therefore, it is imperative to learn a clean graph structure that balances performance and robustness. In this paper, we propose a novel method named \\textit{Global-augmented Graph Structure Learning} (GaGSL), guided by"},"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.04356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-07T01:23:48Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a3394d160618a1618bca87ed98f41620a0043dca6922270751db1d4d088781ab","abstract_canon_sha256":"26411fca71492f43b1d162f32b05451768b8d08e762982bb0a2e2cc8a9d16cde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:18.033535Z","signature_b64":"6mA25BgIdbPvLkY/2tyz5GVmvzp5Bd6tWSNWLunttN8IImE1LxwzN2j0XMl1w4S9zznTBIZkD4F/tkiW3d6YCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c8121c90d2a024bd531b9f0b3549e119423d27ee594dbe810a4292edf5b8ea2","last_reissued_at":"2026-07-05T09:32:18.032960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:18.032960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GaGSL: Global-augmented Graph Structure Learning via Graph Information Bottleneck","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Baoming Zhang, Chongjun Wang, Gaoli Ruan, Jiangqing Song, Junyuan Xie, Shuangjie Li","submitted_at":"2024-11-07T01:23:48Z","abstract_excerpt":"Graph neural networks (GNNs) are prominent for their effectiveness in processing graph data for semi-supervised node classification tasks. Most works of GNNs assume that the observed structure accurately represents the underlying node relationships. However, the graph structure is inevitably noisy or incomplete in reality, which can degrade the quality of graph representations. Therefore, it is imperative to learn a clean graph structure that balances performance and robustness. In this paper, we propose a novel method named \\textit{Global-augmented Graph Structure Learning} (GaGSL), guided by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04356","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/2411.04356/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.04356","created_at":"2026-07-05T09:32:18.033028+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04356v1","created_at":"2026-07-05T09:32:18.033028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04356","created_at":"2026-07-05T09:32:18.033028+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSASDSINFIBE","created_at":"2026-07-05T09:32:18.033028+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSASDSINFIBEXVJR","created_at":"2026-07-05T09:32:18.033028+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSASDSIN","created_at":"2026-07-05T09:32:18.033028+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20853","citing_title":"Cooperation of Experts: Fusing Heterogeneous Information with Large Margin","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FSASDSINFIBEXVJRXHYLGVE6CG","json":"https://pith.science/pith/FSASDSINFIBEXVJRXHYLGVE6CG.json","graph_json":"https://pith.science/api/pith-number/FSASDSINFIBEXVJRXHYLGVE6CG/graph.json","events_json":"https://pith.science/api/pith-number/FSASDSINFIBEXVJRXHYLGVE6CG/events.json","paper":"https://pith.science/paper/FSASDSIN"},"agent_actions":{"view_html":"https://pith.science/pith/FSASDSINFIBEXVJRXHYLGVE6CG","download_json":"https://pith.science/pith/FSASDSINFIBEXVJRXHYLGVE6CG.json","view_paper":"https://pith.science/paper/FSASDSIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04356&json=true","fetch_graph":"https://pith.science/api/pith-number/FSASDSINFIBEXVJRXHYLGVE6CG/graph.json","fetch_events":"https://pith.science/api/pith-number/FSASDSINFIBEXVJRXHYLGVE6CG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSASDSINFIBEXVJRXHYLGVE6CG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSASDSINFIBEXVJRXHYLGVE6CG/action/storage_attestation","attest_author":"https://pith.science/pith/FSASDSINFIBEXVJRXHYLGVE6CG/action/author_attestation","sign_citation":"https://pith.science/pith/FSASDSINFIBEXVJRXHYLGVE6CG/action/citation_signature","submit_replication":"https://pith.science/pith/FSASDSINFIBEXVJRXHYLGVE6CG/action/replication_record"}},"created_at":"2026-07-05T09:32:18.033028+00:00","updated_at":"2026-07-05T09:32:18.033028+00:00"}