{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EFITO3ZZVOJHISVMYY6S3XIGJL","short_pith_number":"pith:EFITO3ZZ","canonical_record":{"source":{"id":"2411.15015","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T15:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"31cfd6877b206567e7fa05662e1b839b043497abc14da673a443e42536112666","abstract_canon_sha256":"1da2152ce9f5003903d2d4b834119b1c120e846103d7e6a1a66387ceec017508"},"schema_version":"1.0"},"canonical_sha256":"2151376f39ab92744aacc63d2ddd064ae3dfe534e568c41315ee9b4cab4cb44b","source":{"kind":"arxiv","id":"2411.15015","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15015","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15015v2","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15015","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"EFITO3ZZVOJH","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"pith_short_16","alias_value":"EFITO3ZZVOJHISVM","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"pith_short_8","alias_value":"EFITO3ZZ","created_at":"2026-07-05T09:44:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EFITO3ZZVOJHISVMYY6S3XIGJL","target":"record","payload":{"canonical_record":{"source":{"id":"2411.15015","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T15:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"31cfd6877b206567e7fa05662e1b839b043497abc14da673a443e42536112666","abstract_canon_sha256":"1da2152ce9f5003903d2d4b834119b1c120e846103d7e6a1a66387ceec017508"},"schema_version":"1.0"},"canonical_sha256":"2151376f39ab92744aacc63d2ddd064ae3dfe534e568c41315ee9b4cab4cb44b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:16.939212Z","signature_b64":"UqSx4pEjM0R13WTlhgUKiJLkw2KxHhtNsy+MvWtL8KFtDUzTpcI4+MQ3fR7y9iBW+xiQiDJAjCRus4gP904gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2151376f39ab92744aacc63d2ddd064ae3dfe534e568c41315ee9b4cab4cb44b","last_reissued_at":"2026-07-05T09:44:16.938774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:16.938774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.15015","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-05T09:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBXFhGiAnY/rwLyq2pTHMhDbFr07pbj64+d8xCrX+oyrw/j367dwmksvvjJDtDdMdZQKXnVI2Jq9wxGjifwDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:10:13.619293Z"},"content_sha256":"8efc13eaf0ae57aba860df64f83db2f522c81cfe5f9f42fe81c600ae9380a33c","schema_version":"1.0","event_id":"sha256:8efc13eaf0ae57aba860df64f83db2f522c81cfe5f9f42fe81c600ae9380a33c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EFITO3ZZVOJHISVMYY6S3XIGJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chonfai Kam, Claudia Linnhoff-Popien, Maximilian Balthasar Mansky","submitted_at":"2024-11-22T15:44:00Z","abstract_excerpt":"We introduce a novel quantum algorithm for determining graph connectedness using a constant number of measurements. The algorithm can be extended to find connected components with a linear number of measurements. It relies on non-unitary abelian gates taken from ZX calculus. Due to the fusion rule, the two-qubit gates correspond to a large single action on the qubits. The algorithm is general and can handle any undirected graph, including those with repeated edges and self-loops. The depth of the algorithm is variable, depending on the graph, and we derive upper and lower bounds. The algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15015","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/2411.15015/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-05T09:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqR0L6/396SW5tsWSNtlntKqtuublErY0g6ZWHW5eKIkYSc759cUKemJc0BtFT6CgMszPB1lHyGLIag8jKLNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T05:10:13.619806Z"},"content_sha256":"b7ada05a8757f2d265128e2a36476b2276268e7a1f3df49fc2f4500f4864e49a","schema_version":"1.0","event_id":"sha256:b7ada05a8757f2d265128e2a36476b2276268e7a1f3df49fc2f4500f4864e49a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/bundle.json","state_url":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/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-13T05:10:13Z","links":{"resolver":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL","bundle":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/bundle.json","state":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EFITO3ZZVOJHISVMYY6S3XIGJL","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":"1da2152ce9f5003903d2d4b834119b1c120e846103d7e6a1a66387ceec017508","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T15:44:00Z","title_canon_sha256":"31cfd6877b206567e7fa05662e1b839b043497abc14da673a443e42536112666"},"schema_version":"1.0","source":{"id":"2411.15015","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15015","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15015v2","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15015","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"EFITO3ZZVOJH","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"pith_short_16","alias_value":"EFITO3ZZVOJHISVM","created_at":"2026-07-05T09:44:16Z"},{"alias_kind":"pith_short_8","alias_value":"EFITO3ZZ","created_at":"2026-07-05T09:44:16Z"}],"graph_snapshots":[{"event_id":"sha256:b7ada05a8757f2d265128e2a36476b2276268e7a1f3df49fc2f4500f4864e49a","target":"graph","created_at":"2026-07-05T09:44:16Z","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/2411.15015/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a novel quantum algorithm for determining graph connectedness using a constant number of measurements. The algorithm can be extended to find connected components with a linear number of measurements. It relies on non-unitary abelian gates taken from ZX calculus. Due to the fusion rule, the two-qubit gates correspond to a large single action on the qubits. The algorithm is general and can handle any undirected graph, including those with repeated edges and self-loops. The depth of the algorithm is variable, depending on the graph, and we derive upper and lower bounds. The algorithm","authors_text":"Chonfai Kam, Claudia Linnhoff-Popien, Maximilian Balthasar Mansky","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T15:44:00Z","title":"A Constant Measurement Quantum Algorithm for Graph Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15015","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:8efc13eaf0ae57aba860df64f83db2f522c81cfe5f9f42fe81c600ae9380a33c","target":"record","created_at":"2026-07-05T09:44:16Z","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":"1da2152ce9f5003903d2d4b834119b1c120e846103d7e6a1a66387ceec017508","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T15:44:00Z","title_canon_sha256":"31cfd6877b206567e7fa05662e1b839b043497abc14da673a443e42536112666"},"schema_version":"1.0","source":{"id":"2411.15015","kind":"arxiv","version":2}},"canonical_sha256":"2151376f39ab92744aacc63d2ddd064ae3dfe534e568c41315ee9b4cab4cb44b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2151376f39ab92744aacc63d2ddd064ae3dfe534e568c41315ee9b4cab4cb44b","first_computed_at":"2026-07-05T09:44:16.938774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:44:16.938774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UqSx4pEjM0R13WTlhgUKiJLkw2KxHhtNsy+MvWtL8KFtDUzTpcI4+MQ3fR7y9iBW+xiQiDJAjCRus4gP904gBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:44:16.939212Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.15015","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8efc13eaf0ae57aba860df64f83db2f522c81cfe5f9f42fe81c600ae9380a33c","sha256:b7ada05a8757f2d265128e2a36476b2276268e7a1f3df49fc2f4500f4864e49a"],"state_sha256":"609ef1e4c824efe560e4cdbf4249b0042a55a89d3a2a580a2560464c5f5853bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZBYsqGknFe9UhMrVVI3GQeRMHLJ3c0V4a2lfXSM+W8oUdH9ywKUTS5jSxbO6348p4xycsUpQ3zj/l3wW7wDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T05:10:13.626335Z","bundle_sha256":"08b46f4f5dbaa704700b0a8c4d01a2400f2be045cff279fb91e62a4e540c7f11"}}