{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:K3WXGSTMJUNCIMAJSWQQHRG2GT","short_pith_number":"pith:K3WXGSTM","canonical_record":{"source":{"id":"1712.06239","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T03:34:10Z","cross_cats_sorted":["cs.CC","cs.CR","cs.SC"],"title_canon_sha256":"bc3f56b592fba0bd0ebe946b61996294baf1910dfa8caa1f7972e1b9a2f5dcab","abstract_canon_sha256":"37d01d181756513d8d8f3a474b8abcefd831587e2e1e572d684a73a5f15e264e"},"schema_version":"1.0"},"canonical_sha256":"56ed734a6c4d1a24300995a103c4da34c1a74b89741eba44fd45c1698355f354","source":{"kind":"arxiv","id":"1712.06239","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06239","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06239v3","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06239","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"K3WXGSTMJUNC","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K3WXGSTMJUNCIMAJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K3WXGSTM","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:K3WXGSTMJUNCIMAJSWQQHRG2GT","target":"record","payload":{"canonical_record":{"source":{"id":"1712.06239","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T03:34:10Z","cross_cats_sorted":["cs.CC","cs.CR","cs.SC"],"title_canon_sha256":"bc3f56b592fba0bd0ebe946b61996294baf1910dfa8caa1f7972e1b9a2f5dcab","abstract_canon_sha256":"37d01d181756513d8d8f3a474b8abcefd831587e2e1e572d684a73a5f15e264e"},"schema_version":"1.0"},"canonical_sha256":"56ed734a6c4d1a24300995a103c4da34c1a74b89741eba44fd45c1698355f354","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:54.892393Z","signature_b64":"3BNpVsYAwpHfNgneKMfIfsXjlLCHRqZy0zVPxBvfSTsD/Shq8sw/QzEEbGQxe0x/nKRIDY/xPry58jBYTthMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56ed734a6c4d1a24300995a103c4da34c1a74b89741eba44fd45c1698355f354","last_reissued_at":"2026-05-18T00:08:54.891653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:54.891653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.06239","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-05-18T00:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XxUhQOyFQPM56yOCpkXjM3WqdypGI6aAhOoBiajjaRA8wEA1/c8KVVqu1u5wEVwb298WH/oepzQzxH/XggfjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:53:32.694497Z"},"content_sha256":"498a74f05aa045543ff09a2799826782690741eb981aebb4c72ff939f6a0bbfe","schema_version":"1.0","event_id":"sha256:498a74f05aa045543ff09a2799826782690741eb981aebb4c72ff939f6a0bbfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:K3WXGSTMJUNCIMAJSWQQHRG2GT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","cs.SC"],"primary_cat":"quant-ph","authors_text":"Xiao-Shan Gao, Yu-Ao Chen","submitted_at":"2017-12-18T03:34:10Z","abstract_excerpt":"Decision of whether a Boolean equation system has a solution is an NPC problem and finding a solution is NP hard. In this paper, we present a quantum algorithm to decide whether a Boolean equation system FS has a solution and compute one if FS does have solutions with any given success probability. The runtime complexity of the algorithm is polynomial in the size of FS and the condition number of FS. As a consequence, we give a polynomial-time quantum algorithm for solving Boolean equation systems if their condition numbers are small, say polynomial in the size of FS. We apply our quantum algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06239","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":""},"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:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIvYNqbRtmeGWe680R0aTHKMVw/28j+ZhWe+jpX51xD2DAh3zR8Q8J/F8UmX+iuZzzTMZCOyRARw436NKFQkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:53:32.694850Z"},"content_sha256":"83683fb0139e79a223615c146f0dd7701a4c13110deba56562be79e7a12d30a9","schema_version":"1.0","event_id":"sha256:83683fb0139e79a223615c146f0dd7701a4c13110deba56562be79e7a12d30a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3WXGSTMJUNCIMAJSWQQHRG2GT/bundle.json","state_url":"https://pith.science/pith/K3WXGSTMJUNCIMAJSWQQHRG2GT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3WXGSTMJUNCIMAJSWQQHRG2GT/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-03T05:53:32Z","links":{"resolver":"https://pith.science/pith/K3WXGSTMJUNCIMAJSWQQHRG2GT","bundle":"https://pith.science/pith/K3WXGSTMJUNCIMAJSWQQHRG2GT/bundle.json","state":"https://pith.science/pith/K3WXGSTMJUNCIMAJSWQQHRG2GT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3WXGSTMJUNCIMAJSWQQHRG2GT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K3WXGSTMJUNCIMAJSWQQHRG2GT","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":"37d01d181756513d8d8f3a474b8abcefd831587e2e1e572d684a73a5f15e264e","cross_cats_sorted":["cs.CC","cs.CR","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T03:34:10Z","title_canon_sha256":"bc3f56b592fba0bd0ebe946b61996294baf1910dfa8caa1f7972e1b9a2f5dcab"},"schema_version":"1.0","source":{"id":"1712.06239","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06239","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06239v3","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06239","created_at":"2026-05-18T00:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"K3WXGSTMJUNC","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K3WXGSTMJUNCIMAJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K3WXGSTM","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:83683fb0139e79a223615c146f0dd7701a4c13110deba56562be79e7a12d30a9","target":"graph","created_at":"2026-05-18T00:08:54Z","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":"Decision of whether a Boolean equation system has a solution is an NPC problem and finding a solution is NP hard. In this paper, we present a quantum algorithm to decide whether a Boolean equation system FS has a solution and compute one if FS does have solutions with any given success probability. The runtime complexity of the algorithm is polynomial in the size of FS and the condition number of FS. As a consequence, we give a polynomial-time quantum algorithm for solving Boolean equation systems if their condition numbers are small, say polynomial in the size of FS. We apply our quantum algo","authors_text":"Xiao-Shan Gao, Yu-Ao Chen","cross_cats":["cs.CC","cs.CR","cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T03:34:10Z","title":"Quantum Algorithms for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06239","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:498a74f05aa045543ff09a2799826782690741eb981aebb4c72ff939f6a0bbfe","target":"record","created_at":"2026-05-18T00:08:54Z","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":"37d01d181756513d8d8f3a474b8abcefd831587e2e1e572d684a73a5f15e264e","cross_cats_sorted":["cs.CC","cs.CR","cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-18T03:34:10Z","title_canon_sha256":"bc3f56b592fba0bd0ebe946b61996294baf1910dfa8caa1f7972e1b9a2f5dcab"},"schema_version":"1.0","source":{"id":"1712.06239","kind":"arxiv","version":3}},"canonical_sha256":"56ed734a6c4d1a24300995a103c4da34c1a74b89741eba44fd45c1698355f354","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56ed734a6c4d1a24300995a103c4da34c1a74b89741eba44fd45c1698355f354","first_computed_at":"2026-05-18T00:08:54.891653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:54.891653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3BNpVsYAwpHfNgneKMfIfsXjlLCHRqZy0zVPxBvfSTsD/Shq8sw/QzEEbGQxe0x/nKRIDY/xPry58jBYTthMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:54.892393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06239","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:498a74f05aa045543ff09a2799826782690741eb981aebb4c72ff939f6a0bbfe","sha256:83683fb0139e79a223615c146f0dd7701a4c13110deba56562be79e7a12d30a9"],"state_sha256":"36c1869e639eb39ade57e4e0d32c7085418a86e502f28ebd689aa15c86a96748"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdtZ/8bkd5/g+L3fT5RcaEnvQYTdDuVIKD2q5BC3I/T/SKwXMJ2AWhGQ5T+M+afXR+4VkQqftqZTgQCZ9GK4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:53:32.696857Z","bundle_sha256":"334336608af1c700ef2173cc3a9e7c5d888c90d5616cdce0aae94192142d9a4a"}}