{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3Q4BLHTEIOKGLST4N6NNAZWV2W","short_pith_number":"pith:3Q4BLHTE","canonical_record":{"source":{"id":"1907.04241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2019-07-08T15:09:03Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"e3469ee92295730ac415f1e803471aca84f161a974ef1bbb18618c3de14d07a8","abstract_canon_sha256":"ae62b47d79e6c9576c17b2083280ffb45696c2946b1f04bf5beaa1264aa83e00"},"schema_version":"1.0"},"canonical_sha256":"dc38159e64439465ca7c6f9ad066d5d59d8a68020b9a5ce771fb9fe58f924583","source":{"kind":"arxiv","id":"1907.04241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04241","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04241v1","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04241","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"3Q4BLHTEIOKG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3Q4BLHTEIOKGLST4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3Q4BLHTE","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3Q4BLHTEIOKGLST4N6NNAZWV2W","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2019-07-08T15:09:03Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"e3469ee92295730ac415f1e803471aca84f161a974ef1bbb18618c3de14d07a8","abstract_canon_sha256":"ae62b47d79e6c9576c17b2083280ffb45696c2946b1f04bf5beaa1264aa83e00"},"schema_version":"1.0"},"canonical_sha256":"dc38159e64439465ca7c6f9ad066d5d59d8a68020b9a5ce771fb9fe58f924583","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:02.918219Z","signature_b64":"4iK+Au6SqX+aYB8mMnZOy5WiR6B4Rp9Xxdc4recEuXC+5JFulex1QU4dCZQDJwzes+fS1QXs+kt9+NLAR3FYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc38159e64439465ca7c6f9ad066d5d59d8a68020b9a5ce771fb9fe58f924583","last_reissued_at":"2026-05-17T23:41:02.917574Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:02.917574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04241","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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Y+FB+hz1k5wta1v1gm143Jlt3MzAzOycBxkoDHAa1nYvs2JRlQFZjezpx3bOp7zi0XKf+k+N56FI49IKI1LCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:58:26.763860Z"},"content_sha256":"b74dc708dd285d9a5760ebbcac10883912f2dbb6b9e461a89dd4825d27eb7207","schema_version":"1.0","event_id":"sha256:b74dc708dd285d9a5760ebbcac10883912f2dbb6b9e461a89dd4825d27eb7207"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3Q4BLHTEIOKGLST4N6NNAZWV2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CHOP: Bypassing Runtime Bounds Checking Through Convex Hull OPtimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.PL","authors_text":"Guru Venkataramani, Hongfa Xue, Tian Lan, Yurong Chen","submitted_at":"2019-07-08T15:09:03Z","abstract_excerpt":"Unsafe memory accesses in programs written using popular programming languages like C/C++ have been among the leading causes for software vulnerability. Prior memory safety checkers such as SoftBound enforce memory spatial safety by checking if every access to array elements are within the corresponding array bounds. However, it often results in high execution time overhead due to the cost of executing the instructions associated with bounds checking. To mitigate this problem, redundant bounds check elimination techniques are needed. In this paper, we propose CHOP, a Convex Hull OPtimization b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04241","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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRpBi9K2DJR9pgaLnaAyWztoV5En7EumQ4Jw0cF2qgnMbfJvsTR18YE7lpSQBGKaXs7StnSCQJGzCO/pnkynAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:58:26.764556Z"},"content_sha256":"89c2edc25024b0974ab619dfbd98e0b93f7c2db90c5328c84b048d572aff3d90","schema_version":"1.0","event_id":"sha256:89c2edc25024b0974ab619dfbd98e0b93f7c2db90c5328c84b048d572aff3d90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3Q4BLHTEIOKGLST4N6NNAZWV2W/bundle.json","state_url":"https://pith.science/pith/3Q4BLHTEIOKGLST4N6NNAZWV2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3Q4BLHTEIOKGLST4N6NNAZWV2W/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-25T11:58:26Z","links":{"resolver":"https://pith.science/pith/3Q4BLHTEIOKGLST4N6NNAZWV2W","bundle":"https://pith.science/pith/3Q4BLHTEIOKGLST4N6NNAZWV2W/bundle.json","state":"https://pith.science/pith/3Q4BLHTEIOKGLST4N6NNAZWV2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3Q4BLHTEIOKGLST4N6NNAZWV2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3Q4BLHTEIOKGLST4N6NNAZWV2W","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":"ae62b47d79e6c9576c17b2083280ffb45696c2946b1f04bf5beaa1264aa83e00","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2019-07-08T15:09:03Z","title_canon_sha256":"e3469ee92295730ac415f1e803471aca84f161a974ef1bbb18618c3de14d07a8"},"schema_version":"1.0","source":{"id":"1907.04241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04241","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04241v1","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04241","created_at":"2026-05-17T23:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"3Q4BLHTEIOKG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3Q4BLHTEIOKGLST4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3Q4BLHTE","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:89c2edc25024b0974ab619dfbd98e0b93f7c2db90c5328c84b048d572aff3d90","target":"graph","created_at":"2026-05-17T23:41:02Z","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":"Unsafe memory accesses in programs written using popular programming languages like C/C++ have been among the leading causes for software vulnerability. Prior memory safety checkers such as SoftBound enforce memory spatial safety by checking if every access to array elements are within the corresponding array bounds. However, it often results in high execution time overhead due to the cost of executing the instructions associated with bounds checking. To mitigate this problem, redundant bounds check elimination techniques are needed. In this paper, we propose CHOP, a Convex Hull OPtimization b","authors_text":"Guru Venkataramani, Hongfa Xue, Tian Lan, Yurong Chen","cross_cats":["cs.PF"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2019-07-08T15:09:03Z","title":"CHOP: Bypassing Runtime Bounds Checking Through Convex Hull OPtimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04241","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:b74dc708dd285d9a5760ebbcac10883912f2dbb6b9e461a89dd4825d27eb7207","target":"record","created_at":"2026-05-17T23:41:02Z","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":"ae62b47d79e6c9576c17b2083280ffb45696c2946b1f04bf5beaa1264aa83e00","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.PL","submitted_at":"2019-07-08T15:09:03Z","title_canon_sha256":"e3469ee92295730ac415f1e803471aca84f161a974ef1bbb18618c3de14d07a8"},"schema_version":"1.0","source":{"id":"1907.04241","kind":"arxiv","version":1}},"canonical_sha256":"dc38159e64439465ca7c6f9ad066d5d59d8a68020b9a5ce771fb9fe58f924583","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc38159e64439465ca7c6f9ad066d5d59d8a68020b9a5ce771fb9fe58f924583","first_computed_at":"2026-05-17T23:41:02.917574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:02.917574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4iK+Au6SqX+aYB8mMnZOy5WiR6B4Rp9Xxdc4recEuXC+5JFulex1QU4dCZQDJwzes+fS1QXs+kt9+NLAR3FYAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:02.918219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b74dc708dd285d9a5760ebbcac10883912f2dbb6b9e461a89dd4825d27eb7207","sha256:89c2edc25024b0974ab619dfbd98e0b93f7c2db90c5328c84b048d572aff3d90"],"state_sha256":"a5c406b8692e8cfae35b8d47a63823d0c9832d39ea50cefe671629c0111c4f9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2emoN+zzicYfIfjG+lyBhJ301MOqCsQwgqMYsLgReRLLFtO5MVMlvM/PNo5TQ4vwOxYBgRO8sDAOIXzzFw9CAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:58:26.768105Z","bundle_sha256":"17b3d000ab99b3c079afc469664192995153cc33f557b36cbd8a934bae5cebf4"}}