{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/conformal-inductive-graph-neural-networks","title":"Conformal Inductive Graph Neural Networks","arxiv_id":"2407.09173","date":"2024-07-12","proceeding":null,"authors":["Soroush H. Zargarbashi","Aleksandar Bojchevski"],"abstract":"Conformal prediction (CP) transforms any model's output into prediction sets guaranteed to include (cover) the true label. CP requires exchangeability, a relaxation of the i.i.d. assumption, to obtain a valid distribution-free coverage guarantee. This makes it directly applicable to transductive node-classification. However, conventional CP cannot be applied in inductive settings due to the implicit shift in the (calibration) scores caused by message passing with the new nodes. We fix this issue for both cases of node and edge-exchangeable graphs, recovering the standard coverage guarantee without sacrificing statistical efficiency. We further prove that the guarantee holds independently of the prediction time, e.g. upon arrival of a new node/edge or at any subsequent moment.","url_abs":"https://arxiv.org/abs/2407.09173v1","url_pdf":"https://arxiv.org/pdf/2407.09173v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"conformal-prediction","task_name":"Conformal Prediction"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":null,"task_name":"valid"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2407.09173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.09173"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/soroushzargar/conformal-node-classification","reach":{"status":"ok"}}],"summary":{"ran":3},"by_repo_kind":{"found_in_text":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"7c95cce0bf02cb49","entry":"edge_induced_subgraph","repo":"soroushzargar/conformal-node-classification","repo_kind":"found_in_text","path":"code-to-upload/utils.py","file_url":"https://github.com/soroushzargar/conformal-node-classification/blob/HEAD/code-to-upload/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7c95cce0bf02cb49"}},{"code_sha256_prefix":"068d2525d3417336","entry":"node_induced_subgraph","repo":"soroushzargar/conformal-node-classification","repo_kind":"found_in_text","path":"code-to-upload/utils.py","file_url":"https://github.com/soroushzargar/conformal-node-classification/blob/HEAD/code-to-upload/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"068d2525d3417336"}},{"code_sha256_prefix":"fec3c81b00e20294","entry":"union_edge_index","repo":"soroushzargar/conformal-node-classification","repo_kind":"found_in_text","path":"code-to-upload/utils.py","file_url":"https://github.com/soroushzargar/conformal-node-classification/blob/HEAD/code-to-upload/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"fec3c81b00e20294"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}