{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:B7HRAV3MO4VWSHF7HKDBX6IVYR","short_pith_number":"pith:B7HRAV3M","canonical_record":{"source":{"id":"2201.05540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-14T16:22:33Z","cross_cats_sorted":[],"title_canon_sha256":"0d26bf3fb678a25bf63ea4276552289140ad8fe29ccd592354b914320401ad63","abstract_canon_sha256":"ecc3a3ff74915183996c97d29f5c90aa8665adce8cdc8b6e8d3d79b0590589fe"},"schema_version":"1.0"},"canonical_sha256":"0fcf10576c772b691cbf3a861bf915c44919fb13cd0bbf2b5a0b03defe0adc56","source":{"kind":"arxiv","id":"2201.05540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.05540","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"2201.05540v1","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.05540","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"B7HRAV3MO4VW","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"pith_short_16","alias_value":"B7HRAV3MO4VWSHF7","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"pith_short_8","alias_value":"B7HRAV3M","created_at":"2026-07-05T03:48:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:B7HRAV3MO4VWSHF7HKDBX6IVYR","target":"record","payload":{"canonical_record":{"source":{"id":"2201.05540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-14T16:22:33Z","cross_cats_sorted":[],"title_canon_sha256":"0d26bf3fb678a25bf63ea4276552289140ad8fe29ccd592354b914320401ad63","abstract_canon_sha256":"ecc3a3ff74915183996c97d29f5c90aa8665adce8cdc8b6e8d3d79b0590589fe"},"schema_version":"1.0"},"canonical_sha256":"0fcf10576c772b691cbf3a861bf915c44919fb13cd0bbf2b5a0b03defe0adc56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:33.473243Z","signature_b64":"/OeIjpBka7SDdCfnq7x73qWuwcsq3+RO9b1uRafBVIif05ef5hphYyuBnmdf3xBOYQTaMW2ogcAxGDJ0uZQKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fcf10576c772b691cbf3a861bf915c44919fb13cd0bbf2b5a0b03defe0adc56","last_reissued_at":"2026-07-05T03:48:33.472898Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:33.472898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.05540","source_version":1,"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-05T03:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bn61JJd8A3H4fieABAmcRsfRMgN+B7pq29V4FvrqRSV9Cc/n3nmUahRf+KpG0BOUQETcImGx8jxDSQACRg7JDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:18:50.674377Z"},"content_sha256":"4f871d7333d3f8308f6893c398ffa5a3ec6e6f596e9a4d65205080af5b496219","schema_version":"1.0","event_id":"sha256:4f871d7333d3f8308f6893c398ffa5a3ec6e6f596e9a4d65205080af5b496219"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:B7HRAV3MO4VWSHF7HKDBX6IVYR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact Graph Structure Learning via Mutual Information Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chuan Shi, Lingfei Wu, Nian Liu, Xiaojie Guo, Xiao Wang, Yu Chen","submitted_at":"2022-01-14T16:22:33Z","abstract_excerpt":"Graph Structure Learning (GSL) recently has attracted considerable attentions in its capacity of optimizing graph structure as well as learning suitable parameters of Graph Neural Networks (GNNs) simultaneously. Current GSL methods mainly learn an optimal graph structure (final view) from single or multiple information sources (basic views), however the theoretical guidance on what is the optimal graph structure is still unexplored. In essence, an optimal graph structure should only contain the information about tasks while compress redundant noise as much as possible, which is defined as \"min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.05540","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/2201.05540/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-05T03:48:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gK4dqEgnfWYtDFIa9KvZeUqtXHPHixC601QHtbKy/9OOM9q/wJ7TM7ZHBkwALkXiuwjp23ecwI8q+2vVi9FoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:18:50.674759Z"},"content_sha256":"235103a8af5744910954fb848ef0baba6f51ec17dcc46d3f0f4441e253003c0c","schema_version":"1.0","event_id":"sha256:235103a8af5744910954fb848ef0baba6f51ec17dcc46d3f0f4441e253003c0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7HRAV3MO4VWSHF7HKDBX6IVYR/bundle.json","state_url":"https://pith.science/pith/B7HRAV3MO4VWSHF7HKDBX6IVYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7HRAV3MO4VWSHF7HKDBX6IVYR/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-06T07:18:50Z","links":{"resolver":"https://pith.science/pith/B7HRAV3MO4VWSHF7HKDBX6IVYR","bundle":"https://pith.science/pith/B7HRAV3MO4VWSHF7HKDBX6IVYR/bundle.json","state":"https://pith.science/pith/B7HRAV3MO4VWSHF7HKDBX6IVYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7HRAV3MO4VWSHF7HKDBX6IVYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:B7HRAV3MO4VWSHF7HKDBX6IVYR","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":"ecc3a3ff74915183996c97d29f5c90aa8665adce8cdc8b6e8d3d79b0590589fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-14T16:22:33Z","title_canon_sha256":"0d26bf3fb678a25bf63ea4276552289140ad8fe29ccd592354b914320401ad63"},"schema_version":"1.0","source":{"id":"2201.05540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.05540","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"arxiv_version","alias_value":"2201.05540v1","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.05540","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"pith_short_12","alias_value":"B7HRAV3MO4VW","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"pith_short_16","alias_value":"B7HRAV3MO4VWSHF7","created_at":"2026-07-05T03:48:33Z"},{"alias_kind":"pith_short_8","alias_value":"B7HRAV3M","created_at":"2026-07-05T03:48:33Z"}],"graph_snapshots":[{"event_id":"sha256:235103a8af5744910954fb848ef0baba6f51ec17dcc46d3f0f4441e253003c0c","target":"graph","created_at":"2026-07-05T03:48:33Z","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/2201.05540/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Structure Learning (GSL) recently has attracted considerable attentions in its capacity of optimizing graph structure as well as learning suitable parameters of Graph Neural Networks (GNNs) simultaneously. Current GSL methods mainly learn an optimal graph structure (final view) from single or multiple information sources (basic views), however the theoretical guidance on what is the optimal graph structure is still unexplored. In essence, an optimal graph structure should only contain the information about tasks while compress redundant noise as much as possible, which is defined as \"min","authors_text":"Chuan Shi, Lingfei Wu, Nian Liu, Xiaojie Guo, Xiao Wang, Yu Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-14T16:22:33Z","title":"Compact Graph Structure Learning via Mutual Information Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.05540","kind":"arxiv","version":1},"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:4f871d7333d3f8308f6893c398ffa5a3ec6e6f596e9a4d65205080af5b496219","target":"record","created_at":"2026-07-05T03:48:33Z","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":"ecc3a3ff74915183996c97d29f5c90aa8665adce8cdc8b6e8d3d79b0590589fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-14T16:22:33Z","title_canon_sha256":"0d26bf3fb678a25bf63ea4276552289140ad8fe29ccd592354b914320401ad63"},"schema_version":"1.0","source":{"id":"2201.05540","kind":"arxiv","version":1}},"canonical_sha256":"0fcf10576c772b691cbf3a861bf915c44919fb13cd0bbf2b5a0b03defe0adc56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fcf10576c772b691cbf3a861bf915c44919fb13cd0bbf2b5a0b03defe0adc56","first_computed_at":"2026-07-05T03:48:33.472898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:33.472898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/OeIjpBka7SDdCfnq7x73qWuwcsq3+RO9b1uRafBVIif05ef5hphYyuBnmdf3xBOYQTaMW2ogcAxGDJ0uZQKBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:33.473243Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.05540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f871d7333d3f8308f6893c398ffa5a3ec6e6f596e9a4d65205080af5b496219","sha256:235103a8af5744910954fb848ef0baba6f51ec17dcc46d3f0f4441e253003c0c"],"state_sha256":"e4baa6d8ea6fbb8f9975056e9a8e6250a9eb7f8610b01ffc3f84a979e9c697f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6afiWj/1X2Q3qZhJjwrv/BcEaO26tG9w+Ihcrb8oued+RsDqWqXzWUZ9iSxLvg1hAmabJKzWwt/bWuPb5bbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T07:18:50.678824Z","bundle_sha256":"d7c6c21311954427e4704a740b0a118dc6ef1aaa6c0732fc69b956fece37eb75"}}