{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WNJNGGYTSBECVZABA3U7BTQEX2","short_pith_number":"pith:WNJNGGYT","canonical_record":{"source":{"id":"1809.10341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T04:53:24Z","cross_cats_sorted":["cs.IT","cs.LG","cs.SI","math.IT"],"title_canon_sha256":"9aa0538b52533f296c9629bc7e776d7be16f9ff26fd267d4cae63c8322148b37","abstract_canon_sha256":"b4c492c4c54ca029226355776e23809ad8d6b85353eab78b673149bdbb3a79d4"},"schema_version":"1.0"},"canonical_sha256":"b352d31b1390482ae40106e9f0ce04beb6a7125be2c93fb31d13eb272b701276","source":{"kind":"arxiv","id":"1809.10341","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10341","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10341v2","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10341","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"WNJNGGYTSBEC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WNJNGGYTSBECVZAB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WNJNGGYT","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WNJNGGYTSBECVZABA3U7BTQEX2","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T04:53:24Z","cross_cats_sorted":["cs.IT","cs.LG","cs.SI","math.IT"],"title_canon_sha256":"9aa0538b52533f296c9629bc7e776d7be16f9ff26fd267d4cae63c8322148b37","abstract_canon_sha256":"b4c492c4c54ca029226355776e23809ad8d6b85353eab78b673149bdbb3a79d4"},"schema_version":"1.0"},"canonical_sha256":"b352d31b1390482ae40106e9f0ce04beb6a7125be2c93fb31d13eb272b701276","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:46.577093Z","signature_b64":"CrlI0Nl7+1Dn940ZmcFCJG0p6CRRw1X2ikSUE0ae7UQ9XyjEtBNhLOzFRN6WlyS15us/NSBhGesNqaDLk2f+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b352d31b1390482ae40106e9f0ce04beb6a7125be2c93fb31d13eb272b701276","last_reissued_at":"2026-05-17T23:57:46.576429Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:46.576429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10341","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-05-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPYY01R4K0LHnSDo4DT2YI+ug4NZAqrB+y5sy4GbgacCncAkjIxp/sXSodJ8gl4W417HT+V0I68uMgiN19CsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:59:50.416794Z"},"content_sha256":"b32bc5f6ed9f7b023c4114253edf191ad89dc6e604dafbfa4609bc3569348817","schema_version":"1.0","event_id":"sha256:b32bc5f6ed9f7b023c4114253edf191ad89dc6e604dafbfa4609bc3569348817"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WNJNGGYTSBECVZABA3U7BTQEX2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Graph Infomax","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.SI","math.IT"],"primary_cat":"stat.ML","authors_text":"Petar Veli\\v{c}kovi\\'c, Pietro Li\\`o, R Devon Hjelm, William Fedus, William L. Hamilton, Yoshua Bengio","submitted_at":"2018-09-27T04:53:24Z","abstract_excerpt":"We present Deep Graph Infomax (DGI), a general approach for learning node representations within graph-structured data in an unsupervised manner. DGI relies on maximizing mutual information between patch representations and corresponding high-level summaries of graphs---both derived using established graph convolutional network architectures. The learnt patch representations summarize subgraphs centered around nodes of interest, and can thus be reused for downstream node-wise learning tasks. In contrast to most prior approaches to unsupervised learning with GCNs, DGI does not rely on random wa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10341","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":""},"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-05-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WM+VXXbkHxFaCrrDnoQ+q+NA5rbw88hM3A/+TqMx8emUYmw2jbG+DEYI/WfttmBUZ8AjfkPlfqUp14GXLWU4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:59:50.417137Z"},"content_sha256":"32194346b4f5de0f62d89e93a1b8f8d09789759179cdba67b90e6e7bae719ce4","schema_version":"1.0","event_id":"sha256:32194346b4f5de0f62d89e93a1b8f8d09789759179cdba67b90e6e7bae719ce4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNJNGGYTSBECVZABA3U7BTQEX2/bundle.json","state_url":"https://pith.science/pith/WNJNGGYTSBECVZABA3U7BTQEX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNJNGGYTSBECVZABA3U7BTQEX2/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-06-01T18:59:50Z","links":{"resolver":"https://pith.science/pith/WNJNGGYTSBECVZABA3U7BTQEX2","bundle":"https://pith.science/pith/WNJNGGYTSBECVZABA3U7BTQEX2/bundle.json","state":"https://pith.science/pith/WNJNGGYTSBECVZABA3U7BTQEX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNJNGGYTSBECVZABA3U7BTQEX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WNJNGGYTSBECVZABA3U7BTQEX2","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":"b4c492c4c54ca029226355776e23809ad8d6b85353eab78b673149bdbb3a79d4","cross_cats_sorted":["cs.IT","cs.LG","cs.SI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T04:53:24Z","title_canon_sha256":"9aa0538b52533f296c9629bc7e776d7be16f9ff26fd267d4cae63c8322148b37"},"schema_version":"1.0","source":{"id":"1809.10341","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10341","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10341v2","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10341","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"WNJNGGYTSBEC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WNJNGGYTSBECVZAB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WNJNGGYT","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:32194346b4f5de0f62d89e93a1b8f8d09789759179cdba67b90e6e7bae719ce4","target":"graph","created_at":"2026-05-17T23:57:46Z","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"},"paper":{"abstract_excerpt":"We present Deep Graph Infomax (DGI), a general approach for learning node representations within graph-structured data in an unsupervised manner. DGI relies on maximizing mutual information between patch representations and corresponding high-level summaries of graphs---both derived using established graph convolutional network architectures. The learnt patch representations summarize subgraphs centered around nodes of interest, and can thus be reused for downstream node-wise learning tasks. In contrast to most prior approaches to unsupervised learning with GCNs, DGI does not rely on random wa","authors_text":"Petar Veli\\v{c}kovi\\'c, Pietro Li\\`o, R Devon Hjelm, William Fedus, William L. Hamilton, Yoshua Bengio","cross_cats":["cs.IT","cs.LG","cs.SI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T04:53:24Z","title":"Deep Graph Infomax"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10341","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:b32bc5f6ed9f7b023c4114253edf191ad89dc6e604dafbfa4609bc3569348817","target":"record","created_at":"2026-05-17T23:57:46Z","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":"b4c492c4c54ca029226355776e23809ad8d6b85353eab78b673149bdbb3a79d4","cross_cats_sorted":["cs.IT","cs.LG","cs.SI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-27T04:53:24Z","title_canon_sha256":"9aa0538b52533f296c9629bc7e776d7be16f9ff26fd267d4cae63c8322148b37"},"schema_version":"1.0","source":{"id":"1809.10341","kind":"arxiv","version":2}},"canonical_sha256":"b352d31b1390482ae40106e9f0ce04beb6a7125be2c93fb31d13eb272b701276","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b352d31b1390482ae40106e9f0ce04beb6a7125be2c93fb31d13eb272b701276","first_computed_at":"2026-05-17T23:57:46.576429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:46.576429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CrlI0Nl7+1Dn940ZmcFCJG0p6CRRw1X2ikSUE0ae7UQ9XyjEtBNhLOzFRN6WlyS15us/NSBhGesNqaDLk2f+CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:46.577093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10341","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b32bc5f6ed9f7b023c4114253edf191ad89dc6e604dafbfa4609bc3569348817","sha256:32194346b4f5de0f62d89e93a1b8f8d09789759179cdba67b90e6e7bae719ce4"],"state_sha256":"8d420d0170dc7b926b81e987a8b82c9278b9e8ba98c0f3a8a9b7cf16a2bdd1ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HBZEFNqj5/l6wEoHrXXqMyVBFUK8ei6yeye3II4jDtmgRBPM/CHPdUMD3fMVkK3oK7Vv81RBDv8wD/Drgs+zDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:59:50.419097Z","bundle_sha256":"fec8fb640a98acd6310bd4320b121e613020a8cb5a2dcd16c2e54dc28bc59505"}}