{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BUKDBWPUAVPJLX7F35HFS43SMV","short_pith_number":"pith:BUKDBWPU","schema_version":"1.0","canonical_sha256":"0d1430d9f4055e95dfe5df4e597372656dcc9b5046cd8f75e2d4fb38b1ede395","source":{"kind":"arxiv","id":"2103.13375","version":2},"attestation_state":"computed","paper":{"title":"Automated Mapping of Vulnerability Advisories onto their Fix Commits in Open Source Repositories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.SE","authors_text":"Antonino Sabetta, Bonaventura Coppola, Daan Hommersom, Damian A. Tamburri, Dario Di Nucci","submitted_at":"2021-03-24T17:50:35Z","abstract_excerpt":"The lack of comprehensive sources of accurate vulnerability data represents a critical obstacle to studying and understanding software vulnerabilities (and their corrections). In this paper, we present an approach that combines heuristics stemming from practical experience and machine-learning (ML) - specifically, natural language processing (NLP) - to address this problem. Our method consists of three phases. First, an advisory record containing key information about a vulnerability is extracted from an advisory (expressed in natural language). Second, using heuristics, a subset of candidate "},"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":"2103.13375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2021-03-24T17:50:35Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"3f3ba86d897110e1395fff09759f2fb9c40c434dbab7d8f9878eae4372df0ad1","abstract_canon_sha256":"67fd8115905a4723b646f20fa7cbdadce2c3f23d7eadd4cda4c2dd25ee9b70bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:22.284701Z","signature_b64":"UmB4Yv2MnuaGPzBrQFvlDWdPLjpSoTmMYaW7tudUvkTslO7rGZyQhNOgZuUoPa0auUcSJBgJGTld5s1IygE0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d1430d9f4055e95dfe5df4e597372656dcc9b5046cd8f75e2d4fb38b1ede395","last_reissued_at":"2026-07-05T10:32:22.283783Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:22.283783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Mapping of Vulnerability Advisories onto their Fix Commits in Open Source Repositories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.SE","authors_text":"Antonino Sabetta, Bonaventura Coppola, Daan Hommersom, Damian A. Tamburri, Dario Di Nucci","submitted_at":"2021-03-24T17:50:35Z","abstract_excerpt":"The lack of comprehensive sources of accurate vulnerability data represents a critical obstacle to studying and understanding software vulnerabilities (and their corrections). In this paper, we present an approach that combines heuristics stemming from practical experience and machine-learning (ML) - specifically, natural language processing (NLP) - to address this problem. Our method consists of three phases. First, an advisory record containing key information about a vulnerability is extracted from an advisory (expressed in natural language). Second, using heuristics, a subset of candidate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.13375","kind":"arxiv","version":2},"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/2103.13375/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":"2103.13375","created_at":"2026-07-05T10:32:22.283912+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.13375v2","created_at":"2026-07-05T10:32:22.283912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.13375","created_at":"2026-07-05T10:32:22.283912+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUKDBWPUAVPJ","created_at":"2026-07-05T10:32:22.283912+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUKDBWPUAVPJLX7F","created_at":"2026-07-05T10:32:22.283912+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUKDBWPU","created_at":"2026-07-05T10:32:22.283912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11202","citing_title":"Forecasting the risk of software choices: A model to foretell security vulnerabilities from library dependencies and source code evolution","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BUKDBWPUAVPJLX7F35HFS43SMV","json":"https://pith.science/pith/BUKDBWPUAVPJLX7F35HFS43SMV.json","graph_json":"https://pith.science/api/pith-number/BUKDBWPUAVPJLX7F35HFS43SMV/graph.json","events_json":"https://pith.science/api/pith-number/BUKDBWPUAVPJLX7F35HFS43SMV/events.json","paper":"https://pith.science/paper/BUKDBWPU"},"agent_actions":{"view_html":"https://pith.science/pith/BUKDBWPUAVPJLX7F35HFS43SMV","download_json":"https://pith.science/pith/BUKDBWPUAVPJLX7F35HFS43SMV.json","view_paper":"https://pith.science/paper/BUKDBWPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.13375&json=true","fetch_graph":"https://pith.science/api/pith-number/BUKDBWPUAVPJLX7F35HFS43SMV/graph.json","fetch_events":"https://pith.science/api/pith-number/BUKDBWPUAVPJLX7F35HFS43SMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUKDBWPUAVPJLX7F35HFS43SMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUKDBWPUAVPJLX7F35HFS43SMV/action/storage_attestation","attest_author":"https://pith.science/pith/BUKDBWPUAVPJLX7F35HFS43SMV/action/author_attestation","sign_citation":"https://pith.science/pith/BUKDBWPUAVPJLX7F35HFS43SMV/action/citation_signature","submit_replication":"https://pith.science/pith/BUKDBWPUAVPJLX7F35HFS43SMV/action/replication_record"}},"created_at":"2026-07-05T10:32:22.283912+00:00","updated_at":"2026-07-05T10:32:22.283912+00:00"}