{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JDGIAANDBO5T5W5L46FMDXQYAB","short_pith_number":"pith:JDGIAAND","schema_version":"1.0","canonical_sha256":"48cc8001a30bbb3edbabe78ac1de180053673e4c99098830f4a0b09d88aba391","source":{"kind":"arxiv","id":"2503.17842","version":1},"attestation_state":"computed","paper":{"title":"Adapt, Agree, Aggregate: Semi-Supervised Ensemble Labeling for Graph Convolutional Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Behnam Roshanfekr, Fardin Ayar, Maryam Abdolali, Mohammad Rahmati, Romina Zakerian","submitted_at":"2025-03-22T19:10:54Z","abstract_excerpt":"In this paper, we propose a novel framework that combines ensemble learning with augmented graph structures to improve the performance and robustness of semi-supervised node classification in graphs. By creating multiple augmented views of the same graph, our approach harnesses the \"wisdom of a diverse crowd\", mitigating the challenges posed by noisy graph structures. Leveraging ensemble learning allows us to simultaneously achieve three key goals: adaptive confidence threshold selection based on model agreement, dynamic determination of the number of high-confidence samples for training, and "},"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":"2503.17842","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-22T19:10:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"92929af92e9d8a15f7f8f926d56ca6d051c9973896ce9d20587af008f3c1f0cc","abstract_canon_sha256":"c90519bf62d89e78dd57ef9279306c26495db2e4e6f0345944efd67923722358"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:56.208587Z","signature_b64":"4ovNttHvRs1xaCgO84C98On7C+8iRiBm1lG8YD5c/9EKk/3mppUSEqdcjHf89V36UU3iEDYEzX/o1hO+Pr1CCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48cc8001a30bbb3edbabe78ac1de180053673e4c99098830f4a0b09d88aba391","last_reissued_at":"2026-07-05T10:37:56.208037Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:56.208037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adapt, Agree, Aggregate: Semi-Supervised Ensemble Labeling for Graph Convolutional Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Behnam Roshanfekr, Fardin Ayar, Maryam Abdolali, Mohammad Rahmati, Romina Zakerian","submitted_at":"2025-03-22T19:10:54Z","abstract_excerpt":"In this paper, we propose a novel framework that combines ensemble learning with augmented graph structures to improve the performance and robustness of semi-supervised node classification in graphs. By creating multiple augmented views of the same graph, our approach harnesses the \"wisdom of a diverse crowd\", mitigating the challenges posed by noisy graph structures. Leveraging ensemble learning allows us to simultaneously achieve three key goals: adaptive confidence threshold selection based on model agreement, dynamic determination of the number of high-confidence samples for training, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.17842","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/2503.17842/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":"2503.17842","created_at":"2026-07-05T10:37:56.208095+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.17842v1","created_at":"2026-07-05T10:37:56.208095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.17842","created_at":"2026-07-05T10:37:56.208095+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDGIAANDBO5T","created_at":"2026-07-05T10:37:56.208095+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDGIAANDBO5T5W5L","created_at":"2026-07-05T10:37:56.208095+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDGIAAND","created_at":"2026-07-05T10:37:56.208095+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDGIAANDBO5T5W5L46FMDXQYAB","json":"https://pith.science/pith/JDGIAANDBO5T5W5L46FMDXQYAB.json","graph_json":"https://pith.science/api/pith-number/JDGIAANDBO5T5W5L46FMDXQYAB/graph.json","events_json":"https://pith.science/api/pith-number/JDGIAANDBO5T5W5L46FMDXQYAB/events.json","paper":"https://pith.science/paper/JDGIAAND"},"agent_actions":{"view_html":"https://pith.science/pith/JDGIAANDBO5T5W5L46FMDXQYAB","download_json":"https://pith.science/pith/JDGIAANDBO5T5W5L46FMDXQYAB.json","view_paper":"https://pith.science/paper/JDGIAAND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.17842&json=true","fetch_graph":"https://pith.science/api/pith-number/JDGIAANDBO5T5W5L46FMDXQYAB/graph.json","fetch_events":"https://pith.science/api/pith-number/JDGIAANDBO5T5W5L46FMDXQYAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDGIAANDBO5T5W5L46FMDXQYAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDGIAANDBO5T5W5L46FMDXQYAB/action/storage_attestation","attest_author":"https://pith.science/pith/JDGIAANDBO5T5W5L46FMDXQYAB/action/author_attestation","sign_citation":"https://pith.science/pith/JDGIAANDBO5T5W5L46FMDXQYAB/action/citation_signature","submit_replication":"https://pith.science/pith/JDGIAANDBO5T5W5L46FMDXQYAB/action/replication_record"}},"created_at":"2026-07-05T10:37:56.208095+00:00","updated_at":"2026-07-05T10:37:56.208095+00:00"}