{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:RYO7TXJBQIEIO74BCPE7ZUMZGA","short_pith_number":"pith:RYO7TXJB","canonical_record":{"source":{"id":"quant-ph/0305170","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-28T10:41:29Z","cross_cats_sorted":[],"title_canon_sha256":"5d26363c4693963114f3921554acdeb7adfc5b8b70f9eed83fb6fe939665f742","abstract_canon_sha256":"5585e2354f11623427843bdf6dadab5e3954a029cf3cc24c18475b5adfcfab3e"},"schema_version":"1.0"},"canonical_sha256":"8e1df9dd218208877f8113c9fcd199300a39b745498eaaa19cd2ff7ebdae5995","source":{"kind":"arxiv","id":"quant-ph/0305170","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0305170","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0305170v2","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0305170","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"RYO7TXJBQIEI","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"pith_short_16","alias_value":"RYO7TXJBQIEIO74B","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"pith_short_8","alias_value":"RYO7TXJB","created_at":"2026-07-04T14:46:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:RYO7TXJBQIEIO74BCPE7ZUMZGA","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0305170","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-28T10:41:29Z","cross_cats_sorted":[],"title_canon_sha256":"5d26363c4693963114f3921554acdeb7adfc5b8b70f9eed83fb6fe939665f742","abstract_canon_sha256":"5585e2354f11623427843bdf6dadab5e3954a029cf3cc24c18475b5adfcfab3e"},"schema_version":"1.0"},"canonical_sha256":"8e1df9dd218208877f8113c9fcd199300a39b745498eaaa19cd2ff7ebdae5995","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:11.567768Z","signature_b64":"/aY4L7AqYoJ+HEWso+o1KQLqBL0IvjBzVAMwG39KgJcCJXtN/jXGZPt/Gdf9b+jC6gv2LHZiHL75/Up6z9iEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e1df9dd218208877f8113c9fcd199300a39b745498eaaa19cd2ff7ebdae5995","last_reissued_at":"2026-07-04T14:46:11.567421Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:11.567421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0305170","source_version":2,"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-07-04T14:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A9++2BK3gQwmbpq1bUWPekmsn30z5GjALNoVjHTRmpO/ame2ABz3uLUhYheEv9XH4mUYDMiUppqu5RELTxZpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:29:39.748424Z"},"content_sha256":"543c4a7b0b69e785777e581b355ebcefa9c07aad28615b4a4495857862bd84a2","schema_version":"1.0","event_id":"sha256:543c4a7b0b69e785777e581b355ebcefa9c07aad28615b4a4495857862bd84a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:RYO7TXJBQIEIO74BCPE7ZUMZGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cluster states, algorithms and graphs","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dirk Schlingemann","submitted_at":"2003-05-28T10:41:29Z","abstract_excerpt":"The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum algorithms, called graph algorithms, which correspond in the binary case to the Clifford group part of a network and which can efficiently be implemented on a one-way quantum computer. These algorithms can ``completely be solved\" in the sense that the manipulation of quantum states in each step can be computed explicitly. Graph algorithms are precisely those which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0305170","kind":"arxiv","version":2},"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/quant-ph/0305170/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"},"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-07-04T14:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkmTlEC9sOgGXRomv+IGvsf4/NolEfVJ0PCc9c3lfGpjjRmARwN32yH5/sbRmiDKz3uFEf2+ULbLEeP2AoL5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:29:39.749329Z"},"content_sha256":"3088d1e725e418b4f3ce6301dbd59cd9cf7f77fc7f9cf66741195e8fe5a0b761","schema_version":"1.0","event_id":"sha256:3088d1e725e418b4f3ce6301dbd59cd9cf7f77fc7f9cf66741195e8fe5a0b761"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYO7TXJBQIEIO74BCPE7ZUMZGA/bundle.json","state_url":"https://pith.science/pith/RYO7TXJBQIEIO74BCPE7ZUMZGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYO7TXJBQIEIO74BCPE7ZUMZGA/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-08-10T10:29:39Z","links":{"resolver":"https://pith.science/pith/RYO7TXJBQIEIO74BCPE7ZUMZGA","bundle":"https://pith.science/pith/RYO7TXJBQIEIO74BCPE7ZUMZGA/bundle.json","state":"https://pith.science/pith/RYO7TXJBQIEIO74BCPE7ZUMZGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYO7TXJBQIEIO74BCPE7ZUMZGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:RYO7TXJBQIEIO74BCPE7ZUMZGA","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":"5585e2354f11623427843bdf6dadab5e3954a029cf3cc24c18475b5adfcfab3e","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-28T10:41:29Z","title_canon_sha256":"5d26363c4693963114f3921554acdeb7adfc5b8b70f9eed83fb6fe939665f742"},"schema_version":"1.0","source":{"id":"quant-ph/0305170","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0305170","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0305170v2","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0305170","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"RYO7TXJBQIEI","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"pith_short_16","alias_value":"RYO7TXJBQIEIO74B","created_at":"2026-07-04T14:46:11Z"},{"alias_kind":"pith_short_8","alias_value":"RYO7TXJB","created_at":"2026-07-04T14:46:11Z"}],"graph_snapshots":[{"event_id":"sha256:3088d1e725e418b4f3ce6301dbd59cd9cf7f77fc7f9cf66741195e8fe5a0b761","target":"graph","created_at":"2026-07-04T14:46:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0305170/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum algorithms, called graph algorithms, which correspond in the binary case to the Clifford group part of a network and which can efficiently be implemented on a one-way quantum computer. These algorithms can ``completely be solved\" in the sense that the manipulation of quantum states in each step can be computed explicitly. Graph algorithms are precisely those which ","authors_text":"Dirk Schlingemann","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2003-05-28T10:41:29Z","title":"Cluster states, algorithms and graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0305170","kind":"arxiv","version":2},"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:543c4a7b0b69e785777e581b355ebcefa9c07aad28615b4a4495857862bd84a2","target":"record","created_at":"2026-07-04T14:46:11Z","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":"5585e2354f11623427843bdf6dadab5e3954a029cf3cc24c18475b5adfcfab3e","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-28T10:41:29Z","title_canon_sha256":"5d26363c4693963114f3921554acdeb7adfc5b8b70f9eed83fb6fe939665f742"},"schema_version":"1.0","source":{"id":"quant-ph/0305170","kind":"arxiv","version":2}},"canonical_sha256":"8e1df9dd218208877f8113c9fcd199300a39b745498eaaa19cd2ff7ebdae5995","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e1df9dd218208877f8113c9fcd199300a39b745498eaaa19cd2ff7ebdae5995","first_computed_at":"2026-07-04T14:46:11.567421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:46:11.567421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/aY4L7AqYoJ+HEWso+o1KQLqBL0IvjBzVAMwG39KgJcCJXtN/jXGZPt/Gdf9b+jC6gv2LHZiHL75/Up6z9iEDA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:46:11.567768Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0305170","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:543c4a7b0b69e785777e581b355ebcefa9c07aad28615b4a4495857862bd84a2","sha256:3088d1e725e418b4f3ce6301dbd59cd9cf7f77fc7f9cf66741195e8fe5a0b761"],"state_sha256":"cae33e40676abd912883f7398b77f35b785ac2f2481a7ab0391cffc4784e3546"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WahlpjCVS9HASvVdDppOU9KzJc/L4hGi/dD3wFmLQXxNsENRyv8uRfuJUq7jC45+xLbURCi4hXKtZNDyjrZkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T10:29:39.756319Z","bundle_sha256":"29df0b360b84db3ce4db7b4a55eda7374f6428a0f7aa13ab31ee86dfb357c51d"}}