{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:QBFC335XWLRSIAHDRY3QM2UNO3","short_pith_number":"pith:QBFC335X","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"},"canonical_sha256":"804a2defb7b2e32400e38e37066a8d76e8269c1f9dcf3a07f95715b8e3062c4e","source":{"kind":"arxiv","id":"2405.14260","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.14260","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"arxiv_version","alias_value":"2405.14260v2","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14260","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"pith_short_12","alias_value":"QBFC335XWLRS","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"pith_short_16","alias_value":"QBFC335XWLRSIAHD","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"pith_short_8","alias_value":"QBFC335X","created_at":"2026-07-05T09:15:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:QBFC335XWLRSIAHDRY3QM2UNO3","target":"record","payload":{"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"},"canonical_sha256":"804a2defb7b2e32400e38e37066a8d76e8269c1f9dcf3a07f95715b8e3062c4e","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"},"source_kind":"arxiv","source_id":"2405.14260","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:15:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWenlA8oXGbLje0u3S5S4BSv83RqFRMUpu9sCwWc5yc4EGSFjuXrDyCHtit9ksm1OG+vlW/IGqo9aK18vyYEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:10:47.126255Z"},"content_sha256":"f521b5ca35a2b63f96eaca8c9e6eba04218b3d8ce466a8d79fcc1925963b6055","schema_version":"1.0","event_id":"sha256:f521b5ca35a2b63f96eaca8c9e6eba04218b3d8ce466a8d79fcc1925963b6055"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:QBFC335XWLRSIAHDRY3QM2UNO3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:15:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Y+IEyMRXEA/SGLEB2m/zmWZqfZB8/sn//iOI4lvgjq3oAYfvE8FxMLddKZBDp2UHglp9KlsicS6uNPvK6MPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:10:47.126788Z"},"content_sha256":"aa74ebb1587fac7bfeb942af7dba27e8915c1dbe743755b36192643f70210e82","schema_version":"1.0","event_id":"sha256:aa74ebb1587fac7bfeb942af7dba27e8915c1dbe743755b36192643f70210e82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3/bundle.json","state_url":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBFC335XWLRSIAHDRY3QM2UNO3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T03:10:47Z","links":{"resolver":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3","bundle":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3/bundle.json","state":"https://pith.science/pith/QBFC335XWLRSIAHDRY3QM2UNO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBFC335XWLRSIAHDRY3QM2UNO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:QBFC335XWLRSIAHDRY3QM2UNO3","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":"9bc452c72d9e1683501757f8c3a2e08f7eb064637bb262df6945282fe0eb47f6","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-23T07:40:21Z","title_canon_sha256":"597e11463894755de929f4e533892166d2d0a0a2fd385a97ccac484f296bed44"},"schema_version":"1.0","source":{"id":"2405.14260","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.14260","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"arxiv_version","alias_value":"2405.14260v2","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14260","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"pith_short_12","alias_value":"QBFC335XWLRS","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"pith_short_16","alias_value":"QBFC335XWLRSIAHD","created_at":"2026-07-05T09:15:10Z"},{"alias_kind":"pith_short_8","alias_value":"QBFC335X","created_at":"2026-07-05T09:15:10Z"}],"graph_snapshots":[{"event_id":"sha256:aa74ebb1587fac7bfeb942af7dba27e8915c1dbe743755b36192643f70210e82","target":"graph","created_at":"2026-07-05T09:15:10Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.14260/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chonghe Jiang, Guibin Zhang, Kun Wang, Shirui Pan, Tianlong Chen, Xiangguo Sun, Yanwei Yue","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-23T07:40:21Z","title":"Graph Sparsification via Mixture of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14260","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f521b5ca35a2b63f96eaca8c9e6eba04218b3d8ce466a8d79fcc1925963b6055","target":"record","created_at":"2026-07-05T09:15:10Z","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":"9bc452c72d9e1683501757f8c3a2e08f7eb064637bb262df6945282fe0eb47f6","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-23T07:40:21Z","title_canon_sha256":"597e11463894755de929f4e533892166d2d0a0a2fd385a97ccac484f296bed44"},"schema_version":"1.0","source":{"id":"2405.14260","kind":"arxiv","version":2}},"canonical_sha256":"804a2defb7b2e32400e38e37066a8d76e8269c1f9dcf3a07f95715b8e3062c4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"804a2defb7b2e32400e38e37066a8d76e8269c1f9dcf3a07f95715b8e3062c4e","first_computed_at":"2026-07-05T09:15:10.656769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:15:10.656769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xk2AEVcb/0U+ryX7aSMTK2zE1q4bh0YFUEoteSMFEyQd2Wd9+H/tAyTL9LmG8xBfbLVwx4+6AIGnmxykHB92Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:15:10.657354Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.14260","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f521b5ca35a2b63f96eaca8c9e6eba04218b3d8ce466a8d79fcc1925963b6055","sha256:aa74ebb1587fac7bfeb942af7dba27e8915c1dbe743755b36192643f70210e82"],"state_sha256":"795befb78b3de2f33fb4fa8f884500db745dc0813e020b99ae08321f7dda0c84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PS0My3KxIRhz/78jMVt2akyPL3p+UvR90waGbOvfxZsNl/4tqgWodHpyY01abw+cMM30vIvR2FpM+TO13hbaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T03:10:47.131965Z","bundle_sha256":"91acdabbac7b56828ddade24fc5e044843d8ffe7f30bea430c01218f1dfc36de"}}