{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3XPVZZDHIQS4XIHO2ZXV7XYOA5","short_pith_number":"pith:3XPVZZDH","schema_version":"1.0","canonical_sha256":"dddf5ce4674425cba0eed66f5fdf0e077c156397b80461ec2cfdd90716485a2b","source":{"kind":"arxiv","id":"2405.01462","version":3},"attestation_state":"computed","paper":{"title":"Uncertainty for Active Learning on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Antonio Oroz, Bertrand Charpentier, Dominik Fuchsgruber, Stephan G\\\"unnemann, Tom Wollschl\\\"ager","submitted_at":"2024-05-02T16:50:47Z","abstract_excerpt":"Uncertainty Sampling is an Active Learning strategy that aims to improve the data efficiency of machine learning models by iteratively acquiring labels of data points with the highest uncertainty. While it has proven effective for independent data its applicability to graphs remains under-explored. We propose the first extensive study of Uncertainty Sampling for node classification: (1) We benchmark Uncertainty Sampling beyond predictive uncertainty and highlight a significant performance gap to other Active Learning strategies. (2) We develop ground-truth Bayesian uncertainty estimates in ter"},"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":"2405.01462","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-02T16:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"70701a649815c12479327f042d373cad8cbddb394cf94b0b7a8cf4b33bf4fc46","abstract_canon_sha256":"d61cdcf9fec7688825eaef14cc65ec120ee05e30983a6c23d20d30918359eccc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:36.614906Z","signature_b64":"5jrRdLejghahZtRVUH+LxQTQZiJQiOythFEEzTIYM/s1uGsRLHwIs4yC4jy2s4gGavyUcjR300SwMt7TEK5wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dddf5ce4674425cba0eed66f5fdf0e077c156397b80461ec2cfdd90716485a2b","last_reissued_at":"2026-07-05T10:20:36.614412Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:36.614412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertainty for Active Learning on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Antonio Oroz, Bertrand Charpentier, Dominik Fuchsgruber, Stephan G\\\"unnemann, Tom Wollschl\\\"ager","submitted_at":"2024-05-02T16:50:47Z","abstract_excerpt":"Uncertainty Sampling is an Active Learning strategy that aims to improve the data efficiency of machine learning models by iteratively acquiring labels of data points with the highest uncertainty. While it has proven effective for independent data its applicability to graphs remains under-explored. We propose the first extensive study of Uncertainty Sampling for node classification: (1) We benchmark Uncertainty Sampling beyond predictive uncertainty and highlight a significant performance gap to other Active Learning strategies. (2) We develop ground-truth Bayesian uncertainty estimates in ter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01462","kind":"arxiv","version":3},"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/2405.01462/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":"2405.01462","created_at":"2026-07-05T10:20:36.614473+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.01462v3","created_at":"2026-07-05T10:20:36.614473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01462","created_at":"2026-07-05T10:20:36.614473+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XPVZZDHIQS4","created_at":"2026-07-05T10:20:36.614473+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XPVZZDHIQS4XIHO","created_at":"2026-07-05T10:20:36.614473+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XPVZZDH","created_at":"2026-07-05T10:20:36.614473+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22434","citing_title":"RANA: Robust Active Learning for Noisy Network Alignment","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3XPVZZDHIQS4XIHO2ZXV7XYOA5","json":"https://pith.science/pith/3XPVZZDHIQS4XIHO2ZXV7XYOA5.json","graph_json":"https://pith.science/api/pith-number/3XPVZZDHIQS4XIHO2ZXV7XYOA5/graph.json","events_json":"https://pith.science/api/pith-number/3XPVZZDHIQS4XIHO2ZXV7XYOA5/events.json","paper":"https://pith.science/paper/3XPVZZDH"},"agent_actions":{"view_html":"https://pith.science/pith/3XPVZZDHIQS4XIHO2ZXV7XYOA5","download_json":"https://pith.science/pith/3XPVZZDHIQS4XIHO2ZXV7XYOA5.json","view_paper":"https://pith.science/paper/3XPVZZDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.01462&json=true","fetch_graph":"https://pith.science/api/pith-number/3XPVZZDHIQS4XIHO2ZXV7XYOA5/graph.json","fetch_events":"https://pith.science/api/pith-number/3XPVZZDHIQS4XIHO2ZXV7XYOA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XPVZZDHIQS4XIHO2ZXV7XYOA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XPVZZDHIQS4XIHO2ZXV7XYOA5/action/storage_attestation","attest_author":"https://pith.science/pith/3XPVZZDHIQS4XIHO2ZXV7XYOA5/action/author_attestation","sign_citation":"https://pith.science/pith/3XPVZZDHIQS4XIHO2ZXV7XYOA5/action/citation_signature","submit_replication":"https://pith.science/pith/3XPVZZDHIQS4XIHO2ZXV7XYOA5/action/replication_record"}},"created_at":"2026-07-05T10:20:36.614473+00:00","updated_at":"2026-07-05T10:20:36.614473+00:00"}