{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3EZIT3SABUEH7JWNSIA5JQIBCB","short_pith_number":"pith:3EZIT3SA","schema_version":"1.0","canonical_sha256":"d93289ee400d087fa6cd9201d4c101107b01b0abea1dd1e0eb5cfd70a7833952","source":{"kind":"arxiv","id":"2405.11454","version":3},"attestation_state":"computed","paper":{"title":"Gradient Testing and Estimation by Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Chenyi Zhang, Helin Wang, Tongyang Li, Xiwen Tao, Yexin Zhang","submitted_at":"2024-05-19T05:39:46Z","abstract_excerpt":"We study gradient testing and gradient estimation of smooth functions using only a comparison oracle that, given two points, indicates which one has the larger function value. For any smooth $f\\colon\\mathbb R^n\\to\\mathbb R$, $\\mathbf{x}\\in\\mathbb R^n$, and $\\varepsilon>0$, we design a gradient testing algorithm that determines whether the normalized gradient $\\nabla f(\\mathbf{x})/\\|\\nabla f(\\mathbf{x})\\|$ is $\\varepsilon$-close or $2\\varepsilon$-far from a given unit vector $\\mathbf{v}$ using $O(1)$ queries, as well as a gradient estimation algorithm that outputs an $\\varepsilon$-estimate of $"},"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":"2405.11454","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-19T05:39:46Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"c60736565be94b771c54a09d31650a4769b74dc2b3f2041d07fb618e00efb4a5","abstract_canon_sha256":"0dbe17318bca8bc46268cf69c017c05f607ad1665785b406b889ab0c2ae1c837"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:42.232974Z","signature_b64":"pohXx92yY1NXSkpN22VqPmqfPLIUAa06eVmJbsYJ9sDIrlLttmh9UAS5LSQUCZj792X5TRG1DJ1xvZ//gA8LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d93289ee400d087fa6cd9201d4c101107b01b0abea1dd1e0eb5cfd70a7833952","last_reissued_at":"2026-06-26T01:15:42.232467Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:42.232467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Testing and Estimation by Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Chenyi Zhang, Helin Wang, Tongyang Li, Xiwen Tao, Yexin Zhang","submitted_at":"2024-05-19T05:39:46Z","abstract_excerpt":"We study gradient testing and gradient estimation of smooth functions using only a comparison oracle that, given two points, indicates which one has the larger function value. For any smooth $f\\colon\\mathbb R^n\\to\\mathbb R$, $\\mathbf{x}\\in\\mathbb R^n$, and $\\varepsilon>0$, we design a gradient testing algorithm that determines whether the normalized gradient $\\nabla f(\\mathbf{x})/\\|\\nabla f(\\mathbf{x})\\|$ is $\\varepsilon$-close or $2\\varepsilon$-far from a given unit vector $\\mathbf{v}$ using $O(1)$ queries, as well as a gradient estimation algorithm that outputs an $\\varepsilon$-estimate of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11454","kind":"arxiv","version":3},"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/2405.11454/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":"2405.11454","created_at":"2026-06-26T01:15:42.232532+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.11454v3","created_at":"2026-06-26T01:15:42.232532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11454","created_at":"2026-06-26T01:15:42.232532+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EZIT3SABUEH","created_at":"2026-06-26T01:15:42.232532+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EZIT3SABUEH7JWN","created_at":"2026-06-26T01:15:42.232532+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EZIT3SA","created_at":"2026-06-26T01:15:42.232532+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2408.11186","citing_title":"Sequential Resource Trading Using Comparison-Based Gradient Estimation","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26867","citing_title":"Function-free Optimization via Comparison Oracles","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3EZIT3SABUEH7JWNSIA5JQIBCB","json":"https://pith.science/pith/3EZIT3SABUEH7JWNSIA5JQIBCB.json","graph_json":"https://pith.science/api/pith-number/3EZIT3SABUEH7JWNSIA5JQIBCB/graph.json","events_json":"https://pith.science/api/pith-number/3EZIT3SABUEH7JWNSIA5JQIBCB/events.json","paper":"https://pith.science/paper/3EZIT3SA"},"agent_actions":{"view_html":"https://pith.science/pith/3EZIT3SABUEH7JWNSIA5JQIBCB","download_json":"https://pith.science/pith/3EZIT3SABUEH7JWNSIA5JQIBCB.json","view_paper":"https://pith.science/paper/3EZIT3SA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.11454&json=true","fetch_graph":"https://pith.science/api/pith-number/3EZIT3SABUEH7JWNSIA5JQIBCB/graph.json","fetch_events":"https://pith.science/api/pith-number/3EZIT3SABUEH7JWNSIA5JQIBCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EZIT3SABUEH7JWNSIA5JQIBCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EZIT3SABUEH7JWNSIA5JQIBCB/action/storage_attestation","attest_author":"https://pith.science/pith/3EZIT3SABUEH7JWNSIA5JQIBCB/action/author_attestation","sign_citation":"https://pith.science/pith/3EZIT3SABUEH7JWNSIA5JQIBCB/action/citation_signature","submit_replication":"https://pith.science/pith/3EZIT3SABUEH7JWNSIA5JQIBCB/action/replication_record"}},"created_at":"2026-06-26T01:15:42.232532+00:00","updated_at":"2026-06-26T01:15:42.232532+00:00"}