{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MYOXQNBZLFAAW4RA37QRDKAP6B","short_pith_number":"pith:MYOXQNBZ","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"},"canonical_sha256":"661d78343959400b7220dfe111a80ff053d5f13f90edd5060ed7d9606dc0299b","source":{"kind":"arxiv","id":"1908.02525","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02525","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02525v1","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02525","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"MYOXQNBZLFAA","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"pith_short_16","alias_value":"MYOXQNBZLFAAW4RA","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"pith_short_8","alias_value":"MYOXQNBZ","created_at":"2026-07-04T23:52:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MYOXQNBZLFAAW4RA37QRDKAP6B","target":"record","payload":{"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"},"canonical_sha256":"661d78343959400b7220dfe111a80ff053d5f13f90edd5060ed7d9606dc0299b","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"},"source_kind":"arxiv","source_id":"1908.02525","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-07-04T23:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9fMiXqqVEJmJwcrI7bVjDxjVXZSPRQ7ta0De+TRFPWA7WIPaDjmaaulb295LdOwb7uuHRWvZza8BvbfFhybcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:44:43.311199Z"},"content_sha256":"eb360c40dcc89f4ecca20cc56b052e9ad40ba10cad3a66117c8a945062313d7d","schema_version":"1.0","event_id":"sha256:eb360c40dcc89f4ecca20cc56b052e9ad40ba10cad3a66117c8a945062313d7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MYOXQNBZLFAAW4RA37QRDKAP6B","target":"graph","payload":{"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"},"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-07-04T23:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2P9WFZ0xPl8vKGkjBCj/luwgqpHyLRv5qXZ7N6zDoZ6ltfqg1BOQrmZLMKInQdPX6XtahOKT9NMJ0H/6p5zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:44:43.312146Z"},"content_sha256":"29edc4bebddb3762c59355e3908781f178c343f648c3758626f41856e24a4933","schema_version":"1.0","event_id":"sha256:29edc4bebddb3762c59355e3908781f178c343f648c3758626f41856e24a4933"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/bundle.json","state_url":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/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-16T08:44:43Z","links":{"resolver":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B","bundle":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/bundle.json","state":"https://pith.science/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYOXQNBZLFAAW4RA37QRDKAP6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MYOXQNBZLFAAW4RA37QRDKAP6B","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":"d1399d6ea750309bc6feac815c54ea2002bbd8114901f63d17a63df24e6322fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-07T10:50:45Z","title_canon_sha256":"98b7d22f6a1034cfab38d176f92e843d4a9ac47da6d4902af0fa876982458484"},"schema_version":"1.0","source":{"id":"1908.02525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02525","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02525v1","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02525","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"MYOXQNBZLFAA","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"pith_short_16","alias_value":"MYOXQNBZLFAAW4RA","created_at":"2026-07-04T23:52:09Z"},{"alias_kind":"pith_short_8","alias_value":"MYOXQNBZ","created_at":"2026-07-04T23:52:09Z"}],"graph_snapshots":[{"event_id":"sha256:29edc4bebddb3762c59355e3908781f178c343f648c3758626f41856e24a4933","target":"graph","created_at":"2026-07-04T23:52:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02525/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Abhinav Bommireddi, Aleksandrs Belovs, Eric Blais","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-07T10:50:45Z","title":"Testing convexity of functions over finite domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02525","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:eb360c40dcc89f4ecca20cc56b052e9ad40ba10cad3a66117c8a945062313d7d","target":"record","created_at":"2026-07-04T23:52:09Z","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":"d1399d6ea750309bc6feac815c54ea2002bbd8114901f63d17a63df24e6322fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-07T10:50:45Z","title_canon_sha256":"98b7d22f6a1034cfab38d176f92e843d4a9ac47da6d4902af0fa876982458484"},"schema_version":"1.0","source":{"id":"1908.02525","kind":"arxiv","version":1}},"canonical_sha256":"661d78343959400b7220dfe111a80ff053d5f13f90edd5060ed7d9606dc0299b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"661d78343959400b7220dfe111a80ff053d5f13f90edd5060ed7d9606dc0299b","first_computed_at":"2026-07-04T23:52:09.886599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:09.886599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9WakjFI1loo2p4vtRTUz1M0tAB5xZ7nK8Rj2VmChlZzwvIdE7RcsP0qCS5lDQpFpahYZfOyY3xHiPa48x1/NCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:09.887020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb360c40dcc89f4ecca20cc56b052e9ad40ba10cad3a66117c8a945062313d7d","sha256:29edc4bebddb3762c59355e3908781f178c343f648c3758626f41856e24a4933"],"state_sha256":"04e43bbc29d7e2445773b430a6af0751481caf74fca1827aa1127864188b0d10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVY9KYN2qg9YcWtM7eFF/mv0xbHhQCl9obwYBc4D+zOff62AmJHf4xB5K5DONzKhzNpbJD7g3rcsOBrHHz9cCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:44:43.318454Z","bundle_sha256":"4b27778152d727f64f5bc7212982d61d01c203491d3e42f044f2e9b3abb14913"}}