{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ONTGGEPFTYT7GPXNW6W6ZSK3QO","short_pith_number":"pith:ONTGGEPF","schema_version":"1.0","canonical_sha256":"73666311e59e27f33eedb7adecc95b83bc6a288f602df7ec9c68cfadb2e5e0f2","source":{"kind":"arxiv","id":"2102.10452","version":1},"attestation_state":"computed","paper":{"title":"Spotting Silent Buffer Overflows in Execution Trace through Graph Neural Network Assisted Data Flow Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Li Yu, Peng Liu, Suhang Wang, Zhilong Wang","submitted_at":"2021-02-20T21:40:53Z","abstract_excerpt":"A software vulnerability could be exploited without any visible symptoms. When no source code is available, although such silent program executions could cause very serious damage, the general problem of analyzing silent yet harmful executions is still an open problem. In this work, we propose a graph neural network (GNN) assisted data flow analysis method for spotting silent buffer overflows in execution traces. The new method combines a novel graph structure (denoted DFG+) beyond data-flow graphs, a tool to extract {\\tt DFG+} from execution traces, and a modified Relational Graph Convolution"},"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":"2102.10452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2021-02-20T21:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"bd49af347ccf3f4c9136bc225c5300564098e42e067d75a829a33f9508534e13","abstract_canon_sha256":"0fbf7c7838b6b20042d5a99772c0fb31147b40ee5b4d422334c3f34e1aa3c04b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:58.033974Z","signature_b64":"mYPjhNtiPBrRBCuvru1mqG4ifj5eLJpMmnLfpc/wZS1kfDbdAdGIKN1z3nExbDgRmAGSiP/EtZmhEynw9G/TCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73666311e59e27f33eedb7adecc95b83bc6a288f602df7ec9c68cfadb2e5e0f2","last_reissued_at":"2026-07-05T02:16:58.033536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:58.033536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spotting Silent Buffer Overflows in Execution Trace through Graph Neural Network Assisted Data Flow Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Li Yu, Peng Liu, Suhang Wang, Zhilong Wang","submitted_at":"2021-02-20T21:40:53Z","abstract_excerpt":"A software vulnerability could be exploited without any visible symptoms. When no source code is available, although such silent program executions could cause very serious damage, the general problem of analyzing silent yet harmful executions is still an open problem. In this work, we propose a graph neural network (GNN) assisted data flow analysis method for spotting silent buffer overflows in execution traces. The new method combines a novel graph structure (denoted DFG+) beyond data-flow graphs, a tool to extract {\\tt DFG+} from execution traces, and a modified Relational Graph Convolution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10452","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/2102.10452/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":"2102.10452","created_at":"2026-07-05T02:16:58.033596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10452v1","created_at":"2026-07-05T02:16:58.033596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10452","created_at":"2026-07-05T02:16:58.033596+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONTGGEPFTYT7","created_at":"2026-07-05T02:16:58.033596+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONTGGEPFTYT7GPXN","created_at":"2026-07-05T02:16:58.033596+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONTGGEPF","created_at":"2026-07-05T02:16:58.033596+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19472","citing_title":"SIExVulTS: Sensitive Information Exposure Vulnerability Detection System using Transformer Models and Static Analysis","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ONTGGEPFTYT7GPXNW6W6ZSK3QO","json":"https://pith.science/pith/ONTGGEPFTYT7GPXNW6W6ZSK3QO.json","graph_json":"https://pith.science/api/pith-number/ONTGGEPFTYT7GPXNW6W6ZSK3QO/graph.json","events_json":"https://pith.science/api/pith-number/ONTGGEPFTYT7GPXNW6W6ZSK3QO/events.json","paper":"https://pith.science/paper/ONTGGEPF"},"agent_actions":{"view_html":"https://pith.science/pith/ONTGGEPFTYT7GPXNW6W6ZSK3QO","download_json":"https://pith.science/pith/ONTGGEPFTYT7GPXNW6W6ZSK3QO.json","view_paper":"https://pith.science/paper/ONTGGEPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10452&json=true","fetch_graph":"https://pith.science/api/pith-number/ONTGGEPFTYT7GPXNW6W6ZSK3QO/graph.json","fetch_events":"https://pith.science/api/pith-number/ONTGGEPFTYT7GPXNW6W6ZSK3QO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONTGGEPFTYT7GPXNW6W6ZSK3QO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONTGGEPFTYT7GPXNW6W6ZSK3QO/action/storage_attestation","attest_author":"https://pith.science/pith/ONTGGEPFTYT7GPXNW6W6ZSK3QO/action/author_attestation","sign_citation":"https://pith.science/pith/ONTGGEPFTYT7GPXNW6W6ZSK3QO/action/citation_signature","submit_replication":"https://pith.science/pith/ONTGGEPFTYT7GPXNW6W6ZSK3QO/action/replication_record"}},"created_at":"2026-07-05T02:16:58.033596+00:00","updated_at":"2026-07-05T02:16:58.033596+00:00"}