{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D5ND265FJ76V5ZK54QL6KRPEIE","short_pith_number":"pith:D5ND265F","schema_version":"1.0","canonical_sha256":"1f5a3d7ba54ffd5ee55de417e545e441199870f51be80d8b2fc1f434c4231213","source":{"kind":"arxiv","id":"1304.6685","version":2},"attestation_state":"computed","paper":{"title":"Distance-Sensitive Property Testing Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Joshua Brody, Pooya Hatami","submitted_at":"2013-04-24T18:07:07Z","abstract_excerpt":"In this paper, we consider several property testing problems and ask how the query complexity depends on the distance parameter $\\eps$. We achieve new lower bounds in this setting for the problems of testing whether a function is monotone and testing whether the function has low Fourier degree. For monotonicity testing, our lower bound matches the recent upper bound of Chakrabarty and Seshadhri."},"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":"1304.6685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-24T18:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"da61079ebde672a574ea4fb4b125306843d9d4a9bb0a0735f8d87f3501ae12bf","abstract_canon_sha256":"1f8f92df58050188c8e5cae637f636ba87e11877ecb0a0adaff0f4afcd4d60e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:52.500574Z","signature_b64":"uWUJgNVGC0Wf8G1eVo2ZR2shphjbsYk5h33Eu0GoG4+WwGV3LkDHpUJplqpm+RdB31wFh4BG6sNMT8+T5b0eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f5a3d7ba54ffd5ee55de417e545e441199870f51be80d8b2fc1f434c4231213","last_reissued_at":"2026-05-18T03:14:52.499739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:52.499739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance-Sensitive Property Testing Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Joshua Brody, Pooya Hatami","submitted_at":"2013-04-24T18:07:07Z","abstract_excerpt":"In this paper, we consider several property testing problems and ask how the query complexity depends on the distance parameter $\\eps$. We achieve new lower bounds in this setting for the problems of testing whether a function is monotone and testing whether the function has low Fourier degree. For monotonicity testing, our lower bound matches the recent upper bound of Chakrabarty and Seshadhri."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6685","kind":"arxiv","version":2},"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":"1304.6685","created_at":"2026-05-18T03:14:52.499868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6685v2","created_at":"2026-05-18T03:14:52.499868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6685","created_at":"2026-05-18T03:14:52.499868+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5ND265FJ76V","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5ND265FJ76V5ZK5","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5ND265F","created_at":"2026-05-18T12:27:40.988391+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/D5ND265FJ76V5ZK54QL6KRPEIE","json":"https://pith.science/pith/D5ND265FJ76V5ZK54QL6KRPEIE.json","graph_json":"https://pith.science/api/pith-number/D5ND265FJ76V5ZK54QL6KRPEIE/graph.json","events_json":"https://pith.science/api/pith-number/D5ND265FJ76V5ZK54QL6KRPEIE/events.json","paper":"https://pith.science/paper/D5ND265F"},"agent_actions":{"view_html":"https://pith.science/pith/D5ND265FJ76V5ZK54QL6KRPEIE","download_json":"https://pith.science/pith/D5ND265FJ76V5ZK54QL6KRPEIE.json","view_paper":"https://pith.science/paper/D5ND265F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6685&json=true","fetch_graph":"https://pith.science/api/pith-number/D5ND265FJ76V5ZK54QL6KRPEIE/graph.json","fetch_events":"https://pith.science/api/pith-number/D5ND265FJ76V5ZK54QL6KRPEIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5ND265FJ76V5ZK54QL6KRPEIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5ND265FJ76V5ZK54QL6KRPEIE/action/storage_attestation","attest_author":"https://pith.science/pith/D5ND265FJ76V5ZK54QL6KRPEIE/action/author_attestation","sign_citation":"https://pith.science/pith/D5ND265FJ76V5ZK54QL6KRPEIE/action/citation_signature","submit_replication":"https://pith.science/pith/D5ND265FJ76V5ZK54QL6KRPEIE/action/replication_record"}},"created_at":"2026-05-18T03:14:52.499868+00:00","updated_at":"2026-05-18T03:14:52.499868+00:00"}