{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4JUNJORIKMD2FAWGXJGN2JKAIQ","short_pith_number":"pith:4JUNJORI","schema_version":"1.0","canonical_sha256":"e268d4ba285307a282c6ba4cdd25404401471291c2ed57bcabad206c4cf6d997","source":{"kind":"arxiv","id":"1112.5064","version":4},"attestation_state":"computed","paper":{"title":"Multipartite entanglement verification resistant against dishonest parties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'e Chailloux, Anna Pappa, Eleni Diamanti, Iordanis Kerenidis, Stephanie Wehner","submitted_at":"2011-12-21T15:41:47Z","abstract_excerpt":"Future quantum information networks will likely consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and hence it is imperative to study the possibility of verifying a multipartite entanglement source in a way that is efficient and provides strong guarantees even in the presence of multiple dishonest parties. In this work, we show how an agent o"},"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":"1112.5064","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-21T15:41:47Z","cross_cats_sorted":[],"title_canon_sha256":"5972a0fedcd45486e57ba41a5d5656de596904f3381284fe9bb75b9f138155ef","abstract_canon_sha256":"3d5afe1d88a4d94d2a83a920862b1a713f51a050167f5cea908fea2d4dd4fe78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:29.491987Z","signature_b64":"KWehpvpr0/FfHYFibp7XXM744uLqYsvCJEsFGopXmp6YmFcs2fEe7A3Q9qvmrnjaglERsVs13iPIWW58KQGAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e268d4ba285307a282c6ba4cdd25404401471291c2ed57bcabad206c4cf6d997","last_reissued_at":"2026-05-18T03:41:29.491195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:29.491195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multipartite entanglement verification resistant against dishonest parties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'e Chailloux, Anna Pappa, Eleni Diamanti, Iordanis Kerenidis, Stephanie Wehner","submitted_at":"2011-12-21T15:41:47Z","abstract_excerpt":"Future quantum information networks will likely consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and hence it is imperative to study the possibility of verifying a multipartite entanglement source in a way that is efficient and provides strong guarantees even in the presence of multiple dishonest parties. In this work, we show how an agent o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5064","kind":"arxiv","version":4},"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":"1112.5064","created_at":"2026-05-18T03:41:29.491334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5064v4","created_at":"2026-05-18T03:41:29.491334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5064","created_at":"2026-05-18T03:41:29.491334+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JUNJORIKMD2","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JUNJORIKMD2FAWG","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JUNJORI","created_at":"2026-05-18T12:26:20.644004+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/4JUNJORIKMD2FAWGXJGN2JKAIQ","json":"https://pith.science/pith/4JUNJORIKMD2FAWGXJGN2JKAIQ.json","graph_json":"https://pith.science/api/pith-number/4JUNJORIKMD2FAWGXJGN2JKAIQ/graph.json","events_json":"https://pith.science/api/pith-number/4JUNJORIKMD2FAWGXJGN2JKAIQ/events.json","paper":"https://pith.science/paper/4JUNJORI"},"agent_actions":{"view_html":"https://pith.science/pith/4JUNJORIKMD2FAWGXJGN2JKAIQ","download_json":"https://pith.science/pith/4JUNJORIKMD2FAWGXJGN2JKAIQ.json","view_paper":"https://pith.science/paper/4JUNJORI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5064&json=true","fetch_graph":"https://pith.science/api/pith-number/4JUNJORIKMD2FAWGXJGN2JKAIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4JUNJORIKMD2FAWGXJGN2JKAIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JUNJORIKMD2FAWGXJGN2JKAIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JUNJORIKMD2FAWGXJGN2JKAIQ/action/storage_attestation","attest_author":"https://pith.science/pith/4JUNJORIKMD2FAWGXJGN2JKAIQ/action/author_attestation","sign_citation":"https://pith.science/pith/4JUNJORIKMD2FAWGXJGN2JKAIQ/action/citation_signature","submit_replication":"https://pith.science/pith/4JUNJORIKMD2FAWGXJGN2JKAIQ/action/replication_record"}},"created_at":"2026-05-18T03:41:29.491334+00:00","updated_at":"2026-05-18T03:41:29.491334+00:00"}