{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C7SFVP2IYBPW25UOFGR4CNHCPR","short_pith_number":"pith:C7SFVP2I","canonical_record":{"source":{"id":"1105.2176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-05-11T13:03:13Z","cross_cats_sorted":["cs.IT","cs.LG","cs.SY","math.IT"],"title_canon_sha256":"a3aba3167f47c47f2dc551b69a7d336c5baf29269ada0056599f3042721dd530","abstract_canon_sha256":"bcd8fea44185821b0787c756d5a49014e8ab17c08bb95d9f6cf069deb593a7d5"},"schema_version":"1.0"},"canonical_sha256":"17e45abf48c05f6d768e29a3c134e27c526b49ec194a05ec866a52bbdd0e1598","source":{"kind":"arxiv","id":"1105.2176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2176","created_at":"2026-05-18T04:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2176v1","created_at":"2026-05-18T04:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2176","created_at":"2026-05-18T04:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"C7SFVP2IYBPW","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"C7SFVP2IYBPW25UO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"C7SFVP2I","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C7SFVP2IYBPW25UOFGR4CNHCPR","target":"record","payload":{"canonical_record":{"source":{"id":"1105.2176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-05-11T13:03:13Z","cross_cats_sorted":["cs.IT","cs.LG","cs.SY","math.IT"],"title_canon_sha256":"a3aba3167f47c47f2dc551b69a7d336c5baf29269ada0056599f3042721dd530","abstract_canon_sha256":"bcd8fea44185821b0787c756d5a49014e8ab17c08bb95d9f6cf069deb593a7d5"},"schema_version":"1.0"},"canonical_sha256":"17e45abf48c05f6d768e29a3c134e27c526b49ec194a05ec866a52bbdd0e1598","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:45.145970Z","signature_b64":"C89y4ApJmzdLqQ5zrIJoMhsCZklxD10sjd5s5XpZVrfJ6T7QNlAiWlF+9VzzK1UjEAAl4IlfJovnYQBmyWtbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17e45abf48c05f6d768e29a3c134e27c526b49ec194a05ec866a52bbdd0e1598","last_reissued_at":"2026-05-18T04:08:45.145524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:45.145524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.2176","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-05-18T04:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wm4txba2RWWrQ8x7WUWtagL3rebzcONnIZgbEy/u/wUSZylcuE2xqzPtwjWSfSRSR9ldwW9uVEgKbNt3Jn2XBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:18:06.754639Z"},"content_sha256":"20363eee5c87097f31224116fc76a089bb999e3c93f7c5a045896a16d8bda38d","schema_version":"1.0","event_id":"sha256:20363eee5c87097f31224116fc76a089bb999e3c93f7c5a045896a16d8bda38d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C7SFVP2IYBPW25UOFGR4CNHCPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for Optimization under Limited Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Tansu Alpcan","submitted_at":"2011-05-11T13:03:13Z","abstract_excerpt":"In many real world problems, optimization decisions have to be made with limited information. The decision maker may have no a priori or posteriori data about the often nonconvex objective function except from on a limited number of points that are obtained over time through costly observations. This paper presents an optimization framework that takes into account the information collection (observation), estimation (regression), and optimization (maximization) aspects in a holistic and structured manner. Explicitly quantifying the information acquired at each optimization step using the entro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2176","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":""},"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:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XygWW/aa1PaGfCM0joMzMSBqvxGk4yWnzpGBAJb8ii9WwCb08CL40xraGr9qk4ZE2UvWm52FUGrUe+lVdtAhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:18:06.754981Z"},"content_sha256":"5ebb2e441fa4b9a165f033b8e154e6f997633cee8add9ed0f313a1e4850e88dc","schema_version":"1.0","event_id":"sha256:5ebb2e441fa4b9a165f033b8e154e6f997633cee8add9ed0f313a1e4850e88dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7SFVP2IYBPW25UOFGR4CNHCPR/bundle.json","state_url":"https://pith.science/pith/C7SFVP2IYBPW25UOFGR4CNHCPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7SFVP2IYBPW25UOFGR4CNHCPR/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-06-20T05:18:06Z","links":{"resolver":"https://pith.science/pith/C7SFVP2IYBPW25UOFGR4CNHCPR","bundle":"https://pith.science/pith/C7SFVP2IYBPW25UOFGR4CNHCPR/bundle.json","state":"https://pith.science/pith/C7SFVP2IYBPW25UOFGR4CNHCPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7SFVP2IYBPW25UOFGR4CNHCPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C7SFVP2IYBPW25UOFGR4CNHCPR","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":"bcd8fea44185821b0787c756d5a49014e8ab17c08bb95d9f6cf069deb593a7d5","cross_cats_sorted":["cs.IT","cs.LG","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-05-11T13:03:13Z","title_canon_sha256":"a3aba3167f47c47f2dc551b69a7d336c5baf29269ada0056599f3042721dd530"},"schema_version":"1.0","source":{"id":"1105.2176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2176","created_at":"2026-05-18T04:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2176v1","created_at":"2026-05-18T04:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2176","created_at":"2026-05-18T04:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"C7SFVP2IYBPW","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"C7SFVP2IYBPW25UO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"C7SFVP2I","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:5ebb2e441fa4b9a165f033b8e154e6f997633cee8add9ed0f313a1e4850e88dc","target":"graph","created_at":"2026-05-18T04:08:45Z","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":"In many real world problems, optimization decisions have to be made with limited information. The decision maker may have no a priori or posteriori data about the often nonconvex objective function except from on a limited number of points that are obtained over time through costly observations. This paper presents an optimization framework that takes into account the information collection (observation), estimation (regression), and optimization (maximization) aspects in a holistic and structured manner. Explicitly quantifying the information acquired at each optimization step using the entro","authors_text":"Tansu Alpcan","cross_cats":["cs.IT","cs.LG","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-05-11T13:03:13Z","title":"A Framework for Optimization under Limited Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2176","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:20363eee5c87097f31224116fc76a089bb999e3c93f7c5a045896a16d8bda38d","target":"record","created_at":"2026-05-18T04:08:45Z","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":"bcd8fea44185821b0787c756d5a49014e8ab17c08bb95d9f6cf069deb593a7d5","cross_cats_sorted":["cs.IT","cs.LG","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-05-11T13:03:13Z","title_canon_sha256":"a3aba3167f47c47f2dc551b69a7d336c5baf29269ada0056599f3042721dd530"},"schema_version":"1.0","source":{"id":"1105.2176","kind":"arxiv","version":1}},"canonical_sha256":"17e45abf48c05f6d768e29a3c134e27c526b49ec194a05ec866a52bbdd0e1598","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17e45abf48c05f6d768e29a3c134e27c526b49ec194a05ec866a52bbdd0e1598","first_computed_at":"2026-05-18T04:08:45.145524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:45.145524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C89y4ApJmzdLqQ5zrIJoMhsCZklxD10sjd5s5XpZVrfJ6T7QNlAiWlF+9VzzK1UjEAAl4IlfJovnYQBmyWtbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:45.145970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20363eee5c87097f31224116fc76a089bb999e3c93f7c5a045896a16d8bda38d","sha256:5ebb2e441fa4b9a165f033b8e154e6f997633cee8add9ed0f313a1e4850e88dc"],"state_sha256":"3d8bd1759e3e2ea56fad4af5344f7f23f2d687129ef3a9d247cd8e1087f80662"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tt32kg5Srw40sXqQihw2SU26GbhqR9jG6n7wF5oUZSbhSGvZiQHo7yNVJgJKvkrPlWvmAVM9XniBeJButprrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:18:06.756872Z","bundle_sha256":"48909dee72498806898ec129764db93c3432eda334f9688f16b625367e7a38c7"}}