{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DJTHH4QEYOBFIH4KB7GRRKCNF4","short_pith_number":"pith:DJTHH4QE","canonical_record":{"source":{"id":"2003.13620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-27T08:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"3a8c84e23004597330a853220dfce4a148ed97fe2acd2d5e32d6eb475c2083a1","abstract_canon_sha256":"965762e6a33defc74abfc73ea624e19444ed7d54308689080bb3b4afba62f72b"},"schema_version":"1.0"},"canonical_sha256":"1a6673f204c382541f8a0fcd18a84d2f19f1a27e5d43e8dd2b8f1ed41e68a3eb","source":{"kind":"arxiv","id":"2003.13620","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.13620","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"2003.13620v2","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13620","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"DJTHH4QEYOBF","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"pith_short_16","alias_value":"DJTHH4QEYOBFIH4K","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"pith_short_8","alias_value":"DJTHH4QE","created_at":"2026-07-05T04:22:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DJTHH4QEYOBFIH4KB7GRRKCNF4","target":"record","payload":{"canonical_record":{"source":{"id":"2003.13620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-27T08:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"3a8c84e23004597330a853220dfce4a148ed97fe2acd2d5e32d6eb475c2083a1","abstract_canon_sha256":"965762e6a33defc74abfc73ea624e19444ed7d54308689080bb3b4afba62f72b"},"schema_version":"1.0"},"canonical_sha256":"1a6673f204c382541f8a0fcd18a84d2f19f1a27e5d43e8dd2b8f1ed41e68a3eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:48.971332Z","signature_b64":"pZ61m8jimqOeucnXZ8v8HzZBqmGoSum+q3/4JRe9HWIr/0ECZQMN/YBks0ujbU+0/Quq1aYU8q2cnIqAVYTQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a6673f204c382541f8a0fcd18a84d2f19f1a27e5d43e8dd2b8f1ed41e68a3eb","last_reissued_at":"2026-07-05T04:22:48.970799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:48.970799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.13620","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-05T04:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qt8LgDGnpwpHjJknJaTAY6Fvc5vOMP15kR0kGnrXywQiME+1VCiblEuOIjvEHhPBKk1+D1pIl6m6Rk7DGL5CAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:24:02.189696Z"},"content_sha256":"d42f6e8fff382367609a585d8b1cc762438564c4477d572b6f9514f989843a5d","schema_version":"1.0","event_id":"sha256:d42f6e8fff382367609a585d8b1cc762438564c4477d572b6f9514f989843a5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DJTHH4QEYOBFIH4KB7GRRKCNF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Latent-Graph Learning for Disease Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anees Kazi, Luca Cosmo, Michael Bronstein, Nassir Navab, Seyed-Ahmad Ahmadi","submitted_at":"2020-03-27T08:18:01Z","abstract_excerpt":"Recently, Graph Convolutional Networks (GCNs) have proven to be a powerful machine learning tool for Computer-Aided Diagnosis (CADx) and disease prediction. A key component in these models is to build a population graph, where the graph adjacency matrix represents pair-wise patient similarities. Until now, the similarity metrics have been defined manually, usually based on meta-features like demographics or clinical scores. The definition of the metric, however, needs careful tuning, as GCNs are very sensitive to the graph structure. In this paper, we demonstrate for the first time in the CADx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13620","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/2003.13620/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-05T04:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FphXqYuMwgyWH0jrzqOIADfY3Znj9WzOgALuNokSX1iJIPawRrefTg7rlfdyduKSGqK6NBu1hmwaefcMluRCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:24:02.190044Z"},"content_sha256":"df68e5483d252e92335283f20e4c1572205541557f9334bbf6dd77751f116c1d","schema_version":"1.0","event_id":"sha256:df68e5483d252e92335283f20e4c1572205541557f9334bbf6dd77751f116c1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/bundle.json","state_url":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/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-06T19:24:02Z","links":{"resolver":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4","bundle":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/bundle.json","state":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DJTHH4QEYOBFIH4KB7GRRKCNF4","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":"965762e6a33defc74abfc73ea624e19444ed7d54308689080bb3b4afba62f72b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-27T08:18:01Z","title_canon_sha256":"3a8c84e23004597330a853220dfce4a148ed97fe2acd2d5e32d6eb475c2083a1"},"schema_version":"1.0","source":{"id":"2003.13620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.13620","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"2003.13620v2","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13620","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"DJTHH4QEYOBF","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"pith_short_16","alias_value":"DJTHH4QEYOBFIH4K","created_at":"2026-07-05T04:22:48Z"},{"alias_kind":"pith_short_8","alias_value":"DJTHH4QE","created_at":"2026-07-05T04:22:48Z"}],"graph_snapshots":[{"event_id":"sha256:df68e5483d252e92335283f20e4c1572205541557f9334bbf6dd77751f116c1d","target":"graph","created_at":"2026-07-05T04:22:48Z","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/2003.13620/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, Graph Convolutional Networks (GCNs) have proven to be a powerful machine learning tool for Computer-Aided Diagnosis (CADx) and disease prediction. A key component in these models is to build a population graph, where the graph adjacency matrix represents pair-wise patient similarities. Until now, the similarity metrics have been defined manually, usually based on meta-features like demographics or clinical scores. The definition of the metric, however, needs careful tuning, as GCNs are very sensitive to the graph structure. In this paper, we demonstrate for the first time in the CADx","authors_text":"Anees Kazi, Luca Cosmo, Michael Bronstein, Nassir Navab, Seyed-Ahmad Ahmadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-27T08:18:01Z","title":"Latent-Graph Learning for Disease Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13620","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:d42f6e8fff382367609a585d8b1cc762438564c4477d572b6f9514f989843a5d","target":"record","created_at":"2026-07-05T04:22:48Z","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":"965762e6a33defc74abfc73ea624e19444ed7d54308689080bb3b4afba62f72b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-27T08:18:01Z","title_canon_sha256":"3a8c84e23004597330a853220dfce4a148ed97fe2acd2d5e32d6eb475c2083a1"},"schema_version":"1.0","source":{"id":"2003.13620","kind":"arxiv","version":2}},"canonical_sha256":"1a6673f204c382541f8a0fcd18a84d2f19f1a27e5d43e8dd2b8f1ed41e68a3eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a6673f204c382541f8a0fcd18a84d2f19f1a27e5d43e8dd2b8f1ed41e68a3eb","first_computed_at":"2026-07-05T04:22:48.970799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:22:48.970799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pZ61m8jimqOeucnXZ8v8HzZBqmGoSum+q3/4JRe9HWIr/0ECZQMN/YBks0ujbU+0/Quq1aYU8q2cnIqAVYTQAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:22:48.971332Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.13620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d42f6e8fff382367609a585d8b1cc762438564c4477d572b6f9514f989843a5d","sha256:df68e5483d252e92335283f20e4c1572205541557f9334bbf6dd77751f116c1d"],"state_sha256":"37cfd0a08c6237e9da95484472cb32b2b9df44cbf98a747e3aab63c1b5b03b9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TxaCdVLa36b5egJSCvN1Qo7VHW5KqofgC9aT4mNJl31RCeMpUORkk/rrbSXuYAucalEts/5TZ+nu+q/OXW8JCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T19:24:02.193135Z","bundle_sha256":"3b241e0f5f3d04dd4ee946c37bbc1b8f6ba992c9068f86c44444fe4484616b4a"}}