{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4DJ5UKGFSFR7QN6IEGKRG4RYWW","short_pith_number":"pith:4DJ5UKGF","canonical_record":{"source":{"id":"2505.13967","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T06:06:56Z","cross_cats_sorted":[],"title_canon_sha256":"3bf388491ccfbfa8f05626fecc21dbd3d02226d420033a394f110bcc421126d1","abstract_canon_sha256":"3bf2f9b81ff6ce19d935114e7583785cc8aa995126040aa3f33c05f65c11f5c0"},"schema_version":"1.0"},"canonical_sha256":"e0d3da28c59163f837c82195137238b585d62d8b172dd06cda0c8ae48c45cdc4","source":{"kind":"arxiv","id":"2505.13967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.13967","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"2505.13967v1","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13967","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"4DJ5UKGFSFR7","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"pith_short_16","alias_value":"4DJ5UKGFSFR7QN6I","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"pith_short_8","alias_value":"4DJ5UKGF","created_at":"2026-07-05T11:05:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4DJ5UKGFSFR7QN6IEGKRG4RYWW","target":"record","payload":{"canonical_record":{"source":{"id":"2505.13967","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T06:06:56Z","cross_cats_sorted":[],"title_canon_sha256":"3bf388491ccfbfa8f05626fecc21dbd3d02226d420033a394f110bcc421126d1","abstract_canon_sha256":"3bf2f9b81ff6ce19d935114e7583785cc8aa995126040aa3f33c05f65c11f5c0"},"schema_version":"1.0"},"canonical_sha256":"e0d3da28c59163f837c82195137238b585d62d8b172dd06cda0c8ae48c45cdc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:54.048258Z","signature_b64":"cAHFStpiJF8/hPFjoQI1xQk/h7xxWovnWFQrKJHrRvBkbznYiiYYvx01d9ig8rk9p1N7uEe9iRkeJc2eLkmHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0d3da28c59163f837c82195137238b585d62d8b172dd06cda0c8ae48c45cdc4","last_reissued_at":"2026-07-05T11:05:54.047833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:54.047833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.13967","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-05T11:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xcdSvzQ4jw0Ya2noQzpxdL8IUaWRwgJ5pijsbF8TTzeNxbeK4ZKrbzCvAoGMWV2fv0UhCwhWV+uZPSYp5SqLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:25:07.139981Z"},"content_sha256":"f7ba42e9f9c1d2810c1cc36ab6940ca335f8aea7c35efdacef55518b9a5f577c","schema_version":"1.0","event_id":"sha256:f7ba42e9f9c1d2810c1cc36ab6940ca335f8aea7c35efdacef55518b9a5f577c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4DJ5UKGFSFR7QN6IEGKRG4RYWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quasi-Newton Method to Solve Uncertain Multiobjective Optimization Problems with Uncertainty Set of Finite Cardinality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"C. Tammer, D. Ghosh, J. C. Yao, K. Gupta, X. Zhao","submitted_at":"2025-05-20T06:06:56Z","abstract_excerpt":"In this article, we derive an iterative scheme through a quasi-Newton technique to capture robust weakly efficient points of uncertain multiobjective optimization problems under the upper set less relation. It is assumed that the set of uncertainty scenarios of the problems being analyzed is of finite cardinality. We also assume that corresponding to each given uncertain scenario from the uncertainty set, the objective function of the problem is twice continuously differentiable. In the proposed iterative scheme, at any iterate, by applying the \\emph{partition set} concept from set-valued opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13967","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/2505.13967/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-05T11:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8P7vyX8SZGsNbJJHaa2k4HLIqi5AIkvd+3ghYFWqcCiN4PNImGQzV1OADN7JtWY29qrrGcd1da27bt9JcTLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:25:07.140320Z"},"content_sha256":"c920eb7aa6d673c153d6557c6a244e83125fd48fb218b2c40fcadacfe2f675ae","schema_version":"1.0","event_id":"sha256:c920eb7aa6d673c153d6557c6a244e83125fd48fb218b2c40fcadacfe2f675ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DJ5UKGFSFR7QN6IEGKRG4RYWW/bundle.json","state_url":"https://pith.science/pith/4DJ5UKGFSFR7QN6IEGKRG4RYWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DJ5UKGFSFR7QN6IEGKRG4RYWW/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-24T03:25:07Z","links":{"resolver":"https://pith.science/pith/4DJ5UKGFSFR7QN6IEGKRG4RYWW","bundle":"https://pith.science/pith/4DJ5UKGFSFR7QN6IEGKRG4RYWW/bundle.json","state":"https://pith.science/pith/4DJ5UKGFSFR7QN6IEGKRG4RYWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DJ5UKGFSFR7QN6IEGKRG4RYWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4DJ5UKGFSFR7QN6IEGKRG4RYWW","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":"3bf2f9b81ff6ce19d935114e7583785cc8aa995126040aa3f33c05f65c11f5c0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T06:06:56Z","title_canon_sha256":"3bf388491ccfbfa8f05626fecc21dbd3d02226d420033a394f110bcc421126d1"},"schema_version":"1.0","source":{"id":"2505.13967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.13967","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"2505.13967v1","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13967","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"4DJ5UKGFSFR7","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"pith_short_16","alias_value":"4DJ5UKGFSFR7QN6I","created_at":"2026-07-05T11:05:54Z"},{"alias_kind":"pith_short_8","alias_value":"4DJ5UKGF","created_at":"2026-07-05T11:05:54Z"}],"graph_snapshots":[{"event_id":"sha256:c920eb7aa6d673c153d6557c6a244e83125fd48fb218b2c40fcadacfe2f675ae","target":"graph","created_at":"2026-07-05T11:05:54Z","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/2505.13967/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this article, we derive an iterative scheme through a quasi-Newton technique to capture robust weakly efficient points of uncertain multiobjective optimization problems under the upper set less relation. It is assumed that the set of uncertainty scenarios of the problems being analyzed is of finite cardinality. We also assume that corresponding to each given uncertain scenario from the uncertainty set, the objective function of the problem is twice continuously differentiable. In the proposed iterative scheme, at any iterate, by applying the \\emph{partition set} concept from set-valued opti","authors_text":"C. Tammer, D. Ghosh, J. C. Yao, K. Gupta, X. Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T06:06:56Z","title":"A Quasi-Newton Method to Solve Uncertain Multiobjective Optimization Problems with Uncertainty Set of Finite Cardinality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13967","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:f7ba42e9f9c1d2810c1cc36ab6940ca335f8aea7c35efdacef55518b9a5f577c","target":"record","created_at":"2026-07-05T11:05:54Z","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":"3bf2f9b81ff6ce19d935114e7583785cc8aa995126040aa3f33c05f65c11f5c0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T06:06:56Z","title_canon_sha256":"3bf388491ccfbfa8f05626fecc21dbd3d02226d420033a394f110bcc421126d1"},"schema_version":"1.0","source":{"id":"2505.13967","kind":"arxiv","version":1}},"canonical_sha256":"e0d3da28c59163f837c82195137238b585d62d8b172dd06cda0c8ae48c45cdc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0d3da28c59163f837c82195137238b585d62d8b172dd06cda0c8ae48c45cdc4","first_computed_at":"2026-07-05T11:05:54.047833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:54.047833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cAHFStpiJF8/hPFjoQI1xQk/h7xxWovnWFQrKJHrRvBkbznYiiYYvx01d9ig8rk9p1N7uEe9iRkeJc2eLkmHCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:54.048258Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.13967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7ba42e9f9c1d2810c1cc36ab6940ca335f8aea7c35efdacef55518b9a5f577c","sha256:c920eb7aa6d673c153d6557c6a244e83125fd48fb218b2c40fcadacfe2f675ae"],"state_sha256":"7e693b223a9a1f6a1acfc3d193acada0933763c086472199f63c5cf58ec3aa5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcUfyBEo6vvh2vgPXePWfcFrxm620Vf3HdKkjDv3/k8+uzOsE3YDuw1E6XuEt+HHebBD/lz3z28gK6wbzcppBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:25:07.144418Z","bundle_sha256":"89af8379828d71852b9cc48ce679ad7113e79050b8d7da47e05e70ff15d0f576"}}