{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YMIIPRQUYH254HCFHBAS4ETQXW","short_pith_number":"pith:YMIIPRQU","canonical_record":{"source":{"id":"1502.08008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-27T18:55:16Z","cross_cats_sorted":[],"title_canon_sha256":"170dc2959120e3fbf53af3cf029ae3d0e66f87a9e09d57e2ada441d2720be351","abstract_canon_sha256":"c9cf33c1034fc45cdd972522e3ee1fc0097152d4d4187b575563fc12af0fdbe4"},"schema_version":"1.0"},"canonical_sha256":"c31087c614c1f5de1c4538412e1270bd81d89ee08b84de02d745fed29e7008a9","source":{"kind":"arxiv","id":"1502.08008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.08008","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"arxiv_version","alias_value":"1502.08008v1","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.08008","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"pith_short_12","alias_value":"YMIIPRQUYH25","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YMIIPRQUYH254HCF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YMIIPRQU","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YMIIPRQUYH254HCFHBAS4ETQXW","target":"record","payload":{"canonical_record":{"source":{"id":"1502.08008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-27T18:55:16Z","cross_cats_sorted":[],"title_canon_sha256":"170dc2959120e3fbf53af3cf029ae3d0e66f87a9e09d57e2ada441d2720be351","abstract_canon_sha256":"c9cf33c1034fc45cdd972522e3ee1fc0097152d4d4187b575563fc12af0fdbe4"},"schema_version":"1.0"},"canonical_sha256":"c31087c614c1f5de1c4538412e1270bd81d89ee08b84de02d745fed29e7008a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:26.197308Z","signature_b64":"SKvzKR77oo4gAforO0/QsE/FWwJWV8kf6C7xjXYpE9ZYIT03SjoCC/qdYzXjrTLwb0tkqOWw81WJVzoEiNy6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c31087c614c1f5de1c4538412e1270bd81d89ee08b84de02d745fed29e7008a9","last_reissued_at":"2026-05-18T00:56:26.196669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:26.196669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.08008","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-18T00:56:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xR1byhanmaEi+ouDO6+YPZ7RYq6jq2VxM4PI8azNK809bp+uH20+vh12EtSTeZbZWGIOmCgGowScEWE+IeKBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:50:56.399133Z"},"content_sha256":"a9e9c1c92594a7f7951ca95c25708d8038f4c383f23bd4629e2820fd49050a77","schema_version":"1.0","event_id":"sha256:a9e9c1c92594a7f7951ca95c25708d8038f4c383f23bd4629e2820fd49050a77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YMIIPRQUYH254HCFHBAS4ETQXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Lu\\'is Cruz-Filipe, Peter Schneider-Kamp","submitted_at":"2015-02-27T18:55:16Z","abstract_excerpt":"In recent work, we formalized the theory of optimal-size sorting networks with the goal of extracting a verified checker for the large-scale computer-generated proof that 25 comparisons are optimal when sorting 9 inputs, which required more than a decade of CPU time and produced 27 GB of proof witnesses. The checker uses an untrusted oracle based on these witnesses and is able to verify the smaller case of 8 inputs within a couple of days, but it did not scale to the full proof for 9 inputs. In this paper, we describe several non-trivial optimizations of the algorithm in the checker, obtained "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.08008","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-18T00:56:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKItIVNGpm8rM+KMdPteshiPWWYyHkrUACIlXgCLhMUczFHP+mbzPwtCnwtE3ERmtvyT+oJzzQKAx/L8D0OeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:50:56.399629Z"},"content_sha256":"805f49633bb1ed3ad8dff53b859d332df998ff4137ec8c0d4215416f12af4b8a","schema_version":"1.0","event_id":"sha256:805f49633bb1ed3ad8dff53b859d332df998ff4137ec8c0d4215416f12af4b8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMIIPRQUYH254HCFHBAS4ETQXW/bundle.json","state_url":"https://pith.science/pith/YMIIPRQUYH254HCFHBAS4ETQXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMIIPRQUYH254HCFHBAS4ETQXW/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-23T18:50:56Z","links":{"resolver":"https://pith.science/pith/YMIIPRQUYH254HCFHBAS4ETQXW","bundle":"https://pith.science/pith/YMIIPRQUYH254HCFHBAS4ETQXW/bundle.json","state":"https://pith.science/pith/YMIIPRQUYH254HCFHBAS4ETQXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMIIPRQUYH254HCFHBAS4ETQXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YMIIPRQUYH254HCFHBAS4ETQXW","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":"c9cf33c1034fc45cdd972522e3ee1fc0097152d4d4187b575563fc12af0fdbe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-27T18:55:16Z","title_canon_sha256":"170dc2959120e3fbf53af3cf029ae3d0e66f87a9e09d57e2ada441d2720be351"},"schema_version":"1.0","source":{"id":"1502.08008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.08008","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"arxiv_version","alias_value":"1502.08008v1","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.08008","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"pith_short_12","alias_value":"YMIIPRQUYH25","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YMIIPRQUYH254HCF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YMIIPRQU","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:805f49633bb1ed3ad8dff53b859d332df998ff4137ec8c0d4215416f12af4b8a","target":"graph","created_at":"2026-05-18T00:56:26Z","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 recent work, we formalized the theory of optimal-size sorting networks with the goal of extracting a verified checker for the large-scale computer-generated proof that 25 comparisons are optimal when sorting 9 inputs, which required more than a decade of CPU time and produced 27 GB of proof witnesses. The checker uses an untrusted oracle based on these witnesses and is able to verify the smaller case of 8 inputs within a couple of days, but it did not scale to the full proof for 9 inputs. In this paper, we describe several non-trivial optimizations of the algorithm in the checker, obtained ","authors_text":"Lu\\'is Cruz-Filipe, Peter Schneider-Kamp","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-27T18:55:16Z","title":"Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.08008","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:a9e9c1c92594a7f7951ca95c25708d8038f4c383f23bd4629e2820fd49050a77","target":"record","created_at":"2026-05-18T00:56:26Z","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":"c9cf33c1034fc45cdd972522e3ee1fc0097152d4d4187b575563fc12af0fdbe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-27T18:55:16Z","title_canon_sha256":"170dc2959120e3fbf53af3cf029ae3d0e66f87a9e09d57e2ada441d2720be351"},"schema_version":"1.0","source":{"id":"1502.08008","kind":"arxiv","version":1}},"canonical_sha256":"c31087c614c1f5de1c4538412e1270bd81d89ee08b84de02d745fed29e7008a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c31087c614c1f5de1c4538412e1270bd81d89ee08b84de02d745fed29e7008a9","first_computed_at":"2026-05-18T00:56:26.196669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:26.196669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SKvzKR77oo4gAforO0/QsE/FWwJWV8kf6C7xjXYpE9ZYIT03SjoCC/qdYzXjrTLwb0tkqOWw81WJVzoEiNy6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:26.197308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.08008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9e9c1c92594a7f7951ca95c25708d8038f4c383f23bd4629e2820fd49050a77","sha256:805f49633bb1ed3ad8dff53b859d332df998ff4137ec8c0d4215416f12af4b8a"],"state_sha256":"bfff8c57236a7a2131964ff4e1aec9b579ca5cc0a4cbf2c324d6331bd3e40df8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQLx2ZSzRVz1vhZ2QyGEKhJQwRKoUAZc7X0R1ROC66cU6hpLfniKIgOumxKeZl+MoNq56N+2NrdtzBsRUMpJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:50:56.402513Z","bundle_sha256":"8a3048d663fa7ce51e44e7128f567dfaada1ed96ca4f42b88b66d3f8bb89d9b4"}}