{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:EONCAKGC5GBCHDUG6PC4SWCYTX","short_pith_number":"pith:EONCAKGC","canonical_record":{"source":{"id":"2604.26867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T16:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"8cc25123f57772b347fc61ae5be670b2ab4d2f3054e52b0d3bfdc2e5260d3aa5","abstract_canon_sha256":"fb814d657d409a5a9d12c95406cfae2254fb7d31a2e03e586cb3cf3742a4efb4"},"schema_version":"1.0"},"canonical_sha256":"239a2028c2e982238e86f3c5c958589de2e413730389d3fb5b2a7f4f1004f000","source":{"kind":"arxiv","id":"2604.26867","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26867","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26867v2","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26867","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"EONCAKGC5GBC","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_16","alias_value":"EONCAKGC5GBCHDUG","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_8","alias_value":"EONCAKGC","created_at":"2026-05-20T01:05:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:EONCAKGC5GBCHDUG6PC4SWCYTX","target":"record","payload":{"canonical_record":{"source":{"id":"2604.26867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T16:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"8cc25123f57772b347fc61ae5be670b2ab4d2f3054e52b0d3bfdc2e5260d3aa5","abstract_canon_sha256":"fb814d657d409a5a9d12c95406cfae2254fb7d31a2e03e586cb3cf3742a4efb4"},"schema_version":"1.0"},"canonical_sha256":"239a2028c2e982238e86f3c5c958589de2e413730389d3fb5b2a7f4f1004f000","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:14.628788Z","signature_b64":"PHz0Uv7JuUZYQx4Ft+htA5P8mk4S7uzIEpsshQ1MBZKtAN9XV5YlN3k+f0S+NqwWYS4C/zF2D6KCjhqZJ7AQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"239a2028c2e982238e86f3c5c958589de2e413730389d3fb5b2a7f4f1004f000","last_reissued_at":"2026-05-20T01:05:14.628029Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:14.628029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.26867","source_version":2,"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-05-20T01:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GL52BilaOjQmaBT9fMA0dnZht+ye+jrzIkVUa8tQnxXCq28PfbRP1GJ63i/TcCREW3bNypjMpwlhEb7UrJwFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:50:46.735508Z"},"content_sha256":"434b20a46366135c1b364c1acadd159f86b72d691b30a7f5be898a83ccc7e1e0","schema_version":"1.0","event_id":"sha256:434b20a46366135c1b364c1acadd159f86b72d691b30a7f5be898a83ccc7e1e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:EONCAKGC5GBCHDUG6PC4SWCYTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Function-free Optimization via Comparison Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Katya Scheinberg, Zikai Xiong","submitted_at":"2026-04-29T16:34:11Z","abstract_excerpt":"In this work, we study optimization specified only through a comparison oracle: given two points, it reports which one is preferred. We call it function-free optimization because we do not assume access to, nor the existence of, a canonical application-given objective function. The goal is to find the most preferred feasible point, which we call the optimal solution. This model arises in preference- and ranking-based settings where objective values and derivatives are unavailable or meaningless. Even when a representative function exists, it may be nonsmooth, nonconvex, or discontinuous. We de"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"Under regularity of the preference relation in a d-dimensional Euclidean space, we estimate normal directions to accuracy ε using O(d log(d/ε)) comparisons, nearly matching a lower bound of Ω(d log(1/ε)). Under convexity, regularity, and a local growth condition on the regularity radius, the resulting normal direction descent method reaches an ε level-set optimality gap using at most Õ(d D²/ε²) comparisons over O(D²/ε²) normal direction estimation steps.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The regularity of the preference relation together with convexity and the local growth condition on the regularity radius; these are invoked to derive the normal-direction estimation and descent complexity bounds but are not guaranteed to hold for arbitrary comparison oracles.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"0c20cfc3539c15e702f52ea80fc4acf033b7701cb868d565942f0b9aee04df84"},"source":{"id":"2604.26867","kind":"arxiv","version":2},"verdict":{"id":"b83445bf-2d25-4542-bffc-130f793fb5af","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T11:53:01.481806Z","strongest_claim":"Under regularity of the preference relation in a d-dimensional Euclidean space, we estimate normal directions to accuracy ε using O(d log(d/ε)) comparisons, nearly matching a lower bound of Ω(d log(1/ε)). Under convexity, regularity, and a local growth condition on the regularity radius, the resulting normal direction descent method reaches an ε level-set optimality gap using at most Õ(d D²/ε²) comparisons over O(D²/ε²) normal direction estimation steps.","one_line_summary":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The regularity of the preference relation together with convexity and the local growth condition on the regularity radius; these are invoked to derive the normal-direction estimation and descent complexity bounds but are not guaranteed to hold for arbitrary comparison oracles.","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.26867/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":"b83445bf-2d25-4542-bffc-130f793fb5af"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v76+z+1OnHdbJJxRv1nt9tu1TycfyvwcV9lopbb3mMxF4/CEVddVLgUUCxbe8tcz//zlrcnHt4fLX6tG12FJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T06:50:46.736442Z"},"content_sha256":"fe0f62df498b6f29a6263852b9ca2ecbff00e9167cb3dcf4dcc19f5157cab8e9","schema_version":"1.0","event_id":"sha256:fe0f62df498b6f29a6263852b9ca2ecbff00e9167cb3dcf4dcc19f5157cab8e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/bundle.json","state_url":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/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-05-23T06:50:46Z","links":{"resolver":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX","bundle":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/bundle.json","state":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EONCAKGC5GBCHDUG6PC4SWCYTX","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":"fb814d657d409a5a9d12c95406cfae2254fb7d31a2e03e586cb3cf3742a4efb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T16:34:11Z","title_canon_sha256":"8cc25123f57772b347fc61ae5be670b2ab4d2f3054e52b0d3bfdc2e5260d3aa5"},"schema_version":"1.0","source":{"id":"2604.26867","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26867","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26867v2","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26867","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"EONCAKGC5GBC","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_16","alias_value":"EONCAKGC5GBCHDUG","created_at":"2026-05-20T01:05:14Z"},{"alias_kind":"pith_short_8","alias_value":"EONCAKGC","created_at":"2026-05-20T01:05:14Z"}],"graph_snapshots":[{"event_id":"sha256:fe0f62df498b6f29a6263852b9ca2ecbff00e9167cb3dcf4dcc19f5157cab8e9","target":"graph","created_at":"2026-05-20T01:05:14Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Under regularity of the preference relation in a d-dimensional Euclidean space, we estimate normal directions to accuracy ε using O(d log(d/ε)) comparisons, nearly matching a lower bound of Ω(d log(1/ε)). Under convexity, regularity, and a local growth condition on the regularity radius, the resulting normal direction descent method reaches an ε level-set optimality gap using at most Õ(d D²/ε²) comparisons over O(D²/ε²) normal direction estimation steps."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The regularity of the preference relation together with convexity and the local growth condition on the regularity radius; these are invoked to derive the normal-direction estimation and descent complexity bounds but are not guaranteed to hold for arbitrary comparison oracles."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity."}],"snapshot_sha256":"0c20cfc3539c15e702f52ea80fc4acf033b7701cb868d565942f0b9aee04df84"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.26867/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we study optimization specified only through a comparison oracle: given two points, it reports which one is preferred. We call it function-free optimization because we do not assume access to, nor the existence of, a canonical application-given objective function. The goal is to find the most preferred feasible point, which we call the optimal solution. This model arises in preference- and ranking-based settings where objective values and derivatives are unavailable or meaningless. Even when a representative function exists, it may be nonsmooth, nonconvex, or discontinuous. We de","authors_text":"Katya Scheinberg, Zikai Xiong","cross_cats":[],"headline":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T16:34:11Z","title":"Function-free Optimization via Comparison Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.26867","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T11:53:01.481806Z","id":"b83445bf-2d25-4542-bffc-130f793fb5af","model_set":{"reader":"grok-4.3"},"one_line_summary":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_claim":"Under regularity of the preference relation in a d-dimensional Euclidean space, we estimate normal directions to accuracy ε using O(d log(d/ε)) comparisons, nearly matching a lower bound of Ω(d log(1/ε)). Under convexity, regularity, and a local growth condition on the regularity radius, the resulting normal direction descent method reaches an ε level-set optimality gap using at most Õ(d D²/ε²) comparisons over O(D²/ε²) normal direction estimation steps.","weakest_assumption":"The regularity of the preference relation together with convexity and the local growth condition on the regularity radius; these are invoked to derive the normal-direction estimation and descent complexity bounds but are not guaranteed to hold for arbitrary comparison oracles."}},"verdict_id":"b83445bf-2d25-4542-bffc-130f793fb5af"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:434b20a46366135c1b364c1acadd159f86b72d691b30a7f5be898a83ccc7e1e0","target":"record","created_at":"2026-05-20T01:05:14Z","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":"fb814d657d409a5a9d12c95406cfae2254fb7d31a2e03e586cb3cf3742a4efb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T16:34:11Z","title_canon_sha256":"8cc25123f57772b347fc61ae5be670b2ab4d2f3054e52b0d3bfdc2e5260d3aa5"},"schema_version":"1.0","source":{"id":"2604.26867","kind":"arxiv","version":2}},"canonical_sha256":"239a2028c2e982238e86f3c5c958589de2e413730389d3fb5b2a7f4f1004f000","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"239a2028c2e982238e86f3c5c958589de2e413730389d3fb5b2a7f4f1004f000","first_computed_at":"2026-05-20T01:05:14.628029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:14.628029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PHz0Uv7JuUZYQx4Ft+htA5P8mk4S7uzIEpsshQ1MBZKtAN9XV5YlN3k+f0S+NqwWYS4C/zF2D6KCjhqZJ7AQDA==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:14.628788Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.26867","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:434b20a46366135c1b364c1acadd159f86b72d691b30a7f5be898a83ccc7e1e0","sha256:fe0f62df498b6f29a6263852b9ca2ecbff00e9167cb3dcf4dcc19f5157cab8e9"],"state_sha256":"9823b294cb0bb4c347c895a20edf2e0be68f45596f00e583723b471cb76ae9dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UpM40pDMR+nZ6wRyOgWelh967s2jYNDt6HFCiitWkaGPhO/CCw35+dDW3EDBTGLoZLn2yvewYBDV5OiZ13/6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T06:50:46.740624Z","bundle_sha256":"e7b397c6a8740ace76b6973679f4479258f35b7908400184714d07d5d347c8cd"}}