{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:5PCAQQBYGQ4C6GWYJOS6TIKUSJ","short_pith_number":"pith:5PCAQQBY","canonical_record":{"source":{"id":"quant-ph/0310134","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-21T16:26:16Z","cross_cats_sorted":[],"title_canon_sha256":"4cace214907e1f8e1ba8679ef7441acc02333f8db2c04420fb544d6dfcbfaeb9","abstract_canon_sha256":"9e55e0ef5580b19572c5f0fd9d62164823dae52660f4c31d751905afb785141d"},"schema_version":"1.0"},"canonical_sha256":"ebc408403834382f1ad84ba5e9a154925ef166117cfdf5bd88648134d9fc6e3e","source":{"kind":"arxiv","id":"quant-ph/0310134","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0310134","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0310134v3","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0310134","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"5PCAQQBYGQ4C","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"pith_short_16","alias_value":"5PCAQQBYGQ4C6GWY","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"pith_short_8","alias_value":"5PCAQQBY","created_at":"2026-07-04T14:49:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:5PCAQQBYGQ4C6GWYJOS6TIKUSJ","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0310134","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-21T16:26:16Z","cross_cats_sorted":[],"title_canon_sha256":"4cace214907e1f8e1ba8679ef7441acc02333f8db2c04420fb544d6dfcbfaeb9","abstract_canon_sha256":"9e55e0ef5580b19572c5f0fd9d62164823dae52660f4c31d751905afb785141d"},"schema_version":"1.0"},"canonical_sha256":"ebc408403834382f1ad84ba5e9a154925ef166117cfdf5bd88648134d9fc6e3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:49:45.668739Z","signature_b64":"R5KQ5D3fKmzrZzaW0+Byc7jbm3Oz+795w9Am+ktHiYlfU3xC+r27XzdZulFLNpVp49PVH49WD8PC/WHdlo76Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebc408403834382f1ad84ba5e9a154925ef166117cfdf5bd88648134d9fc6e3e","last_reissued_at":"2026-07-04T14:49:45.668347Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:49:45.668347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0310134","source_version":3,"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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87TKMNyuMW3JbG+oFORXRpx3DyRke5rF+MafRIgrofE41hN1Unj8nuH0dlHEMe5vS6S/2Y7IndHGLoAtisG5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:47:57.722823Z"},"content_sha256":"4720a988ae9fccbb5575aace4c23cf2e5a31b1d23c0a21123d425efedb3b5eb3","schema_version":"1.0","event_id":"sha256:4720a988ae9fccbb5575aace4c23cf2e5a31b1d23c0a21123d425efedb3b5eb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:5PCAQQBYGQ4C6GWYJOS6TIKUSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Algorithms for the Triangle Problem","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic Magniez, Mario Szegedy, Miklos Santha","submitted_at":"2003-10-21T16:26:16Z","abstract_excerpt":"We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes $\\tilde{O}(n^{10/7})$ queries. The second algorithm uses $\\tilde{O}(n^{13/10})$ queries, and it is based on a design concept of Ambainis~\\cite{amb04} that incorporates the benefits of quantum walks into Grover search~\\cite{gro96}. The first algorithm uses only $O(\\log n)$ qubits in its quantum subroutines, whereas the second one uses O(n) qubits. The Triangle Pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0310134","kind":"arxiv","version":3},"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/0310134/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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XmA221EEDSpe3QBTAWHYL2P619zqtRW8MuTjHRCAxOPQU7vZGFhKFmVQ4yfcZKuNYgM5dAw/BFaiwohD5XyuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T11:47:57.723737Z"},"content_sha256":"890fcdf323ed4105eada5cb62c3efde68a7ec8c8a48b70fe65d706eb05325525","schema_version":"1.0","event_id":"sha256:890fcdf323ed4105eada5cb62c3efde68a7ec8c8a48b70fe65d706eb05325525"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/bundle.json","state_url":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/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-09T11:47:57Z","links":{"resolver":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ","bundle":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/bundle.json","state":"https://pith.science/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PCAQQBYGQ4C6GWYJOS6TIKUSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:5PCAQQBYGQ4C6GWYJOS6TIKUSJ","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":"9e55e0ef5580b19572c5f0fd9d62164823dae52660f4c31d751905afb785141d","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-21T16:26:16Z","title_canon_sha256":"4cace214907e1f8e1ba8679ef7441acc02333f8db2c04420fb544d6dfcbfaeb9"},"schema_version":"1.0","source":{"id":"quant-ph/0310134","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0310134","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0310134v3","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0310134","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"5PCAQQBYGQ4C","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"pith_short_16","alias_value":"5PCAQQBYGQ4C6GWY","created_at":"2026-07-04T14:49:45Z"},{"alias_kind":"pith_short_8","alias_value":"5PCAQQBY","created_at":"2026-07-04T14:49:45Z"}],"graph_snapshots":[{"event_id":"sha256:890fcdf323ed4105eada5cb62c3efde68a7ec8c8a48b70fe65d706eb05325525","target":"graph","created_at":"2026-07-04T14:49:45Z","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/0310134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes $\\tilde{O}(n^{10/7})$ queries. The second algorithm uses $\\tilde{O}(n^{13/10})$ queries, and it is based on a design concept of Ambainis~\\cite{amb04} that incorporates the benefits of quantum walks into Grover search~\\cite{gro96}. The first algorithm uses only $O(\\log n)$ qubits in its quantum subroutines, whereas the second one uses O(n) qubits. The Triangle Pr","authors_text":"Frederic Magniez, Mario Szegedy, Miklos Santha","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2003-10-21T16:26:16Z","title":"Quantum Algorithms for the Triangle Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0310134","kind":"arxiv","version":3},"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:4720a988ae9fccbb5575aace4c23cf2e5a31b1d23c0a21123d425efedb3b5eb3","target":"record","created_at":"2026-07-04T14:49:45Z","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":"9e55e0ef5580b19572c5f0fd9d62164823dae52660f4c31d751905afb785141d","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-21T16:26:16Z","title_canon_sha256":"4cace214907e1f8e1ba8679ef7441acc02333f8db2c04420fb544d6dfcbfaeb9"},"schema_version":"1.0","source":{"id":"quant-ph/0310134","kind":"arxiv","version":3}},"canonical_sha256":"ebc408403834382f1ad84ba5e9a154925ef166117cfdf5bd88648134d9fc6e3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebc408403834382f1ad84ba5e9a154925ef166117cfdf5bd88648134d9fc6e3e","first_computed_at":"2026-07-04T14:49:45.668347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:49:45.668347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R5KQ5D3fKmzrZzaW0+Byc7jbm3Oz+795w9Am+ktHiYlfU3xC+r27XzdZulFLNpVp49PVH49WD8PC/WHdlo76Cw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:49:45.668739Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0310134","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4720a988ae9fccbb5575aace4c23cf2e5a31b1d23c0a21123d425efedb3b5eb3","sha256:890fcdf323ed4105eada5cb62c3efde68a7ec8c8a48b70fe65d706eb05325525"],"state_sha256":"751f9ead8a8f011424e7c76edbf92bd85ece0a20edec8589ed1e95d8f0edc9e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fxkq9cVpl3ute5cQfKkvNwTa6Qopr0NGF6nks4ceIBvUIfaePUcC3nSzOZvbQvV5l14uPHQDuAjDeJ94CowjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T11:47:57.732932Z","bundle_sha256":"ea0b0e3f846c203f4512e49dca60335ce330e8c221c52d225cd5ff2a70675004"}}