{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A6P3P2TS3UDORSX2VXYCJ6QKEB","short_pith_number":"pith:A6P3P2TS","canonical_record":{"source":{"id":"1806.09026","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-23T19:51:24Z","cross_cats_sorted":[],"title_canon_sha256":"0160266ed85452ed5df15ef466c764af3705317422a33f5b5a01f068e6ac760c","abstract_canon_sha256":"6d0ddad0b0c4253a1e77cf2920375aa0151eaf550e5564175155f12e8c417858"},"schema_version":"1.0"},"canonical_sha256":"079fb7ea72dd06e8cafaadf024fa0a20577dcc707b30b8ba0fcac0eb7c48661d","source":{"kind":"arxiv","id":"1806.09026","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09026","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09026v3","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09026","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"A6P3P2TS3UDO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A6P3P2TS3UDORSX2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A6P3P2TS","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A6P3P2TS3UDORSX2VXYCJ6QKEB","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09026","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-23T19:51:24Z","cross_cats_sorted":[],"title_canon_sha256":"0160266ed85452ed5df15ef466c764af3705317422a33f5b5a01f068e6ac760c","abstract_canon_sha256":"6d0ddad0b0c4253a1e77cf2920375aa0151eaf550e5564175155f12e8c417858"},"schema_version":"1.0"},"canonical_sha256":"079fb7ea72dd06e8cafaadf024fa0a20577dcc707b30b8ba0fcac0eb7c48661d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:08.443969Z","signature_b64":"oJI95SSlkjoVdcRL3VEFDdMslbPcvLCqrtDRJCiHkcOIg2rD8qA16qyuKP6xTq4sSDbMkw15ffWCth9rsBIEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079fb7ea72dd06e8cafaadf024fa0a20577dcc707b30b8ba0fcac0eb7c48661d","last_reissued_at":"2026-05-18T00:00:08.443359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:08.443359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09026","source_version":3,"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:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FyfqLrhAuvdEbRN5z/cPClBakkb+5fD/yy44h9FzUMh7yANL+dCdbE3Jjyf+b+RP980VUjX/ETZJKagisPe5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:50.873064Z"},"content_sha256":"8a75b32ff1efe60be124bd98e9db1cf7f8a19696bcee05b1703ec7e0b07d3f64","schema_version":"1.0","event_id":"sha256:8a75b32ff1efe60be124bd98e9db1cf7f8a19696bcee05b1703ec7e0b07d3f64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A6P3P2TS3UDORSX2VXYCJ6QKEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Context-aware Failure-oblivious Computing as a Means of Preventing Buffer Overflows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Daniel Pekarek, Hanspeter M\\\"ossenb\\\"ock, Manuel Rigger","submitted_at":"2018-06-23T19:51:24Z","abstract_excerpt":"In languages like C, buffer overflows are widespread. A common mitigation technique is to use tools that detect them during execution and abort the program to prevent the leakage of data or the diversion of control flow. However, for server applications, it would be desirable to prevent such errors while maintaining availability of the system. To this end, we present an approach to handle buffer overflows without aborting the program. This approach involves implementing a continuation logic in library functions based on an introspection function that allows querying the size of a buffer. We de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09026","kind":"arxiv","version":3},"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:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHpz1BxQF4nFfMLGWPYzWav+3OgCFg22b8aRh2pMJVpGg7YCDPkwhxJo0QqmOhgSSX118uedxYmjDuAM/QH9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:50.873700Z"},"content_sha256":"523ddfce9078f08a66335dd00c7f0fb4acbcb8b693d6f1fd1df66affd20e55c7","schema_version":"1.0","event_id":"sha256:523ddfce9078f08a66335dd00c7f0fb4acbcb8b693d6f1fd1df66affd20e55c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6P3P2TS3UDORSX2VXYCJ6QKEB/bundle.json","state_url":"https://pith.science/pith/A6P3P2TS3UDORSX2VXYCJ6QKEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6P3P2TS3UDORSX2VXYCJ6QKEB/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-25T04:13:50Z","links":{"resolver":"https://pith.science/pith/A6P3P2TS3UDORSX2VXYCJ6QKEB","bundle":"https://pith.science/pith/A6P3P2TS3UDORSX2VXYCJ6QKEB/bundle.json","state":"https://pith.science/pith/A6P3P2TS3UDORSX2VXYCJ6QKEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6P3P2TS3UDORSX2VXYCJ6QKEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A6P3P2TS3UDORSX2VXYCJ6QKEB","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":"6d0ddad0b0c4253a1e77cf2920375aa0151eaf550e5564175155f12e8c417858","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-23T19:51:24Z","title_canon_sha256":"0160266ed85452ed5df15ef466c764af3705317422a33f5b5a01f068e6ac760c"},"schema_version":"1.0","source":{"id":"1806.09026","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09026","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09026v3","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09026","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"A6P3P2TS3UDO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A6P3P2TS3UDORSX2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A6P3P2TS","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:523ddfce9078f08a66335dd00c7f0fb4acbcb8b693d6f1fd1df66affd20e55c7","target":"graph","created_at":"2026-05-18T00:00:08Z","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":"In languages like C, buffer overflows are widespread. A common mitigation technique is to use tools that detect them during execution and abort the program to prevent the leakage of data or the diversion of control flow. However, for server applications, it would be desirable to prevent such errors while maintaining availability of the system. To this end, we present an approach to handle buffer overflows without aborting the program. This approach involves implementing a continuation logic in library functions based on an introspection function that allows querying the size of a buffer. We de","authors_text":"Daniel Pekarek, Hanspeter M\\\"ossenb\\\"ock, Manuel Rigger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-23T19:51:24Z","title":"Context-aware Failure-oblivious Computing as a Means of Preventing Buffer Overflows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09026","kind":"arxiv","version":3},"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:8a75b32ff1efe60be124bd98e9db1cf7f8a19696bcee05b1703ec7e0b07d3f64","target":"record","created_at":"2026-05-18T00:00:08Z","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":"6d0ddad0b0c4253a1e77cf2920375aa0151eaf550e5564175155f12e8c417858","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-23T19:51:24Z","title_canon_sha256":"0160266ed85452ed5df15ef466c764af3705317422a33f5b5a01f068e6ac760c"},"schema_version":"1.0","source":{"id":"1806.09026","kind":"arxiv","version":3}},"canonical_sha256":"079fb7ea72dd06e8cafaadf024fa0a20577dcc707b30b8ba0fcac0eb7c48661d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"079fb7ea72dd06e8cafaadf024fa0a20577dcc707b30b8ba0fcac0eb7c48661d","first_computed_at":"2026-05-18T00:00:08.443359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:08.443359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oJI95SSlkjoVdcRL3VEFDdMslbPcvLCqrtDRJCiHkcOIg2rD8qA16qyuKP6xTq4sSDbMkw15ffWCth9rsBIEDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:08.443969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09026","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a75b32ff1efe60be124bd98e9db1cf7f8a19696bcee05b1703ec7e0b07d3f64","sha256:523ddfce9078f08a66335dd00c7f0fb4acbcb8b693d6f1fd1df66affd20e55c7"],"state_sha256":"25ce4b8798d04620e6867bc4a2a155fa09becd319cf5feacf9856746efeb6d88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jrq+rJfE84bOnUHXuGXIP+ydixB5xqFEqNI78TYedIfk/H1Rodzz0RR9HVGSFByayYNsRgFBZoxyLkid3gbRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:13:50.877298Z","bundle_sha256":"0b69d7118c968f3ac377d578f0693896d12036e3eda92a08debb4960f74bc6b1"}}