{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QBFC335XWLRSIAHDRY3QM2UNO3","short_pith_number":"pith:QBFC335X","schema_version":"1.0","canonical_sha256":"804a2defb7b2e32400e38e37066a8d76e8269c1f9dcf3a07f95715b8e3062c4e","source":{"kind":"arxiv","id":"2405.14260","version":2},"attestation_state":"computed","paper":{"title":"Graph Sparsification via Mixture of Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chonghe Jiang, Guibin Zhang, Kun Wang, Shirui Pan, Tianlong Chen, Xiangguo Sun, Yanwei Yue","submitted_at":"2024-05-23T07:40:21Z","abstract_excerpt":"Graph Neural Networks (GNNs) have demonstrated superior performance across various graph learning tasks but face significant computational challenges when applied to large-scale graphs. One effective approach to mitigate these challenges is graph sparsification, which involves removing non-essential edges to reduce computational overhead. However, previous graph sparsification methods often rely on a single global sparsity setting and uniform pruning criteria, failing to provide customized sparsification schemes for each node's complex local context. In this paper, we introduce Mixture-of-Grap"},"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":"2405.14260","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-23T07:40:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"597e11463894755de929f4e533892166d2d0a0a2fd385a97ccac484f296bed44","abstract_canon_sha256":"9bc452c72d9e1683501757f8c3a2e08f7eb064637bb262df6945282fe0eb47f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:10.657354Z","signature_b64":"xk2AEVcb/0U+ryX7aSMTK2zE1q4bh0YFUEoteSMFEyQd2Wd9+H/tAyTL9LmG8xBfbLVwx4+6AIGnmxykHB92Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"804a2defb7b2e32400e38e37066a8d76e8269c1f9dcf3a07f95715b8e3062c4e","last_reissued_at":"2026-07-05T09:15:10.656769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:10.656769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Sparsification via Mixture of Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chonghe Jiang, Guibin Zhang, Kun Wang, Shirui Pan, Tianlong Chen, Xiangguo Sun, Yanwei Yue","submitted_at":"2024-05-23T07:40:21Z","abstract_excerpt":"Graph Neural Networks (GNNs) have demonstrated superior performance across various graph learning tasks but face significant computational challenges when applied to large-scale graphs. One effective approach to mitigate these challenges is graph sparsification, which involves removing non-essential edges to reduce computational overhead. However, previous graph sparsification methods often rely on a single global sparsity setting and uniform pruning criteria, failing to provide customized sparsification schemes for each node's complex local context. In this paper, we introduce Mixture-of-Grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14260","kind":"arxiv","version":2},"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/2405.14260/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":"2405.14260","created_at":"2026-07-05T09:15:10.656848+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14260v2","created_at":"2026-07-05T09:15:10.656848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14260","created_at":"2026-07-05T09:15:10.656848+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBFC335XWLRS","created_at":"2026-07-05T09:15:10.656848+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBFC335XWLRSIAHD","created_at":"2026-07-05T09:15:10.656848+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBFC335X","created_at":"2026-07-05T09:15:10.656848+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30101","citing_title":"SIR: Structured Image Representations for Explainable Robot Learning","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3","json":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3.json","graph_json":"https://pith.science/api/pith-number/QBFC335XWLRSIAHDRY3QM2UNO3/graph.json","events_json":"https://pith.science/api/pith-number/QBFC335XWLRSIAHDRY3QM2UNO3/events.json","paper":"https://pith.science/paper/QBFC335X"},"agent_actions":{"view_html":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3","download_json":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3.json","view_paper":"https://pith.science/paper/QBFC335X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14260&json=true","fetch_graph":"https://pith.science/api/pith-number/QBFC335XWLRSIAHDRY3QM2UNO3/graph.json","fetch_events":"https://pith.science/api/pith-number/QBFC335XWLRSIAHDRY3QM2UNO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3/action/storage_attestation","attest_author":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3/action/author_attestation","sign_citation":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3/action/citation_signature","submit_replication":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3/action/replication_record"}},"created_at":"2026-07-05T09:15:10.656848+00:00","updated_at":"2026-07-05T09:15:10.656848+00:00"}