{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZNBKLKO6Q2YBR65D5T3TKAOE6X","short_pith_number":"pith:ZNBKLKO6","canonical_record":{"source":{"id":"2404.06720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T04:15:50Z","cross_cats_sorted":["cs.CC","cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"3b17d196ddb7012bdcd1397cdf231ee725fd9d4adb2eb11f992376b791784d21","abstract_canon_sha256":"857bc80e37cad64179705fd44b704e6d84e8bc69fd05f12ab733a0737a00e748"},"schema_version":"1.0"},"canonical_sha256":"cb42a5a9de86b018fba3ecf73501c4f5ddfe02db1549bd966596c931e7423347","source":{"kind":"arxiv","id":"2404.06720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06720","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06720v1","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06720","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZNBKLKO6Q2YB","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"pith_short_16","alias_value":"ZNBKLKO6Q2YBR65D","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"pith_short_8","alias_value":"ZNBKLKO6","created_at":"2026-07-05T08:06:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZNBKLKO6Q2YBR65D5T3TKAOE6X","target":"record","payload":{"canonical_record":{"source":{"id":"2404.06720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T04:15:50Z","cross_cats_sorted":["cs.CC","cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"3b17d196ddb7012bdcd1397cdf231ee725fd9d4adb2eb11f992376b791784d21","abstract_canon_sha256":"857bc80e37cad64179705fd44b704e6d84e8bc69fd05f12ab733a0737a00e748"},"schema_version":"1.0"},"canonical_sha256":"cb42a5a9de86b018fba3ecf73501c4f5ddfe02db1549bd966596c931e7423347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:16.402196Z","signature_b64":"nfcCg32KPryRxQRZuBGwdHlGK9dM7jI4NKZ8E04ZBigM2ReBDoAj2RnSxHBOXABpUDBXAd+XWGfu9Z9BFCAgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb42a5a9de86b018fba3ecf73501c4f5ddfe02db1549bd966596c931e7423347","last_reissued_at":"2026-07-05T08:06:16.401729Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:16.401729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.06720","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-05T08:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xwqW7xhjOJEVkXxMhXvdp9tZMtbOeC24qKyizgxa9gJdZ1bcgKJT2TzdnQBSTIEt5JinmQogKP5gUSVM7zGODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:27:04.250634Z"},"content_sha256":"7103c55a5ffbef691f02e907e336a1a816c71274b0c60bcce77033a99af9cdc8","schema_version":"1.0","event_id":"sha256:7103c55a5ffbef691f02e907e336a1a816c71274b0c60bcce77033a99af9cdc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZNBKLKO6Q2YBR65D5T3TKAOE6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Moise Blanchard","submitted_at":"2024-04-10T04:15:50Z","abstract_excerpt":"In this paper we provide oracle complexity lower bounds for finding a point in a given set using a memory-constrained algorithm that has access to a separation oracle. We assume that the set is contained within the unit $d$-dimensional ball and contains a ball of known radius $\\epsilon>0$. This setup is commonly referred to as the feasibility problem. We show that to solve feasibility problems with accuracy $\\epsilon \\geq e^{-d^{o(1)}}$, any deterministic algorithm either uses $d^{1+\\delta}$ bits of memory or must make at least $1/(d^{0.01\\delta }\\epsilon^{2\\frac{1-\\delta}{1+1.01 \\delta}-o(1)}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06720","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/2404.06720/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-05T08:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TnemnRujRvG9vqNyn6qUvYdrAFmZ+2pbPu1cOOUiFfkbq7v2YwLEBS9DjCjtQjqX12JRoLUdxhUCzDmJmk2LDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T05:27:04.251562Z"},"content_sha256":"e45e8ead2d47d99b66ec6ed43a8df249290e364e2d14c4a7fa8899e527c237b3","schema_version":"1.0","event_id":"sha256:e45e8ead2d47d99b66ec6ed43a8df249290e364e2d14c4a7fa8899e527c237b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNBKLKO6Q2YBR65D5T3TKAOE6X/bundle.json","state_url":"https://pith.science/pith/ZNBKLKO6Q2YBR65D5T3TKAOE6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNBKLKO6Q2YBR65D5T3TKAOE6X/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-19T05:27:04Z","links":{"resolver":"https://pith.science/pith/ZNBKLKO6Q2YBR65D5T3TKAOE6X","bundle":"https://pith.science/pith/ZNBKLKO6Q2YBR65D5T3TKAOE6X/bundle.json","state":"https://pith.science/pith/ZNBKLKO6Q2YBR65D5T3TKAOE6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNBKLKO6Q2YBR65D5T3TKAOE6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZNBKLKO6Q2YBR65D5T3TKAOE6X","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":"857bc80e37cad64179705fd44b704e6d84e8bc69fd05f12ab733a0737a00e748","cross_cats_sorted":["cs.CC","cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T04:15:50Z","title_canon_sha256":"3b17d196ddb7012bdcd1397cdf231ee725fd9d4adb2eb11f992376b791784d21"},"schema_version":"1.0","source":{"id":"2404.06720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06720","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06720v1","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06720","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZNBKLKO6Q2YB","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"pith_short_16","alias_value":"ZNBKLKO6Q2YBR65D","created_at":"2026-07-05T08:06:16Z"},{"alias_kind":"pith_short_8","alias_value":"ZNBKLKO6","created_at":"2026-07-05T08:06:16Z"}],"graph_snapshots":[{"event_id":"sha256:e45e8ead2d47d99b66ec6ed43a8df249290e364e2d14c4a7fa8899e527c237b3","target":"graph","created_at":"2026-07-05T08:06:16Z","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/2404.06720/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we provide oracle complexity lower bounds for finding a point in a given set using a memory-constrained algorithm that has access to a separation oracle. We assume that the set is contained within the unit $d$-dimensional ball and contains a ball of known radius $\\epsilon>0$. This setup is commonly referred to as the feasibility problem. We show that to solve feasibility problems with accuracy $\\epsilon \\geq e^{-d^{o(1)}}$, any deterministic algorithm either uses $d^{1+\\delta}$ bits of memory or must make at least $1/(d^{0.01\\delta }\\epsilon^{2\\frac{1-\\delta}{1+1.01 \\delta}-o(1)}","authors_text":"Moise Blanchard","cross_cats":["cs.CC","cs.DS","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T04:15:50Z","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06720","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:7103c55a5ffbef691f02e907e336a1a816c71274b0c60bcce77033a99af9cdc8","target":"record","created_at":"2026-07-05T08:06:16Z","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":"857bc80e37cad64179705fd44b704e6d84e8bc69fd05f12ab733a0737a00e748","cross_cats_sorted":["cs.CC","cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-10T04:15:50Z","title_canon_sha256":"3b17d196ddb7012bdcd1397cdf231ee725fd9d4adb2eb11f992376b791784d21"},"schema_version":"1.0","source":{"id":"2404.06720","kind":"arxiv","version":1}},"canonical_sha256":"cb42a5a9de86b018fba3ecf73501c4f5ddfe02db1549bd966596c931e7423347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb42a5a9de86b018fba3ecf73501c4f5ddfe02db1549bd966596c931e7423347","first_computed_at":"2026-07-05T08:06:16.401729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:06:16.401729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nfcCg32KPryRxQRZuBGwdHlGK9dM7jI4NKZ8E04ZBigM2ReBDoAj2RnSxHBOXABpUDBXAd+XWGfu9Z9BFCAgAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:06:16.402196Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.06720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7103c55a5ffbef691f02e907e336a1a816c71274b0c60bcce77033a99af9cdc8","sha256:e45e8ead2d47d99b66ec6ed43a8df249290e364e2d14c4a7fa8899e527c237b3"],"state_sha256":"dcef0bb71d85fba438bbbe08994b7514986f1907534111aba2deb58da8b51acd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMQ5mQDQ4PN2Y4GGVutYg9XJuboazMAhhns2xdTEZr0mVgBncNa7GUD91YyHCMOplMKxAq3QDEK8psVQEl3cAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T05:27:04.260685Z","bundle_sha256":"0d6c14e1d116c6fe4108eba944773c01179d622da0eb95457c97c5f1ef166437"}}