{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C2AEHWBQTNP4VQGUIS5B4NE7G3","short_pith_number":"pith:C2AEHWBQ","canonical_record":{"source":{"id":"1708.05786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-19T00:20:44Z","cross_cats_sorted":[],"title_canon_sha256":"fad28e1a428fa842e8afd6265005deb751042aa49f47ee17986eebb4d602546d","abstract_canon_sha256":"8043c2d38e7b83da3d1bf490ead63119b20119f39018fb2a6c5db78fb38ca99a"},"schema_version":"1.0"},"canonical_sha256":"168043d8309b5fcac0d444ba1e349f36ca449731008c3e98ca2ad2f87500cff4","source":{"kind":"arxiv","id":"1708.05786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05786","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05786v1","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05786","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"C2AEHWBQTNP4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C2AEHWBQTNP4VQGU","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C2AEHWBQ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C2AEHWBQTNP4VQGUIS5B4NE7G3","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-19T00:20:44Z","cross_cats_sorted":[],"title_canon_sha256":"fad28e1a428fa842e8afd6265005deb751042aa49f47ee17986eebb4d602546d","abstract_canon_sha256":"8043c2d38e7b83da3d1bf490ead63119b20119f39018fb2a6c5db78fb38ca99a"},"schema_version":"1.0"},"canonical_sha256":"168043d8309b5fcac0d444ba1e349f36ca449731008c3e98ca2ad2f87500cff4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:44.318059Z","signature_b64":"P6GmsQjYfNiVXehScPA2WruNSu6f2k3g0G3+f0WwfoC75kregG7NuRzomEewIjD9aHrCr5UEC0Z0Hm50RRdHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"168043d8309b5fcac0d444ba1e349f36ca449731008c3e98ca2ad2f87500cff4","last_reissued_at":"2026-05-18T00:37:44.317396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:44.317396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05786","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-18T00:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfMTB+fU70SYz9eIScxSpD+E/T0lg8EvWb04+nLzEmQiEbcsi7hhmnHweOzpZUIg66XNwu45Td5pZzHh0LAnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T01:04:32.580149Z"},"content_sha256":"08558a1f7d77d777bf2075b4e22f14cdb330d97df00a09751553deec37a79433","schema_version":"1.0","event_id":"sha256:08558a1f7d77d777bf2075b4e22f14cdb330d97df00a09751553deec37a79433"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C2AEHWBQTNP4VQGUIS5B4NE7G3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boolean Unateness Testing with $\\widetilde{O}(n^{3/4})$ Adaptive Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik Waingarten, Jinyu Xie, Xi Chen","submitted_at":"2017-08-19T00:20:44Z","abstract_excerpt":"We give an adaptive algorithm which tests whether an unknown Boolean function $f\\colon \\{0, 1\\}^n \\to\\{0, 1\\}$ is unate, i.e. every variable of $f$ is either non-decreasing or non-increasing, or $\\epsilon$-far from unate with one-sided error using $\\widetilde{O}(n^{3/4}/\\epsilon^2)$ queries. This improves on the best adaptive $O(n/\\epsilon)$-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova and Seshadhri when $1/\\epsilon \\ll n^{1/4}$. Combined with the $\\widetilde{\\Omega}(n)$-query lower bound for non-adaptive algorithms with one-sided error of [CWX17, BCPRS17], we conclude"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05786","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-18T00:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LNjOvPPYmO+yULiytaoEk3Vc8TyedefFNMa22KfVjy0L2fzVGG2oQNK/hsXhnYBF2R0d/iRaQjyf2SZaAiPPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T01:04:32.580611Z"},"content_sha256":"649b53d5ca7fdfd479a1f054065438893b83ba8b7c1380a10879929cba5aff69","schema_version":"1.0","event_id":"sha256:649b53d5ca7fdfd479a1f054065438893b83ba8b7c1380a10879929cba5aff69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2AEHWBQTNP4VQGUIS5B4NE7G3/bundle.json","state_url":"https://pith.science/pith/C2AEHWBQTNP4VQGUIS5B4NE7G3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2AEHWBQTNP4VQGUIS5B4NE7G3/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-08-23T01:04:32Z","links":{"resolver":"https://pith.science/pith/C2AEHWBQTNP4VQGUIS5B4NE7G3","bundle":"https://pith.science/pith/C2AEHWBQTNP4VQGUIS5B4NE7G3/bundle.json","state":"https://pith.science/pith/C2AEHWBQTNP4VQGUIS5B4NE7G3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2AEHWBQTNP4VQGUIS5B4NE7G3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C2AEHWBQTNP4VQGUIS5B4NE7G3","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":"8043c2d38e7b83da3d1bf490ead63119b20119f39018fb2a6c5db78fb38ca99a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-19T00:20:44Z","title_canon_sha256":"fad28e1a428fa842e8afd6265005deb751042aa49f47ee17986eebb4d602546d"},"schema_version":"1.0","source":{"id":"1708.05786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05786","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05786v1","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05786","created_at":"2026-05-18T00:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"C2AEHWBQTNP4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C2AEHWBQTNP4VQGU","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C2AEHWBQ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:649b53d5ca7fdfd479a1f054065438893b83ba8b7c1380a10879929cba5aff69","target":"graph","created_at":"2026-05-18T00:37:44Z","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":"We give an adaptive algorithm which tests whether an unknown Boolean function $f\\colon \\{0, 1\\}^n \\to\\{0, 1\\}$ is unate, i.e. every variable of $f$ is either non-decreasing or non-increasing, or $\\epsilon$-far from unate with one-sided error using $\\widetilde{O}(n^{3/4}/\\epsilon^2)$ queries. This improves on the best adaptive $O(n/\\epsilon)$-query algorithm from Baleshzar, Chakrabarty, Pallavoor, Raskhodnikova and Seshadhri when $1/\\epsilon \\ll n^{1/4}$. Combined with the $\\widetilde{\\Omega}(n)$-query lower bound for non-adaptive algorithms with one-sided error of [CWX17, BCPRS17], we conclude","authors_text":"Erik Waingarten, Jinyu Xie, Xi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-19T00:20:44Z","title":"Boolean Unateness Testing with $\\widetilde{O}(n^{3/4})$ Adaptive Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05786","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:08558a1f7d77d777bf2075b4e22f14cdb330d97df00a09751553deec37a79433","target":"record","created_at":"2026-05-18T00:37:44Z","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":"8043c2d38e7b83da3d1bf490ead63119b20119f39018fb2a6c5db78fb38ca99a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-08-19T00:20:44Z","title_canon_sha256":"fad28e1a428fa842e8afd6265005deb751042aa49f47ee17986eebb4d602546d"},"schema_version":"1.0","source":{"id":"1708.05786","kind":"arxiv","version":1}},"canonical_sha256":"168043d8309b5fcac0d444ba1e349f36ca449731008c3e98ca2ad2f87500cff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"168043d8309b5fcac0d444ba1e349f36ca449731008c3e98ca2ad2f87500cff4","first_computed_at":"2026-05-18T00:37:44.317396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:44.317396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P6GmsQjYfNiVXehScPA2WruNSu6f2k3g0G3+f0WwfoC75kregG7NuRzomEewIjD9aHrCr5UEC0Z0Hm50RRdHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:44.318059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08558a1f7d77d777bf2075b4e22f14cdb330d97df00a09751553deec37a79433","sha256:649b53d5ca7fdfd479a1f054065438893b83ba8b7c1380a10879929cba5aff69"],"state_sha256":"e496305e32469e025b1075f6162245755e81185d06d7dbd5e445f77b26fb52a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgHHhmTXeisKSP6SX9mKVel7mUlZOzV75CnnHPcQ2ATNr4uB2z2mTmOhdPQJwTAmAs6CEe2blwVCxzYc0EZ5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T01:04:32.584892Z","bundle_sha256":"52aca960b373f28a34c3971f0aa2a9404073bfed026681fd89a1d606709831a1"}}