{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F75M5Q65HAHVTFK6QITOTYSMXO","short_pith_number":"pith:F75M5Q65","schema_version":"1.0","canonical_sha256":"2ffacec3dd380f59955e8226e9e24cbba4154ab6c62ef02af4c122b08ea4442d","source":{"kind":"arxiv","id":"1603.06505","version":6},"attestation_state":"computed","paper":{"title":"Characterizations of symmetrically partial Boolean functions with exact quantum query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Shenggen Zheng","submitted_at":"2016-03-21T17:24:04Z","abstract_excerpt":"We give and prove an optimal exact quantum query algorithm with complexity $k+1$ for computing the promise problem (i.e., symmetric and partial Boolean function) $DJ_n^k$ defined as: $DJ_n^k(x)=1$ for $|x|=n/2$, $DJ_n^k(x)=0$ for $|x|$ in the set $\\{0, 1,\\ldots, k, n-k, n-k+1,\\ldots,n\\}$, and it is undefined for the rest cases, where $n$ is even, $|x|$ is the Hamming weight of $x$. The case of $k=0$ is the well-known Deutsch-Jozsa problem. We outline all symmetric (and partial) Boolean functions with degrees 1 and 2, and prove their exact quantum query complexity. Then we prove that any symmet"},"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":"1603.06505","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-21T17:24:04Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"3875eb4c8cd366d1f77066f60e99adff3d4e8ca88f9ff9fdb789fb7dd5c1af0f","abstract_canon_sha256":"ceff3a1af5d04d102bfcbde111401a823545b22400dd2551489f82b8464b84c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:09.529023Z","signature_b64":"vXXR6XiLLuWPEev30Xv94Qu80EyrXQXSek9WtZGofkWxEuvoRCXF7W0HFSYALKuHKffLSERDbT6UTHnr7mq9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ffacec3dd380f59955e8226e9e24cbba4154ab6c62ef02af4c122b08ea4442d","last_reissued_at":"2026-05-18T00:43:09.528299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:09.528299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizations of symmetrically partial Boolean functions with exact quantum query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Shenggen Zheng","submitted_at":"2016-03-21T17:24:04Z","abstract_excerpt":"We give and prove an optimal exact quantum query algorithm with complexity $k+1$ for computing the promise problem (i.e., symmetric and partial Boolean function) $DJ_n^k$ defined as: $DJ_n^k(x)=1$ for $|x|=n/2$, $DJ_n^k(x)=0$ for $|x|$ in the set $\\{0, 1,\\ldots, k, n-k, n-k+1,\\ldots,n\\}$, and it is undefined for the rest cases, where $n$ is even, $|x|$ is the Hamming weight of $x$. The case of $k=0$ is the well-known Deutsch-Jozsa problem. We outline all symmetric (and partial) Boolean functions with degrees 1 and 2, and prove their exact quantum query complexity. Then we prove that any symmet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06505","kind":"arxiv","version":6},"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":"1603.06505","created_at":"2026-05-18T00:43:09.528438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06505v6","created_at":"2026-05-18T00:43:09.528438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06505","created_at":"2026-05-18T00:43:09.528438+00:00"},{"alias_kind":"pith_short_12","alias_value":"F75M5Q65HAHV","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F75M5Q65HAHVTFK6","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F75M5Q65","created_at":"2026-05-18T12:30:15.759754+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/F75M5Q65HAHVTFK6QITOTYSMXO","json":"https://pith.science/pith/F75M5Q65HAHVTFK6QITOTYSMXO.json","graph_json":"https://pith.science/api/pith-number/F75M5Q65HAHVTFK6QITOTYSMXO/graph.json","events_json":"https://pith.science/api/pith-number/F75M5Q65HAHVTFK6QITOTYSMXO/events.json","paper":"https://pith.science/paper/F75M5Q65"},"agent_actions":{"view_html":"https://pith.science/pith/F75M5Q65HAHVTFK6QITOTYSMXO","download_json":"https://pith.science/pith/F75M5Q65HAHVTFK6QITOTYSMXO.json","view_paper":"https://pith.science/paper/F75M5Q65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06505&json=true","fetch_graph":"https://pith.science/api/pith-number/F75M5Q65HAHVTFK6QITOTYSMXO/graph.json","fetch_events":"https://pith.science/api/pith-number/F75M5Q65HAHVTFK6QITOTYSMXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F75M5Q65HAHVTFK6QITOTYSMXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F75M5Q65HAHVTFK6QITOTYSMXO/action/storage_attestation","attest_author":"https://pith.science/pith/F75M5Q65HAHVTFK6QITOTYSMXO/action/author_attestation","sign_citation":"https://pith.science/pith/F75M5Q65HAHVTFK6QITOTYSMXO/action/citation_signature","submit_replication":"https://pith.science/pith/F75M5Q65HAHVTFK6QITOTYSMXO/action/replication_record"}},"created_at":"2026-05-18T00:43:09.528438+00:00","updated_at":"2026-05-18T00:43:09.528438+00:00"}