{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SJ3UTCLL6XC2UAAEEVJMM2YMTJ","short_pith_number":"pith:SJ3UTCLL","schema_version":"1.0","canonical_sha256":"927749896bf5c5aa00042552c66b0c9a50b830431e92b25e2d40824eed07ca9e","source":{"kind":"arxiv","id":"1608.06980","version":2},"attestation_state":"computed","paper":{"title":"A $\\widetilde{O}(n)$ Non-Adaptive Tester for Unateness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Deeparnab Chakrabarty","submitted_at":"2016-08-24T22:20:43Z","abstract_excerpt":"Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, $O(n \\log(n)/\\varepsilon)$-query tester for unateness of Boolean functions $f:\\{0,1\\}^n \\to \\{0,1\\}$. In this note we describe a simple non-adaptive, $O(n \\log(n/\\varepsilon)/\\varepsilon)$ -query tester for unateness for functions over the hypercube with any ordered range."},"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":"1608.06980","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-24T22:20:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cfb5d4063a9fa7bd9f6dfa5bb7cc80e8bca05e30b7f05f79e1ccd2a543fd3e13","abstract_canon_sha256":"f2cb2b44751301c2de83d5740dd77d1c65ab2f425e1752c245a506e126f133a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:20.294203Z","signature_b64":"8Y0TCr/Jwidvut1EuYEW+A6xqGGfqDjf5PryO0NQwKVEy55dwoFR45tblUxxGoGqZzvJLkinnoleXAx3fpFTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"927749896bf5c5aa00042552c66b0c9a50b830431e92b25e2d40824eed07ca9e","last_reissued_at":"2026-05-18T01:06:20.293464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:20.293464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $\\widetilde{O}(n)$ Non-Adaptive Tester for Unateness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Deeparnab Chakrabarty","submitted_at":"2016-08-24T22:20:43Z","abstract_excerpt":"Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, $O(n \\log(n)/\\varepsilon)$-query tester for unateness of Boolean functions $f:\\{0,1\\}^n \\to \\{0,1\\}$. In this note we describe a simple non-adaptive, $O(n \\log(n/\\varepsilon)/\\varepsilon)$ -query tester for unateness for functions over the hypercube with any ordered range."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06980","kind":"arxiv","version":2},"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":"1608.06980","created_at":"2026-05-18T01:06:20.293579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06980v2","created_at":"2026-05-18T01:06:20.293579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06980","created_at":"2026-05-18T01:06:20.293579+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJ3UTCLL6XC2","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJ3UTCLL6XC2UAAE","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJ3UTCLL","created_at":"2026-05-18T12:30:44.179134+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/SJ3UTCLL6XC2UAAEEVJMM2YMTJ","json":"https://pith.science/pith/SJ3UTCLL6XC2UAAEEVJMM2YMTJ.json","graph_json":"https://pith.science/api/pith-number/SJ3UTCLL6XC2UAAEEVJMM2YMTJ/graph.json","events_json":"https://pith.science/api/pith-number/SJ3UTCLL6XC2UAAEEVJMM2YMTJ/events.json","paper":"https://pith.science/paper/SJ3UTCLL"},"agent_actions":{"view_html":"https://pith.science/pith/SJ3UTCLL6XC2UAAEEVJMM2YMTJ","download_json":"https://pith.science/pith/SJ3UTCLL6XC2UAAEEVJMM2YMTJ.json","view_paper":"https://pith.science/paper/SJ3UTCLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06980&json=true","fetch_graph":"https://pith.science/api/pith-number/SJ3UTCLL6XC2UAAEEVJMM2YMTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SJ3UTCLL6XC2UAAEEVJMM2YMTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJ3UTCLL6XC2UAAEEVJMM2YMTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJ3UTCLL6XC2UAAEEVJMM2YMTJ/action/storage_attestation","attest_author":"https://pith.science/pith/SJ3UTCLL6XC2UAAEEVJMM2YMTJ/action/author_attestation","sign_citation":"https://pith.science/pith/SJ3UTCLL6XC2UAAEEVJMM2YMTJ/action/citation_signature","submit_replication":"https://pith.science/pith/SJ3UTCLL6XC2UAAEEVJMM2YMTJ/action/replication_record"}},"created_at":"2026-05-18T01:06:20.293579+00:00","updated_at":"2026-05-18T01:06:20.293579+00:00"}