{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AOYUC4EAQYW45OJQTILXTBCCEU","short_pith_number":"pith:AOYUC4EA","canonical_record":{"source":{"id":"1802.03856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T01:26:36Z","cross_cats_sorted":["cs.CC","cs.CR","quant-ph"],"title_canon_sha256":"7a268e4f5b917dcd621b9c5e317ffe83c5dadaf06d0e9aedd442169dbede8f3e","abstract_canon_sha256":"a53de98a65be85ca24016852ba67dbf9d78eaa3568a449f3ebe5900a1fddc9f4"},"schema_version":"1.0"},"canonical_sha256":"03b1417080862dceb9309a177984422507276f4757e15da3d44d59617921d455","source":{"kind":"arxiv","id":"1802.03856","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03856","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03856v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03856","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"AOYUC4EAQYW4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AOYUC4EAQYW45OJQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AOYUC4EA","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AOYUC4EAQYW45OJQTILXTBCCEU","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T01:26:36Z","cross_cats_sorted":["cs.CC","cs.CR","quant-ph"],"title_canon_sha256":"7a268e4f5b917dcd621b9c5e317ffe83c5dadaf06d0e9aedd442169dbede8f3e","abstract_canon_sha256":"a53de98a65be85ca24016852ba67dbf9d78eaa3568a449f3ebe5900a1fddc9f4"},"schema_version":"1.0"},"canonical_sha256":"03b1417080862dceb9309a177984422507276f4757e15da3d44d59617921d455","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.477110Z","signature_b64":"VArtXaJ7iiacuA1IYO8Ne9zCGwJHKbc4yJBpEHMILeadBQV/Hv0dC/6dXGafbQj0bj5GaKar85Gk6l67ozuODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03b1417080862dceb9309a177984422507276f4757e15da3d44d59617921d455","last_reissued_at":"2026-05-18T00:03:56.476413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.476413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03856","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-05-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wyeuz5XR4OsS6qfELXRvNKjlVIRsrYPj30ljMchal5AS7iPMlzn4QGrkXzYu58aGUXO2BA4MVGhw8qqzNYSAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:29:57.305483Z"},"content_sha256":"debd580a36084deecd61dc292fb80612e449f89d0cc8c27f297168168da9fb48","schema_version":"1.0","event_id":"sha256:debd580a36084deecd61dc292fb80612e449f89d0cc8c27f297168168da9fb48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AOYUC4EAQYW45OJQTILXTBCCEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Algorithm for Optimization and Polynomial System Solving over Finite Field and Application to Cryptanalysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","quant-ph"],"primary_cat":"cs.SC","authors_text":"Chun-Ming Yuan, Xiao-Shan Gao, Yu-Ao Chen","submitted_at":"2018-02-12T01:26:36Z","abstract_excerpt":"In this paper, we give quantum algorithms for two fundamental computation problems: solving polynomial systems over finite fields and optimization where the arguments of the objective function and constraints take values from a finite field or a bounded interval of integers. The quantum algorithms can solve these problems with any given success probability and have polynomial runtime complexities in the size of the input, the degree of the inequality constraints, and the condition number of certain matrices derived from the problem. So, we achieved exponential speedup for these problems when t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03856","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":""},"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-05-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1EzEggFtr2NjzokysFXDuNmYxY/rXH1Rb/3KDHkp2Kthd5KXgZgpccA0sOS6Nt0Vv05gJx7cvosAuIeqh1OlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:29:57.305853Z"},"content_sha256":"4b00db243d10605aa148dc0723af677b4770be4c89090ffada3d0ccf63693188","schema_version":"1.0","event_id":"sha256:4b00db243d10605aa148dc0723af677b4770be4c89090ffada3d0ccf63693188"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOYUC4EAQYW45OJQTILXTBCCEU/bundle.json","state_url":"https://pith.science/pith/AOYUC4EAQYW45OJQTILXTBCCEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOYUC4EAQYW45OJQTILXTBCCEU/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-06-02T20:29:57Z","links":{"resolver":"https://pith.science/pith/AOYUC4EAQYW45OJQTILXTBCCEU","bundle":"https://pith.science/pith/AOYUC4EAQYW45OJQTILXTBCCEU/bundle.json","state":"https://pith.science/pith/AOYUC4EAQYW45OJQTILXTBCCEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOYUC4EAQYW45OJQTILXTBCCEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AOYUC4EAQYW45OJQTILXTBCCEU","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":"a53de98a65be85ca24016852ba67dbf9d78eaa3568a449f3ebe5900a1fddc9f4","cross_cats_sorted":["cs.CC","cs.CR","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T01:26:36Z","title_canon_sha256":"7a268e4f5b917dcd621b9c5e317ffe83c5dadaf06d0e9aedd442169dbede8f3e"},"schema_version":"1.0","source":{"id":"1802.03856","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03856","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03856v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03856","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"AOYUC4EAQYW4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AOYUC4EAQYW45OJQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AOYUC4EA","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:4b00db243d10605aa148dc0723af677b4770be4c89090ffada3d0ccf63693188","target":"graph","created_at":"2026-05-18T00:03:56Z","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"},"paper":{"abstract_excerpt":"In this paper, we give quantum algorithms for two fundamental computation problems: solving polynomial systems over finite fields and optimization where the arguments of the objective function and constraints take values from a finite field or a bounded interval of integers. The quantum algorithms can solve these problems with any given success probability and have polynomial runtime complexities in the size of the input, the degree of the inequality constraints, and the condition number of certain matrices derived from the problem. So, we achieved exponential speedup for these problems when t","authors_text":"Chun-Ming Yuan, Xiao-Shan Gao, Yu-Ao Chen","cross_cats":["cs.CC","cs.CR","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T01:26:36Z","title":"Quantum Algorithm for Optimization and Polynomial System Solving over Finite Field and Application to Cryptanalysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03856","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:debd580a36084deecd61dc292fb80612e449f89d0cc8c27f297168168da9fb48","target":"record","created_at":"2026-05-18T00:03:56Z","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":"a53de98a65be85ca24016852ba67dbf9d78eaa3568a449f3ebe5900a1fddc9f4","cross_cats_sorted":["cs.CC","cs.CR","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-02-12T01:26:36Z","title_canon_sha256":"7a268e4f5b917dcd621b9c5e317ffe83c5dadaf06d0e9aedd442169dbede8f3e"},"schema_version":"1.0","source":{"id":"1802.03856","kind":"arxiv","version":2}},"canonical_sha256":"03b1417080862dceb9309a177984422507276f4757e15da3d44d59617921d455","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03b1417080862dceb9309a177984422507276f4757e15da3d44d59617921d455","first_computed_at":"2026-05-18T00:03:56.476413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:56.476413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VArtXaJ7iiacuA1IYO8Ne9zCGwJHKbc4yJBpEHMILeadBQV/Hv0dC/6dXGafbQj0bj5GaKar85Gk6l67ozuODA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:56.477110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03856","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:debd580a36084deecd61dc292fb80612e449f89d0cc8c27f297168168da9fb48","sha256:4b00db243d10605aa148dc0723af677b4770be4c89090ffada3d0ccf63693188"],"state_sha256":"e34670685cf0776a3f3f7fc5d0b63bb037f1d0c0eec24208172ead45439c21ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYLL3r5o0jvgWsyRP1j8oToykW3KOcG07ZBblDgGE1UbKbWnZJ4fp2eK4tb9cHuIXE6i9/8SGP5YD84KN/kpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:29:57.308612Z","bundle_sha256":"cc6a95e27c341816ef14a5b511d7b1c86d59d859e50a1ddf241edd6f21523f17"}}