{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:PDL4UOIOZ2GVQPGEOJWBPEFW7C","short_pith_number":"pith:PDL4UOIO","schema_version":"1.0","canonical_sha256":"78d7ca390ece8d583cc4726c1790b6f8b57dddb88f6d5d1ab56858d6f9cad96b","source":{"kind":"arxiv","id":"quant-ph/0304073","version":1},"attestation_state":"computed","paper":{"title":"On deciding whether a Boolean function is constant or not","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fabio Benatti, Luca Marinatto","submitted_at":"2003-04-10T15:08:23Z","abstract_excerpt":"We study the probability of making an error if, by querying an oracle a fixed number of times, we declare constant a randomly chosen n-bit\n Boolean function. We compare the classical and the quantum case, and we determine for how many oracle-queries k and for how many bits n one querying procedure is more efficient than the other."},"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":"quant-ph/0304073","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-04-10T15:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"17f37f7ce2bcdb41e1f7fe19f7b61e339d4218308ccd1c885746bf37afaa5f72","abstract_canon_sha256":"7bd697bf5dad588e1aa7344f3e0003dec14a128ffe7ea92c565704557a4568b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:04.042238Z","signature_b64":"ldv7UVFng/3uJKSXOm9y0JPoufMVOJn/5nU1Swd5sSctROHf6lcBLU9PBbGGPhRkD5qcvPs8cHG4duKyN5/jCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78d7ca390ece8d583cc4726c1790b6f8b57dddb88f6d5d1ab56858d6f9cad96b","last_reissued_at":"2026-05-18T01:05:04.041565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:04.041565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On deciding whether a Boolean function is constant or not","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fabio Benatti, Luca Marinatto","submitted_at":"2003-04-10T15:08:23Z","abstract_excerpt":"We study the probability of making an error if, by querying an oracle a fixed number of times, we declare constant a randomly chosen n-bit\n Boolean function. We compare the classical and the quantum case, and we determine for how many oracle-queries k and for how many bits n one querying procedure is more efficient than the other."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0304073","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":"quant-ph/0304073","created_at":"2026-05-18T01:05:04.041671+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0304073v1","created_at":"2026-05-18T01:05:04.041671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0304073","created_at":"2026-05-18T01:05:04.041671+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDL4UOIOZ2GV","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDL4UOIOZ2GVQPGE","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDL4UOIO","created_at":"2026-05-18T12:25:52.051335+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/PDL4UOIOZ2GVQPGEOJWBPEFW7C","json":"https://pith.science/pith/PDL4UOIOZ2GVQPGEOJWBPEFW7C.json","graph_json":"https://pith.science/api/pith-number/PDL4UOIOZ2GVQPGEOJWBPEFW7C/graph.json","events_json":"https://pith.science/api/pith-number/PDL4UOIOZ2GVQPGEOJWBPEFW7C/events.json","paper":"https://pith.science/paper/PDL4UOIO"},"agent_actions":{"view_html":"https://pith.science/pith/PDL4UOIOZ2GVQPGEOJWBPEFW7C","download_json":"https://pith.science/pith/PDL4UOIOZ2GVQPGEOJWBPEFW7C.json","view_paper":"https://pith.science/paper/PDL4UOIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0304073&json=true","fetch_graph":"https://pith.science/api/pith-number/PDL4UOIOZ2GVQPGEOJWBPEFW7C/graph.json","fetch_events":"https://pith.science/api/pith-number/PDL4UOIOZ2GVQPGEOJWBPEFW7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDL4UOIOZ2GVQPGEOJWBPEFW7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDL4UOIOZ2GVQPGEOJWBPEFW7C/action/storage_attestation","attest_author":"https://pith.science/pith/PDL4UOIOZ2GVQPGEOJWBPEFW7C/action/author_attestation","sign_citation":"https://pith.science/pith/PDL4UOIOZ2GVQPGEOJWBPEFW7C/action/citation_signature","submit_replication":"https://pith.science/pith/PDL4UOIOZ2GVQPGEOJWBPEFW7C/action/replication_record"}},"created_at":"2026-05-18T01:05:04.041671+00:00","updated_at":"2026-05-18T01:05:04.041671+00:00"}