{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XVMJMZ64K3LHZSUA6DY2DONSNI","short_pith_number":"pith:XVMJMZ64","schema_version":"1.0","canonical_sha256":"bd589667dc56d67cca80f0f1a1b9b26a28e6e20df1d17f93dd7caf1acc0caeb5","source":{"kind":"arxiv","id":"2205.03753","version":1},"attestation_state":"computed","paper":{"title":"Select and Calibrate the Low-confidence: Dual-Channel Consistency based Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Bin Yan, Jian Chen, Kai Qiao, Linyuan Wang, Shuai Yang, Shuhao Shi","submitted_at":"2022-05-08T01:35:28Z","abstract_excerpt":"The Graph Convolutional Networks (GCNs) have achieved excellent results in node classification tasks, but the model's performance at low label rates is still unsatisfactory. Previous studies in Semi-Supervised Learning (SSL) for graph have focused on using network predictions to generate soft pseudo-labels or instructing message propagation, which inevitably contains the incorrect prediction due to the over-confident in the predictions. Our proposed Dual-Channel Consistency based Graph Convolutional Networks (DCC-GCN) uses dual-channel to extract embeddings from node features and topological s"},"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":"2205.03753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-08T01:35:28Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"5aa26bfe8536ecfd600e6d073e1dade3208ff5437cc1967a113544215fa704cf","abstract_canon_sha256":"249f7981fbb16422bff229c469b29b84b7c5e2ae21d782b8a0636fe2c49bd8ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:51.597091Z","signature_b64":"YMtRDk6jts/M+WueaZY/DQlMHHpxp5q7YAaMjQZXXdqXWxHkL6ljUQi/iRmRaxHpsOnCZfPDLE+nqZ1YV7XSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd589667dc56d67cca80f0f1a1b9b26a28e6e20df1d17f93dd7caf1acc0caeb5","last_reissued_at":"2026-07-05T07:17:51.596581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:51.596581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Select and Calibrate the Low-confidence: Dual-Channel Consistency based Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Bin Yan, Jian Chen, Kai Qiao, Linyuan Wang, Shuai Yang, Shuhao Shi","submitted_at":"2022-05-08T01:35:28Z","abstract_excerpt":"The Graph Convolutional Networks (GCNs) have achieved excellent results in node classification tasks, but the model's performance at low label rates is still unsatisfactory. Previous studies in Semi-Supervised Learning (SSL) for graph have focused on using network predictions to generate soft pseudo-labels or instructing message propagation, which inevitably contains the incorrect prediction due to the over-confident in the predictions. Our proposed Dual-Channel Consistency based Graph Convolutional Networks (DCC-GCN) uses dual-channel to extract embeddings from node features and topological s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.03753","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/2205.03753/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":"2205.03753","created_at":"2026-07-05T07:17:51.596640+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.03753v1","created_at":"2026-07-05T07:17:51.596640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.03753","created_at":"2026-07-05T07:17:51.596640+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVMJMZ64K3LH","created_at":"2026-07-05T07:17:51.596640+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVMJMZ64K3LHZSUA","created_at":"2026-07-05T07:17:51.596640+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVMJMZ64","created_at":"2026-07-05T07:17:51.596640+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14223","citing_title":"Towards Precise Prediction Uncertainty in GNNs: Refining GNNs with Topology-grouping Strategy","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XVMJMZ64K3LHZSUA6DY2DONSNI","json":"https://pith.science/pith/XVMJMZ64K3LHZSUA6DY2DONSNI.json","graph_json":"https://pith.science/api/pith-number/XVMJMZ64K3LHZSUA6DY2DONSNI/graph.json","events_json":"https://pith.science/api/pith-number/XVMJMZ64K3LHZSUA6DY2DONSNI/events.json","paper":"https://pith.science/paper/XVMJMZ64"},"agent_actions":{"view_html":"https://pith.science/pith/XVMJMZ64K3LHZSUA6DY2DONSNI","download_json":"https://pith.science/pith/XVMJMZ64K3LHZSUA6DY2DONSNI.json","view_paper":"https://pith.science/paper/XVMJMZ64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.03753&json=true","fetch_graph":"https://pith.science/api/pith-number/XVMJMZ64K3LHZSUA6DY2DONSNI/graph.json","fetch_events":"https://pith.science/api/pith-number/XVMJMZ64K3LHZSUA6DY2DONSNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVMJMZ64K3LHZSUA6DY2DONSNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVMJMZ64K3LHZSUA6DY2DONSNI/action/storage_attestation","attest_author":"https://pith.science/pith/XVMJMZ64K3LHZSUA6DY2DONSNI/action/author_attestation","sign_citation":"https://pith.science/pith/XVMJMZ64K3LHZSUA6DY2DONSNI/action/citation_signature","submit_replication":"https://pith.science/pith/XVMJMZ64K3LHZSUA6DY2DONSNI/action/replication_record"}},"created_at":"2026-07-05T07:17:51.596640+00:00","updated_at":"2026-07-05T07:17:51.596640+00:00"}