{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VYCAFU4WBQUVSQHHSKEJKTG7AL","short_pith_number":"pith:VYCAFU4W","canonical_record":{"source":{"id":"1606.03585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-11T12:44:40Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"c1269012f4bce7e3e423961cb9cf4e7a41b7dcfa0e8e9e9f12590fe1aa6d2eeb","abstract_canon_sha256":"1827e4159a4063a06ac03c269ee029d0291a4d7e8899adc34ac7f385c2710796"},"schema_version":"1.0"},"canonical_sha256":"ae0402d3960c295940e79288954cdf02d2d9e2224741954f33c9abc2bf473670","source":{"kind":"arxiv","id":"1606.03585","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03585","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03585v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03585","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"VYCAFU4WBQUV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VYCAFU4WBQUVSQHH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VYCAFU4W","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VYCAFU4WBQUVSQHHSKEJKTG7AL","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-11T12:44:40Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"c1269012f4bce7e3e423961cb9cf4e7a41b7dcfa0e8e9e9f12590fe1aa6d2eeb","abstract_canon_sha256":"1827e4159a4063a06ac03c269ee029d0291a4d7e8899adc34ac7f385c2710796"},"schema_version":"1.0"},"canonical_sha256":"ae0402d3960c295940e79288954cdf02d2d9e2224741954f33c9abc2bf473670","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:33.614361Z","signature_b64":"bKuNKOFut4OfmnL6WD5S7BwWSFCWyHEqwPzPT+220nPVQCj4+yMyz8eQU9VdP5lvaU2MX7ff3w99zYXWvM08Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0402d3960c295940e79288954cdf02d2d9e2224741954f33c9abc2bf473670","last_reissued_at":"2026-05-18T01:12:33.613805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:33.613805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03585","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-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJOBhM+44eNECWFf5Q5/QucoSipuHJAJ+EJKB3QbLPLcnjzcZkADWEP/WmSLhozdpWu72go858DxINKLUab+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:53:27.450487Z"},"content_sha256":"cac2d4850ac31f3feebcffebf1badb50ac934bd8b1119f7b86f85952bc836336","schema_version":"1.0","event_id":"sha256:cac2d4850ac31f3feebcffebf1badb50ac934bd8b1119f7b86f85952bc836336"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VYCAFU4WBQUVSQHHSKEJKTG7AL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of probabilistic trials for hidden satisfiability problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Aarthi Sundaram, Adam Bouland, Daniel Grier, Itai Arad, Miklos Santha, Shengyu Zhang","submitted_at":"2016-06-11T12:44:40Z","abstract_excerpt":"What is the minimum amount of information and time needed to solve 2SAT? When the instance is known, it can be solved in polynomial time, but is this also possible without knowing the instance? Bei, Chen and Zhang (STOC '13) considered a model where the input is accessed by proposing possible assignments to a special oracle. This oracle, on encountering some constraint unsatisfied by the proposal, returns only the constraint index. It turns out that, in this model, even 1SAT cannot be solved in polynomial time unless P=NP. Hence, we consider a model in which the input is accessed by proposing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03585","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-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gMmPpHHimSa22PMy9J6flK8LmGS9qEzt4siwOwwVDIjnwY2P3T69me4q2d2Fm5iLPxyz1m51ljjWYYHtrsCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:53:27.451102Z"},"content_sha256":"c58abed6669dab6fe2c9a53cc68659026c48cf9c2c68af9851b371f30e54f60d","schema_version":"1.0","event_id":"sha256:c58abed6669dab6fe2c9a53cc68659026c48cf9c2c68af9851b371f30e54f60d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYCAFU4WBQUVSQHHSKEJKTG7AL/bundle.json","state_url":"https://pith.science/pith/VYCAFU4WBQUVSQHHSKEJKTG7AL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYCAFU4WBQUVSQHHSKEJKTG7AL/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-27T19:53:27Z","links":{"resolver":"https://pith.science/pith/VYCAFU4WBQUVSQHHSKEJKTG7AL","bundle":"https://pith.science/pith/VYCAFU4WBQUVSQHHSKEJKTG7AL/bundle.json","state":"https://pith.science/pith/VYCAFU4WBQUVSQHHSKEJKTG7AL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYCAFU4WBQUVSQHHSKEJKTG7AL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VYCAFU4WBQUVSQHHSKEJKTG7AL","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":"1827e4159a4063a06ac03c269ee029d0291a4d7e8899adc34ac7f385c2710796","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-11T12:44:40Z","title_canon_sha256":"c1269012f4bce7e3e423961cb9cf4e7a41b7dcfa0e8e9e9f12590fe1aa6d2eeb"},"schema_version":"1.0","source":{"id":"1606.03585","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03585","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03585v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03585","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"VYCAFU4WBQUV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VYCAFU4WBQUVSQHH","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VYCAFU4W","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:c58abed6669dab6fe2c9a53cc68659026c48cf9c2c68af9851b371f30e54f60d","target":"graph","created_at":"2026-05-18T01:12:33Z","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":"What is the minimum amount of information and time needed to solve 2SAT? When the instance is known, it can be solved in polynomial time, but is this also possible without knowing the instance? Bei, Chen and Zhang (STOC '13) considered a model where the input is accessed by proposing possible assignments to a special oracle. This oracle, on encountering some constraint unsatisfied by the proposal, returns only the constraint index. It turns out that, in this model, even 1SAT cannot be solved in polynomial time unless P=NP. Hence, we consider a model in which the input is accessed by proposing ","authors_text":"Aarthi Sundaram, Adam Bouland, Daniel Grier, Itai Arad, Miklos Santha, Shengyu Zhang","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-11T12:44:40Z","title":"On the complexity of probabilistic trials for hidden satisfiability problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03585","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:cac2d4850ac31f3feebcffebf1badb50ac934bd8b1119f7b86f85952bc836336","target":"record","created_at":"2026-05-18T01:12:33Z","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":"1827e4159a4063a06ac03c269ee029d0291a4d7e8899adc34ac7f385c2710796","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-11T12:44:40Z","title_canon_sha256":"c1269012f4bce7e3e423961cb9cf4e7a41b7dcfa0e8e9e9f12590fe1aa6d2eeb"},"schema_version":"1.0","source":{"id":"1606.03585","kind":"arxiv","version":1}},"canonical_sha256":"ae0402d3960c295940e79288954cdf02d2d9e2224741954f33c9abc2bf473670","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae0402d3960c295940e79288954cdf02d2d9e2224741954f33c9abc2bf473670","first_computed_at":"2026-05-18T01:12:33.613805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:33.613805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bKuNKOFut4OfmnL6WD5S7BwWSFCWyHEqwPzPT+220nPVQCj4+yMyz8eQU9VdP5lvaU2MX7ff3w99zYXWvM08Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:33.614361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03585","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cac2d4850ac31f3feebcffebf1badb50ac934bd8b1119f7b86f85952bc836336","sha256:c58abed6669dab6fe2c9a53cc68659026c48cf9c2c68af9851b371f30e54f60d"],"state_sha256":"5e3867be9dbeea44ecf72a06d7694b2d71fb0bcbaa19b168c6957fabb13d7fce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAIlmAjSuq3DRrvSzE+be1aHYY4EqF8G0d3S8Wq5c5jrEPktXyV/EruBeFpMlm+K9rT/9qPyu0ejKmQxIuFmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:53:27.454628Z","bundle_sha256":"bf1a638df25284f94e17fe72390f7354a59b9ffe94e65b3654953c79d54cc8ff"}}