{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DHRMFULJ3FEZI5YOXUU6R7SNGS","short_pith_number":"pith:DHRMFULJ","schema_version":"1.0","canonical_sha256":"19e2c2d169d94994770ebd29e8fe4d349c885bb2b8ed2598716566d124e8ca3a","source":{"kind":"arxiv","id":"1812.04191","version":1},"attestation_state":"computed","paper":{"title":"Code-less Patching for Heap Vulnerabilities Using Targeted Calling Context Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Emil Mohammed, Golam Kayas, Junghwan Rhee, Lannan Luo, Qiang Zeng, Xiaojiang Du","submitted_at":"2018-12-11T02:30:27Z","abstract_excerpt":"Exploitation of heap vulnerabilities has been on the rise, leading to many devastating attacks. Conventional heap patch generation is a lengthy procedure, requiring intensive manual efforts. Worse, fresh patches tend to harm system dependability, hence deterring users from deploying them. We propose a heap patching system that simultaneously has the following prominent advantages: (1) generating patches without manual efforts; (2) installing patches without altering the code (so called code-less patching); (3) handling various heap vulnerability types; (4) imposing a very low overhead; and (5)"},"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":"1812.04191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-12-11T02:30:27Z","cross_cats_sorted":[],"title_canon_sha256":"7b8053bffa8b890cf706c403ddef953ce3482a4fd84cbcabf8abf73e43fdc80d","abstract_canon_sha256":"4ca365d5c03a445c462ab1d820881e33e25fad0421b610cec6383b7b9e941517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:35.249467Z","signature_b64":"4fJJRBlOxvuvbuowk0NMoR4xn3gAARQEf4hHdVJdxYcjpZ4XQAWBrhzZb5q9tglnYWaqbA7doFD7AfGeJ+/NCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19e2c2d169d94994770ebd29e8fe4d349c885bb2b8ed2598716566d124e8ca3a","last_reissued_at":"2026-05-17T23:58:35.248860Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:35.248860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code-less Patching for Heap Vulnerabilities Using Targeted Calling Context Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Emil Mohammed, Golam Kayas, Junghwan Rhee, Lannan Luo, Qiang Zeng, Xiaojiang Du","submitted_at":"2018-12-11T02:30:27Z","abstract_excerpt":"Exploitation of heap vulnerabilities has been on the rise, leading to many devastating attacks. Conventional heap patch generation is a lengthy procedure, requiring intensive manual efforts. Worse, fresh patches tend to harm system dependability, hence deterring users from deploying them. We propose a heap patching system that simultaneously has the following prominent advantages: (1) generating patches without manual efforts; (2) installing patches without altering the code (so called code-less patching); (3) handling various heap vulnerability types; (4) imposing a very low overhead; and (5)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04191","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":""},"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":"1812.04191","created_at":"2026-05-17T23:58:35.248971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04191v1","created_at":"2026-05-17T23:58:35.248971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04191","created_at":"2026-05-17T23:58:35.248971+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHRMFULJ3FEZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHRMFULJ3FEZI5YO","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHRMFULJ","created_at":"2026-05-18T12:32:19.392346+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/DHRMFULJ3FEZI5YOXUU6R7SNGS","json":"https://pith.science/pith/DHRMFULJ3FEZI5YOXUU6R7SNGS.json","graph_json":"https://pith.science/api/pith-number/DHRMFULJ3FEZI5YOXUU6R7SNGS/graph.json","events_json":"https://pith.science/api/pith-number/DHRMFULJ3FEZI5YOXUU6R7SNGS/events.json","paper":"https://pith.science/paper/DHRMFULJ"},"agent_actions":{"view_html":"https://pith.science/pith/DHRMFULJ3FEZI5YOXUU6R7SNGS","download_json":"https://pith.science/pith/DHRMFULJ3FEZI5YOXUU6R7SNGS.json","view_paper":"https://pith.science/paper/DHRMFULJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04191&json=true","fetch_graph":"https://pith.science/api/pith-number/DHRMFULJ3FEZI5YOXUU6R7SNGS/graph.json","fetch_events":"https://pith.science/api/pith-number/DHRMFULJ3FEZI5YOXUU6R7SNGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHRMFULJ3FEZI5YOXUU6R7SNGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHRMFULJ3FEZI5YOXUU6R7SNGS/action/storage_attestation","attest_author":"https://pith.science/pith/DHRMFULJ3FEZI5YOXUU6R7SNGS/action/author_attestation","sign_citation":"https://pith.science/pith/DHRMFULJ3FEZI5YOXUU6R7SNGS/action/citation_signature","submit_replication":"https://pith.science/pith/DHRMFULJ3FEZI5YOXUU6R7SNGS/action/replication_record"}},"created_at":"2026-05-17T23:58:35.248971+00:00","updated_at":"2026-05-17T23:58:35.248971+00:00"}