{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N4NXIDIXZHQHMBJ2JUHKQLWAF6","short_pith_number":"pith:N4NXIDIX","schema_version":"1.0","canonical_sha256":"6f1b740d17c9e076053a4d0ea82ec02f9fb3a39a65df85fdccf26bd4273d2d4b","source":{"kind":"arxiv","id":"1401.6848","version":1},"attestation_state":"computed","paper":{"title":"AM with Multiple Merlins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Dana Moshkovitz, Russell Impagliazzo, Scott Aaronson","submitted_at":"2014-01-27T13:48:49Z","abstract_excerpt":"We introduce and study a new model of interactive proofs: AM(k), or Arthur-Merlin with k non-communicating Merlins. Unlike with the better-known MIP, here the assumption is that each Merlin receives an independent random challenge from Arthur. One motivation for this model (which we explore in detail) comes from the close analogies between it and the quantum complexity class QMA(k), but the AM(k) model is also natural in its own right.\n  We illustrate the power of multiple Merlins by giving an AM(2) protocol for 3SAT, in which the Merlins' challenges and responses consist of only n^{1/2+o(1)} "},"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":"1401.6848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-27T13:48:49Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"e87be34410f100bf2c84f1d9c9c11004640c95e9784fc855a48d23a62fabd03e","abstract_canon_sha256":"f070fdbf1f04032901c04c2f3a4b6add00ecc18e796e2dda8fedc180c96a7b24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:00.464960Z","signature_b64":"bzWwD7GH3YKo+UNr7BzHWlRKx8uuixv6ZRlCI8bepkNUzoFeafp3hENJit1mh/cxc3FIV0gVVbCFZm0elgfHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1b740d17c9e076053a4d0ea82ec02f9fb3a39a65df85fdccf26bd4273d2d4b","last_reissued_at":"2026-05-18T03:01:00.464264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:00.464264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AM with Multiple Merlins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Dana Moshkovitz, Russell Impagliazzo, Scott Aaronson","submitted_at":"2014-01-27T13:48:49Z","abstract_excerpt":"We introduce and study a new model of interactive proofs: AM(k), or Arthur-Merlin with k non-communicating Merlins. Unlike with the better-known MIP, here the assumption is that each Merlin receives an independent random challenge from Arthur. One motivation for this model (which we explore in detail) comes from the close analogies between it and the quantum complexity class QMA(k), but the AM(k) model is also natural in its own right.\n  We illustrate the power of multiple Merlins by giving an AM(2) protocol for 3SAT, in which the Merlins' challenges and responses consist of only n^{1/2+o(1)} "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6848","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":"1401.6848","created_at":"2026-05-18T03:01:00.464390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6848v1","created_at":"2026-05-18T03:01:00.464390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6848","created_at":"2026-05-18T03:01:00.464390+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4NXIDIXZHQH","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4NXIDIXZHQHMBJ2","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4NXIDIX","created_at":"2026-05-18T12:28:41.024544+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/N4NXIDIXZHQHMBJ2JUHKQLWAF6","json":"https://pith.science/pith/N4NXIDIXZHQHMBJ2JUHKQLWAF6.json","graph_json":"https://pith.science/api/pith-number/N4NXIDIXZHQHMBJ2JUHKQLWAF6/graph.json","events_json":"https://pith.science/api/pith-number/N4NXIDIXZHQHMBJ2JUHKQLWAF6/events.json","paper":"https://pith.science/paper/N4NXIDIX"},"agent_actions":{"view_html":"https://pith.science/pith/N4NXIDIXZHQHMBJ2JUHKQLWAF6","download_json":"https://pith.science/pith/N4NXIDIXZHQHMBJ2JUHKQLWAF6.json","view_paper":"https://pith.science/paper/N4NXIDIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6848&json=true","fetch_graph":"https://pith.science/api/pith-number/N4NXIDIXZHQHMBJ2JUHKQLWAF6/graph.json","fetch_events":"https://pith.science/api/pith-number/N4NXIDIXZHQHMBJ2JUHKQLWAF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4NXIDIXZHQHMBJ2JUHKQLWAF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4NXIDIXZHQHMBJ2JUHKQLWAF6/action/storage_attestation","attest_author":"https://pith.science/pith/N4NXIDIXZHQHMBJ2JUHKQLWAF6/action/author_attestation","sign_citation":"https://pith.science/pith/N4NXIDIXZHQHMBJ2JUHKQLWAF6/action/citation_signature","submit_replication":"https://pith.science/pith/N4NXIDIXZHQHMBJ2JUHKQLWAF6/action/replication_record"}},"created_at":"2026-05-18T03:01:00.464390+00:00","updated_at":"2026-05-18T03:01:00.464390+00:00"}