{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SAKUX32CUIXANZSZL5CKAVDVR3","short_pith_number":"pith:SAKUX32C","canonical_record":{"source":{"id":"1908.05365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-08-14T22:38:18Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"6b12779ffcd88db5e5ea8b572d8f532ce3b279148e91908f1d8fac0df9dc5f3e","abstract_canon_sha256":"07d5711807556746e6de05b06ad20a4cfee45c694d447f80121fc8f67a76308b"},"schema_version":"1.0"},"canonical_sha256":"90154bef42a22e06e6595f44a054758ede0300ed3848e9bb7f78865ee0d7040a","source":{"kind":"arxiv","id":"1908.05365","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05365","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05365v2","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05365","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"SAKUX32CUIXA","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"pith_short_16","alias_value":"SAKUX32CUIXANZSZ","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"pith_short_8","alias_value":"SAKUX32C","created_at":"2026-07-05T02:08:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SAKUX32CUIXANZSZL5CKAVDVR3","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-08-14T22:38:18Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"6b12779ffcd88db5e5ea8b572d8f532ce3b279148e91908f1d8fac0df9dc5f3e","abstract_canon_sha256":"07d5711807556746e6de05b06ad20a4cfee45c694d447f80121fc8f67a76308b"},"schema_version":"1.0"},"canonical_sha256":"90154bef42a22e06e6595f44a054758ede0300ed3848e9bb7f78865ee0d7040a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:59.577967Z","signature_b64":"LiEGBLg1dekw43L4RWUpeSplsvgPjmSQd0WKAcyvMkn/7i09GhgVvi1kXzKXPI4kNGLGwFdpeIOYO0Nj6EmpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90154bef42a22e06e6595f44a054758ede0300ed3848e9bb7f78865ee0d7040a","last_reissued_at":"2026-07-05T02:08:59.577627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:59.577627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05365","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-07-05T02:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTfNr5f8ZhjYu7+XyrB4Wc5roZ6qgsIlV5yk7ZVMBjwx+r2rv08q2cNlcFyoc5M0+KGdCdBcMi847+cILDGmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:32:13.718046Z"},"content_sha256":"3ac2494a06852d842bfff3a2c8612c41c945c755fab7e34e3382e22d172bbd6f","schema_version":"1.0","event_id":"sha256:3ac2494a06852d842bfff3a2c8612c41c945c755fab7e34e3382e22d172bbd6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SAKUX32CUIXANZSZL5CKAVDVR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"End-to-End Learning from Complex Multigraphs with Latent-Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Fabian Jansen, Floris Hermsen, Peter Bloem, Wolf Vos","submitted_at":"2019-08-14T22:38:18Z","abstract_excerpt":"We study the problem of end-to-end learning from complex multigraphs with potentially very large numbers of edges between two vertices, each edge labeled with rich information. Examples range from communication networks to flights between airports or financial transaction graphs. We propose Latent-Graph Convolutional Networks (L-GCNs), which propagate information from these complex edges to a latent adjacency tensor, after which further downstream tasks can be performed, such as node classification. We evaluate the performance of several variations of the model on two synthetic datasets simula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05365/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"},"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-07-05T02:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYMPgr0g9FtkqOdO+pQRKEl3vA01wxO9JPnhCCHXdyx9XVbafh74tQT+39U4L4Zbz84ClsDuF6IPfJtRtujsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:32:13.718697Z"},"content_sha256":"71dc611d6ec24704657a96631ef2303597b139cf077ee64ff29220e1674f9ffd","schema_version":"1.0","event_id":"sha256:71dc611d6ec24704657a96631ef2303597b139cf077ee64ff29220e1674f9ffd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAKUX32CUIXANZSZL5CKAVDVR3/bundle.json","state_url":"https://pith.science/pith/SAKUX32CUIXANZSZL5CKAVDVR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAKUX32CUIXANZSZL5CKAVDVR3/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-08-16T15:32:13Z","links":{"resolver":"https://pith.science/pith/SAKUX32CUIXANZSZL5CKAVDVR3","bundle":"https://pith.science/pith/SAKUX32CUIXANZSZL5CKAVDVR3/bundle.json","state":"https://pith.science/pith/SAKUX32CUIXANZSZL5CKAVDVR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAKUX32CUIXANZSZL5CKAVDVR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SAKUX32CUIXANZSZL5CKAVDVR3","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":"07d5711807556746e6de05b06ad20a4cfee45c694d447f80121fc8f67a76308b","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-08-14T22:38:18Z","title_canon_sha256":"6b12779ffcd88db5e5ea8b572d8f532ce3b279148e91908f1d8fac0df9dc5f3e"},"schema_version":"1.0","source":{"id":"1908.05365","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05365","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05365v2","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05365","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"SAKUX32CUIXA","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"pith_short_16","alias_value":"SAKUX32CUIXANZSZ","created_at":"2026-07-05T02:08:59Z"},{"alias_kind":"pith_short_8","alias_value":"SAKUX32C","created_at":"2026-07-05T02:08:59Z"}],"graph_snapshots":[{"event_id":"sha256:71dc611d6ec24704657a96631ef2303597b139cf077ee64ff29220e1674f9ffd","target":"graph","created_at":"2026-07-05T02:08:59Z","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/1908.05365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of end-to-end learning from complex multigraphs with potentially very large numbers of edges between two vertices, each edge labeled with rich information. Examples range from communication networks to flights between airports or financial transaction graphs. We propose Latent-Graph Convolutional Networks (L-GCNs), which propagate information from these complex edges to a latent adjacency tensor, after which further downstream tasks can be performed, such as node classification. We evaluate the performance of several variations of the model on two synthetic datasets simula","authors_text":"Fabian Jansen, Floris Hermsen, Peter Bloem, Wolf Vos","cross_cats":["cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-08-14T22:38:18Z","title":"End-to-End Learning from Complex Multigraphs with Latent-Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05365","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:3ac2494a06852d842bfff3a2c8612c41c945c755fab7e34e3382e22d172bbd6f","target":"record","created_at":"2026-07-05T02:08:59Z","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":"07d5711807556746e6de05b06ad20a4cfee45c694d447f80121fc8f67a76308b","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-08-14T22:38:18Z","title_canon_sha256":"6b12779ffcd88db5e5ea8b572d8f532ce3b279148e91908f1d8fac0df9dc5f3e"},"schema_version":"1.0","source":{"id":"1908.05365","kind":"arxiv","version":2}},"canonical_sha256":"90154bef42a22e06e6595f44a054758ede0300ed3848e9bb7f78865ee0d7040a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90154bef42a22e06e6595f44a054758ede0300ed3848e9bb7f78865ee0d7040a","first_computed_at":"2026-07-05T02:08:59.577627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:08:59.577627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LiEGBLg1dekw43L4RWUpeSplsvgPjmSQd0WKAcyvMkn/7i09GhgVvi1kXzKXPI4kNGLGwFdpeIOYO0Nj6EmpDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:08:59.577967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05365","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ac2494a06852d842bfff3a2c8612c41c945c755fab7e34e3382e22d172bbd6f","sha256:71dc611d6ec24704657a96631ef2303597b139cf077ee64ff29220e1674f9ffd"],"state_sha256":"5981c7c10fa652bfe084135b917e64913e8e2dd06e49b942566741db1d31c306"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NrPNYHgbOuIacms467ABVVZfS3N5vSnErFZUPcJ+RWknOisspLMWDZu15w4JrIIWAwhvqCpJu3eUMHEnQ56AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T15:32:13.723776Z","bundle_sha256":"34cf551e3cf460882796693d6d11f1c903103a395cad6e82266ae375a93e6e1e"}}