{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GTFSYQBRKR6DLNZVFXCXLNZM7N","short_pith_number":"pith:GTFSYQBR","canonical_record":{"source":{"id":"2607.25252","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-28T03:53:11Z","cross_cats_sorted":[],"title_canon_sha256":"3774bc11bcabaa4c8d29fac4c2b72f90097bc240403f9192a7c6075a98f527a7","abstract_canon_sha256":"5600943308edbb33c65b0c0156567d62bf9e28c74a8be9a7b8a9daba5111f784"},"schema_version":"1.0"},"canonical_sha256":"34cb2c4031547c35b7352dc575b72cfb75cc9ca0cbe62a545e9698a18e192097","source":{"kind":"arxiv","id":"2607.25252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25252","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25252v1","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25252","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"GTFSYQBRKR6D","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"pith_short_16","alias_value":"GTFSYQBRKR6DLNZV","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"pith_short_8","alias_value":"GTFSYQBR","created_at":"2026-07-29T00:25:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GTFSYQBRKR6DLNZVFXCXLNZM7N","target":"record","payload":{"canonical_record":{"source":{"id":"2607.25252","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-28T03:53:11Z","cross_cats_sorted":[],"title_canon_sha256":"3774bc11bcabaa4c8d29fac4c2b72f90097bc240403f9192a7c6075a98f527a7","abstract_canon_sha256":"5600943308edbb33c65b0c0156567d62bf9e28c74a8be9a7b8a9daba5111f784"},"schema_version":"1.0"},"canonical_sha256":"34cb2c4031547c35b7352dc575b72cfb75cc9ca0cbe62a545e9698a18e192097","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T00:25:10.856244Z","signature_b64":"+XYWYAaPSZ/wJNaJ0YAmFSNExMkyNuikGcQHsuaoKAaihIthXr55SWRY/ywXaaLIfZFiAOs9W1sKVGByhtZgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34cb2c4031547c35b7352dc575b72cfb75cc9ca0cbe62a545e9698a18e192097","last_reissued_at":"2026-07-29T00:25:10.855283Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T00:25:10.855283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.25252","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-29T00:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVSR2rcZApwLIkezJLCh3N/15J/IfOWInLZI2QhnpvoUkLFXK085nCiw/RmSWNAR+vIf54ircTfY3kMLG9uNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:10:37.906584Z"},"content_sha256":"7a102d66fc225229af682eb47fcfef9941239276f4e0f2e62eb4294ecc91030a","schema_version":"1.0","event_id":"sha256:7a102d66fc225229af682eb47fcfef9941239276f4e0f2e62eb4294ecc91030a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GTFSYQBRKR6DLNZVFXCXLNZM7N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anshika, Debdas Ghosh, Ravi Raushan, V. Vetrivel","submitted_at":"2026-07-28T03:53:11Z","abstract_excerpt":"This work presents two different types of proximal gradient methods, with line search and without line search, for solving unconstrained set-valued optimization problems under the lower set-less ordering relation induced by a solid cone that is convex, pointed, and closed. The objective mapping of the problem involves finitely many functions, with each one being the sum of a continuously differentiable function and a convex function that is proper and closed. We present an approach to characterize weakly minimal points of the problem with the help of weakly efficient points of a family of vect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25252","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/2607.25252/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-29T00:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DM1bwFtP5BUEN39sqHqj5A245cv4l2t+e0FDglcZOqITHjXZU3cZuYT9kA69/3vTiAa9MU1yHsKhklKMbi8IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:10:37.906956Z"},"content_sha256":"ad25bdac242d4bbdf4898542eb6b35da70517d1f2ddd78fd9676a0e93749b0ad","schema_version":"1.0","event_id":"sha256:ad25bdac242d4bbdf4898542eb6b35da70517d1f2ddd78fd9676a0e93749b0ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTFSYQBRKR6DLNZVFXCXLNZM7N/bundle.json","state_url":"https://pith.science/pith/GTFSYQBRKR6DLNZVFXCXLNZM7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTFSYQBRKR6DLNZVFXCXLNZM7N/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-22T06:10:37Z","links":{"resolver":"https://pith.science/pith/GTFSYQBRKR6DLNZVFXCXLNZM7N","bundle":"https://pith.science/pith/GTFSYQBRKR6DLNZVFXCXLNZM7N/bundle.json","state":"https://pith.science/pith/GTFSYQBRKR6DLNZVFXCXLNZM7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTFSYQBRKR6DLNZVFXCXLNZM7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GTFSYQBRKR6DLNZVFXCXLNZM7N","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":"5600943308edbb33c65b0c0156567d62bf9e28c74a8be9a7b8a9daba5111f784","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-28T03:53:11Z","title_canon_sha256":"3774bc11bcabaa4c8d29fac4c2b72f90097bc240403f9192a7c6075a98f527a7"},"schema_version":"1.0","source":{"id":"2607.25252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25252","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25252v1","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25252","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"GTFSYQBRKR6D","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"pith_short_16","alias_value":"GTFSYQBRKR6DLNZV","created_at":"2026-07-29T00:25:10Z"},{"alias_kind":"pith_short_8","alias_value":"GTFSYQBR","created_at":"2026-07-29T00:25:10Z"}],"graph_snapshots":[{"event_id":"sha256:ad25bdac242d4bbdf4898542eb6b35da70517d1f2ddd78fd9676a0e93749b0ad","target":"graph","created_at":"2026-07-29T00:25:10Z","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/2607.25252/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work presents two different types of proximal gradient methods, with line search and without line search, for solving unconstrained set-valued optimization problems under the lower set-less ordering relation induced by a solid cone that is convex, pointed, and closed. The objective mapping of the problem involves finitely many functions, with each one being the sum of a continuously differentiable function and a convex function that is proper and closed. We present an approach to characterize weakly minimal points of the problem with the help of weakly efficient points of a family of vect","authors_text":"Anshika, Debdas Ghosh, Ravi Raushan, V. Vetrivel","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-28T03:53:11Z","title":"Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25252","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:7a102d66fc225229af682eb47fcfef9941239276f4e0f2e62eb4294ecc91030a","target":"record","created_at":"2026-07-29T00:25:10Z","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":"5600943308edbb33c65b0c0156567d62bf9e28c74a8be9a7b8a9daba5111f784","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-28T03:53:11Z","title_canon_sha256":"3774bc11bcabaa4c8d29fac4c2b72f90097bc240403f9192a7c6075a98f527a7"},"schema_version":"1.0","source":{"id":"2607.25252","kind":"arxiv","version":1}},"canonical_sha256":"34cb2c4031547c35b7352dc575b72cfb75cc9ca0cbe62a545e9698a18e192097","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34cb2c4031547c35b7352dc575b72cfb75cc9ca0cbe62a545e9698a18e192097","first_computed_at":"2026-07-29T00:25:10.855283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-29T00:25:10.855283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+XYWYAaPSZ/wJNaJ0YAmFSNExMkyNuikGcQHsuaoKAaihIthXr55SWRY/ywXaaLIfZFiAOs9W1sKVGByhtZgBA==","signature_status":"signed_v1","signed_at":"2026-07-29T00:25:10.856244Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.25252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a102d66fc225229af682eb47fcfef9941239276f4e0f2e62eb4294ecc91030a","sha256:ad25bdac242d4bbdf4898542eb6b35da70517d1f2ddd78fd9676a0e93749b0ad"],"state_sha256":"43a20a1d74369b050a86656be4e878fb456c6ab3af6b4fd9fafbdefe3a65b689"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiRmDtuiV40GtZcW9qR5zzIRBFO/b/WtiwbP/fx+3wPsjDLfIL2VXQk9lVUz+1lMlMo1FKk6sPs8LbMP9m/VDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T06:10:37.909553Z","bundle_sha256":"686d6c80a7358e3fad7bb6addbbe9bb2a07428d533bf26c5f85759b7a563eb83"}}