{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WQOYL4D3H47KF4MJUFADZZBLQD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1e5a2724d9ce8e3188ceee6ce01543d1bea6fd266a552c72aa24f60d8df75691","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T04:46:59Z","title_canon_sha256":"5b8e26913a41a026635d2a556a429b53cbc3b2ffce46a0f825137e17d7e34666"},"schema_version":"1.0","source":{"id":"2605.16809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16809","created_at":"2026-05-20T00:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16809v1","created_at":"2026-05-20T00:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16809","created_at":"2026-05-20T00:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"WQOYL4D3H47K","created_at":"2026-05-20T00:03:23Z"},{"alias_kind":"pith_short_16","alias_value":"WQOYL4D3H47KF4MJ","created_at":"2026-05-20T00:03:23Z"},{"alias_kind":"pith_short_8","alias_value":"WQOYL4D3","created_at":"2026-05-20T00:03:23Z"}],"graph_snapshots":[{"event_id":"sha256:59fb6ef171e87fe5aa8674c30471c10cf8e006a89719d44eeca88bbdf1fa28ea","target":"graph","created_at":"2026-05-20T00:03:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"InGSL achieves significant performance improvements at a reduced number of edges by jointly considering both similarity and diversity in edge construction by incorporating a mutual-information-guided learning strategy."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that similarity-based edge construction is the primary source of structure redundancy and that a mutual-information term can reliably select informative edges without losing critical connections or adding new computational overhead that offsets the savings."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"InGSL reduces edge redundancy in existing graph structure learning methods by adding a mutual-information-guided diversity term, delivering better results with fewer edges across six tested frameworks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"InGSL reduces redundant edges in graph structure learning by balancing similarity and diversity through a mutual-information strategy."}],"snapshot_sha256":"e53b6f644f67758173a20d1e9e125995b36ebe067f43584611ae3374dd8079b0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"7225c22511d7db6da24c8b6af66982c4f72634d142ce743733490a696794f912"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.271752Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:11:43.493007Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.279734Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.418001Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16809/integrity.json","findings":[],"snapshot_sha256":"17527a542db66185537bb708801e5d053cedaae33ee8d70b49015fb6cd8a2a38","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The quality of graph-structured data is fundamental to the success of modern graph analysis techniques such as Graph Neural Networks (GNNs). However, real-world graph data is often suboptimal, suffering from issues such as noise and incomplete connections. Graph Structure Learning (GSL) has emerged as a promising technique that adaptively optimizes node connections. However, we observe that the effectiveness of GSL often comes at the cost of a dramatic expansion in edge count, resulting in significant storage and computational overhead.\n  In this work, we reveal that this limitation stems from","authors_text":"Bingde Hu, Canghong Jin, Can Wang, Da Zhong Li, Hai Lin, Jiawei Chen, Sheng Zhou, Shen Han, Zhiyao Zhou","cross_cats":[],"headline":"InGSL reduces redundant edges in graph structure learning by balancing similarity and diversity through a mutual-information strategy.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T04:46:59Z","title":"Informative Graph Structure Learning"},"references":{"count":56,"internal_anchors":1,"resolved_work":56,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Kipf and Max Welling","work_id":"b46adfec-f85a-4df1-be97-69900280ef43","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Neural message passing for quantum chemistry","work_id":"b2b7a819-41b5-4e72-b648-0a1e483424d0","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Convolutional neural networks on graphs with fast localized spectral filtering.Advances in Neural Information Processing Systems, 29, 2016","work_id":"a9f3ba97-af38-430b-bf54-5c4884fed14b","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Hatllm: Hierarchical attention mask- ing for enhanced collaborative modeling in llm-based recommendation.CoRR, abs/2510.10955, 2025","work_id":"bfc76c09-a5da-44ce-ae9a-91097f6a00ec","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Simplifying graph convolutional networks","work_id":"33c3dc29-7df5-4a85-8622-0d9d9f2ed6e0","year":2019}],"snapshot_sha256":"39a18657f5906db1929a781d44d6f9e5f73ee4d73c2b0afd7144f1c724af35a0"},"source":{"id":"2605.16809","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:04:28.461464Z","id":"928eaf83-998f-4bb7-9c77-b98735d20168","model_set":{"reader":"grok-4.3"},"one_line_summary":"InGSL reduces edge redundancy in existing graph structure learning methods by adding a mutual-information-guided diversity term, delivering better results with fewer edges across six tested frameworks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"InGSL reduces redundant edges in graph structure learning by balancing similarity and diversity through a mutual-information strategy.","strongest_claim":"InGSL achieves significant performance improvements at a reduced number of edges by jointly considering both similarity and diversity in edge construction by incorporating a mutual-information-guided learning strategy.","weakest_assumption":"The assumption that similarity-based edge construction is the primary source of structure redundancy and that a mutual-information term can reliably select informative edges without losing critical connections or adding new computational overhead that offsets the savings."}},"verdict_id":"928eaf83-998f-4bb7-9c77-b98735d20168"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3a3b99913e11934f6f7e2d44c2b62690886ee54fcf5dc13821ad2176216d5b0d","target":"record","created_at":"2026-05-20T00:03:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1e5a2724d9ce8e3188ceee6ce01543d1bea6fd266a552c72aa24f60d8df75691","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T04:46:59Z","title_canon_sha256":"5b8e26913a41a026635d2a556a429b53cbc3b2ffce46a0f825137e17d7e34666"},"schema_version":"1.0","source":{"id":"2605.16809","kind":"arxiv","version":1}},"canonical_sha256":"b41d85f07b3f3ea2f189a1403ce42b80ce152caf69fd597c6c921989ad5af363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b41d85f07b3f3ea2f189a1403ce42b80ce152caf69fd597c6c921989ad5af363","first_computed_at":"2026-05-20T00:03:23.469189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:23.469189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cl79Lox7soejLtjxf5KELE9Yz6tat56dZsAnLxsmuKDsD7hakSOa92tLYgbsDjRau8n95dOE7wKCwW4Y32lvBg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:23.470027Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a3b99913e11934f6f7e2d44c2b62690886ee54fcf5dc13821ad2176216d5b0d","sha256:59fb6ef171e87fe5aa8674c30471c10cf8e006a89719d44eeca88bbdf1fa28ea"],"state_sha256":"1baa4ace28bac7bbce29e4aa98959b7c8fc07fe576266e8c6c3b05689b6540b2"}