{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JDSR3HKRKNXYJJEG65Z7P3ND7V","short_pith_number":"pith:JDSR3HKR","canonical_record":{"source":{"id":"1301.4461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T18:56:08Z","cross_cats_sorted":[],"title_canon_sha256":"f4dcdc0e102bd4c3da7aaedb0eff501d0de32a68bf4689c20e16d4989afd80ca","abstract_canon_sha256":"6d61569c9c286bffdfdae23e9d75229138851ab913deddb7364521d42d74ed9d"},"schema_version":"1.0"},"canonical_sha256":"48e51d9d51536f84a486f773f7eda3fd4e19f36f30c47940f17c4130565269df","source":{"kind":"arxiv","id":"1301.4461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4461","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4461v1","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4461","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"JDSR3HKRKNXY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JDSR3HKRKNXYJJEG","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JDSR3HKR","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JDSR3HKRKNXYJJEG65Z7P3ND7V","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T18:56:08Z","cross_cats_sorted":[],"title_canon_sha256":"f4dcdc0e102bd4c3da7aaedb0eff501d0de32a68bf4689c20e16d4989afd80ca","abstract_canon_sha256":"6d61569c9c286bffdfdae23e9d75229138851ab913deddb7364521d42d74ed9d"},"schema_version":"1.0"},"canonical_sha256":"48e51d9d51536f84a486f773f7eda3fd4e19f36f30c47940f17c4130565269df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:05.377264Z","signature_b64":"4Nldrm2FFCZXQ8aZ3iQkQp0XLBrSpbQ/lhsnYV73zvrB+kaLFjnlPOBKQ19mAbwvhesmfPeSNDriSaw4nfgFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48e51d9d51536f84a486f773f7eda3fd4e19f36f30c47940f17c4130565269df","last_reissued_at":"2026-05-18T03:36:05.376758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:05.376758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4461","source_version":1,"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-18T03:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCK2mnNTbBgRtbOxNiZbpnut57XzGeGJJaMw/RVj+5G15/zQ41d0aKtX/D3QpjRHsgd9M+ND59CK+lo7dW7lCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:41:06.302304Z"},"content_sha256":"0416567c547234d17629fa216b39471ca9aebb35bb8a4e4b809b4b44fc95a9e9","schema_version":"1.0","event_id":"sha256:0416567c547234d17629fa216b39471ca9aebb35bb8a4e4b809b4b44fc95a9e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JDSR3HKRKNXYJJEG65Z7P3ND7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sure-Success Quantum Algorithms on Weight Decision Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"K. Uyanik, S. Turgut","submitted_at":"2013-01-18T18:56:08Z","abstract_excerpt":"Conditions on sure-success decidability of weights of Boolean functions are presented for a given number of generalized Grover iterations. It is shown that the decidability problem reduces to a system of algebraic equations of a single variable. For problems that require a large number of iterations, it is observed that the iteration number of sure-success quantum algorithms scale as the square root of the iteration number of the corresponding classical probabilistic algorithms. It is also demonstrated that for a few iterations, quantum algorithms can be more efficient than this."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4461","kind":"arxiv","version":1},"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-18T03:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8TK0rY9VdadBiJyLlPBKs09bxR/s9WMV0pcxsQ0s5OIfJGDPyFtit6QbXedcxVpIh1zGZmeFS+9w3diGQWjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:41:06.302658Z"},"content_sha256":"15cda13da0c6c46bb849a1c32eeda934d67ec47eda47772948439111a30c4770","schema_version":"1.0","event_id":"sha256:15cda13da0c6c46bb849a1c32eeda934d67ec47eda47772948439111a30c4770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/bundle.json","state_url":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/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-28T09:41:06Z","links":{"resolver":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V","bundle":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/bundle.json","state":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JDSR3HKRKNXYJJEG65Z7P3ND7V","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":"6d61569c9c286bffdfdae23e9d75229138851ab913deddb7364521d42d74ed9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T18:56:08Z","title_canon_sha256":"f4dcdc0e102bd4c3da7aaedb0eff501d0de32a68bf4689c20e16d4989afd80ca"},"schema_version":"1.0","source":{"id":"1301.4461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4461","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4461v1","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4461","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"JDSR3HKRKNXY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JDSR3HKRKNXYJJEG","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JDSR3HKR","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:15cda13da0c6c46bb849a1c32eeda934d67ec47eda47772948439111a30c4770","target":"graph","created_at":"2026-05-18T03:36:05Z","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":"Conditions on sure-success decidability of weights of Boolean functions are presented for a given number of generalized Grover iterations. It is shown that the decidability problem reduces to a system of algebraic equations of a single variable. For problems that require a large number of iterations, it is observed that the iteration number of sure-success quantum algorithms scale as the square root of the iteration number of the corresponding classical probabilistic algorithms. It is also demonstrated that for a few iterations, quantum algorithms can be more efficient than this.","authors_text":"K. Uyanik, S. Turgut","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T18:56:08Z","title":"Sure-Success Quantum Algorithms on Weight Decision Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4461","kind":"arxiv","version":1},"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:0416567c547234d17629fa216b39471ca9aebb35bb8a4e4b809b4b44fc95a9e9","target":"record","created_at":"2026-05-18T03:36:05Z","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":"6d61569c9c286bffdfdae23e9d75229138851ab913deddb7364521d42d74ed9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T18:56:08Z","title_canon_sha256":"f4dcdc0e102bd4c3da7aaedb0eff501d0de32a68bf4689c20e16d4989afd80ca"},"schema_version":"1.0","source":{"id":"1301.4461","kind":"arxiv","version":1}},"canonical_sha256":"48e51d9d51536f84a486f773f7eda3fd4e19f36f30c47940f17c4130565269df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48e51d9d51536f84a486f773f7eda3fd4e19f36f30c47940f17c4130565269df","first_computed_at":"2026-05-18T03:36:05.376758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:05.376758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Nldrm2FFCZXQ8aZ3iQkQp0XLBrSpbQ/lhsnYV73zvrB+kaLFjnlPOBKQ19mAbwvhesmfPeSNDriSaw4nfgFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:05.377264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0416567c547234d17629fa216b39471ca9aebb35bb8a4e4b809b4b44fc95a9e9","sha256:15cda13da0c6c46bb849a1c32eeda934d67ec47eda47772948439111a30c4770"],"state_sha256":"2f4384c5d501dba7b9e05cd87a0694124b1ffb3225d6b32c88f589b74abde533"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T03JcYYh6TIoixuCSDVntezJDS2iA/3QXeYm/80loiyIGF8KrSunL68f2hfxBn66ZpEifp1PAVVY7rbwBZt3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T09:41:06.304482Z","bundle_sha256":"89daae914a25429698e7fd061f00aab65d4e13b06579ce55bb875dd59357b8c4"}}