{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GEBQNQP6RF34UVCYH5ZXFTUENH","short_pith_number":"pith:GEBQNQP6","schema_version":"1.0","canonical_sha256":"310306c1fe8977ca54583f7372ce8469dbcb88a94c063e546b9ffd0db5479968","source":{"kind":"arxiv","id":"2110.07317","version":3},"attestation_state":"computed","paper":{"title":"ReGVD: Revisiting Graph Neural Networks for Vulnerability Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Dai Quoc Nguyen, Dinh Phung, Quan Hung Tran, Trung Le, Van-Anh Nguyen, Van Nguyen","submitted_at":"2021-10-14T12:44:38Z","abstract_excerpt":"Identifying vulnerabilities in the source code is essential to protect the software systems from cyber security attacks. It, however, is also a challenging step that requires specialized expertise in security and code representation. To this end, we aim to develop a general, practical, and programming language-independent model capable of running on various source codes and libraries without difficulty. Therefore, we consider vulnerability detection as an inductive text classification problem and propose ReGVD, a simple yet effective graph neural network-based model for the problem. In particu"},"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":"2110.07317","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-14T12:44:38Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"c5d125c4e73db038c9ece561a821559a399504a33ea9f6b03cd515c01f2734eb","abstract_canon_sha256":"9397b4d8a4ed91290f76f450cc722e933c2e53ea9e52dc561ae9f01a286c84b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:24.532377Z","signature_b64":"mGOG65LKHbvpmiIDwsn2+QSfeT7oUFCUiM12Halvub0s2aTWQbLG2JNMZq+z/3WQWmAlJ7jpg/n/CSXl6UkYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"310306c1fe8977ca54583f7372ce8469dbcb88a94c063e546b9ffd0db5479968","last_reissued_at":"2026-07-05T03:54:24.531920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:24.531920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReGVD: Revisiting Graph Neural Networks for Vulnerability Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Dai Quoc Nguyen, Dinh Phung, Quan Hung Tran, Trung Le, Van-Anh Nguyen, Van Nguyen","submitted_at":"2021-10-14T12:44:38Z","abstract_excerpt":"Identifying vulnerabilities in the source code is essential to protect the software systems from cyber security attacks. It, however, is also a challenging step that requires specialized expertise in security and code representation. To this end, we aim to develop a general, practical, and programming language-independent model capable of running on various source codes and libraries without difficulty. Therefore, we consider vulnerability detection as an inductive text classification problem and propose ReGVD, a simple yet effective graph neural network-based model for the problem. In particu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07317","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/2110.07317/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":"2110.07317","created_at":"2026-07-05T03:54:24.531981+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.07317v3","created_at":"2026-07-05T03:54:24.531981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07317","created_at":"2026-07-05T03:54:24.531981+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEBQNQP6RF34","created_at":"2026-07-05T03:54:24.531981+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEBQNQP6RF34UVCY","created_at":"2026-07-05T03:54:24.531981+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEBQNQP6","created_at":"2026-07-05T03:54:24.531981+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/GEBQNQP6RF34UVCYH5ZXFTUENH","json":"https://pith.science/pith/GEBQNQP6RF34UVCYH5ZXFTUENH.json","graph_json":"https://pith.science/api/pith-number/GEBQNQP6RF34UVCYH5ZXFTUENH/graph.json","events_json":"https://pith.science/api/pith-number/GEBQNQP6RF34UVCYH5ZXFTUENH/events.json","paper":"https://pith.science/paper/GEBQNQP6"},"agent_actions":{"view_html":"https://pith.science/pith/GEBQNQP6RF34UVCYH5ZXFTUENH","download_json":"https://pith.science/pith/GEBQNQP6RF34UVCYH5ZXFTUENH.json","view_paper":"https://pith.science/paper/GEBQNQP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.07317&json=true","fetch_graph":"https://pith.science/api/pith-number/GEBQNQP6RF34UVCYH5ZXFTUENH/graph.json","fetch_events":"https://pith.science/api/pith-number/GEBQNQP6RF34UVCYH5ZXFTUENH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEBQNQP6RF34UVCYH5ZXFTUENH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEBQNQP6RF34UVCYH5ZXFTUENH/action/storage_attestation","attest_author":"https://pith.science/pith/GEBQNQP6RF34UVCYH5ZXFTUENH/action/author_attestation","sign_citation":"https://pith.science/pith/GEBQNQP6RF34UVCYH5ZXFTUENH/action/citation_signature","submit_replication":"https://pith.science/pith/GEBQNQP6RF34UVCYH5ZXFTUENH/action/replication_record"}},"created_at":"2026-07-05T03:54:24.531981+00:00","updated_at":"2026-07-05T03:54:24.531981+00:00"}