{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ROA5AJP7KZMCWVMFWIRE4VHLQ2","short_pith_number":"pith:ROA5AJP7","schema_version":"1.0","canonical_sha256":"8b81d025ff56582b5585b2224e54eb8695f12d8be0ef5a1cdd63146452c17a24","source":{"kind":"arxiv","id":"1209.5192","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic verifiers for asymmetric debates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abuzer Yakary{\\i}lmaz, A. C. Cem Say, H. G\\\"okalp Demirci","submitted_at":"2012-09-24T08:44:46Z","abstract_excerpt":"We examine the power of silent constant-space probabilistic verifiers that watch asymmetric debates (where one side is unable to see some of the messages of the other) between two deterministic provers, and try to determine who is right. We prove that probabilistic verifiers outperform their deterministic counterparts as asymmetric debate checkers. It is shown that the membership problem for every language in NSPACE(s(n)) has a 2^{s(n)}-time debate where one prover is completely blind to the other one, for polynomially bounded space constructible s(n). When partial information is allowed to be"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1209.5192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-24T08:44:46Z","cross_cats_sorted":[],"title_canon_sha256":"3217f3b8417616b5f4bb20c2731494478047973c32a14904b80a4200fc87a790","abstract_canon_sha256":"3e2277fd458626049f658196fef3148d5167bcabd985ed96ec19e1bfea03ef0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:58.906381Z","signature_b64":"OYSvCIdn+AtyF54k8Iu+oCNAjln1vdSRbFrq+1YZvdaxz+3JRW0Ljz6C4mxHp5enK8uCHWgEU6c4p1bhv4qQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b81d025ff56582b5585b2224e54eb8695f12d8be0ef5a1cdd63146452c17a24","last_reissued_at":"2026-05-18T03:44:58.905663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:58.905663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic verifiers for asymmetric debates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abuzer Yakary{\\i}lmaz, A. C. Cem Say, H. G\\\"okalp Demirci","submitted_at":"2012-09-24T08:44:46Z","abstract_excerpt":"We examine the power of silent constant-space probabilistic verifiers that watch asymmetric debates (where one side is unable to see some of the messages of the other) between two deterministic provers, and try to determine who is right. We prove that probabilistic verifiers outperform their deterministic counterparts as asymmetric debate checkers. It is shown that the membership problem for every language in NSPACE(s(n)) has a 2^{s(n)}-time debate where one prover is completely blind to the other one, for polynomially bounded space constructible s(n). When partial information is allowed to be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5192","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.5192","created_at":"2026-05-18T03:44:58.905758+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5192v1","created_at":"2026-05-18T03:44:58.905758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5192","created_at":"2026-05-18T03:44:58.905758+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROA5AJP7KZMC","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROA5AJP7KZMCWVMF","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROA5AJP7","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROA5AJP7KZMCWVMFWIRE4VHLQ2","json":"https://pith.science/pith/ROA5AJP7KZMCWVMFWIRE4VHLQ2.json","graph_json":"https://pith.science/api/pith-number/ROA5AJP7KZMCWVMFWIRE4VHLQ2/graph.json","events_json":"https://pith.science/api/pith-number/ROA5AJP7KZMCWVMFWIRE4VHLQ2/events.json","paper":"https://pith.science/paper/ROA5AJP7"},"agent_actions":{"view_html":"https://pith.science/pith/ROA5AJP7KZMCWVMFWIRE4VHLQ2","download_json":"https://pith.science/pith/ROA5AJP7KZMCWVMFWIRE4VHLQ2.json","view_paper":"https://pith.science/paper/ROA5AJP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5192&json=true","fetch_graph":"https://pith.science/api/pith-number/ROA5AJP7KZMCWVMFWIRE4VHLQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/ROA5AJP7KZMCWVMFWIRE4VHLQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROA5AJP7KZMCWVMFWIRE4VHLQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROA5AJP7KZMCWVMFWIRE4VHLQ2/action/storage_attestation","attest_author":"https://pith.science/pith/ROA5AJP7KZMCWVMFWIRE4VHLQ2/action/author_attestation","sign_citation":"https://pith.science/pith/ROA5AJP7KZMCWVMFWIRE4VHLQ2/action/citation_signature","submit_replication":"https://pith.science/pith/ROA5AJP7KZMCWVMFWIRE4VHLQ2/action/replication_record"}},"created_at":"2026-05-18T03:44:58.905758+00:00","updated_at":"2026-05-18T03:44:58.905758+00:00"}