{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Y2SYZTXL5OWTOUFOZ7BVFUXWDQ","short_pith_number":"pith:Y2SYZTXL","schema_version":"1.0","canonical_sha256":"c6a58cceebebad3750aecfc352d2f61c239f22f26c4d93f65887a86ae93c8366","source":{"kind":"arxiv","id":"2002.01169","version":1},"attestation_state":"computed","paper":{"title":"Graph Representation Learning via Graphical Mutual Information Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Junzhou Huang, Minnan Luo, Qinghua Zheng, Tingyang Xu, Wenbing Huang, Yu Rong, Zhen Peng","submitted_at":"2020-02-04T08:33:49Z","abstract_excerpt":"The richness in the content of various information networks such as social networks and communication networks provides the unprecedented potential for learning high-quality expressive representations without external supervision. This paper investigates how to preserve and extract the abundant information from graph-structured data into embedding space in an unsupervised manner. To this end, we propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. GMI generalizes the idea of conventional mutual infor"},"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":"2002.01169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-04T08:33:49Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"5909251471e471fa45e8c7da98871a594b708ae1923a4b4570656b45a03d59fa","abstract_canon_sha256":"80f211420d15f240ba184be1bf62360d77f71d7f953f6b7dae0849ce04a2a158"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:37.557441Z","signature_b64":"NsM4PFfi0i14+2zb6y2Mm+wjkqBB3MVLRM6UcZnww7UBSvssp4P83foYvC9aLbF8tgsYhVkB+NxJiaksWNNiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6a58cceebebad3750aecfc352d2f61c239f22f26c4d93f65887a86ae93c8366","last_reissued_at":"2026-07-05T00:38:37.556948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:37.556948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Representation Learning via Graphical Mutual Information Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Junzhou Huang, Minnan Luo, Qinghua Zheng, Tingyang Xu, Wenbing Huang, Yu Rong, Zhen Peng","submitted_at":"2020-02-04T08:33:49Z","abstract_excerpt":"The richness in the content of various information networks such as social networks and communication networks provides the unprecedented potential for learning high-quality expressive representations without external supervision. This paper investigates how to preserve and extract the abundant information from graph-structured data into embedding space in an unsupervised manner. To this end, we propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. GMI generalizes the idea of conventional mutual infor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01169","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/2002.01169/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":"2002.01169","created_at":"2026-07-05T00:38:37.557000+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.01169v1","created_at":"2026-07-05T00:38:37.557000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01169","created_at":"2026-07-05T00:38:37.557000+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2SYZTXL5OWT","created_at":"2026-07-05T00:38:37.557000+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2SYZTXL5OWTOUFO","created_at":"2026-07-05T00:38:37.557000+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2SYZTXL","created_at":"2026-07-05T00:38:37.557000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ","json":"https://pith.science/pith/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ.json","graph_json":"https://pith.science/api/pith-number/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ/graph.json","events_json":"https://pith.science/api/pith-number/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ/events.json","paper":"https://pith.science/paper/Y2SYZTXL"},"agent_actions":{"view_html":"https://pith.science/pith/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ","download_json":"https://pith.science/pith/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ.json","view_paper":"https://pith.science/paper/Y2SYZTXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.01169&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ/action/storage_attestation","attest_author":"https://pith.science/pith/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ/action/author_attestation","sign_citation":"https://pith.science/pith/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ/action/citation_signature","submit_replication":"https://pith.science/pith/Y2SYZTXL5OWTOUFOZ7BVFUXWDQ/action/replication_record"}},"created_at":"2026-07-05T00:38:37.557000+00:00","updated_at":"2026-07-05T00:38:37.557000+00:00"}