{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2IHHWW35A6QYAAHJASKK52GH27","short_pith_number":"pith:2IHHWW35","schema_version":"1.0","canonical_sha256":"d20e7b5b7d07a18000e90494aee8c7d7de867998361b7333b7c7abd9849feea6","source":{"kind":"arxiv","id":"2010.05563","version":1},"attestation_state":"computed","paper":{"title":"Graph Information Bottleneck for Subgraph Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Junchi Yu, Junzhou Huang, Ran He, Tingyang Xu, Yatao Bian, Yu Rong","submitted_at":"2020-10-12T09:32:20Z","abstract_excerpt":"Given the input graph and its label/property, several key problems of graph learning, such as finding interpretable subgraphs, graph denoising and graph compression, can be attributed to the fundamental problem of recognizing a subgraph of the original one. This subgraph shall be as informative as possible, yet contains less redundant and noisy structure. This problem setting is closely related to the well-known information bottleneck (IB) principle, which, however, has less been studied for the irregular graph data and graph neural networks (GNNs). In this paper, we propose a framework of Gra"},"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":"2010.05563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-12T09:32:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1afe841fda249a8b64be6c3b0fcf33346038e9ee7e97fac1ac5c56a3cbb1cdb8","abstract_canon_sha256":"cc3dd3cc701b031cc08fe68b4e1157e275912560cbe7370d2f6bd0a15e00851d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:42:07.935613Z","signature_b64":"xrG9jEjzrUrrfPuKYI4PnaEirOf7Tr7YsvqP9CKBbPRl4/8l/MP3Vg0Nf/mh8UAiK0dVpA5Abtj5hkf45k6RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d20e7b5b7d07a18000e90494aee8c7d7de867998361b7333b7c7abd9849feea6","last_reissued_at":"2026-07-05T01:42:07.935118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:42:07.935118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Information Bottleneck for Subgraph Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Junchi Yu, Junzhou Huang, Ran He, Tingyang Xu, Yatao Bian, Yu Rong","submitted_at":"2020-10-12T09:32:20Z","abstract_excerpt":"Given the input graph and its label/property, several key problems of graph learning, such as finding interpretable subgraphs, graph denoising and graph compression, can be attributed to the fundamental problem of recognizing a subgraph of the original one. This subgraph shall be as informative as possible, yet contains less redundant and noisy structure. This problem setting is closely related to the well-known information bottleneck (IB) principle, which, however, has less been studied for the irregular graph data and graph neural networks (GNNs). In this paper, we propose a framework of Gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.05563","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/2010.05563/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":"2010.05563","created_at":"2026-07-05T01:42:07.935175+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.05563v1","created_at":"2026-07-05T01:42:07.935175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.05563","created_at":"2026-07-05T01:42:07.935175+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IHHWW35A6QY","created_at":"2026-07-05T01:42:07.935175+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IHHWW35A6QYAAHJ","created_at":"2026-07-05T01:42:07.935175+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IHHWW35","created_at":"2026-07-05T01:42:07.935175+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19778","citing_title":"B-cos GNNs: Faithful Explanations through Dynamic Linearity","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12061","citing_title":"SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory","ref_index":161,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IHHWW35A6QYAAHJASKK52GH27","json":"https://pith.science/pith/2IHHWW35A6QYAAHJASKK52GH27.json","graph_json":"https://pith.science/api/pith-number/2IHHWW35A6QYAAHJASKK52GH27/graph.json","events_json":"https://pith.science/api/pith-number/2IHHWW35A6QYAAHJASKK52GH27/events.json","paper":"https://pith.science/paper/2IHHWW35"},"agent_actions":{"view_html":"https://pith.science/pith/2IHHWW35A6QYAAHJASKK52GH27","download_json":"https://pith.science/pith/2IHHWW35A6QYAAHJASKK52GH27.json","view_paper":"https://pith.science/paper/2IHHWW35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.05563&json=true","fetch_graph":"https://pith.science/api/pith-number/2IHHWW35A6QYAAHJASKK52GH27/graph.json","fetch_events":"https://pith.science/api/pith-number/2IHHWW35A6QYAAHJASKK52GH27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IHHWW35A6QYAAHJASKK52GH27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IHHWW35A6QYAAHJASKK52GH27/action/storage_attestation","attest_author":"https://pith.science/pith/2IHHWW35A6QYAAHJASKK52GH27/action/author_attestation","sign_citation":"https://pith.science/pith/2IHHWW35A6QYAAHJASKK52GH27/action/citation_signature","submit_replication":"https://pith.science/pith/2IHHWW35A6QYAAHJASKK52GH27/action/replication_record"}},"created_at":"2026-07-05T01:42:07.935175+00:00","updated_at":"2026-07-05T01:42:07.935175+00:00"}