{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FOPL4TKNJOAXZCZ7CDVCEBT65Q","short_pith_number":"pith:FOPL4TKN","schema_version":"1.0","canonical_sha256":"2b9ebe4d4d4b817c8b3f10ea22067eec3955ec073beec4a1ff8c7ba1d74d304b","source":{"kind":"arxiv","id":"1911.07123","version":3},"attestation_state":"computed","paper":{"title":"Graph-Revised Convolutional Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Donghan Yu, Ruohong Zhang, Yiming Yang, Yuexin Wu, Zhengbao Jiang","submitted_at":"2019-11-17T01:00:12Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) have received increasing attention in the machine learning community for effectively leveraging both the content features of nodes and the linkage patterns across graphs in various applications. As real-world graphs are often incomplete and noisy, treating them as ground-truth information, which is a common practice in most GCNs, unavoidably leads to sub-optimal solutions. Existing efforts for addressing this problem either involve an over-parameterized model which is difficult to scale, or simply re-weight observed edges without dealing with the missing-edg"},"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":"1911.07123","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-17T01:00:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"17b5f0475370b38a6af0938f5330a80c71509a7bb1391355441bdb27be60f7d5","abstract_canon_sha256":"8196b9f4f9fcc24b5d2e386a495838ec37ed6dc1cf5fba7febcc57993722d1e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:02:51.539103Z","signature_b64":"TIkyHDtvQkC7k14R4tNJONUdiuM5IXZtr3i4/I7UQH6h11u7NY7eRDbi5jHwa+Cb+bwd0v71m+5LgBLw+/jWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b9ebe4d4d4b817c8b3f10ea22067eec3955ec073beec4a1ff8c7ba1d74d304b","last_reissued_at":"2026-07-05T02:02:51.538646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:02:51.538646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Revised Convolutional Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Donghan Yu, Ruohong Zhang, Yiming Yang, Yuexin Wu, Zhengbao Jiang","submitted_at":"2019-11-17T01:00:12Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) have received increasing attention in the machine learning community for effectively leveraging both the content features of nodes and the linkage patterns across graphs in various applications. As real-world graphs are often incomplete and noisy, treating them as ground-truth information, which is a common practice in most GCNs, unavoidably leads to sub-optimal solutions. Existing efforts for addressing this problem either involve an over-parameterized model which is difficult to scale, or simply re-weight observed edges without dealing with the missing-edg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07123","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/1911.07123/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":"1911.07123","created_at":"2026-07-05T02:02:51.538709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.07123v3","created_at":"2026-07-05T02:02:51.538709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07123","created_at":"2026-07-05T02:02:51.538709+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOPL4TKNJOAX","created_at":"2026-07-05T02:02:51.538709+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOPL4TKNJOAXZCZ7","created_at":"2026-07-05T02:02:51.538709+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOPL4TKN","created_at":"2026-07-05T02:02:51.538709+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/FOPL4TKNJOAXZCZ7CDVCEBT65Q","json":"https://pith.science/pith/FOPL4TKNJOAXZCZ7CDVCEBT65Q.json","graph_json":"https://pith.science/api/pith-number/FOPL4TKNJOAXZCZ7CDVCEBT65Q/graph.json","events_json":"https://pith.science/api/pith-number/FOPL4TKNJOAXZCZ7CDVCEBT65Q/events.json","paper":"https://pith.science/paper/FOPL4TKN"},"agent_actions":{"view_html":"https://pith.science/pith/FOPL4TKNJOAXZCZ7CDVCEBT65Q","download_json":"https://pith.science/pith/FOPL4TKNJOAXZCZ7CDVCEBT65Q.json","view_paper":"https://pith.science/paper/FOPL4TKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.07123&json=true","fetch_graph":"https://pith.science/api/pith-number/FOPL4TKNJOAXZCZ7CDVCEBT65Q/graph.json","fetch_events":"https://pith.science/api/pith-number/FOPL4TKNJOAXZCZ7CDVCEBT65Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOPL4TKNJOAXZCZ7CDVCEBT65Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOPL4TKNJOAXZCZ7CDVCEBT65Q/action/storage_attestation","attest_author":"https://pith.science/pith/FOPL4TKNJOAXZCZ7CDVCEBT65Q/action/author_attestation","sign_citation":"https://pith.science/pith/FOPL4TKNJOAXZCZ7CDVCEBT65Q/action/citation_signature","submit_replication":"https://pith.science/pith/FOPL4TKNJOAXZCZ7CDVCEBT65Q/action/replication_record"}},"created_at":"2026-07-05T02:02:51.538709+00:00","updated_at":"2026-07-05T02:02:51.538709+00:00"}