{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DLDYDSAIXY7DITSK72VGNCTZ3O","short_pith_number":"pith:DLDYDSAI","schema_version":"1.0","canonical_sha256":"1ac781c808be3e344e4afeaa668a79db98eff7ddb6c8539f67f32a585fd068db","source":{"kind":"arxiv","id":"2402.01445","version":1},"attestation_state":"computed","paper":{"title":"All graph state verification protocols are composably secure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Damian Markham, L\\'eo Colisson, Raja Yehia","submitted_at":"2024-02-02T14:37:26Z","abstract_excerpt":"Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties. Since graph states are the starting point of numerous quantum protocols, it is crucial to ensure that graph state verification protocols can safely be composed with other protocols, this property being known as composable security. Previous works [YDK21] conjectured that such a property could not be proven within the abstract cryptography framework: we disprove this conjecture by showing that all graph state verification"},"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":"2402.01445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-02T14:37:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"ac1c588f2e42d8b9505c8605e4bde460925d0fb9037d2b5697eb52068da68d49","abstract_canon_sha256":"c916494af33ed201443f8c6e63f6a17c0fce4ed48832619fc67821a9e897475d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:44.343478Z","signature_b64":"1mnxKE63Le/wOxYx/VappU45T7BasfcBcKrsDvCuNUSLyEUWN4EVY9SBNmcRJU81FjYlvX3e1+6SL4YVFonTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ac781c808be3e344e4afeaa668a79db98eff7ddb6c8539f67f32a585fd068db","last_reissued_at":"2026-07-05T07:40:44.336849Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:44.336849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All graph state verification protocols are composably secure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Damian Markham, L\\'eo Colisson, Raja Yehia","submitted_at":"2024-02-02T14:37:26Z","abstract_excerpt":"Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties. Since graph states are the starting point of numerous quantum protocols, it is crucial to ensure that graph state verification protocols can safely be composed with other protocols, this property being known as composable security. Previous works [YDK21] conjectured that such a property could not be proven within the abstract cryptography framework: we disprove this conjecture by showing that all graph state verification"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01445","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/2402.01445/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.01445","created_at":"2026-07-05T07:40:44.338391+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.01445v1","created_at":"2026-07-05T07:40:44.338391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01445","created_at":"2026-07-05T07:40:44.338391+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLDYDSAIXY7D","created_at":"2026-07-05T07:40:44.338391+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLDYDSAIXY7DITSK","created_at":"2026-07-05T07:40:44.338391+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLDYDSAI","created_at":"2026-07-05T07:40:44.338391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.21988","citing_title":"Unifying communication paradigms in measurement-based delegated quantum computing","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DLDYDSAIXY7DITSK72VGNCTZ3O","json":"https://pith.science/pith/DLDYDSAIXY7DITSK72VGNCTZ3O.json","graph_json":"https://pith.science/api/pith-number/DLDYDSAIXY7DITSK72VGNCTZ3O/graph.json","events_json":"https://pith.science/api/pith-number/DLDYDSAIXY7DITSK72VGNCTZ3O/events.json","paper":"https://pith.science/paper/DLDYDSAI"},"agent_actions":{"view_html":"https://pith.science/pith/DLDYDSAIXY7DITSK72VGNCTZ3O","download_json":"https://pith.science/pith/DLDYDSAIXY7DITSK72VGNCTZ3O.json","view_paper":"https://pith.science/paper/DLDYDSAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.01445&json=true","fetch_graph":"https://pith.science/api/pith-number/DLDYDSAIXY7DITSK72VGNCTZ3O/graph.json","fetch_events":"https://pith.science/api/pith-number/DLDYDSAIXY7DITSK72VGNCTZ3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLDYDSAIXY7DITSK72VGNCTZ3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLDYDSAIXY7DITSK72VGNCTZ3O/action/storage_attestation","attest_author":"https://pith.science/pith/DLDYDSAIXY7DITSK72VGNCTZ3O/action/author_attestation","sign_citation":"https://pith.science/pith/DLDYDSAIXY7DITSK72VGNCTZ3O/action/citation_signature","submit_replication":"https://pith.science/pith/DLDYDSAIXY7DITSK72VGNCTZ3O/action/replication_record"}},"created_at":"2026-07-05T07:40:44.338391+00:00","updated_at":"2026-07-05T07:40:44.338391+00:00"}