{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NQGRQQTTZMAMP5XX7NEGCYAOIM","short_pith_number":"pith:NQGRQQTT","canonical_record":{"source":{"id":"1103.3791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-19T16:18:53Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"ae1c577a602e67e03fbe287bb1c5145ff984a59f5cfca6fe76bb79c3c4b4165d","abstract_canon_sha256":"924f37ecb31d144e1896a1e0c050378c5d5620528f58b65755eb101040230493"},"schema_version":"1.0"},"canonical_sha256":"6c0d184273cb00c7f6f7fb4861600e43150d572d7e83c0cf0a83d6f2050a86dd","source":{"kind":"arxiv","id":"1103.3791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3791","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3791v1","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3791","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"NQGRQQTTZMAM","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NQGRQQTTZMAMP5XX","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NQGRQQTT","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NQGRQQTTZMAMP5XX7NEGCYAOIM","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-19T16:18:53Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"ae1c577a602e67e03fbe287bb1c5145ff984a59f5cfca6fe76bb79c3c4b4165d","abstract_canon_sha256":"924f37ecb31d144e1896a1e0c050378c5d5620528f58b65755eb101040230493"},"schema_version":"1.0"},"canonical_sha256":"6c0d184273cb00c7f6f7fb4861600e43150d572d7e83c0cf0a83d6f2050a86dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:18.111797Z","signature_b64":"dv84n54IXwXMp1U5k4nyvpLOxSiIKOKwBWt6ZbXr408arBsEUH0hzhv6xUwwrNAKGQUa3LIxARL7yilGYus9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c0d184273cb00c7f6f7fb4861600e43150d572d7e83c0cf0a83d6f2050a86dd","last_reissued_at":"2026-05-18T02:22:18.110932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:18.110932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3791","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:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wD6kaMXyuwCsaLxMw0oSyH0VqdhhW334u7nPDjCq1WhrYcZeKJsnWeyMMJ5H8v/27qewG+fwTGMHLfSe43xSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:29.053770Z"},"content_sha256":"bd01d3d55c8accc349c0295506aeae18783310901df62785f02c9e3f69868da0","schema_version":"1.0","event_id":"sha256:bd01d3d55c8accc349c0295506aeae18783310901df62785f02c9e3f69868da0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NQGRQQTTZMAMP5XX7NEGCYAOIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Domenico Famularo, Paolo Pugliese, Yaroslav D. Sergeyev","submitted_at":"2011-03-19T16:18:53Z","abstract_excerpt":"In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. The constrained problem is reduced to a discontinuous unconstrained problem by the index scheme without introducing additional parameters or variables. A Branch-and-Bound method that does not use derivatives for solving the reduced problem is proposed. The method either determines the infeasibility of the original problem or finds lower and upper bounds for the global solution. Not all the constraints are evaluated during every iter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3791","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:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psz8KuSemQu5mCZGI7DpLOS4ul1MypTOoqWt80teFh1yXJ7Nsl0FrEri9Gnv+Cvv0cog+20ZDcBoc8som8yEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:29.054128Z"},"content_sha256":"2f81239781c92a4b80c1787ff44896159b30c1100115ee939e5c00d78639fc93","schema_version":"1.0","event_id":"sha256:2f81239781c92a4b80c1787ff44896159b30c1100115ee939e5c00d78639fc93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQGRQQTTZMAMP5XX7NEGCYAOIM/bundle.json","state_url":"https://pith.science/pith/NQGRQQTTZMAMP5XX7NEGCYAOIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQGRQQTTZMAMP5XX7NEGCYAOIM/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-05-27T10:35:29Z","links":{"resolver":"https://pith.science/pith/NQGRQQTTZMAMP5XX7NEGCYAOIM","bundle":"https://pith.science/pith/NQGRQQTTZMAMP5XX7NEGCYAOIM/bundle.json","state":"https://pith.science/pith/NQGRQQTTZMAMP5XX7NEGCYAOIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQGRQQTTZMAMP5XX7NEGCYAOIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NQGRQQTTZMAMP5XX7NEGCYAOIM","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":"924f37ecb31d144e1896a1e0c050378c5d5620528f58b65755eb101040230493","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-19T16:18:53Z","title_canon_sha256":"ae1c577a602e67e03fbe287bb1c5145ff984a59f5cfca6fe76bb79c3c4b4165d"},"schema_version":"1.0","source":{"id":"1103.3791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3791","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3791v1","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3791","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"NQGRQQTTZMAM","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NQGRQQTTZMAMP5XX","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NQGRQQTT","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:2f81239781c92a4b80c1787ff44896159b30c1100115ee939e5c00d78639fc93","target":"graph","created_at":"2026-05-18T02:22:18Z","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 this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. The constrained problem is reduced to a discontinuous unconstrained problem by the index scheme without introducing additional parameters or variables. A Branch-and-Bound method that does not use derivatives for solving the reduced problem is proposed. The method either determines the infeasibility of the original problem or finds lower and upper bounds for the global solution. Not all the constraints are evaluated during every iter","authors_text":"Domenico Famularo, Paolo Pugliese, Yaroslav D. Sergeyev","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-19T16:18:53Z","title":"Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3791","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:bd01d3d55c8accc349c0295506aeae18783310901df62785f02c9e3f69868da0","target":"record","created_at":"2026-05-18T02:22:18Z","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":"924f37ecb31d144e1896a1e0c050378c5d5620528f58b65755eb101040230493","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-19T16:18:53Z","title_canon_sha256":"ae1c577a602e67e03fbe287bb1c5145ff984a59f5cfca6fe76bb79c3c4b4165d"},"schema_version":"1.0","source":{"id":"1103.3791","kind":"arxiv","version":1}},"canonical_sha256":"6c0d184273cb00c7f6f7fb4861600e43150d572d7e83c0cf0a83d6f2050a86dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c0d184273cb00c7f6f7fb4861600e43150d572d7e83c0cf0a83d6f2050a86dd","first_computed_at":"2026-05-18T02:22:18.110932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:18.110932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dv84n54IXwXMp1U5k4nyvpLOxSiIKOKwBWt6ZbXr408arBsEUH0hzhv6xUwwrNAKGQUa3LIxARL7yilGYus9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:18.111797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd01d3d55c8accc349c0295506aeae18783310901df62785f02c9e3f69868da0","sha256:2f81239781c92a4b80c1787ff44896159b30c1100115ee939e5c00d78639fc93"],"state_sha256":"dff21f926bd96e612e5b4d1a1d161d46f36f20a566d079e3d55f15285794ce48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/j8DYYGuH9wXS+Ffnqc8pAFOPkUyhNBgZpswsXhJ0qku+DZRpIjQE5BUGiS2U59qrSr2L1zDorvPJydB0y7RCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:35:29.056916Z","bundle_sha256":"569aab89851fa12514ff61a5194861850fd77ab6b30ea3301dd73cba27eb6143"}}