{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QHNUYVMZZPBKTBKLTVKWSGRUAS","short_pith_number":"pith:QHNUYVMZ","canonical_record":{"source":{"id":"1804.08470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-23T14:32:45Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"0e945ea5c68f5f5267a095c81ee91946fdee4a09ddaac9008c71e58f6e4df294","abstract_canon_sha256":"2606028bc2547fec6563527921ebe91a6d5c4d5b04ed296db22e9432461c304f"},"schema_version":"1.0"},"canonical_sha256":"81db4c5599cbc2a9854b9d55691a34048870a89b7b162fef74fd62bd95f29561","source":{"kind":"arxiv","id":"1804.08470","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08470","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08470v2","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08470","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"pith_short_12","alias_value":"QHNUYVMZZPBK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QHNUYVMZZPBKTBKL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QHNUYVMZ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QHNUYVMZZPBKTBKLTVKWSGRUAS","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-23T14:32:45Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"0e945ea5c68f5f5267a095c81ee91946fdee4a09ddaac9008c71e58f6e4df294","abstract_canon_sha256":"2606028bc2547fec6563527921ebe91a6d5c4d5b04ed296db22e9432461c304f"},"schema_version":"1.0"},"canonical_sha256":"81db4c5599cbc2a9854b9d55691a34048870a89b7b162fef74fd62bd95f29561","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:40.077369Z","signature_b64":"X9g7vhnZw4R9qwUEBbgQ1Q4wzT/sTolC+6a2SyUxxSm6mrh5vC2OG8U2dPqhG7tv8P+AsZNprMWrnaN1rDWECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81db4c5599cbc2a9854b9d55691a34048870a89b7b162fef74fd62bd95f29561","last_reissued_at":"2026-05-18T00:06:40.076987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:40.076987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08470","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4i7hC+UcSaODl7RaHFRrrd1v00Mpj3VoX14tILv61vfDb4iZXobf08GINpNICzsnp08BbsRyxNEIJBMTdvypCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:26:31.245689Z"},"content_sha256":"9e8d58713d4a4521681f7ea140c1bee72bbf45cc648a3eac1d9112cf11eb37ec","schema_version":"1.0","event_id":"sha256:9e8d58713d4a4521681f7ea140c1bee72bbf45cc648a3eac1d9112cf11eb37ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QHNUYVMZZPBKTBKLTVKWSGRUAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automatic Heap Layout Manipulation for Exploitation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Daniel Kroening, Sean Heelan, Tom Melham","submitted_at":"2018-04-23T14:32:45Z","abstract_excerpt":"Heap layout manipulation is integral to exploiting heap-based memory corruption vulnerabilities. In this paper we present the first automatic approach to the problem, based on pseudo-random black-box search. Our approach searches for the inputs required to place the source of a heap-based buffer overflow or underflow next to heap-allocated objects that an exploit developer, or automatic exploit generation system, wishes to read or corrupt. We present a framework for benchmarking heap layout manipulation algorithms, and use it to evaluate our approach on several real-world allocators, showing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08470","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EH8aW6c/hTd0JOnRHcu0qcC2HNXLqgHEyGHuS9iOHiFw0f2SZU+PM2xGa2eeXWGRfRQcEfla/Bh5VnyqCdEjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:26:31.246025Z"},"content_sha256":"5433a1c9b468c592bb5a307071117a6c3370894ea3fc38bd34fc6a7f27889bc4","schema_version":"1.0","event_id":"sha256:5433a1c9b468c592bb5a307071117a6c3370894ea3fc38bd34fc6a7f27889bc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/bundle.json","state_url":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T01:26:31Z","links":{"resolver":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS","bundle":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/bundle.json","state":"https://pith.science/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHNUYVMZZPBKTBKLTVKWSGRUAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QHNUYVMZZPBKTBKLTVKWSGRUAS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2606028bc2547fec6563527921ebe91a6d5c4d5b04ed296db22e9432461c304f","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-23T14:32:45Z","title_canon_sha256":"0e945ea5c68f5f5267a095c81ee91946fdee4a09ddaac9008c71e58f6e4df294"},"schema_version":"1.0","source":{"id":"1804.08470","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08470","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08470v2","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08470","created_at":"2026-05-18T00:06:40Z"},{"alias_kind":"pith_short_12","alias_value":"QHNUYVMZZPBK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QHNUYVMZZPBKTBKL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QHNUYVMZ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:5433a1c9b468c592bb5a307071117a6c3370894ea3fc38bd34fc6a7f27889bc4","target":"graph","created_at":"2026-05-18T00:06:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Heap layout manipulation is integral to exploiting heap-based memory corruption vulnerabilities. In this paper we present the first automatic approach to the problem, based on pseudo-random black-box search. Our approach searches for the inputs required to place the source of a heap-based buffer overflow or underflow next to heap-allocated objects that an exploit developer, or automatic exploit generation system, wishes to read or corrupt. We present a framework for benchmarking heap layout manipulation algorithms, and use it to evaluate our approach on several real-world allocators, showing t","authors_text":"Daniel Kroening, Sean Heelan, Tom Melham","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-23T14:32:45Z","title":"Automatic Heap Layout Manipulation for Exploitation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08470","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9e8d58713d4a4521681f7ea140c1bee72bbf45cc648a3eac1d9112cf11eb37ec","target":"record","created_at":"2026-05-18T00:06:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2606028bc2547fec6563527921ebe91a6d5c4d5b04ed296db22e9432461c304f","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-23T14:32:45Z","title_canon_sha256":"0e945ea5c68f5f5267a095c81ee91946fdee4a09ddaac9008c71e58f6e4df294"},"schema_version":"1.0","source":{"id":"1804.08470","kind":"arxiv","version":2}},"canonical_sha256":"81db4c5599cbc2a9854b9d55691a34048870a89b7b162fef74fd62bd95f29561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81db4c5599cbc2a9854b9d55691a34048870a89b7b162fef74fd62bd95f29561","first_computed_at":"2026-05-18T00:06:40.076987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:40.076987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X9g7vhnZw4R9qwUEBbgQ1Q4wzT/sTolC+6a2SyUxxSm6mrh5vC2OG8U2dPqhG7tv8P+AsZNprMWrnaN1rDWECw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:40.077369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08470","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e8d58713d4a4521681f7ea140c1bee72bbf45cc648a3eac1d9112cf11eb37ec","sha256:5433a1c9b468c592bb5a307071117a6c3370894ea3fc38bd34fc6a7f27889bc4"],"state_sha256":"73c0683df98bd487a4253c6364d871fab519dc98075be1b11a21598f11e2c537"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kpv+xPYTugz+eHitwMVcTdvvaxh6rF1rBNXqPF4Zdva98e6AQPTgtqJSGzlR1EwmI8wWaLYkMHKnckHGbEEEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:26:31.247820Z","bundle_sha256":"8901797c96b33c4237c8f404f146c68513cc1e9aa1415df9d851c10e58c92d1f"}}