{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BDFAXJTYBWE3TNJN2RYLDZJJGZ","short_pith_number":"pith:BDFAXJTY","schema_version":"1.0","canonical_sha256":"08ca0ba6780d89b9b52dd470b1e52936789e3265be2bb0be5af98376527e19e9","source":{"kind":"arxiv","id":"2506.12468","version":2},"attestation_state":"computed","paper":{"title":"Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dongwoo Kim, HwanJo Yu, Jungseul Ok, SeongKu Kang, Suyeon Kim","submitted_at":"2025-06-14T12:14:15Z","abstract_excerpt":"Graph Neural Networks (GNNs) have achieved state-of-the-art performance in node classification tasks but struggle with label noise in real-world data. Existing studies on graph learning with label noise commonly rely on class-dependent label noise, overlooking the complexities of instance-dependent noise and falling short of capturing real-world corruption patterns. We introduce BeGIN (Benchmarking for Graphs with Instance-dependent Noise), a new benchmark that provides realistic graph datasets with various noise types and comprehensively evaluates noise-handling strategies across GNN architec"},"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":"2506.12468","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-14T12:14:15Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"086236cb680a98b91997d81cda994c2471a4a3ce6be78c3dc66d462e52990b38","abstract_canon_sha256":"932ec36d4704aac963b9c916e30d0158b9ae7ac8ad4106e9645096cffc176727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:42.097953Z","signature_b64":"HSq7prOBE0fD7/ERHKlbapfnJSUpJbtvSJj01LoAOgF3tcVIp80LjJR3sir7wC6uZwPToEXWliGHUck8OaVbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08ca0ba6780d89b9b52dd470b1e52936789e3265be2bb0be5af98376527e19e9","last_reissued_at":"2026-07-05T11:22:42.097469Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:42.097469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dongwoo Kim, HwanJo Yu, Jungseul Ok, SeongKu Kang, Suyeon Kim","submitted_at":"2025-06-14T12:14:15Z","abstract_excerpt":"Graph Neural Networks (GNNs) have achieved state-of-the-art performance in node classification tasks but struggle with label noise in real-world data. Existing studies on graph learning with label noise commonly rely on class-dependent label noise, overlooking the complexities of instance-dependent noise and falling short of capturing real-world corruption patterns. We introduce BeGIN (Benchmarking for Graphs with Instance-dependent Noise), a new benchmark that provides realistic graph datasets with various noise types and comprehensively evaluates noise-handling strategies across GNN architec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12468","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/2506.12468/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":"2506.12468","created_at":"2026-07-05T11:22:42.097523+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.12468v2","created_at":"2026-07-05T11:22:42.097523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12468","created_at":"2026-07-05T11:22:42.097523+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDFAXJTYBWE3","created_at":"2026-07-05T11:22:42.097523+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDFAXJTYBWE3TNJN","created_at":"2026-07-05T11:22:42.097523+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDFAXJTY","created_at":"2026-07-05T11:22:42.097523+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27913","citing_title":"Where LLM Annotators Fail: Label-Free Learning on Graphs with LLMs","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BDFAXJTYBWE3TNJN2RYLDZJJGZ","json":"https://pith.science/pith/BDFAXJTYBWE3TNJN2RYLDZJJGZ.json","graph_json":"https://pith.science/api/pith-number/BDFAXJTYBWE3TNJN2RYLDZJJGZ/graph.json","events_json":"https://pith.science/api/pith-number/BDFAXJTYBWE3TNJN2RYLDZJJGZ/events.json","paper":"https://pith.science/paper/BDFAXJTY"},"agent_actions":{"view_html":"https://pith.science/pith/BDFAXJTYBWE3TNJN2RYLDZJJGZ","download_json":"https://pith.science/pith/BDFAXJTYBWE3TNJN2RYLDZJJGZ.json","view_paper":"https://pith.science/paper/BDFAXJTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.12468&json=true","fetch_graph":"https://pith.science/api/pith-number/BDFAXJTYBWE3TNJN2RYLDZJJGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BDFAXJTYBWE3TNJN2RYLDZJJGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDFAXJTYBWE3TNJN2RYLDZJJGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDFAXJTYBWE3TNJN2RYLDZJJGZ/action/storage_attestation","attest_author":"https://pith.science/pith/BDFAXJTYBWE3TNJN2RYLDZJJGZ/action/author_attestation","sign_citation":"https://pith.science/pith/BDFAXJTYBWE3TNJN2RYLDZJJGZ/action/citation_signature","submit_replication":"https://pith.science/pith/BDFAXJTYBWE3TNJN2RYLDZJJGZ/action/replication_record"}},"created_at":"2026-07-05T11:22:42.097523+00:00","updated_at":"2026-07-05T11:22:42.097523+00:00"}