{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GCX5DNN7XDDVZYY55B4HRL6UHX","short_pith_number":"pith:GCX5DNN7","schema_version":"1.0","canonical_sha256":"30afd1b5bfb8c75ce31de87878afd43dcd2078d0bba4f15ccf545ebe06b290ac","source":{"kind":"arxiv","id":"2410.17958","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Convexity Testing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Anindya De, Erik Waingarten, Rocco A. Servedio, Shivam Nadimpalli, Xi Chen","submitted_at":"2024-10-23T15:27:59Z","abstract_excerpt":"We consider the problem of testing whether an unknown and arbitrary set $S \\subseteq \\mathbb{R}^n$ (given as a black-box membership oracle) is convex, versus $\\varepsilon$-far from every convex set, under the standard Gaussian distribution. The current state-of-the-art testing algorithms for this problem make $2^{\\tilde{O}(\\sqrt{n})\\cdot \\mathrm{poly}(1/\\varepsilon)}$ non-adaptive queries, both for the standard testing problem and for tolerant testing.\n  We give the first lower bounds for convexity testing in the black-box query model:\n  - We show that any one-sided tester (which may be adapti"},"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":"2410.17958","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-10-23T15:27:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f34bd44d8480a4cdd45b3197fa469c3ebdd6de4f0ab95472af92e6de74043b1c","abstract_canon_sha256":"d6e33fa33b4043fd6be6289fb858ecd88da15086918be11ded1ed8782b6c1acd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:47.452086Z","signature_b64":"XIO0v6MezjrujfYEvWfSK+Qw30iHkboYz8L/LKmHqhz22EuTDlw5IZtqShhw2IwtJIByAP0CEs3P03kxVN7rAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30afd1b5bfb8c75ce31de87878afd43dcd2078d0bba4f15ccf545ebe06b290ac","last_reissued_at":"2026-07-05T09:24:47.451572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:47.451572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Convexity Testing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Anindya De, Erik Waingarten, Rocco A. Servedio, Shivam Nadimpalli, Xi Chen","submitted_at":"2024-10-23T15:27:59Z","abstract_excerpt":"We consider the problem of testing whether an unknown and arbitrary set $S \\subseteq \\mathbb{R}^n$ (given as a black-box membership oracle) is convex, versus $\\varepsilon$-far from every convex set, under the standard Gaussian distribution. The current state-of-the-art testing algorithms for this problem make $2^{\\tilde{O}(\\sqrt{n})\\cdot \\mathrm{poly}(1/\\varepsilon)}$ non-adaptive queries, both for the standard testing problem and for tolerant testing.\n  We give the first lower bounds for convexity testing in the black-box query model:\n  - We show that any one-sided tester (which may be adapti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17958","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.17958/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.17958","created_at":"2026-07-05T09:24:47.451641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.17958v1","created_at":"2026-07-05T09:24:47.451641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17958","created_at":"2026-07-05T09:24:47.451641+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCX5DNN7XDDV","created_at":"2026-07-05T09:24:47.451641+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCX5DNN7XDDVZYY5","created_at":"2026-07-05T09:24:47.451641+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCX5DNN7","created_at":"2026-07-05T09:24:47.451641+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01573","citing_title":"Testing Unate Distributions","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCX5DNN7XDDVZYY55B4HRL6UHX","json":"https://pith.science/pith/GCX5DNN7XDDVZYY55B4HRL6UHX.json","graph_json":"https://pith.science/api/pith-number/GCX5DNN7XDDVZYY55B4HRL6UHX/graph.json","events_json":"https://pith.science/api/pith-number/GCX5DNN7XDDVZYY55B4HRL6UHX/events.json","paper":"https://pith.science/paper/GCX5DNN7"},"agent_actions":{"view_html":"https://pith.science/pith/GCX5DNN7XDDVZYY55B4HRL6UHX","download_json":"https://pith.science/pith/GCX5DNN7XDDVZYY55B4HRL6UHX.json","view_paper":"https://pith.science/paper/GCX5DNN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.17958&json=true","fetch_graph":"https://pith.science/api/pith-number/GCX5DNN7XDDVZYY55B4HRL6UHX/graph.json","fetch_events":"https://pith.science/api/pith-number/GCX5DNN7XDDVZYY55B4HRL6UHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCX5DNN7XDDVZYY55B4HRL6UHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCX5DNN7XDDVZYY55B4HRL6UHX/action/storage_attestation","attest_author":"https://pith.science/pith/GCX5DNN7XDDVZYY55B4HRL6UHX/action/author_attestation","sign_citation":"https://pith.science/pith/GCX5DNN7XDDVZYY55B4HRL6UHX/action/citation_signature","submit_replication":"https://pith.science/pith/GCX5DNN7XDDVZYY55B4HRL6UHX/action/replication_record"}},"created_at":"2026-07-05T09:24:47.451641+00:00","updated_at":"2026-07-05T09:24:47.451641+00:00"}