{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LOGLEKPOSB57WVU65ELWZBKHV7","short_pith_number":"pith:LOGLEKPO","canonical_record":{"source":{"id":"2405.07129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-12T01:44:19Z","cross_cats_sorted":[],"title_canon_sha256":"aa00431a197020af227dbf3a0091ce92ee3750c2b3128689384156179b3687c2","abstract_canon_sha256":"f7ee42d1a85876fa3dfa5ad14457cac846e81f4f8184375f603db0ef81ddc051"},"schema_version":"1.0"},"canonical_sha256":"5b8cb229ee907bfb569ee9176c8547aff54204b85cb4e49abe628a296b715cd3","source":{"kind":"arxiv","id":"2405.07129","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.07129","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"2405.07129v3","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07129","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"LOGLEKPOSB57","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"LOGLEKPOSB57WVU6","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"LOGLEKPO","created_at":"2026-07-05T10:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LOGLEKPOSB57WVU65ELWZBKHV7","target":"record","payload":{"canonical_record":{"source":{"id":"2405.07129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-12T01:44:19Z","cross_cats_sorted":[],"title_canon_sha256":"aa00431a197020af227dbf3a0091ce92ee3750c2b3128689384156179b3687c2","abstract_canon_sha256":"f7ee42d1a85876fa3dfa5ad14457cac846e81f4f8184375f603db0ef81ddc051"},"schema_version":"1.0"},"canonical_sha256":"5b8cb229ee907bfb569ee9176c8547aff54204b85cb4e49abe628a296b715cd3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:29:17.146257Z","signature_b64":"kxNeD1G+oIkv1ZOiytpTjYsuv/CRgkTeNmTlTYlBzzq70F2/2maQ6ADAwiZq37UkrXQBHGV4yXpXIm/L69VhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b8cb229ee907bfb569ee9176c8547aff54204b85cb4e49abe628a296b715cd3","last_reissued_at":"2026-07-05T10:29:17.145447Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:29:17.145447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.07129","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-05T10:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLAeD/uQgwv+58/BuFt011d8TJ4EI33B1aF80yIZ0OsU0DyW090YJ/Fgsq00JcuApXEQQKOzopDf+Q5kHxF+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:59:13.272800Z"},"content_sha256":"f2f8796f27261a59db10257517fb94e835a172c4102fe71bef34ea98056045bd","schema_version":"1.0","event_id":"sha256:f2f8796f27261a59db10257517fb94e835a172c4102fe71bef34ea98056045bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LOGLEKPOSB57WVU65ELWZBKHV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gordon Cui, Hideyuki Kawashima, Kazuhiro Saito, Rei Sato, Shohei Watabe, Tetsuro Nikuni","submitted_at":"2024-05-12T01:44:19Z","abstract_excerpt":"Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state -- an equal superposition of all feasible solutions satisfying the problem's constraints -- is pre-prepared. The query complexity of preparing this state using brute-force methods scales exponentially with the factorial growth of feasible solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07129","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/2405.07129/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-05T10:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPCzjvwX2IRRRt4d+BndXTHdi4dTTAHohrxIlzEThgSY9F6PczRNLBXAQ2y9PJeJOZFJRgtJ53DaKlNs/6LLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:59:13.273305Z"},"content_sha256":"1740f6306c8d4279bcfa4bc3656c9cea01c8c858646493d8d2306dc2dede8cb3","schema_version":"1.0","event_id":"sha256:1740f6306c8d4279bcfa4bc3656c9cea01c8c858646493d8d2306dc2dede8cb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7/bundle.json","state_url":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOGLEKPOSB57WVU65ELWZBKHV7/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:59:13Z","links":{"resolver":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7","bundle":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7/bundle.json","state":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOGLEKPOSB57WVU65ELWZBKHV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LOGLEKPOSB57WVU65ELWZBKHV7","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":"f7ee42d1a85876fa3dfa5ad14457cac846e81f4f8184375f603db0ef81ddc051","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-12T01:44:19Z","title_canon_sha256":"aa00431a197020af227dbf3a0091ce92ee3750c2b3128689384156179b3687c2"},"schema_version":"1.0","source":{"id":"2405.07129","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.07129","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"2405.07129v3","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07129","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"LOGLEKPOSB57","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"LOGLEKPOSB57WVU6","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"LOGLEKPO","created_at":"2026-07-05T10:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:1740f6306c8d4279bcfa4bc3656c9cea01c8c858646493d8d2306dc2dede8cb3","target":"graph","created_at":"2026-07-05T10:29:17Z","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/2405.07129/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state -- an equal superposition of all feasible solutions satisfying the problem's constraints -- is pre-prepared. The query complexity of preparing this state using brute-force methods scales exponentially with the factorial growth of feasible solu","authors_text":"Gordon Cui, Hideyuki Kawashima, Kazuhiro Saito, Rei Sato, Shohei Watabe, Tetsuro Nikuni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-12T01:44:19Z","title":"Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07129","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:f2f8796f27261a59db10257517fb94e835a172c4102fe71bef34ea98056045bd","target":"record","created_at":"2026-07-05T10:29:17Z","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":"f7ee42d1a85876fa3dfa5ad14457cac846e81f4f8184375f603db0ef81ddc051","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-12T01:44:19Z","title_canon_sha256":"aa00431a197020af227dbf3a0091ce92ee3750c2b3128689384156179b3687c2"},"schema_version":"1.0","source":{"id":"2405.07129","kind":"arxiv","version":3}},"canonical_sha256":"5b8cb229ee907bfb569ee9176c8547aff54204b85cb4e49abe628a296b715cd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b8cb229ee907bfb569ee9176c8547aff54204b85cb4e49abe628a296b715cd3","first_computed_at":"2026-07-05T10:29:17.145447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:29:17.145447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kxNeD1G+oIkv1ZOiytpTjYsuv/CRgkTeNmTlTYlBzzq70F2/2maQ6ADAwiZq37UkrXQBHGV4yXpXIm/L69VhCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:29:17.146257Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.07129","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2f8796f27261a59db10257517fb94e835a172c4102fe71bef34ea98056045bd","sha256:1740f6306c8d4279bcfa4bc3656c9cea01c8c858646493d8d2306dc2dede8cb3"],"state_sha256":"da419f1d7502a88a19d4e10c3239a574cc6bd36d8b5aa139aeadcf4720a9b09a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxebhm98LeQTTA9jbkvL18QAUlN1iJ23l9LH8tnr8z4L0cEpVAjSxkBvM0q1QHWT0FfQ7123pzyKbWkqME/9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T10:59:13.277557Z","bundle_sha256":"ef1051c6a0e0a14d6d32352a8219fb1b6a493ad50688140223924f5de753dc2d"}}