{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HQNWD4DOATY4C6SI6W4NLE3XJ3","short_pith_number":"pith:HQNWD4DO","schema_version":"1.0","canonical_sha256":"3c1b61f06e04f1c17a48f5b8d593774ee5924ff741100218c581f4806b688443","source":{"kind":"arxiv","id":"1511.03333","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Jinyu Xie, Xi Chen","submitted_at":"2015-11-10T23:09:47Z","abstract_excerpt":"We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions.\n  Given oracle access to an unknown Boolean function $f:\\{0,1\\}^n \\rightarrow \\{0,1\\}$ and sampling oracle access to an unknown distribution $\\mathcal{D}$ over $\\{0,1\\}^n$, we present an $\\tilde{O}(n^{1/3}/\\epsilon^5)$-query algorithm that tests whether $f$ is a monotone conjunction versus $\\epsilon$-far from any monotone conjunction with respect to $\\mathcal{D}$. This improves the previous best upper bound of $\\tilde{O}(n^{1/2}/\\epsilon)$ by Dolev and Ron when $1/\\epsilon$ is small compared to $"},"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":"1511.03333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-10T23:09:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"52fe0cda15a2703d84edac2e90a0306365607476d535f13c8d18ff082b317d23","abstract_canon_sha256":"e7c550ff4a20d7232e2fca09b91c4190601ef909c5ed2cf756d0e7e664569c52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:15.736650Z","signature_b64":"ikGFIEAz1KKz3fQbUk03rcr7DbYoFIdtpGyKVUDGXYw49gw63GEUddOppk7HKcBqD9QCXb7bV7yxaK+ery+ODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c1b61f06e04f1c17a48f5b8d593774ee5924ff741100218c581f4806b688443","last_reissued_at":"2026-05-18T01:27:15.735967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:15.735967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Jinyu Xie, Xi Chen","submitted_at":"2015-11-10T23:09:47Z","abstract_excerpt":"We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions.\n  Given oracle access to an unknown Boolean function $f:\\{0,1\\}^n \\rightarrow \\{0,1\\}$ and sampling oracle access to an unknown distribution $\\mathcal{D}$ over $\\{0,1\\}^n$, we present an $\\tilde{O}(n^{1/3}/\\epsilon^5)$-query algorithm that tests whether $f$ is a monotone conjunction versus $\\epsilon$-far from any monotone conjunction with respect to $\\mathcal{D}$. This improves the previous best upper bound of $\\tilde{O}(n^{1/2}/\\epsilon)$ by Dolev and Ron when $1/\\epsilon$ is small compared to $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03333","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":"1511.03333","created_at":"2026-05-18T01:27:15.736077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03333v1","created_at":"2026-05-18T01:27:15.736077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03333","created_at":"2026-05-18T01:27:15.736077+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQNWD4DOATY4","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQNWD4DOATY4C6SI","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQNWD4DO","created_at":"2026-05-18T12:29:25.134429+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/HQNWD4DOATY4C6SI6W4NLE3XJ3","json":"https://pith.science/pith/HQNWD4DOATY4C6SI6W4NLE3XJ3.json","graph_json":"https://pith.science/api/pith-number/HQNWD4DOATY4C6SI6W4NLE3XJ3/graph.json","events_json":"https://pith.science/api/pith-number/HQNWD4DOATY4C6SI6W4NLE3XJ3/events.json","paper":"https://pith.science/paper/HQNWD4DO"},"agent_actions":{"view_html":"https://pith.science/pith/HQNWD4DOATY4C6SI6W4NLE3XJ3","download_json":"https://pith.science/pith/HQNWD4DOATY4C6SI6W4NLE3XJ3.json","view_paper":"https://pith.science/paper/HQNWD4DO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03333&json=true","fetch_graph":"https://pith.science/api/pith-number/HQNWD4DOATY4C6SI6W4NLE3XJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/HQNWD4DOATY4C6SI6W4NLE3XJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQNWD4DOATY4C6SI6W4NLE3XJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQNWD4DOATY4C6SI6W4NLE3XJ3/action/storage_attestation","attest_author":"https://pith.science/pith/HQNWD4DOATY4C6SI6W4NLE3XJ3/action/author_attestation","sign_citation":"https://pith.science/pith/HQNWD4DOATY4C6SI6W4NLE3XJ3/action/citation_signature","submit_replication":"https://pith.science/pith/HQNWD4DOATY4C6SI6W4NLE3XJ3/action/replication_record"}},"created_at":"2026-05-18T01:27:15.736077+00:00","updated_at":"2026-05-18T01:27:15.736077+00:00"}