{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MYOXQNBZLFAAW4RA37QRDKAP6B","short_pith_number":"pith:MYOXQNBZ","schema_version":"1.0","canonical_sha256":"661d78343959400b7220dfe111a80ff053d5f13f90edd5060ed7d9606dc0299b","source":{"kind":"arxiv","id":"1908.02525","version":1},"attestation_state":"computed","paper":{"title":"Testing convexity of functions over finite domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abhinav Bommireddi, Aleksandrs Belovs, Eric Blais","submitted_at":"2019-08-07T10:50:45Z","abstract_excerpt":"We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains.\n  1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the upper bound $O(\\frac{\\log(\\epsilon n)}{\\epsilon})$ in the usual uniform model, and prove an $O(\\frac{\\log n}{\\epsilon})$ upper bound in the distribution-free setting.\n  2. We show a tight lower bound of $\\Omega(\\frac{\\log(\\epsilon n)}{\\epsilon})$ queries for testing convexity of functions $f: [n] \\rightarrow \\mathbb{R}$ on the line. This lower bound applies t"},"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":"1908.02525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-07T10:50:45Z","cross_cats_sorted":[],"title_canon_sha256":"98b7d22f6a1034cfab38d176f92e843d4a9ac47da6d4902af0fa876982458484","abstract_canon_sha256":"d1399d6ea750309bc6feac815c54ea2002bbd8114901f63d17a63df24e6322fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:09.887020Z","signature_b64":"9WakjFI1loo2p4vtRTUz1M0tAB5xZ7nK8Rj2VmChlZzwvIdE7RcsP0qCS5lDQpFpahYZfOyY3xHiPa48x1/NCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"661d78343959400b7220dfe111a80ff053d5f13f90edd5060ed7d9606dc0299b","last_reissued_at":"2026-07-04T23:52:09.886599Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:09.886599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing convexity of functions over finite domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abhinav Bommireddi, Aleksandrs Belovs, Eric Blais","submitted_at":"2019-08-07T10:50:45Z","abstract_excerpt":"We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains.\n  1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the upper bound $O(\\frac{\\log(\\epsilon n)}{\\epsilon})$ in the usual uniform model, and prove an $O(\\frac{\\log n}{\\epsilon})$ upper bound in the distribution-free setting.\n  2. We show a tight lower bound of $\\Omega(\\frac{\\log(\\epsilon n)}{\\epsilon})$ queries for testing convexity of functions $f: [n] \\rightarrow \\mathbb{R}$ on the line. This lower bound applies t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02525","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/1908.02525/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":"1908.02525","created_at":"2026-07-04T23:52:09.886657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02525v1","created_at":"2026-07-04T23:52:09.886657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02525","created_at":"2026-07-04T23:52:09.886657+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYOXQNBZLFAA","created_at":"2026-07-04T23:52:09.886657+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYOXQNBZLFAAW4RA","created_at":"2026-07-04T23:52:09.886657+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYOXQNBZ","created_at":"2026-07-04T23:52:09.886657+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/MYOXQNBZLFAAW4RA37QRDKAP6B","json":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B.json","graph_json":"https://pith.science/api/pith-number/MYOXQNBZLFAAW4RA37QRDKAP6B/graph.json","events_json":"https://pith.science/api/pith-number/MYOXQNBZLFAAW4RA37QRDKAP6B/events.json","paper":"https://pith.science/paper/MYOXQNBZ"},"agent_actions":{"view_html":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B","download_json":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B.json","view_paper":"https://pith.science/paper/MYOXQNBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02525&json=true","fetch_graph":"https://pith.science/api/pith-number/MYOXQNBZLFAAW4RA37QRDKAP6B/graph.json","fetch_events":"https://pith.science/api/pith-number/MYOXQNBZLFAAW4RA37QRDKAP6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/action/storage_attestation","attest_author":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/action/author_attestation","sign_citation":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/action/citation_signature","submit_replication":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/action/replication_record"}},"created_at":"2026-07-04T23:52:09.886657+00:00","updated_at":"2026-07-04T23:52:09.886657+00:00"}