{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JDSR3HKRKNXYJJEG65Z7P3ND7V","short_pith_number":"pith:JDSR3HKR","schema_version":"1.0","canonical_sha256":"48e51d9d51536f84a486f773f7eda3fd4e19f36f30c47940f17c4130565269df","source":{"kind":"arxiv","id":"1301.4461","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.4461","created_at":"2026-05-18T03:36:05.376850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4461v1","created_at":"2026-05-18T03:36:05.376850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4461","created_at":"2026-05-18T03:36:05.376850+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDSR3HKRKNXY","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDSR3HKRKNXYJJEG","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDSR3HKR","created_at":"2026-05-18T12:27:49.015174+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/JDSR3HKRKNXYJJEG65Z7P3ND7V","json":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V.json","graph_json":"https://pith.science/api/pith-number/JDSR3HKRKNXYJJEG65Z7P3ND7V/graph.json","events_json":"https://pith.science/api/pith-number/JDSR3HKRKNXYJJEG65Z7P3ND7V/events.json","paper":"https://pith.science/paper/JDSR3HKR"},"agent_actions":{"view_html":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V","download_json":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V.json","view_paper":"https://pith.science/paper/JDSR3HKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4461&json=true","fetch_graph":"https://pith.science/api/pith-number/JDSR3HKRKNXYJJEG65Z7P3ND7V/graph.json","fetch_events":"https://pith.science/api/pith-number/JDSR3HKRKNXYJJEG65Z7P3ND7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/action/storage_attestation","attest_author":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/action/author_attestation","sign_citation":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/action/citation_signature","submit_replication":"https://pith.science/pith/JDSR3HKRKNXYJJEG65Z7P3ND7V/action/replication_record"}},"created_at":"2026-05-18T03:36:05.376850+00:00","updated_at":"2026-05-18T03:36:05.376850+00:00"}