{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YYK5SOCQAKUVTKQLMQO2J3OKZH","short_pith_number":"pith:YYK5SOCQ","canonical_record":{"source":{"id":"1301.7462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-30T23:02:36Z","cross_cats_sorted":["cs.DS","cs.FL"],"title_canon_sha256":"00c874838593abe84c7ec3b7c67c18ea800d20f1f35f715b6c032012eefad2fc","abstract_canon_sha256":"c49a3e925508833b67b9100866625b17f4b8988378024889a249dab6ab28bf07"},"schema_version":"1.0"},"canonical_sha256":"c615d9385002a959aa0b641da4edcac9cbe12647dc0fd0b9fdd13182c444b4e5","source":{"kind":"arxiv","id":"1301.7462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7462","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7462v1","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7462","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"YYK5SOCQAKUV","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YYK5SOCQAKUVTKQL","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YYK5SOCQ","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YYK5SOCQAKUVTKQLMQO2J3OKZH","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-30T23:02:36Z","cross_cats_sorted":["cs.DS","cs.FL"],"title_canon_sha256":"00c874838593abe84c7ec3b7c67c18ea800d20f1f35f715b6c032012eefad2fc","abstract_canon_sha256":"c49a3e925508833b67b9100866625b17f4b8988378024889a249dab6ab28bf07"},"schema_version":"1.0"},"canonical_sha256":"c615d9385002a959aa0b641da4edcac9cbe12647dc0fd0b9fdd13182c444b4e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:49.451158Z","signature_b64":"HYrGFo4CF3U5CPWkYnaUiNBlPL7uvcRv7u77CuqsLCZecq40aVtaQbqrhpbsMgXs7EmQtD43kB9ImNAgqu/eAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c615d9385002a959aa0b641da4edcac9cbe12647dc0fd0b9fdd13182c444b4e5","last_reissued_at":"2026-05-18T03:34:49.450732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:49.450732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7462","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-18T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHC7zIlzAi9xQQ4yUt0tt2b1uMfohK4XXwCIpNHJbSBBFIh2fYjQSc0xbHiedxv+ehq+sQ7MmcIhtaQ40GBXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:25:17.288596Z"},"content_sha256":"3ae0c33f7a81a5928d3a1760c5e082fc7f8d85d38418143db007f576d7817c6f","schema_version":"1.0","event_id":"sha256:3ae0c33f7a81a5928d3a1760c5e082fc7f8d85d38418143db007f576d7817c6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YYK5SOCQAKUVTKQLMQO2J3OKZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for the Verification of Certifying Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.FL"],"primary_cat":"cs.LO","authors_text":"Christine Rizkallah, Eyad Alkassar, Kurt Mehlhorn, Sascha B\\\"ohme","submitted_at":"2013-01-30T23:02:36Z","abstract_excerpt":"Formal verification of complex algorithms is challenging. Verifying their implementations goes beyond the state of the art of current automatic verification tools and usually involves intricate mathematical theorems. Certifying algorithms compute in addition to each output a witness certifying that the output is correct. A checker for such a witness is usually much simpler than the original algorithm - yet it is all the user has to trust. The verification of checkers is feasible with current tools and leads to computations that can be completely trusted. We describe a framework to seamlessly v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7462","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-18T03:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+kLdyte3R5arz46z+Iz/ryoN9GUk/EtdEiBQVOjvk7VnzwB0UE4NcElhn/GKY5dDfzpfKOKf6nV2BiVWvhqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:25:17.288947Z"},"content_sha256":"4d73bead50a35bb9aeeb8f19de44fa9cefc664388d0cc13942456ca7674d63a5","schema_version":"1.0","event_id":"sha256:4d73bead50a35bb9aeeb8f19de44fa9cefc664388d0cc13942456ca7674d63a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYK5SOCQAKUVTKQLMQO2J3OKZH/bundle.json","state_url":"https://pith.science/pith/YYK5SOCQAKUVTKQLMQO2J3OKZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYK5SOCQAKUVTKQLMQO2J3OKZH/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-04T09:25:17Z","links":{"resolver":"https://pith.science/pith/YYK5SOCQAKUVTKQLMQO2J3OKZH","bundle":"https://pith.science/pith/YYK5SOCQAKUVTKQLMQO2J3OKZH/bundle.json","state":"https://pith.science/pith/YYK5SOCQAKUVTKQLMQO2J3OKZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYK5SOCQAKUVTKQLMQO2J3OKZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YYK5SOCQAKUVTKQLMQO2J3OKZH","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":"c49a3e925508833b67b9100866625b17f4b8988378024889a249dab6ab28bf07","cross_cats_sorted":["cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-30T23:02:36Z","title_canon_sha256":"00c874838593abe84c7ec3b7c67c18ea800d20f1f35f715b6c032012eefad2fc"},"schema_version":"1.0","source":{"id":"1301.7462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7462","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7462v1","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7462","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"YYK5SOCQAKUV","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YYK5SOCQAKUVTKQL","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YYK5SOCQ","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:4d73bead50a35bb9aeeb8f19de44fa9cefc664388d0cc13942456ca7674d63a5","target":"graph","created_at":"2026-05-18T03:34:49Z","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":"Formal verification of complex algorithms is challenging. Verifying their implementations goes beyond the state of the art of current automatic verification tools and usually involves intricate mathematical theorems. Certifying algorithms compute in addition to each output a witness certifying that the output is correct. A checker for such a witness is usually much simpler than the original algorithm - yet it is all the user has to trust. The verification of checkers is feasible with current tools and leads to computations that can be completely trusted. We describe a framework to seamlessly v","authors_text":"Christine Rizkallah, Eyad Alkassar, Kurt Mehlhorn, Sascha B\\\"ohme","cross_cats":["cs.DS","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-30T23:02:36Z","title":"A Framework for the Verification of Certifying Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7462","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:3ae0c33f7a81a5928d3a1760c5e082fc7f8d85d38418143db007f576d7817c6f","target":"record","created_at":"2026-05-18T03:34:49Z","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":"c49a3e925508833b67b9100866625b17f4b8988378024889a249dab6ab28bf07","cross_cats_sorted":["cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-01-30T23:02:36Z","title_canon_sha256":"00c874838593abe84c7ec3b7c67c18ea800d20f1f35f715b6c032012eefad2fc"},"schema_version":"1.0","source":{"id":"1301.7462","kind":"arxiv","version":1}},"canonical_sha256":"c615d9385002a959aa0b641da4edcac9cbe12647dc0fd0b9fdd13182c444b4e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c615d9385002a959aa0b641da4edcac9cbe12647dc0fd0b9fdd13182c444b4e5","first_computed_at":"2026-05-18T03:34:49.450732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:49.450732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HYrGFo4CF3U5CPWkYnaUiNBlPL7uvcRv7u77CuqsLCZecq40aVtaQbqrhpbsMgXs7EmQtD43kB9ImNAgqu/eAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:49.451158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ae0c33f7a81a5928d3a1760c5e082fc7f8d85d38418143db007f576d7817c6f","sha256:4d73bead50a35bb9aeeb8f19de44fa9cefc664388d0cc13942456ca7674d63a5"],"state_sha256":"c551e8d78a8a020da3a1bca4581e2a72499255acdb455382a1a1f3855881f444"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BPRuJW1Lj8CHJRw7IjwZi9+AtK2C3atgPWEkHk/Ec05xhVe+YDGCEI+CD//CvK48cnpH6T9HNjDIKXRyxwtGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:25:17.290896Z","bundle_sha256":"886cacb534f5755dda7e742909a943e52e90533c5cf73562da0ed9d089a5086b"}}