{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3KX6IXI3DHF35TTLZRQQUCJOBT","short_pith_number":"pith:3KX6IXI3","schema_version":"1.0","canonical_sha256":"daafe45d1b19cbbece6bcc610a092e0ceff4ba6e857759970ce3ea3425300181","source":{"kind":"arxiv","id":"1806.04355","version":1},"attestation_state":"computed","paper":{"title":"SoK: Sanitizing for Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Dokyung Song, Julian Lettner, Michael Franz, Per Larsen, Prabhu Rajasekaran, Stijn Volckaert, Yeoul Na","submitted_at":"2018-06-12T06:36:30Z","abstract_excerpt":"The C and C++ programming languages are notoriously insecure yet remain indispensable. Developers therefore resort to a multi-pronged approach to find security issues before adversaries. These include manual, static, and dynamic program analysis. Dynamic bug finding tools --- henceforth \"sanitizers\" --- can find bugs that elude other types of analysis because they observe the actual execution of a program, and can therefore directly observe incorrect program behavior as it happens.\n  A vast number of sanitizers have been prototyped by academics and refined by practitioners. We provide a system"},"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":"1806.04355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-12T06:36:30Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"a39e28631e69719b8b5adc5567da3fce89dd4913c7ca7ffbaa2a60235d28ff01","abstract_canon_sha256":"af28435622ee7b094f8772d625a769aba9dd201dd88088b98271735e1f1946a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.796949Z","signature_b64":"S+hjo12+G/GK3olOR/Lff4Asmtxogzu7BCMkVNPHG4+SAgRE6Fwp6LQRvuj996xqTZegeo76G5rITCUomJE+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daafe45d1b19cbbece6bcc610a092e0ceff4ba6e857759970ce3ea3425300181","last_reissued_at":"2026-05-18T00:13:35.796346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.796346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SoK: Sanitizing for Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Dokyung Song, Julian Lettner, Michael Franz, Per Larsen, Prabhu Rajasekaran, Stijn Volckaert, Yeoul Na","submitted_at":"2018-06-12T06:36:30Z","abstract_excerpt":"The C and C++ programming languages are notoriously insecure yet remain indispensable. Developers therefore resort to a multi-pronged approach to find security issues before adversaries. These include manual, static, and dynamic program analysis. Dynamic bug finding tools --- henceforth \"sanitizers\" --- can find bugs that elude other types of analysis because they observe the actual execution of a program, and can therefore directly observe incorrect program behavior as it happens.\n  A vast number of sanitizers have been prototyped by academics and refined by practitioners. We provide a system"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04355","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":"1806.04355","created_at":"2026-05-18T00:13:35.796439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04355v1","created_at":"2026-05-18T00:13:35.796439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04355","created_at":"2026-05-18T00:13:35.796439+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KX6IXI3DHF3","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KX6IXI3DHF35TTL","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KX6IXI3","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04241","citing_title":"CHOP: Bypassing Runtime Bounds Checking Through Convex Hull OPtimization","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3KX6IXI3DHF35TTLZRQQUCJOBT","json":"https://pith.science/pith/3KX6IXI3DHF35TTLZRQQUCJOBT.json","graph_json":"https://pith.science/api/pith-number/3KX6IXI3DHF35TTLZRQQUCJOBT/graph.json","events_json":"https://pith.science/api/pith-number/3KX6IXI3DHF35TTLZRQQUCJOBT/events.json","paper":"https://pith.science/paper/3KX6IXI3"},"agent_actions":{"view_html":"https://pith.science/pith/3KX6IXI3DHF35TTLZRQQUCJOBT","download_json":"https://pith.science/pith/3KX6IXI3DHF35TTLZRQQUCJOBT.json","view_paper":"https://pith.science/paper/3KX6IXI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04355&json=true","fetch_graph":"https://pith.science/api/pith-number/3KX6IXI3DHF35TTLZRQQUCJOBT/graph.json","fetch_events":"https://pith.science/api/pith-number/3KX6IXI3DHF35TTLZRQQUCJOBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KX6IXI3DHF35TTLZRQQUCJOBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KX6IXI3DHF35TTLZRQQUCJOBT/action/storage_attestation","attest_author":"https://pith.science/pith/3KX6IXI3DHF35TTLZRQQUCJOBT/action/author_attestation","sign_citation":"https://pith.science/pith/3KX6IXI3DHF35TTLZRQQUCJOBT/action/citation_signature","submit_replication":"https://pith.science/pith/3KX6IXI3DHF35TTLZRQQUCJOBT/action/replication_record"}},"created_at":"2026-05-18T00:13:35.796439+00:00","updated_at":"2026-05-18T00:13:35.796439+00:00"}