{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VHQFB35YIZJMTGX3TTEBFLF4YL","short_pith_number":"pith:VHQFB35Y","canonical_record":{"source":{"id":"1103.2056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-10T15:17:31Z","cross_cats_sorted":["cs.NA","math.NA","physics.comp-ph"],"title_canon_sha256":"e7b55cbb210d5c2b49b3c23605c2b9ef6b0ac8dbf099089fca8fc991de0a1d07","abstract_canon_sha256":"71e2129dc6f1bdd2ada48896d6e7432054faf10b284dabd30f83a656b8b2af08"},"schema_version":"1.0"},"canonical_sha256":"a9e050efb84652c99afb9cc812acbcc2ec92400df157918b58aa4149d64d105d","source":{"kind":"arxiv","id":"1103.2056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2056","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2056v1","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2056","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"VHQFB35YIZJM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHQFB35YIZJMTGX3","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHQFB35Y","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VHQFB35YIZJMTGX3TTEBFLF4YL","target":"record","payload":{"canonical_record":{"source":{"id":"1103.2056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-10T15:17:31Z","cross_cats_sorted":["cs.NA","math.NA","physics.comp-ph"],"title_canon_sha256":"e7b55cbb210d5c2b49b3c23605c2b9ef6b0ac8dbf099089fca8fc991de0a1d07","abstract_canon_sha256":"71e2129dc6f1bdd2ada48896d6e7432054faf10b284dabd30f83a656b8b2af08"},"schema_version":"1.0"},"canonical_sha256":"a9e050efb84652c99afb9cc812acbcc2ec92400df157918b58aa4149d64d105d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:30.629069Z","signature_b64":"4qlxpJmHItLFUj6QVNUba94M0Q2dy18NH7intfg6j+u3fmBw5aOoVsBOn/zXH/7Wmn53tFTGNzxaylg5mVKdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e050efb84652c99afb9cc812acbcc2ec92400df157918b58aa4149d64d105d","last_reissued_at":"2026-05-18T02:22:30.628296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:30.628296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.2056","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-18T02:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OoBiqM9uwUdV5rAuvlsUPo6sBZDbeWp7b5PhfRoAUXI6FL7Z6DHcpkK5tAvoQi54k20s1c7l6JgRafqSMMZLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:15:59.530717Z"},"content_sha256":"42368acdf0d7ea7c2d2d9587663992814b2875ec1124b29e82fe9d2dae4e0ee3","schema_version":"1.0","event_id":"sha256:42368acdf0d7ea7c2d2d9587663992814b2875ec1124b29e82fe9d2dae4e0ee3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VHQFB35YIZJMTGX3TTEBFLF4YL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","physics.comp-ph"],"primary_cat":"math.OC","authors_text":"Dmitri E. Kvasov, Yaroslav D. Sergeyev","submitted_at":"2011-03-10T15:17:31Z","abstract_excerpt":"In the paper, the global optimization problem of a multidimensional \"black-box\" function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz constant is considered. A new efficient algorithm for solving this problem is presented. At each iteration of the method a number of possible Lipschitz constants is chosen from a set of values varying from zero to infinity. This idea is unified with an efficient diagonal partition strategy. A novel technique balancing usage of local and global information during partitioning is proposed. A new procedure for finding lower boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2056","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-18T02:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XtXkR7jTDOk2vBgpgadkDKxMIR4CDdUpD9SUJDHW/wp5PILx2JRmuEgtsAfOnS23z2X7beouNIhcla8CWcqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:15:59.531240Z"},"content_sha256":"fab4a21a4d9bfd2d6a01730be93ab7ab6c62004821da9d25a9e854326fb27fa4","schema_version":"1.0","event_id":"sha256:fab4a21a4d9bfd2d6a01730be93ab7ab6c62004821da9d25a9e854326fb27fa4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHQFB35YIZJMTGX3TTEBFLF4YL/bundle.json","state_url":"https://pith.science/pith/VHQFB35YIZJMTGX3TTEBFLF4YL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHQFB35YIZJMTGX3TTEBFLF4YL/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-05T03:15:59Z","links":{"resolver":"https://pith.science/pith/VHQFB35YIZJMTGX3TTEBFLF4YL","bundle":"https://pith.science/pith/VHQFB35YIZJMTGX3TTEBFLF4YL/bundle.json","state":"https://pith.science/pith/VHQFB35YIZJMTGX3TTEBFLF4YL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHQFB35YIZJMTGX3TTEBFLF4YL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VHQFB35YIZJMTGX3TTEBFLF4YL","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":"71e2129dc6f1bdd2ada48896d6e7432054faf10b284dabd30f83a656b8b2af08","cross_cats_sorted":["cs.NA","math.NA","physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-10T15:17:31Z","title_canon_sha256":"e7b55cbb210d5c2b49b3c23605c2b9ef6b0ac8dbf099089fca8fc991de0a1d07"},"schema_version":"1.0","source":{"id":"1103.2056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2056","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2056v1","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2056","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"VHQFB35YIZJM","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHQFB35YIZJMTGX3","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHQFB35Y","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:fab4a21a4d9bfd2d6a01730be93ab7ab6c62004821da9d25a9e854326fb27fa4","target":"graph","created_at":"2026-05-18T02:22:30Z","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 the paper, the global optimization problem of a multidimensional \"black-box\" function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz constant is considered. A new efficient algorithm for solving this problem is presented. At each iteration of the method a number of possible Lipschitz constants is chosen from a set of values varying from zero to infinity. This idea is unified with an efficient diagonal partition strategy. A novel technique balancing usage of local and global information during partitioning is proposed. A new procedure for finding lower boun","authors_text":"Dmitri E. Kvasov, Yaroslav D. Sergeyev","cross_cats":["cs.NA","math.NA","physics.comp-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-10T15:17:31Z","title":"Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2056","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:42368acdf0d7ea7c2d2d9587663992814b2875ec1124b29e82fe9d2dae4e0ee3","target":"record","created_at":"2026-05-18T02:22:30Z","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":"71e2129dc6f1bdd2ada48896d6e7432054faf10b284dabd30f83a656b8b2af08","cross_cats_sorted":["cs.NA","math.NA","physics.comp-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-10T15:17:31Z","title_canon_sha256":"e7b55cbb210d5c2b49b3c23605c2b9ef6b0ac8dbf099089fca8fc991de0a1d07"},"schema_version":"1.0","source":{"id":"1103.2056","kind":"arxiv","version":1}},"canonical_sha256":"a9e050efb84652c99afb9cc812acbcc2ec92400df157918b58aa4149d64d105d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9e050efb84652c99afb9cc812acbcc2ec92400df157918b58aa4149d64d105d","first_computed_at":"2026-05-18T02:22:30.628296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:30.628296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4qlxpJmHItLFUj6QVNUba94M0Q2dy18NH7intfg6j+u3fmBw5aOoVsBOn/zXH/7Wmn53tFTGNzxaylg5mVKdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:30.629069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42368acdf0d7ea7c2d2d9587663992814b2875ec1124b29e82fe9d2dae4e0ee3","sha256:fab4a21a4d9bfd2d6a01730be93ab7ab6c62004821da9d25a9e854326fb27fa4"],"state_sha256":"4339014ce892176d5523bb857d8097da594f31bffb74e568747fbf533caade9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNcRuENwwS9/ibIZMQCpk0jtSgHrN5TRkrLWwr20/0BfrsSmfYH9C3crNvK+MHWaatcr/Nfc6E0IEUAvk4wiCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:15:59.534088Z","bundle_sha256":"52e8476d5a59a161ba28b2659c31a934240d2d726dcd83d65e215c5d5c893f68"}}