{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5ATCG3STFBZM42JHN4N2UIXUTE","short_pith_number":"pith:5ATCG3ST","canonical_record":{"source":{"id":"2601.21166","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-29T02:08:41Z","cross_cats_sorted":[],"title_canon_sha256":"751bba5f14f5575ebd70a1f89b1feb39477f2252e0d5bac2e981c2cb16e0c520","abstract_canon_sha256":"4c16b4d55bcdc46b9eec6df91cdd6c952df77de15a3d63414339aa1b43f19891"},"schema_version":"1.0"},"canonical_sha256":"e826236e532872ce69276f1baa22f4990b73adaeb64bae405c7929cd34401471","source":{"kind":"arxiv","id":"2601.21166","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.21166","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"2601.21166v2","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.21166","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"5ATCG3STFBZM","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"pith_short_16","alias_value":"5ATCG3STFBZM42JH","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"pith_short_8","alias_value":"5ATCG3ST","created_at":"2026-06-23T02:13:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5ATCG3STFBZM42JHN4N2UIXUTE","target":"record","payload":{"canonical_record":{"source":{"id":"2601.21166","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-29T02:08:41Z","cross_cats_sorted":[],"title_canon_sha256":"751bba5f14f5575ebd70a1f89b1feb39477f2252e0d5bac2e981c2cb16e0c520","abstract_canon_sha256":"4c16b4d55bcdc46b9eec6df91cdd6c952df77de15a3d63414339aa1b43f19891"},"schema_version":"1.0"},"canonical_sha256":"e826236e532872ce69276f1baa22f4990b73adaeb64bae405c7929cd34401471","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:20.428035Z","signature_b64":"yOTJH+prJY2zz4cJ5V0gWTourikXDpRC2JCon6tvPnRBeXX8nTMALdwhWv5B1BiJp633tCp0Q7sFLblTzL3jAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e826236e532872ce69276f1baa22f4990b73adaeb64bae405c7929cd34401471","last_reissued_at":"2026-06-23T02:13:20.427575Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:20.427575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.21166","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-06-23T02:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8O5idY5LDjy4HWSn5spOlzOt5if6d7kjhk39K1miEGwakG7IDAV2fXQ61yA+nG+UjRF33hwACEdFfURjVTCzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:49:28.058853Z"},"content_sha256":"7b6470825f8ef291dd754a2866ddfd1ef9a9ae577bf3d2cffed415a0a8937f1c","schema_version":"1.0","event_id":"sha256:7b6470825f8ef291dd754a2866ddfd1ef9a9ae577bf3d2cffed415a0a8937f1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5ATCG3STFBZM42JHN4N2UIXUTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Omar Saadi, Qiuyi Zhang, Rayane Bouftini, Taha El Bakkali","submitted_at":"2026-01-29T02:08:41Z","abstract_excerpt":"We study smooth nonconvex optimization using only noisy pairwise comparisons, without access to gradients or function values. We propose Noisy-Comparison Random Search (NCRS), a simple direct-search method that samples random directions and performs accept/reject updates from comparison feedback. Under a low-dimensional active-subspace structure, NCRS adapts to the intrinsic dimension $k\\le d$ rather than the ambient dimension $d$. For a uniform-margin comparison oracle with advantage $p$, NCRS achieves $\\epsilon$-first-order stationarity with comparison complexity $\\mathcal{O}(k/(p^2\\epsilon^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.21166","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.21166/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-06-23T02:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBYnU5VYF9vOAKxbptOLrahxFxJ9cHvIyr0JKvIWK+mJmQ6RDIHJBJx6q4wNO690wUi4EgonxUOzdrMSdikpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:49:28.059386Z"},"content_sha256":"06aef9e99cc832891919266284bf66fd24e8fd495501ba7b615a251aea36efae","schema_version":"1.0","event_id":"sha256:06aef9e99cc832891919266284bf66fd24e8fd495501ba7b615a251aea36efae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ATCG3STFBZM42JHN4N2UIXUTE/bundle.json","state_url":"https://pith.science/pith/5ATCG3STFBZM42JHN4N2UIXUTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ATCG3STFBZM42JHN4N2UIXUTE/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-08T05:49:28Z","links":{"resolver":"https://pith.science/pith/5ATCG3STFBZM42JHN4N2UIXUTE","bundle":"https://pith.science/pith/5ATCG3STFBZM42JHN4N2UIXUTE/bundle.json","state":"https://pith.science/pith/5ATCG3STFBZM42JHN4N2UIXUTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ATCG3STFBZM42JHN4N2UIXUTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5ATCG3STFBZM42JHN4N2UIXUTE","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":"4c16b4d55bcdc46b9eec6df91cdd6c952df77de15a3d63414339aa1b43f19891","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-29T02:08:41Z","title_canon_sha256":"751bba5f14f5575ebd70a1f89b1feb39477f2252e0d5bac2e981c2cb16e0c520"},"schema_version":"1.0","source":{"id":"2601.21166","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.21166","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"2601.21166v2","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.21166","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"5ATCG3STFBZM","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"pith_short_16","alias_value":"5ATCG3STFBZM42JH","created_at":"2026-06-23T02:13:20Z"},{"alias_kind":"pith_short_8","alias_value":"5ATCG3ST","created_at":"2026-06-23T02:13:20Z"}],"graph_snapshots":[{"event_id":"sha256:06aef9e99cc832891919266284bf66fd24e8fd495501ba7b615a251aea36efae","target":"graph","created_at":"2026-06-23T02:13:20Z","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/2601.21166/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study smooth nonconvex optimization using only noisy pairwise comparisons, without access to gradients or function values. We propose Noisy-Comparison Random Search (NCRS), a simple direct-search method that samples random directions and performs accept/reject updates from comparison feedback. Under a low-dimensional active-subspace structure, NCRS adapts to the intrinsic dimension $k\\le d$ rather than the ambient dimension $d$. For a uniform-margin comparison oracle with advantage $p$, NCRS achieves $\\epsilon$-first-order stationarity with comparison complexity $\\mathcal{O}(k/(p^2\\epsilon^","authors_text":"Omar Saadi, Qiuyi Zhang, Rayane Bouftini, Taha El Bakkali","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-29T02:08:41Z","title":"Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.21166","kind":"arxiv","version":2},"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:7b6470825f8ef291dd754a2866ddfd1ef9a9ae577bf3d2cffed415a0a8937f1c","target":"record","created_at":"2026-06-23T02:13:20Z","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":"4c16b4d55bcdc46b9eec6df91cdd6c952df77de15a3d63414339aa1b43f19891","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-29T02:08:41Z","title_canon_sha256":"751bba5f14f5575ebd70a1f89b1feb39477f2252e0d5bac2e981c2cb16e0c520"},"schema_version":"1.0","source":{"id":"2601.21166","kind":"arxiv","version":2}},"canonical_sha256":"e826236e532872ce69276f1baa22f4990b73adaeb64bae405c7929cd34401471","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e826236e532872ce69276f1baa22f4990b73adaeb64bae405c7929cd34401471","first_computed_at":"2026-06-23T02:13:20.427575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:20.427575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yOTJH+prJY2zz4cJ5V0gWTourikXDpRC2JCon6tvPnRBeXX8nTMALdwhWv5B1BiJp633tCp0Q7sFLblTzL3jAA==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:20.428035Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.21166","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b6470825f8ef291dd754a2866ddfd1ef9a9ae577bf3d2cffed415a0a8937f1c","sha256:06aef9e99cc832891919266284bf66fd24e8fd495501ba7b615a251aea36efae"],"state_sha256":"416726f1167dd2b6d16b0330cccd201528678ef4ee0ad7658058d4c84cab4ad1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+6MDg9tFej9+g1Ge0KL/Bc5sluhIn58ZBim+cJ6lNHjO7k2gfanmt8YubAo5hNl2byXv6Cia+/tEfkGr17fGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T05:49:28.063293Z","bundle_sha256":"1e80407710f967c66d89081f3181666b27d406e5ba27e9d777bec67183a9fe6b"}}