{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4IY6FDHEPVDQLX32DPA556BRKF","short_pith_number":"pith:4IY6FDHE","schema_version":"1.0","canonical_sha256":"e231e28ce47d4705df7a1bc1def831514b4822c436a3e6903fa4c2134fbfd6cd","source":{"kind":"arxiv","id":"2012.15116","version":1},"attestation_state":"computed","paper":{"title":"Stack-based Buffer Overflow Detection using Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Fabio Massimo Zennaro, Laszlo Erdodi, William Arild Dahl","submitted_at":"2020-12-30T11:24:44Z","abstract_excerpt":"Detecting vulnerabilities in software is a critical challenge in the development and deployment of applications. One of the most known and dangerous vulnerabilities is stack-based buffer overflows, which may allow potential attackers to execute malicious code. In this paper we consider the use of modern machine learning models, specifically recurrent neural networks, to detect stack-based buffer overflow vulnerabilities in the assembly code of a program. Since assembly code is a generic and common representation, focusing on this language allows us to potentially consider programs written in 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":"2012.15116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-12-30T11:24:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4bef42d2e15fd3d81cce75d208d446f60fe99bfa311c94f42656befc676137dc","abstract_canon_sha256":"2507c9238f5eb948a259ad4b2207888515c5024e46366f5fdc602ab00fca03b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:03:04.740685Z","signature_b64":"jCCH9COEQbvpPd8fl7dEtBezZG3EpXLq6R38qdf9zw2r3jJ/k/EeI7tzVkpCk0IVBY1eA9EQF4JLcoLb6kxYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e231e28ce47d4705df7a1bc1def831514b4822c436a3e6903fa4c2134fbfd6cd","last_reissued_at":"2026-07-05T02:03:04.740286Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:03:04.740286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stack-based Buffer Overflow Detection using Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Fabio Massimo Zennaro, Laszlo Erdodi, William Arild Dahl","submitted_at":"2020-12-30T11:24:44Z","abstract_excerpt":"Detecting vulnerabilities in software is a critical challenge in the development and deployment of applications. One of the most known and dangerous vulnerabilities is stack-based buffer overflows, which may allow potential attackers to execute malicious code. In this paper we consider the use of modern machine learning models, specifically recurrent neural networks, to detect stack-based buffer overflow vulnerabilities in the assembly code of a program. Since assembly code is a generic and common representation, focusing on this language allows us to potentially consider programs written in s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.15116","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/2012.15116/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":"2012.15116","created_at":"2026-07-05T02:03:04.740365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.15116v1","created_at":"2026-07-05T02:03:04.740365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.15116","created_at":"2026-07-05T02:03:04.740365+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IY6FDHEPVDQ","created_at":"2026-07-05T02:03:04.740365+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IY6FDHEPVDQLX32","created_at":"2026-07-05T02:03:04.740365+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IY6FDHE","created_at":"2026-07-05T02:03:04.740365+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07538","citing_title":"Can Neural Decompilation Assist Vulnerability Prediction on Binary Code?","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4IY6FDHEPVDQLX32DPA556BRKF","json":"https://pith.science/pith/4IY6FDHEPVDQLX32DPA556BRKF.json","graph_json":"https://pith.science/api/pith-number/4IY6FDHEPVDQLX32DPA556BRKF/graph.json","events_json":"https://pith.science/api/pith-number/4IY6FDHEPVDQLX32DPA556BRKF/events.json","paper":"https://pith.science/paper/4IY6FDHE"},"agent_actions":{"view_html":"https://pith.science/pith/4IY6FDHEPVDQLX32DPA556BRKF","download_json":"https://pith.science/pith/4IY6FDHEPVDQLX32DPA556BRKF.json","view_paper":"https://pith.science/paper/4IY6FDHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.15116&json=true","fetch_graph":"https://pith.science/api/pith-number/4IY6FDHEPVDQLX32DPA556BRKF/graph.json","fetch_events":"https://pith.science/api/pith-number/4IY6FDHEPVDQLX32DPA556BRKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IY6FDHEPVDQLX32DPA556BRKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IY6FDHEPVDQLX32DPA556BRKF/action/storage_attestation","attest_author":"https://pith.science/pith/4IY6FDHEPVDQLX32DPA556BRKF/action/author_attestation","sign_citation":"https://pith.science/pith/4IY6FDHEPVDQLX32DPA556BRKF/action/citation_signature","submit_replication":"https://pith.science/pith/4IY6FDHEPVDQLX32DPA556BRKF/action/replication_record"}},"created_at":"2026-07-05T02:03:04.740365+00:00","updated_at":"2026-07-05T02:03:04.740365+00:00"}