{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:IBOKCEYSUGK4JESW5SGMT2AGBL","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":"9709fc1b174d2819818df701dace91a8e8b8e4eb9b40ff88f4245e1d9db987f7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-24T12:06:12Z","title_canon_sha256":"59b9771231cf4106bbd9df3b71468c3944533b3fc9ae0204567fd3621ad2ceda"},"schema_version":"1.0","source":{"id":"2103.13125","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.13125","created_at":"2026-07-05T02:38:18Z"},{"alias_kind":"arxiv_version","alias_value":"2103.13125v2","created_at":"2026-07-05T02:38:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.13125","created_at":"2026-07-05T02:38:18Z"},{"alias_kind":"pith_short_12","alias_value":"IBOKCEYSUGK4","created_at":"2026-07-05T02:38:18Z"},{"alias_kind":"pith_short_16","alias_value":"IBOKCEYSUGK4JESW","created_at":"2026-07-05T02:38:18Z"},{"alias_kind":"pith_short_8","alias_value":"IBOKCEYS","created_at":"2026-07-05T02:38:18Z"}],"graph_snapshots":[{"event_id":"sha256:82388ebbab54fe21f88e5a5af88d5c071dae23f8ec1fee0ba3f78c2779dd16a8","target":"graph","created_at":"2026-07-05T02:38:18Z","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/2103.13125/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we introduce a self-supervised learning method to enhance the graph-level representations with the help of a set of subgraphs. For this purpose, we propose a universal framework to generate subgraphs in an auto-regressive way and then using these subgraphs to guide the learning of graph representation by Graph Neural Networks. Under this framework, we can get a comprehensive understanding of the graph structure in a learnable way. And to fully capture enough information of original graphs, we design three information aggregators: \\textbf{attribute-conv}, \\textbf{layer-conv} and ","authors_text":"Chenguang Wang, Ziwen Liu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-24T12:06:12Z","title":"Learning Graph Representation by Aggregating Subgraphs via Mutual Information Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.13125","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:7d8ac12e2cca300c8a15e5de7f5f627ddad68d3e8ae67ea360d3aea61191aa09","target":"record","created_at":"2026-07-05T02:38:18Z","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":"9709fc1b174d2819818df701dace91a8e8b8e4eb9b40ff88f4245e1d9db987f7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-24T12:06:12Z","title_canon_sha256":"59b9771231cf4106bbd9df3b71468c3944533b3fc9ae0204567fd3621ad2ceda"},"schema_version":"1.0","source":{"id":"2103.13125","kind":"arxiv","version":2}},"canonical_sha256":"405ca11312a195c49256ec8cc9e8060aed3f09861e6ceb42f1b59e1882d819f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"405ca11312a195c49256ec8cc9e8060aed3f09861e6ceb42f1b59e1882d819f5","first_computed_at":"2026-07-05T02:38:18.269140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:38:18.269140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Gn+iVfY8Pa2nL/FPvQVeDhLarDib62O0v/2y3oGHHb7waDgfPaXhcgwjYzHAF55/bVPP+DTnKCpe8kqRmWUDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:38:18.269774Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.13125","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d8ac12e2cca300c8a15e5de7f5f627ddad68d3e8ae67ea360d3aea61191aa09","sha256:82388ebbab54fe21f88e5a5af88d5c071dae23f8ec1fee0ba3f78c2779dd16a8"],"state_sha256":"035214817c65dc438cc802594969a014996eabb30facdf13b6784668d8ee20c0"}