{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EKA3ZNHDCEIH5HCINYRCX4BGHN","short_pith_number":"pith:EKA3ZNHD","canonical_record":{"source":{"id":"1905.09532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-23T08:34:23Z","cross_cats_sorted":[],"title_canon_sha256":"1053e3ea0c69fb7626e4d803c869eaccf9571bded592e62624e7d4b4a0df691f","abstract_canon_sha256":"d7fb8121bda3a69518ca9453e1a0b8dfe8eda96bf05f6ad825823aae6ebc78e2"},"schema_version":"1.0"},"canonical_sha256":"2281bcb4e311107e9c486e222bf0263b432bda781db5c19aa1a3035f9b247a35","source":{"kind":"arxiv","id":"1905.09532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09532","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09532v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09532","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"EKA3ZNHDCEIH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EKA3ZNHDCEIH5HCI","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EKA3ZNHD","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EKA3ZNHDCEIH5HCINYRCX4BGHN","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-23T08:34:23Z","cross_cats_sorted":[],"title_canon_sha256":"1053e3ea0c69fb7626e4d803c869eaccf9571bded592e62624e7d4b4a0df691f","abstract_canon_sha256":"d7fb8121bda3a69518ca9453e1a0b8dfe8eda96bf05f6ad825823aae6ebc78e2"},"schema_version":"1.0"},"canonical_sha256":"2281bcb4e311107e9c486e222bf0263b432bda781db5c19aa1a3035f9b247a35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:16.815227Z","signature_b64":"rbuZJu0/VBDju5qJLBtdxy3p16HK8859LBmgsk2O/grb/cEfuYsnCdVjQ9mW8rzwhMwsukI+V+xHb0dZE/R/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2281bcb4e311107e9c486e222bf0263b432bda781db5c19aa1a3035f9b247a35","last_reissued_at":"2026-05-17T23:45:16.814559Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:16.814559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09532","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:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gz5uJcJ/pW5uefZihtgUlA5EvWlt34ZLH7YKrJMFd3MD2tpvUQXoUu6yzo8tHcIELUPGO+48v2WMOdpWf9jMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:54:20.055789Z"},"content_sha256":"7734977bfc86bf964d25d3cb72fb0c9dfabf1ddcd4ae589af03d30163b75249e","schema_version":"1.0","event_id":"sha256:7734977bfc86bf964d25d3cb72fb0c9dfabf1ddcd4ae589af03d30163b75249e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EKA3ZNHDCEIH5HCINYRCX4BGHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SynFuzz: Efficient Concolic Execution via Branch Condition Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Byoungyoung Lee, Chengyu Song, Insik Shin, Md Lutfor Rahman, Wookhyun Han, Yuxuan Chen","submitted_at":"2019-05-23T08:34:23Z","abstract_excerpt":"Concolic execution is a powerful program analysis technique for exploring execution paths in a systematic manner. Compare to random-mutation-based fuzzing, concolic execution is especially good at exploring paths that are guarded by complex and tight branch predicates (e.g., (a*b) == 0xdeadbeef). The drawback, however, is that concolic execution engines are much slower than native execution. One major source of the slowness is that concolic execution engines have to the interpret instructions to maintain the symbolic expression of program variables. In this work, we propose SynFuzz, a novel ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09532","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:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ej1UAqzDSAkVN+8NLMfKjbEVtnFRwK7ltO6YfYpu/FppJVZd0RpjCyQANE86SSOWJTpDiATL5EY/4YwmQnklAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:54:20.056450Z"},"content_sha256":"f17abe4b9e8c8dfa398178384acefeefa5bc05764683db4c1046448ebb3a514a","schema_version":"1.0","event_id":"sha256:f17abe4b9e8c8dfa398178384acefeefa5bc05764683db4c1046448ebb3a514a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKA3ZNHDCEIH5HCINYRCX4BGHN/bundle.json","state_url":"https://pith.science/pith/EKA3ZNHDCEIH5HCINYRCX4BGHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKA3ZNHDCEIH5HCINYRCX4BGHN/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-05-26T07:54:20Z","links":{"resolver":"https://pith.science/pith/EKA3ZNHDCEIH5HCINYRCX4BGHN","bundle":"https://pith.science/pith/EKA3ZNHDCEIH5HCINYRCX4BGHN/bundle.json","state":"https://pith.science/pith/EKA3ZNHDCEIH5HCINYRCX4BGHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKA3ZNHDCEIH5HCINYRCX4BGHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EKA3ZNHDCEIH5HCINYRCX4BGHN","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":"d7fb8121bda3a69518ca9453e1a0b8dfe8eda96bf05f6ad825823aae6ebc78e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-23T08:34:23Z","title_canon_sha256":"1053e3ea0c69fb7626e4d803c869eaccf9571bded592e62624e7d4b4a0df691f"},"schema_version":"1.0","source":{"id":"1905.09532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09532","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09532v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09532","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"EKA3ZNHDCEIH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EKA3ZNHDCEIH5HCI","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EKA3ZNHD","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:f17abe4b9e8c8dfa398178384acefeefa5bc05764683db4c1046448ebb3a514a","target":"graph","created_at":"2026-05-17T23:45:16Z","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":"Concolic execution is a powerful program analysis technique for exploring execution paths in a systematic manner. Compare to random-mutation-based fuzzing, concolic execution is especially good at exploring paths that are guarded by complex and tight branch predicates (e.g., (a*b) == 0xdeadbeef). The drawback, however, is that concolic execution engines are much slower than native execution. One major source of the slowness is that concolic execution engines have to the interpret instructions to maintain the symbolic expression of program variables. In this work, we propose SynFuzz, a novel ap","authors_text":"Byoungyoung Lee, Chengyu Song, Insik Shin, Md Lutfor Rahman, Wookhyun Han, Yuxuan Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-23T08:34:23Z","title":"SynFuzz: Efficient Concolic Execution via Branch Condition Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09532","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:7734977bfc86bf964d25d3cb72fb0c9dfabf1ddcd4ae589af03d30163b75249e","target":"record","created_at":"2026-05-17T23:45:16Z","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":"d7fb8121bda3a69518ca9453e1a0b8dfe8eda96bf05f6ad825823aae6ebc78e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-23T08:34:23Z","title_canon_sha256":"1053e3ea0c69fb7626e4d803c869eaccf9571bded592e62624e7d4b4a0df691f"},"schema_version":"1.0","source":{"id":"1905.09532","kind":"arxiv","version":1}},"canonical_sha256":"2281bcb4e311107e9c486e222bf0263b432bda781db5c19aa1a3035f9b247a35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2281bcb4e311107e9c486e222bf0263b432bda781db5c19aa1a3035f9b247a35","first_computed_at":"2026-05-17T23:45:16.814559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:16.814559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rbuZJu0/VBDju5qJLBtdxy3p16HK8859LBmgsk2O/grb/cEfuYsnCdVjQ9mW8rzwhMwsukI+V+xHb0dZE/R/BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:16.815227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7734977bfc86bf964d25d3cb72fb0c9dfabf1ddcd4ae589af03d30163b75249e","sha256:f17abe4b9e8c8dfa398178384acefeefa5bc05764683db4c1046448ebb3a514a"],"state_sha256":"914353768b5d462e06423f8a5d9832bf91a361efd0f754a1f12520d75b018394"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H58TUlxQYn3iBL0Qy9RRi8s1zJ9lMMAYg5kmppDL0wUXhKyaTn8gW8eKBkaoSUqM8UDSPG5km+G7bbJFhpe4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:54:20.059968Z","bundle_sha256":"0ca645ddab3a4d8309fa3b0e400b726386a85f96e7125718e77c1f0be073090f"}}