{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:R6WGI3OHLLMA6GZSPVTPVHG5UV","short_pith_number":"pith:R6WGI3OH","canonical_record":{"source":{"id":"2211.02257","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-04T04:18:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2b997daf6db06538390d2cd875c0564f834c20a155bd14f74be5622d2bd11b26","abstract_canon_sha256":"aecb78dc0c878d2ab0cb8480f8e7d1aaf5e3d37916cd0fab003566f287c4177f"},"schema_version":"1.0"},"canonical_sha256":"8fac646dc75ad80f1b327d66fa9cdda55b9d04300a0868a7fb4e955d352f9af4","source":{"kind":"arxiv","id":"2211.02257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02257","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02257v1","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02257","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"R6WGI3OHLLMA","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"R6WGI3OHLLMA6GZS","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"R6WGI3OH","created_at":"2026-07-05T05:13:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:R6WGI3OHLLMA6GZSPVTPVHG5UV","target":"record","payload":{"canonical_record":{"source":{"id":"2211.02257","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-04T04:18:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2b997daf6db06538390d2cd875c0564f834c20a155bd14f74be5622d2bd11b26","abstract_canon_sha256":"aecb78dc0c878d2ab0cb8480f8e7d1aaf5e3d37916cd0fab003566f287c4177f"},"schema_version":"1.0"},"canonical_sha256":"8fac646dc75ad80f1b327d66fa9cdda55b9d04300a0868a7fb4e955d352f9af4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:13.376085Z","signature_b64":"nrFw3GtzoOxpI+pEXO5D8W6qjp1InxSpi/SHNb0xQ91Jk8sqCgbXUKvMBSoXKX7Sc+IjVAeZow8h/lQwMGBfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fac646dc75ad80f1b327d66fa9cdda55b9d04300a0868a7fb4e955d352f9af4","last_reissued_at":"2026-07-05T05:13:13.375707Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:13.375707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.02257","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-07-05T05:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXvK5H3fGmK87EqTb9rH8XIuQK4S0i6eSgMhuXcBSY2CZB/BAK+gHKrei1ShF63904s6R/s0m/b67qhqexW/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:54:25.934675Z"},"content_sha256":"7ae31b532412fbf00ae7138e73e1dfaa3cf9d4e5f7e43b652e7aeb59db8f8d43","schema_version":"1.0","event_id":"sha256:7ae31b532412fbf00ae7138e73e1dfaa3cf9d4e5f7e43b652e7aeb59db8f8d43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:R6WGI3OHLLMA6GZSPVTPVHG5UV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certification with an NP Oracle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Caleb Koch, Carmen Strassle, Guy Blanc, Jane Lange, Li-Yang Tan","submitted_at":"2022-11-04T04:18:30Z","abstract_excerpt":"In the certification problem, the algorithm is given a function $f$ with certificate complexity $k$ and an input $x^\\star$, and the goal is to find a certificate of size $\\le \\text{poly}(k)$ for $f$'s value at $x^\\star$. This problem is in $\\mathsf{NP}^{\\mathsf{NP}}$, and assuming $\\mathsf{P} \\ne \\mathsf{NP}$, is not in $\\mathsf{P}$. Prior works, dating back to Valiant in 1984, have therefore sought to design efficient algorithms by imposing assumptions on $f$ such as monotonicity.\n  Our first result is a $\\mathsf{BPP}^{\\mathsf{NP}}$ algorithm for the general problem. The key ingredient is a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02257","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.02257/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZCz1n/Mmiwt07nsghObbzzxCzgttt1gy3t77bQ4PTa16ZRwTjjQYVLQDun2/sjmkGMf0whN7xaE/FfWXg1wBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:54:25.935358Z"},"content_sha256":"7dad1d39a3fdbce30c535e59abdfdf3a8b63e509649b1ca829dbc9ca79884800","schema_version":"1.0","event_id":"sha256:7dad1d39a3fdbce30c535e59abdfdf3a8b63e509649b1ca829dbc9ca79884800"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6WGI3OHLLMA6GZSPVTPVHG5UV/bundle.json","state_url":"https://pith.science/pith/R6WGI3OHLLMA6GZSPVTPVHG5UV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6WGI3OHLLMA6GZSPVTPVHG5UV/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-07-05T13:54:25Z","links":{"resolver":"https://pith.science/pith/R6WGI3OHLLMA6GZSPVTPVHG5UV","bundle":"https://pith.science/pith/R6WGI3OHLLMA6GZSPVTPVHG5UV/bundle.json","state":"https://pith.science/pith/R6WGI3OHLLMA6GZSPVTPVHG5UV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6WGI3OHLLMA6GZSPVTPVHG5UV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:R6WGI3OHLLMA6GZSPVTPVHG5UV","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":"aecb78dc0c878d2ab0cb8480f8e7d1aaf5e3d37916cd0fab003566f287c4177f","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-04T04:18:30Z","title_canon_sha256":"2b997daf6db06538390d2cd875c0564f834c20a155bd14f74be5622d2bd11b26"},"schema_version":"1.0","source":{"id":"2211.02257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02257","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02257v1","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02257","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"R6WGI3OHLLMA","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"R6WGI3OHLLMA6GZS","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"R6WGI3OH","created_at":"2026-07-05T05:13:13Z"}],"graph_snapshots":[{"event_id":"sha256:7dad1d39a3fdbce30c535e59abdfdf3a8b63e509649b1ca829dbc9ca79884800","target":"graph","created_at":"2026-07-05T05:13:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.02257/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the certification problem, the algorithm is given a function $f$ with certificate complexity $k$ and an input $x^\\star$, and the goal is to find a certificate of size $\\le \\text{poly}(k)$ for $f$'s value at $x^\\star$. This problem is in $\\mathsf{NP}^{\\mathsf{NP}}$, and assuming $\\mathsf{P} \\ne \\mathsf{NP}$, is not in $\\mathsf{P}$. Prior works, dating back to Valiant in 1984, have therefore sought to design efficient algorithms by imposing assumptions on $f$ such as monotonicity.\n  Our first result is a $\\mathsf{BPP}^{\\mathsf{NP}}$ algorithm for the general problem. The key ingredient is a n","authors_text":"Caleb Koch, Carmen Strassle, Guy Blanc, Jane Lange, Li-Yang Tan","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-04T04:18:30Z","title":"Certification with an NP Oracle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02257","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:7ae31b532412fbf00ae7138e73e1dfaa3cf9d4e5f7e43b652e7aeb59db8f8d43","target":"record","created_at":"2026-07-05T05:13:13Z","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":"aecb78dc0c878d2ab0cb8480f8e7d1aaf5e3d37916cd0fab003566f287c4177f","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-11-04T04:18:30Z","title_canon_sha256":"2b997daf6db06538390d2cd875c0564f834c20a155bd14f74be5622d2bd11b26"},"schema_version":"1.0","source":{"id":"2211.02257","kind":"arxiv","version":1}},"canonical_sha256":"8fac646dc75ad80f1b327d66fa9cdda55b9d04300a0868a7fb4e955d352f9af4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fac646dc75ad80f1b327d66fa9cdda55b9d04300a0868a7fb4e955d352f9af4","first_computed_at":"2026-07-05T05:13:13.375707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:13:13.375707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nrFw3GtzoOxpI+pEXO5D8W6qjp1InxSpi/SHNb0xQ91Jk8sqCgbXUKvMBSoXKX7Sc+IjVAeZow8h/lQwMGBfAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:13:13.376085Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.02257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ae31b532412fbf00ae7138e73e1dfaa3cf9d4e5f7e43b652e7aeb59db8f8d43","sha256:7dad1d39a3fdbce30c535e59abdfdf3a8b63e509649b1ca829dbc9ca79884800"],"state_sha256":"1f75f82ddc46d74e1d9068e59f91c40b1b53a48fda125ffd08cf2b89f2f55696"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWXWbQIMASLsq7W5wZJgQ31z1Zn0iZfnlX7kgRMTvTWbY3Oh5TZXzv0Th24ypEw+r14K/3PieKmCuT8s34AGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T13:54:25.938429Z","bundle_sha256":"6ad6ca33eee4357847aef567f23e524b8d7ffda09d851716b49e4c2239b2b86d"}}