{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:AIV6FJGWG7PCKSCDTD2SLAU3TA","short_pith_number":"pith:AIV6FJGW","canonical_record":{"source":{"id":"1010.2285","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-12T02:19:43Z","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"title_canon_sha256":"c26fcd7abccaffc5bcc78ecb2159c83b6830de9189ca0a542b7468615d49f7ac","abstract_canon_sha256":"6810994b6a5b2c0c11577b59409e763ea860b8b556ee93d5cd3874f86dd1303b"},"schema_version":"1.0"},"canonical_sha256":"022be2a4d637de25484398f525829b98167c10f79a03db54dca8162dd551af93","source":{"kind":"arxiv","id":"1010.2285","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2285","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2285v3","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2285","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"AIV6FJGWG7PC","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIV6FJGWG7PCKSCD","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIV6FJGW","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:AIV6FJGWG7PCKSCDTD2SLAU3TA","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2285","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-12T02:19:43Z","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"title_canon_sha256":"c26fcd7abccaffc5bcc78ecb2159c83b6830de9189ca0a542b7468615d49f7ac","abstract_canon_sha256":"6810994b6a5b2c0c11577b59409e763ea860b8b556ee93d5cd3874f86dd1303b"},"schema_version":"1.0"},"canonical_sha256":"022be2a4d637de25484398f525829b98167c10f79a03db54dca8162dd551af93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:47.113768Z","signature_b64":"6rQgaTfYPjmyQJnk5GVvk5gx9avUKfMbW+x+GJLZuthOcNipUy8mZJZPL22OlujPJrYLsCivu6YBMeqdVWatBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"022be2a4d637de25484398f525829b98167c10f79a03db54dca8162dd551af93","last_reissued_at":"2026-05-18T04:13:47.113290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:47.113290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2285","source_version":3,"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-18T04:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wVy6nzDhgO5QGklYQbJp/yWdd9zuHyftb9ircKCAPu561yJ6o+1IMOHRgQwTYjP1wlX6fq6IuA15kOO8rOADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:03:50.600220Z"},"content_sha256":"c4c0bae9a148193776725947966c8c8c047b64f5a3d0174ceaeb3b5518ccace3","schema_version":"1.0","event_id":"sha256:c4c0bae9a148193776725947966c8c8c047b64f5a3d0174ceaeb3b5518ccace3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:AIV6FJGWG7PCKSCDTD2SLAU3TA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-based complexity, feedback and dynamics in convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Alexander Rakhlin, Maxim Raginsky","submitted_at":"2010-10-12T02:19:43Z","abstract_excerpt":"We study the intrinsic limitations of sequential convex optimization through the lens of feedback information theory. In the oracle model of optimization, an algorithm queries an {\\em oracle} for noisy information about the unknown objective function, and the goal is to (approximately) minimize every function in a given class using as few queries as possible. We show that, in order for a function to be optimized, the algorithm must be able to accumulate enough information about the objective. This, in turn, puts limits on the speed of optimization under specific assumptions on the oracle and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2285","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":""},"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-05-18T04:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEWGI3YXTpnv5vgyq+8zqIq/0pIbFqBKlu9KcPCaJlX5pAom3MbJv+tAaFkEh9ofCm2cU+yVj1aNeHe/nsplCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:03:50.600575Z"},"content_sha256":"40c96a43886ca86d76d93b76f0252f76de65b632df5c9cb4245ec6dfb36e2fec","schema_version":"1.0","event_id":"sha256:40c96a43886ca86d76d93b76f0252f76de65b632df5c9cb4245ec6dfb36e2fec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIV6FJGWG7PCKSCDTD2SLAU3TA/bundle.json","state_url":"https://pith.science/pith/AIV6FJGWG7PCKSCDTD2SLAU3TA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIV6FJGWG7PCKSCDTD2SLAU3TA/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-07-05T08:03:50Z","links":{"resolver":"https://pith.science/pith/AIV6FJGWG7PCKSCDTD2SLAU3TA","bundle":"https://pith.science/pith/AIV6FJGWG7PCKSCDTD2SLAU3TA/bundle.json","state":"https://pith.science/pith/AIV6FJGWG7PCKSCDTD2SLAU3TA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIV6FJGWG7PCKSCDTD2SLAU3TA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:AIV6FJGWG7PCKSCDTD2SLAU3TA","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":"6810994b6a5b2c0c11577b59409e763ea860b8b556ee93d5cd3874f86dd1303b","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-12T02:19:43Z","title_canon_sha256":"c26fcd7abccaffc5bcc78ecb2159c83b6830de9189ca0a542b7468615d49f7ac"},"schema_version":"1.0","source":{"id":"1010.2285","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2285","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2285v3","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2285","created_at":"2026-05-18T04:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"AIV6FJGWG7PC","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"AIV6FJGWG7PCKSCD","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"AIV6FJGW","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:40c96a43886ca86d76d93b76f0252f76de65b632df5c9cb4245ec6dfb36e2fec","target":"graph","created_at":"2026-05-18T04:13:47Z","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"},"paper":{"abstract_excerpt":"We study the intrinsic limitations of sequential convex optimization through the lens of feedback information theory. In the oracle model of optimization, an algorithm queries an {\\em oracle} for noisy information about the unknown objective function, and the goal is to (approximately) minimize every function in a given class using as few queries as possible. We show that, in order for a function to be optimized, the algorithm must be able to accumulate enough information about the objective. This, in turn, puts limits on the speed of optimization under specific assumptions on the oracle and t","authors_text":"Alexander Rakhlin, Maxim Raginsky","cross_cats":["cs.SY","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-12T02:19:43Z","title":"Information-based complexity, feedback and dynamics in convex programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2285","kind":"arxiv","version":3},"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:c4c0bae9a148193776725947966c8c8c047b64f5a3d0174ceaeb3b5518ccace3","target":"record","created_at":"2026-05-18T04:13:47Z","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":"6810994b6a5b2c0c11577b59409e763ea860b8b556ee93d5cd3874f86dd1303b","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-12T02:19:43Z","title_canon_sha256":"c26fcd7abccaffc5bcc78ecb2159c83b6830de9189ca0a542b7468615d49f7ac"},"schema_version":"1.0","source":{"id":"1010.2285","kind":"arxiv","version":3}},"canonical_sha256":"022be2a4d637de25484398f525829b98167c10f79a03db54dca8162dd551af93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"022be2a4d637de25484398f525829b98167c10f79a03db54dca8162dd551af93","first_computed_at":"2026-05-18T04:13:47.113290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:47.113290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6rQgaTfYPjmyQJnk5GVvk5gx9avUKfMbW+x+GJLZuthOcNipUy8mZJZPL22OlujPJrYLsCivu6YBMeqdVWatBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:47.113768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2285","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4c0bae9a148193776725947966c8c8c047b64f5a3d0174ceaeb3b5518ccace3","sha256:40c96a43886ca86d76d93b76f0252f76de65b632df5c9cb4245ec6dfb36e2fec"],"state_sha256":"b146b00e0651cc6e8976d0eb6f9653a9c5ce9754439145842e183a395a3abd2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yh/nm5eeoyotSxiXYCRL8/n+mD/xoNmLCpl81MZXbwnQ9di/Tu/7VwLnKQISKGQNCJtEd1T+gM3hhnMYoP8RAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:03:50.602541Z","bundle_sha256":"a6b13c394485ffa6f50bb2eb5269f0684acefc411a90a88ac45638865645e2cd"}}