{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FINTXOIPJYXKKRVFXVRHGPR7WZ","short_pith_number":"pith:FINTXOIP","canonical_record":{"source":{"id":"2311.08109","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-14T12:13:42Z","cross_cats_sorted":[],"title_canon_sha256":"1afc2b8637f6401d33c9c8ebff3e075144884a5ee56a5cb93063900ddad13ca5","abstract_canon_sha256":"e446e899a821d177c27507eeaf9b0d0f590ccfea200e410929240d0fc08a4562"},"schema_version":"1.0"},"canonical_sha256":"2a1b3bb90f4e2ea546a5bd62733e3fb67b57bd8a5ae0bf18907907b9004311a0","source":{"kind":"arxiv","id":"2311.08109","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.08109","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"2311.08109v3","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08109","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"FINTXOIPJYXK","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"pith_short_16","alias_value":"FINTXOIPJYXKKRVF","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"pith_short_8","alias_value":"FINTXOIP","created_at":"2026-07-05T07:32:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FINTXOIPJYXKKRVFXVRHGPR7WZ","target":"record","payload":{"canonical_record":{"source":{"id":"2311.08109","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-14T12:13:42Z","cross_cats_sorted":[],"title_canon_sha256":"1afc2b8637f6401d33c9c8ebff3e075144884a5ee56a5cb93063900ddad13ca5","abstract_canon_sha256":"e446e899a821d177c27507eeaf9b0d0f590ccfea200e410929240d0fc08a4562"},"schema_version":"1.0"},"canonical_sha256":"2a1b3bb90f4e2ea546a5bd62733e3fb67b57bd8a5ae0bf18907907b9004311a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:44.867885Z","signature_b64":"GMUL1UfRvMNkk6yugqk/igytferY7ryUbYKk832p7JAceqv/e6dzKXJKswj+Na9SafdxDQrQ4e0ESLrag3k0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a1b3bb90f4e2ea546a5bd62733e3fb67b57bd8a5ae0bf18907907b9004311a0","last_reissued_at":"2026-07-05T07:32:44.867495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:44.867495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.08109","source_version":3,"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-05T07:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuqHaJ9sdtmkz5tCAXjPF9s1ZcBCQY6EQGHn34Yx/y0eKTIo9A87JTv9SorkTrXLjbmXUyt+Tr0NQzlkDY6UBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:19:09.290774Z"},"content_sha256":"d01fab1691acd61495545b3b17a7ef05620b8419b2f3d32bb1190c98b79c1a84","schema_version":"1.0","event_id":"sha256:d01fab1691acd61495545b3b17a7ef05620b8419b2f3d32bb1190c98b79c1a84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FINTXOIPJYXKKRVFXVRHGPR7WZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improvements to steepest descent method for multi-objective optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Liping Tang, Wang Chen, Xinmin Yang","submitted_at":"2023-11-14T12:13:42Z","abstract_excerpt":"In this paper, we propose a simple yet efficient strategy for improving the multi-objective steepest descent method proposed by Fliege and Svaiter (Math Methods Oper Res, 2000, 3: 479--494). The core idea behind this strategy involves incorporating a positive modification parameter into the iterative formulation of the multi-objective steepest descent algorithm in a multiplicative manner. This modification parameter captures certain second-order information associated with the objective functions. We provide two distinct methods for calculating this modification parameter, leading to the devel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08109","kind":"arxiv","version":3},"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/2311.08109/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-05T07:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XbTyBJIXRv8jC+qM+3Gy7Q6bCnApXjQRVkhfuA+1YsmYJgHILuKyBkuCNsBb3t20tKcNEXiFtPs5lRuX7p4qDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:19:09.291156Z"},"content_sha256":"fba6d7ad087a7fe28793c30c9af8a1d7162f9a8bb78854ab94cd1132ee6db603","schema_version":"1.0","event_id":"sha256:fba6d7ad087a7fe28793c30c9af8a1d7162f9a8bb78854ab94cd1132ee6db603"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FINTXOIPJYXKKRVFXVRHGPR7WZ/bundle.json","state_url":"https://pith.science/pith/FINTXOIPJYXKKRVFXVRHGPR7WZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FINTXOIPJYXKKRVFXVRHGPR7WZ/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-07-09T02:19:09Z","links":{"resolver":"https://pith.science/pith/FINTXOIPJYXKKRVFXVRHGPR7WZ","bundle":"https://pith.science/pith/FINTXOIPJYXKKRVFXVRHGPR7WZ/bundle.json","state":"https://pith.science/pith/FINTXOIPJYXKKRVFXVRHGPR7WZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FINTXOIPJYXKKRVFXVRHGPR7WZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FINTXOIPJYXKKRVFXVRHGPR7WZ","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":"e446e899a821d177c27507eeaf9b0d0f590ccfea200e410929240d0fc08a4562","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-14T12:13:42Z","title_canon_sha256":"1afc2b8637f6401d33c9c8ebff3e075144884a5ee56a5cb93063900ddad13ca5"},"schema_version":"1.0","source":{"id":"2311.08109","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.08109","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"2311.08109v3","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08109","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"FINTXOIPJYXK","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"pith_short_16","alias_value":"FINTXOIPJYXKKRVF","created_at":"2026-07-05T07:32:44Z"},{"alias_kind":"pith_short_8","alias_value":"FINTXOIP","created_at":"2026-07-05T07:32:44Z"}],"graph_snapshots":[{"event_id":"sha256:fba6d7ad087a7fe28793c30c9af8a1d7162f9a8bb78854ab94cd1132ee6db603","target":"graph","created_at":"2026-07-05T07:32:44Z","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/2311.08109/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a simple yet efficient strategy for improving the multi-objective steepest descent method proposed by Fliege and Svaiter (Math Methods Oper Res, 2000, 3: 479--494). The core idea behind this strategy involves incorporating a positive modification parameter into the iterative formulation of the multi-objective steepest descent algorithm in a multiplicative manner. This modification parameter captures certain second-order information associated with the objective functions. We provide two distinct methods for calculating this modification parameter, leading to the devel","authors_text":"Liping Tang, Wang Chen, Xinmin Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-14T12:13:42Z","title":"Improvements to steepest descent method for multi-objective optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08109","kind":"arxiv","version":3},"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:d01fab1691acd61495545b3b17a7ef05620b8419b2f3d32bb1190c98b79c1a84","target":"record","created_at":"2026-07-05T07:32:44Z","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":"e446e899a821d177c27507eeaf9b0d0f590ccfea200e410929240d0fc08a4562","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-14T12:13:42Z","title_canon_sha256":"1afc2b8637f6401d33c9c8ebff3e075144884a5ee56a5cb93063900ddad13ca5"},"schema_version":"1.0","source":{"id":"2311.08109","kind":"arxiv","version":3}},"canonical_sha256":"2a1b3bb90f4e2ea546a5bd62733e3fb67b57bd8a5ae0bf18907907b9004311a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a1b3bb90f4e2ea546a5bd62733e3fb67b57bd8a5ae0bf18907907b9004311a0","first_computed_at":"2026-07-05T07:32:44.867495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:32:44.867495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GMUL1UfRvMNkk6yugqk/igytferY7ryUbYKk832p7JAceqv/e6dzKXJKswj+Na9SafdxDQrQ4e0ESLrag3k0Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:32:44.867885Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.08109","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d01fab1691acd61495545b3b17a7ef05620b8419b2f3d32bb1190c98b79c1a84","sha256:fba6d7ad087a7fe28793c30c9af8a1d7162f9a8bb78854ab94cd1132ee6db603"],"state_sha256":"f6997598752194bb671ebc7433b9b1cb3ec01e1bb111431e113b0c6689f7b64f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sVxXwvDrCW8b39ydXHxXZz7fyyf7t97lD3jVc+N+IZOOidiJC5yht2zHZBQkv//ovfCvAumEN4senHgeB9+FCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T02:19:09.293352Z","bundle_sha256":"5ab725cb1ca41426df7d074e00c811e9ff8f8db157d0ce85973fffc8c08070da"}}