{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SXNWFKHEZG46YS6EJK4NCUIK5V","short_pith_number":"pith:SXNWFKHE","canonical_record":{"source":{"id":"1907.09700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-23T05:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"2e621095a344addc1438a9bb157f26e22beb8f6dc0eeab60c355eafacd5e726d","abstract_canon_sha256":"412ce44aed263722c1382d13e2358f3301205de2e8f384d4253a623d8f80b8e5"},"schema_version":"1.0"},"canonical_sha256":"95db62a8e4c9b9ec4bc44ab8d1510aed75adc76374375ef9065f110d9849b2aa","source":{"kind":"arxiv","id":"1907.09700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09700","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09700v1","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09700","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"SXNWFKHEZG46","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SXNWFKHEZG46YS6E","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SXNWFKHE","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SXNWFKHEZG46YS6EJK4NCUIK5V","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-23T05:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"2e621095a344addc1438a9bb157f26e22beb8f6dc0eeab60c355eafacd5e726d","abstract_canon_sha256":"412ce44aed263722c1382d13e2358f3301205de2e8f384d4253a623d8f80b8e5"},"schema_version":"1.0"},"canonical_sha256":"95db62a8e4c9b9ec4bc44ab8d1510aed75adc76374375ef9065f110d9849b2aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:50.362807Z","signature_b64":"wZ8nps04YZoX5uZ+9QbO3NxiTAdTAkSNIzUO16Xeetby5zSUbkCf6Uq2cQwW3azs7NSSLeptsOijuv0xxiWyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95db62a8e4c9b9ec4bc44ab8d1510aed75adc76374375ef9065f110d9849b2aa","last_reissued_at":"2026-05-17T23:39:50.362287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:50.362287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09700","source_version":1,"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-17T23:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxLl+j16WXu1a/LS+uJ0J0+19Wkvg3WWPTNxe1FbCI0tXEiqq03PWLLlGECfGXvB4pPftf+dokXxSwcQd35hDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:51:00.732935Z"},"content_sha256":"261506674514a944a63c326a154c485f3e0ed2fa73964ad77ee19c23be5131ad","schema_version":"1.0","event_id":"sha256:261506674514a944a63c326a154c485f3e0ed2fa73964ad77ee19c23be5131ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SXNWFKHEZG46YS6EJK4NCUIK5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhancing Dynamic Symbolic Execution by Automatically Learning Search Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Hakjoo Oh, Jingyoung Kim, Junhee Lee, Seongjoon Hong, Sooyoung Cha","submitted_at":"2019-07-23T05:33:35Z","abstract_excerpt":"We present a technique to automatically generate search heuristics for dynamic symbolic execution. A key challenge in dynamic symbolic execution is how to effectively explore the program's execution paths to achieve high code coverage in a limited time budget. Dynamic symbolic execution employs a search heuristic to address this challenge, which favors exploring particular types of paths that are most likely to maximize the final coverage. However, manually designing a good search heuristic is nontrivial and typically ends up with suboptimal and unstable outcomes. The goal of this paper is to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09700","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"},"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-17T23:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/PEAuKCAFavyQ1gBOa0XBMG/vrNpI7vdnYzGnV9Hii9ECZbnZm09wW/MgzAUOtVaNiiGxlZMe375mPz61AIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:51:00.733299Z"},"content_sha256":"40c2358af38d9efe784ed6a96f83389addb4cb2dd8233b0eedd0c5e83450a234","schema_version":"1.0","event_id":"sha256:40c2358af38d9efe784ed6a96f83389addb4cb2dd8233b0eedd0c5e83450a234"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXNWFKHEZG46YS6EJK4NCUIK5V/bundle.json","state_url":"https://pith.science/pith/SXNWFKHEZG46YS6EJK4NCUIK5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXNWFKHEZG46YS6EJK4NCUIK5V/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-04T20:51:00Z","links":{"resolver":"https://pith.science/pith/SXNWFKHEZG46YS6EJK4NCUIK5V","bundle":"https://pith.science/pith/SXNWFKHEZG46YS6EJK4NCUIK5V/bundle.json","state":"https://pith.science/pith/SXNWFKHEZG46YS6EJK4NCUIK5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXNWFKHEZG46YS6EJK4NCUIK5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SXNWFKHEZG46YS6EJK4NCUIK5V","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":"412ce44aed263722c1382d13e2358f3301205de2e8f384d4253a623d8f80b8e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-23T05:33:35Z","title_canon_sha256":"2e621095a344addc1438a9bb157f26e22beb8f6dc0eeab60c355eafacd5e726d"},"schema_version":"1.0","source":{"id":"1907.09700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09700","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09700v1","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09700","created_at":"2026-05-17T23:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"SXNWFKHEZG46","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SXNWFKHEZG46YS6E","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SXNWFKHE","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:40c2358af38d9efe784ed6a96f83389addb4cb2dd8233b0eedd0c5e83450a234","target":"graph","created_at":"2026-05-17T23:39:50Z","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":"We present a technique to automatically generate search heuristics for dynamic symbolic execution. A key challenge in dynamic symbolic execution is how to effectively explore the program's execution paths to achieve high code coverage in a limited time budget. Dynamic symbolic execution employs a search heuristic to address this challenge, which favors exploring particular types of paths that are most likely to maximize the final coverage. However, manually designing a good search heuristic is nontrivial and typically ends up with suboptimal and unstable outcomes. The goal of this paper is to ","authors_text":"Hakjoo Oh, Jingyoung Kim, Junhee Lee, Seongjoon Hong, Sooyoung Cha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-23T05:33:35Z","title":"Enhancing Dynamic Symbolic Execution by Automatically Learning Search Heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09700","kind":"arxiv","version":1},"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:261506674514a944a63c326a154c485f3e0ed2fa73964ad77ee19c23be5131ad","target":"record","created_at":"2026-05-17T23:39:50Z","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":"412ce44aed263722c1382d13e2358f3301205de2e8f384d4253a623d8f80b8e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-23T05:33:35Z","title_canon_sha256":"2e621095a344addc1438a9bb157f26e22beb8f6dc0eeab60c355eafacd5e726d"},"schema_version":"1.0","source":{"id":"1907.09700","kind":"arxiv","version":1}},"canonical_sha256":"95db62a8e4c9b9ec4bc44ab8d1510aed75adc76374375ef9065f110d9849b2aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95db62a8e4c9b9ec4bc44ab8d1510aed75adc76374375ef9065f110d9849b2aa","first_computed_at":"2026-05-17T23:39:50.362287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:50.362287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wZ8nps04YZoX5uZ+9QbO3NxiTAdTAkSNIzUO16Xeetby5zSUbkCf6Uq2cQwW3azs7NSSLeptsOijuv0xxiWyCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:50.362807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:261506674514a944a63c326a154c485f3e0ed2fa73964ad77ee19c23be5131ad","sha256:40c2358af38d9efe784ed6a96f83389addb4cb2dd8233b0eedd0c5e83450a234"],"state_sha256":"c3051ef4a4b6c898d8e6365a92e468972636d3350d16252b99ccb18d938da21d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFBoYwlWP5aM/AkLbnkHQQ4YNFVyQq9vn0zYp30tZesYWWnmv4VI8X31g57bUpuFaYEA++bjnBJMnGIwZSt0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:51:00.735852Z","bundle_sha256":"d5ca5a775c8ca67f6597c8e2bcf8f4eae71abe563c0ed8f038ad71e1f9b240d7"}}