{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RCD7ILPA4UHGC6B3Z7NPIUU2DH","short_pith_number":"pith:RCD7ILPA","canonical_record":{"source":{"id":"2506.00244","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-30T21:20:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"01dc81290bc11a142d31f4c220bf4091ab6441f9f7d4baf1ad0e0bd97154795e","abstract_canon_sha256":"3d60bef70e0274722edf241aa3cd911143809a41c5fae1d8a60c0e8d8541db0b"},"schema_version":"1.0"},"canonical_sha256":"8887f42de0e50e61783bcfdaf4529a19d7357a42368f58c0eb62f71fa6c3d768","source":{"kind":"arxiv","id":"2506.00244","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00244","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00244v1","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00244","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"RCD7ILPA4UHG","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"pith_short_16","alias_value":"RCD7ILPA4UHGC6B3","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"pith_short_8","alias_value":"RCD7ILPA","created_at":"2026-07-05T11:14:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RCD7ILPA4UHGC6B3Z7NPIUU2DH","target":"record","payload":{"canonical_record":{"source":{"id":"2506.00244","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-30T21:20:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"01dc81290bc11a142d31f4c220bf4091ab6441f9f7d4baf1ad0e0bd97154795e","abstract_canon_sha256":"3d60bef70e0274722edf241aa3cd911143809a41c5fae1d8a60c0e8d8541db0b"},"schema_version":"1.0"},"canonical_sha256":"8887f42de0e50e61783bcfdaf4529a19d7357a42368f58c0eb62f71fa6c3d768","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:09.584421Z","signature_b64":"USmmnBB20OMp9CtxKuvXKkZtplvSwnDZAHtxdiWepp2vI9mHYsqmkWhy+a60HsNv6mDgMV5fHm78qv/OzoISAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8887f42de0e50e61783bcfdaf4529a19d7357a42368f58c0eb62f71fa6c3d768","last_reissued_at":"2026-07-05T11:14:09.583865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:09.583865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.00244","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-05T11:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RUEQkw/ulNe+eFh/5zaLjB0LHhq9DpeLcvQePHg+XRz/QIB9a2cbzJeqUPHAjFCVVlyyZxMWw5/yB7IWSGdsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:14:39.034391Z"},"content_sha256":"a499ef45d90fbe11e9e8b13878215cb969b18234603f25a9227010dd978b2b7f","schema_version":"1.0","event_id":"sha256:a499ef45d90fbe11e9e8b13878215cb969b18234603f25a9227010dd978b2b7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RCD7ILPA4UHGC6B3Z7NPIUU2DH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DeGLIF for Label Noise Robust Node Classification using GNNs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nandyala Hemachandra, Pintu Kumar","submitted_at":"2025-05-30T21:20:40Z","abstract_excerpt":"Noisy labelled datasets are generally inexpensive compared to clean labelled datasets, and the same is true for graph data. In this paper, we propose a denoising technique DeGLIF: Denoising Graph Data using Leave-One-Out Influence Function. DeGLIF uses a small set of clean data and the leave-one-out influence function to make label noise robust node-level prediction on graph data. Leave-one-out influence function approximates the change in the model parameters if a training point is removed from the training dataset. Recent advances propose a way to calculate the leave-one-out influence functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00244","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/2506.00244/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-05T11:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkP4E8rKwWITsuVhlm3315ZDy+7xMaoN90Glzy1uBLl631kWuOFVhiZpSCLojBzutmAirr+BBHbXrK33swD5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:14:39.034876Z"},"content_sha256":"c924db0a1e6e9942b865bd5887f2e36f8ef1d5469b410a08590b463b14eba0d7","schema_version":"1.0","event_id":"sha256:c924db0a1e6e9942b865bd5887f2e36f8ef1d5469b410a08590b463b14eba0d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCD7ILPA4UHGC6B3Z7NPIUU2DH/bundle.json","state_url":"https://pith.science/pith/RCD7ILPA4UHGC6B3Z7NPIUU2DH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCD7ILPA4UHGC6B3Z7NPIUU2DH/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-08T09:14:39Z","links":{"resolver":"https://pith.science/pith/RCD7ILPA4UHGC6B3Z7NPIUU2DH","bundle":"https://pith.science/pith/RCD7ILPA4UHGC6B3Z7NPIUU2DH/bundle.json","state":"https://pith.science/pith/RCD7ILPA4UHGC6B3Z7NPIUU2DH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCD7ILPA4UHGC6B3Z7NPIUU2DH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RCD7ILPA4UHGC6B3Z7NPIUU2DH","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":"3d60bef70e0274722edf241aa3cd911143809a41c5fae1d8a60c0e8d8541db0b","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-30T21:20:40Z","title_canon_sha256":"01dc81290bc11a142d31f4c220bf4091ab6441f9f7d4baf1ad0e0bd97154795e"},"schema_version":"1.0","source":{"id":"2506.00244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00244","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00244v1","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00244","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"RCD7ILPA4UHG","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"pith_short_16","alias_value":"RCD7ILPA4UHGC6B3","created_at":"2026-07-05T11:14:09Z"},{"alias_kind":"pith_short_8","alias_value":"RCD7ILPA","created_at":"2026-07-05T11:14:09Z"}],"graph_snapshots":[{"event_id":"sha256:c924db0a1e6e9942b865bd5887f2e36f8ef1d5469b410a08590b463b14eba0d7","target":"graph","created_at":"2026-07-05T11:14:09Z","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/2506.00244/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Noisy labelled datasets are generally inexpensive compared to clean labelled datasets, and the same is true for graph data. In this paper, we propose a denoising technique DeGLIF: Denoising Graph Data using Leave-One-Out Influence Function. DeGLIF uses a small set of clean data and the leave-one-out influence function to make label noise robust node-level prediction on graph data. Leave-one-out influence function approximates the change in the model parameters if a training point is removed from the training dataset. Recent advances propose a way to calculate the leave-one-out influence functi","authors_text":"Nandyala Hemachandra, Pintu Kumar","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-30T21:20:40Z","title":"DeGLIF for Label Noise Robust Node Classification using GNNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00244","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:a499ef45d90fbe11e9e8b13878215cb969b18234603f25a9227010dd978b2b7f","target":"record","created_at":"2026-07-05T11:14:09Z","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":"3d60bef70e0274722edf241aa3cd911143809a41c5fae1d8a60c0e8d8541db0b","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-30T21:20:40Z","title_canon_sha256":"01dc81290bc11a142d31f4c220bf4091ab6441f9f7d4baf1ad0e0bd97154795e"},"schema_version":"1.0","source":{"id":"2506.00244","kind":"arxiv","version":1}},"canonical_sha256":"8887f42de0e50e61783bcfdaf4529a19d7357a42368f58c0eb62f71fa6c3d768","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8887f42de0e50e61783bcfdaf4529a19d7357a42368f58c0eb62f71fa6c3d768","first_computed_at":"2026-07-05T11:14:09.583865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:09.583865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"USmmnBB20OMp9CtxKuvXKkZtplvSwnDZAHtxdiWepp2vI9mHYsqmkWhy+a60HsNv6mDgMV5fHm78qv/OzoISAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:09.584421Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a499ef45d90fbe11e9e8b13878215cb969b18234603f25a9227010dd978b2b7f","sha256:c924db0a1e6e9942b865bd5887f2e36f8ef1d5469b410a08590b463b14eba0d7"],"state_sha256":"159bf877c49bda2c9668958bdc9af7646071eefef1189a416d2ce6615914286f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lJOOHJWvDwBlpqhG5xi+5NkxXiIYTFF4DrPiknz7a0A+s7FTODOLr1+EZ4OLCzvRErtEF0mOIqF3CsqD+ICvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:14:39.038093Z","bundle_sha256":"f8ceeaffa7eca81003146864074641f9d8be91fc7224d9ac93204a5b1e90c6b0"}}