{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XAXUH6KESXAUJCOTTEVXW7L5MN","short_pith_number":"pith:XAXUH6KE","schema_version":"1.0","canonical_sha256":"b82f43f94495c14489d3992b7b7d7d6346a9c7b8e9bf584f4f853a686ed026aa","source":{"kind":"arxiv","id":"2012.09376","version":3},"attestation_state":"computed","paper":{"title":"Quantum Algorithm for Lexicographically Minimal String Rotation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Qisheng Wang","submitted_at":"2020-12-17T03:13:45Z","abstract_excerpt":"Lexicographically minimal string rotation (LMSR) is a problem to find the minimal one among all rotations of a string in the lexicographical order, which is widely used in equality checking of graphs, polygons, automata and chemical structures. In this paper, we propose an $O(n^{3/4})$ quantum query algorithm for LMSR. In particular, the algorithm has average-case query complexity $O(\\sqrt n \\log n)$, which is shown to be asymptotically optimal up to a polylogarithmic factor, compared to its $\\Omega\\left(\\sqrt{n/\\log n}\\right)$ lower bound. Furthermore, we show that our quantum algorithm outpe"},"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":"2012.09376","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-12-17T03:13:45Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"e42c39349f31a167233a93bd960947b244dab41b887d18f3a59dc6a830d5540f","abstract_canon_sha256":"35393be47940285ef553c4bb9b1ff58684df8b54a3bc6e6e8dbad4d9240a5a2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:18.944762Z","signature_b64":"g8FzfFOg+6NcsmUvCQNDy78iAuFB3Fuf4H3ioG0RcLXM+gt7VxMVD3KAbd2LzmACwNU6RMeKAa70xAbWmewpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b82f43f94495c14489d3992b7b7d7d6346a9c7b8e9bf584f4f853a686ed026aa","last_reissued_at":"2026-07-05T07:40:18.944259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:18.944259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithm for Lexicographically Minimal String Rotation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Qisheng Wang","submitted_at":"2020-12-17T03:13:45Z","abstract_excerpt":"Lexicographically minimal string rotation (LMSR) is a problem to find the minimal one among all rotations of a string in the lexicographical order, which is widely used in equality checking of graphs, polygons, automata and chemical structures. In this paper, we propose an $O(n^{3/4})$ quantum query algorithm for LMSR. In particular, the algorithm has average-case query complexity $O(\\sqrt n \\log n)$, which is shown to be asymptotically optimal up to a polylogarithmic factor, compared to its $\\Omega\\left(\\sqrt{n/\\log n}\\right)$ lower bound. Furthermore, we show that our quantum algorithm outpe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09376","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/2012.09376/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":"2012.09376","created_at":"2026-07-05T07:40:18.944321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.09376v3","created_at":"2026-07-05T07:40:18.944321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09376","created_at":"2026-07-05T07:40:18.944321+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAXUH6KESXAU","created_at":"2026-07-05T07:40:18.944321+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAXUH6KESXAUJCOT","created_at":"2026-07-05T07:40:18.944321+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAXUH6KE","created_at":"2026-07-05T07:40:18.944321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XAXUH6KESXAUJCOTTEVXW7L5MN","json":"https://pith.science/pith/XAXUH6KESXAUJCOTTEVXW7L5MN.json","graph_json":"https://pith.science/api/pith-number/XAXUH6KESXAUJCOTTEVXW7L5MN/graph.json","events_json":"https://pith.science/api/pith-number/XAXUH6KESXAUJCOTTEVXW7L5MN/events.json","paper":"https://pith.science/paper/XAXUH6KE"},"agent_actions":{"view_html":"https://pith.science/pith/XAXUH6KESXAUJCOTTEVXW7L5MN","download_json":"https://pith.science/pith/XAXUH6KESXAUJCOTTEVXW7L5MN.json","view_paper":"https://pith.science/paper/XAXUH6KE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.09376&json=true","fetch_graph":"https://pith.science/api/pith-number/XAXUH6KESXAUJCOTTEVXW7L5MN/graph.json","fetch_events":"https://pith.science/api/pith-number/XAXUH6KESXAUJCOTTEVXW7L5MN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAXUH6KESXAUJCOTTEVXW7L5MN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAXUH6KESXAUJCOTTEVXW7L5MN/action/storage_attestation","attest_author":"https://pith.science/pith/XAXUH6KESXAUJCOTTEVXW7L5MN/action/author_attestation","sign_citation":"https://pith.science/pith/XAXUH6KESXAUJCOTTEVXW7L5MN/action/citation_signature","submit_replication":"https://pith.science/pith/XAXUH6KESXAUJCOTTEVXW7L5MN/action/replication_record"}},"created_at":"2026-07-05T07:40:18.944321+00:00","updated_at":"2026-07-05T07:40:18.944321+00:00"}