{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NLK3IOEVPEE326BSABIU2PP2HQ","short_pith_number":"pith:NLK3IOEV","canonical_record":{"source":{"id":"1905.12665","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T18:20:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"beb6137ef5b12c1429091fae198f83452270d398a559256d05ac18957c69b263","abstract_canon_sha256":"cefb94ac35ff6a534f61e5b7ed2828ec694e9bf6ebb999fb02aae004bb359b41"},"schema_version":"1.0"},"canonical_sha256":"6ad5b438957909bd783200514d3dfa3c09cd871c52f6b1628353303394ae27d8","source":{"kind":"arxiv","id":"1905.12665","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12665","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12665v3","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12665","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"NLK3IOEVPEE3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NLK3IOEVPEE326BS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NLK3IOEV","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NLK3IOEVPEE326BSABIU2PP2HQ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.12665","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T18:20:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"beb6137ef5b12c1429091fae198f83452270d398a559256d05ac18957c69b263","abstract_canon_sha256":"cefb94ac35ff6a534f61e5b7ed2828ec694e9bf6ebb999fb02aae004bb359b41"},"schema_version":"1.0"},"canonical_sha256":"6ad5b438957909bd783200514d3dfa3c09cd871c52f6b1628353303394ae27d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:02.067413Z","signature_b64":"UeXni8LyjgX4zFzqYg6IkJVrhXBBKmA8WAlbFX2M52I6VwJ1zWeUkRGT0So5RuwSGeEUeIe3xqWRbi7RK+VBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad5b438957909bd783200514d3dfa3c09cd871c52f6b1628353303394ae27d8","last_reissued_at":"2026-05-17T23:44:02.066863Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:02.066863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.12665","source_version":3,"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:44:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QhvojO0PpGB6v4iST19ObfhKp3rVAn/tE7TsY91RHLBOYCouMDur+iW0Qx9PZQZ0ynqI4UVZj5ebh8ybEt5JAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:39:51.232718Z"},"content_sha256":"e8eab236a69a2669c6f380f605c11835643aa6d4621d9f21b95c593c8c83c9ad","schema_version":"1.0","event_id":"sha256:e8eab236a69a2669c6f380f605c11835643aa6d4621d9f21b95c593c8c83c9ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NLK3IOEVPEE326BSABIU2PP2HQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Learning Network: A Structure Learning Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ad\\'in Ram\\'irez Rivera, Darwin Saire Pilco","submitted_at":"2019-05-29T18:20:47Z","abstract_excerpt":"Recently, graph neural networks (GNNs) have proved to be suitable in tasks on unstructured data. Particularly in tasks as community detection, node classification, and link prediction. However, most GNN models still operate with static relationships. We propose the Graph Learning Network (GLN), a simple yet effective process to learn node embeddings and structure prediction functions. Our model uses graph convolutions to propose expected node features, and predict the best structure based on them. We repeat these steps recursively to enhance the prediction and the embeddings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12665","kind":"arxiv","version":3},"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:44:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GznLo6ST7pnggfiAwrWDFz6y+V6KaU4Ljv/wRhZXM15i1n0B1gq5KWDFfQMGfoLmRkLFY4UL9Je5Y4bSIYb1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:39:51.233465Z"},"content_sha256":"c86f28a5ae130301741088b5c56695afe26b633f0586650175b52d0766afd513","schema_version":"1.0","event_id":"sha256:c86f28a5ae130301741088b5c56695afe26b633f0586650175b52d0766afd513"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLK3IOEVPEE326BSABIU2PP2HQ/bundle.json","state_url":"https://pith.science/pith/NLK3IOEVPEE326BSABIU2PP2HQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLK3IOEVPEE326BSABIU2PP2HQ/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-05T22:39:51Z","links":{"resolver":"https://pith.science/pith/NLK3IOEVPEE326BSABIU2PP2HQ","bundle":"https://pith.science/pith/NLK3IOEVPEE326BSABIU2PP2HQ/bundle.json","state":"https://pith.science/pith/NLK3IOEVPEE326BSABIU2PP2HQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLK3IOEVPEE326BSABIU2PP2HQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NLK3IOEVPEE326BSABIU2PP2HQ","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":"cefb94ac35ff6a534f61e5b7ed2828ec694e9bf6ebb999fb02aae004bb359b41","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T18:20:47Z","title_canon_sha256":"beb6137ef5b12c1429091fae198f83452270d398a559256d05ac18957c69b263"},"schema_version":"1.0","source":{"id":"1905.12665","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12665","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12665v3","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12665","created_at":"2026-05-17T23:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"NLK3IOEVPEE3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NLK3IOEVPEE326BS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NLK3IOEV","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:c86f28a5ae130301741088b5c56695afe26b633f0586650175b52d0766afd513","target":"graph","created_at":"2026-05-17T23:44:02Z","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":"Recently, graph neural networks (GNNs) have proved to be suitable in tasks on unstructured data. Particularly in tasks as community detection, node classification, and link prediction. However, most GNN models still operate with static relationships. We propose the Graph Learning Network (GLN), a simple yet effective process to learn node embeddings and structure prediction functions. Our model uses graph convolutions to propose expected node features, and predict the best structure based on them. We repeat these steps recursively to enhance the prediction and the embeddings.","authors_text":"Ad\\'in Ram\\'irez Rivera, Darwin Saire Pilco","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T18:20:47Z","title":"Graph Learning Network: A Structure Learning Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12665","kind":"arxiv","version":3},"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:e8eab236a69a2669c6f380f605c11835643aa6d4621d9f21b95c593c8c83c9ad","target":"record","created_at":"2026-05-17T23:44:02Z","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":"cefb94ac35ff6a534f61e5b7ed2828ec694e9bf6ebb999fb02aae004bb359b41","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T18:20:47Z","title_canon_sha256":"beb6137ef5b12c1429091fae198f83452270d398a559256d05ac18957c69b263"},"schema_version":"1.0","source":{"id":"1905.12665","kind":"arxiv","version":3}},"canonical_sha256":"6ad5b438957909bd783200514d3dfa3c09cd871c52f6b1628353303394ae27d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ad5b438957909bd783200514d3dfa3c09cd871c52f6b1628353303394ae27d8","first_computed_at":"2026-05-17T23:44:02.066863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:02.066863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UeXni8LyjgX4zFzqYg6IkJVrhXBBKmA8WAlbFX2M52I6VwJ1zWeUkRGT0So5RuwSGeEUeIe3xqWRbi7RK+VBCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:02.067413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12665","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8eab236a69a2669c6f380f605c11835643aa6d4621d9f21b95c593c8c83c9ad","sha256:c86f28a5ae130301741088b5c56695afe26b633f0586650175b52d0766afd513"],"state_sha256":"f9c8709a6b704dd47cb4b095d3e6afd14ddbfcd6474e58be05fce4701feba846"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0cP6CHydR+jDDXlIbLP631VkJecBu1Cxn76VikANCyvLa3sxXhVagzdrVs3kzEBdb2j74sF1ZxTJpV/+ATeDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:39:51.237888Z","bundle_sha256":"05984f6716c303eb276501dc38d8b956e03ca89cfb6d218f95e8a767c45d770c"}}