{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:L4WHS2CVE22HTULAWFKXNSX2DC","short_pith_number":"pith:L4WHS2CV","canonical_record":{"source":{"id":"2412.03190","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-04T10:22:34Z","cross_cats_sorted":[],"title_canon_sha256":"42db4169fc6cb52ea7b55cf611ac7947b34fcd9d04b883c680e03e3af7bea7d8","abstract_canon_sha256":"67ccd3afd34d63f81069b1963ce1bfdd3beffca3c82c687cea35f0d29e4a267d"},"schema_version":"1.0"},"canonical_sha256":"5f2c79685526b479d160b15576cafa189f3136b246dfd4efc768623583026603","source":{"kind":"arxiv","id":"2412.03190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03190","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03190v1","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03190","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"pith_short_12","alias_value":"L4WHS2CVE22H","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"pith_short_16","alias_value":"L4WHS2CVE22HTULA","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"pith_short_8","alias_value":"L4WHS2CV","created_at":"2026-07-05T09:44:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:L4WHS2CVE22HTULAWFKXNSX2DC","target":"record","payload":{"canonical_record":{"source":{"id":"2412.03190","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-04T10:22:34Z","cross_cats_sorted":[],"title_canon_sha256":"42db4169fc6cb52ea7b55cf611ac7947b34fcd9d04b883c680e03e3af7bea7d8","abstract_canon_sha256":"67ccd3afd34d63f81069b1963ce1bfdd3beffca3c82c687cea35f0d29e4a267d"},"schema_version":"1.0"},"canonical_sha256":"5f2c79685526b479d160b15576cafa189f3136b246dfd4efc768623583026603","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:26.163131Z","signature_b64":"ov/EUAP03Zx9HQJnlOwqmwbatVlnYOK7r0hwYVEjRLR+jdgEUccK9/viHnbCyEbBs0pobAU0ZWZ2xH9nBxj9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f2c79685526b479d160b15576cafa189f3136b246dfd4efc768623583026603","last_reissued_at":"2026-07-05T09:44:26.162758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:26.162758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.03190","source_version":1,"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-05T09:44:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ymJr2dNt7P37O06q2k/k5AZQU8f/aDvC2OC72Y16+sWhNYhOH0XLfCeAUW+jjQiFYZ60J3H6uFU4kHKi7qM6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T23:21:19.011798Z"},"content_sha256":"73193c0732149b5c570c99602afb01efd822ed4ecf1dbb159a490a94234a531b","schema_version":"1.0","event_id":"sha256:73193c0732149b5c570c99602afb01efd822ed4ecf1dbb159a490a94234a531b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:L4WHS2CVE22HTULAWFKXNSX2DC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node Classification With Integrated Reject Option","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Charu Sharma, Jayadratha Gayen, Naresh Manwani, Uday Bhaskar","submitted_at":"2024-12-04T10:22:34Z","abstract_excerpt":"One of the key tasks in graph learning is node classification. While Graph neural networks have been used for various applications, their adaptivity to reject option setting is not previously explored. In this paper, we propose NCwR, a novel approach to node classification in Graph Neural Networks (GNNs) with an integrated reject option, which allows the model to abstain from making predictions when uncertainty is high. We propose both cost-based and coverage-based methods for classification with abstention in node classification setting using GNNs. We perform experiments using our method on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03190","kind":"arxiv","version":1},"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/2412.03190/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-05T09:44:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLE3TA7jVl/T/S4rMUTLDiSU24/dlM4wnlpgUCfDI+4b7rTGCqlMmV1IEe2O+AD/tFz1rp+bbod1mPsKCjI0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T23:21:19.012422Z"},"content_sha256":"bacfcc2b9e8d1d0b82c623d35412ba526afa324a2cdebe87078137257a3b58c7","schema_version":"1.0","event_id":"sha256:bacfcc2b9e8d1d0b82c623d35412ba526afa324a2cdebe87078137257a3b58c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4WHS2CVE22HTULAWFKXNSX2DC/bundle.json","state_url":"https://pith.science/pith/L4WHS2CVE22HTULAWFKXNSX2DC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4WHS2CVE22HTULAWFKXNSX2DC/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-18T23:21:19Z","links":{"resolver":"https://pith.science/pith/L4WHS2CVE22HTULAWFKXNSX2DC","bundle":"https://pith.science/pith/L4WHS2CVE22HTULAWFKXNSX2DC/bundle.json","state":"https://pith.science/pith/L4WHS2CVE22HTULAWFKXNSX2DC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4WHS2CVE22HTULAWFKXNSX2DC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:L4WHS2CVE22HTULAWFKXNSX2DC","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":"67ccd3afd34d63f81069b1963ce1bfdd3beffca3c82c687cea35f0d29e4a267d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-04T10:22:34Z","title_canon_sha256":"42db4169fc6cb52ea7b55cf611ac7947b34fcd9d04b883c680e03e3af7bea7d8"},"schema_version":"1.0","source":{"id":"2412.03190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03190","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03190v1","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03190","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"pith_short_12","alias_value":"L4WHS2CVE22H","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"pith_short_16","alias_value":"L4WHS2CVE22HTULA","created_at":"2026-07-05T09:44:26Z"},{"alias_kind":"pith_short_8","alias_value":"L4WHS2CV","created_at":"2026-07-05T09:44:26Z"}],"graph_snapshots":[{"event_id":"sha256:bacfcc2b9e8d1d0b82c623d35412ba526afa324a2cdebe87078137257a3b58c7","target":"graph","created_at":"2026-07-05T09:44:26Z","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/2412.03190/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the key tasks in graph learning is node classification. While Graph neural networks have been used for various applications, their adaptivity to reject option setting is not previously explored. In this paper, we propose NCwR, a novel approach to node classification in Graph Neural Networks (GNNs) with an integrated reject option, which allows the model to abstain from making predictions when uncertainty is high. We propose both cost-based and coverage-based methods for classification with abstention in node classification setting using GNNs. We perform experiments using our method on t","authors_text":"Charu Sharma, Jayadratha Gayen, Naresh Manwani, Uday Bhaskar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-04T10:22:34Z","title":"Node Classification With Integrated Reject Option"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03190","kind":"arxiv","version":1},"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:73193c0732149b5c570c99602afb01efd822ed4ecf1dbb159a490a94234a531b","target":"record","created_at":"2026-07-05T09:44:26Z","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":"67ccd3afd34d63f81069b1963ce1bfdd3beffca3c82c687cea35f0d29e4a267d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-04T10:22:34Z","title_canon_sha256":"42db4169fc6cb52ea7b55cf611ac7947b34fcd9d04b883c680e03e3af7bea7d8"},"schema_version":"1.0","source":{"id":"2412.03190","kind":"arxiv","version":1}},"canonical_sha256":"5f2c79685526b479d160b15576cafa189f3136b246dfd4efc768623583026603","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f2c79685526b479d160b15576cafa189f3136b246dfd4efc768623583026603","first_computed_at":"2026-07-05T09:44:26.162758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:44:26.162758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ov/EUAP03Zx9HQJnlOwqmwbatVlnYOK7r0hwYVEjRLR+jdgEUccK9/viHnbCyEbBs0pobAU0ZWZ2xH9nBxj9BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:44:26.163131Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.03190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73193c0732149b5c570c99602afb01efd822ed4ecf1dbb159a490a94234a531b","sha256:bacfcc2b9e8d1d0b82c623d35412ba526afa324a2cdebe87078137257a3b58c7"],"state_sha256":"55ec72676f76f108a29148d8c3ed68b09d7401126a84c4a9a32c32305ab94026"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BYOqU4brGVBvCpXZMVypFe+cGsgZXW97mzqbh4ZCebeoSDyaSEn+8iJm/R6lwJBo4CxS+EiLMBr8dbnjoImyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T23:21:19.017537Z","bundle_sha256":"4f3cf98b55a24adc893e741a9f1d16903d6e43954452972a5ac691026d2ba890"}}