{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DJTHH4QEYOBFIH4KB7GRRKCNF4","short_pith_number":"pith:DJTHH4QE","schema_version":"1.0","canonical_sha256":"1a6673f204c382541f8a0fcd18a84d2f19f1a27e5d43e8dd2b8f1ed41e68a3eb","source":{"kind":"arxiv","id":"2003.13620","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.13620","created_at":"2026-07-05T04:22:48.970870+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.13620v2","created_at":"2026-07-05T04:22:48.970870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13620","created_at":"2026-07-05T04:22:48.970870+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJTHH4QEYOBF","created_at":"2026-07-05T04:22:48.970870+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJTHH4QEYOBFIH4K","created_at":"2026-07-05T04:22:48.970870+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJTHH4QE","created_at":"2026-07-05T04:22:48.970870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4","json":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4.json","graph_json":"https://pith.science/api/pith-number/DJTHH4QEYOBFIH4KB7GRRKCNF4/graph.json","events_json":"https://pith.science/api/pith-number/DJTHH4QEYOBFIH4KB7GRRKCNF4/events.json","paper":"https://pith.science/paper/DJTHH4QE"},"agent_actions":{"view_html":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4","download_json":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4.json","view_paper":"https://pith.science/paper/DJTHH4QE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.13620&json=true","fetch_graph":"https://pith.science/api/pith-number/DJTHH4QEYOBFIH4KB7GRRKCNF4/graph.json","fetch_events":"https://pith.science/api/pith-number/DJTHH4QEYOBFIH4KB7GRRKCNF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/action/storage_attestation","attest_author":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/action/author_attestation","sign_citation":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/action/citation_signature","submit_replication":"https://pith.science/pith/DJTHH4QEYOBFIH4KB7GRRKCNF4/action/replication_record"}},"created_at":"2026-07-05T04:22:48.970870+00:00","updated_at":"2026-07-05T04:22:48.970870+00:00"}