{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5Z3HWK3YALJLRDXFI4ZP3BL63C","short_pith_number":"pith:5Z3HWK3Y","canonical_record":{"source":{"id":"2403.02671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-05T05:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"c8e02624aa678f3f3f545f84093846d44b087fffba0dfd0aac110a434484d435","abstract_canon_sha256":"a96e11a3c08dc5f57604291aa5829109463d541e47ce90ed372ed02477aa626b"},"schema_version":"1.0"},"canonical_sha256":"ee767b2b7802d2b88ee54732fd857ed8864ef046c5c7038987cc2c4efcad01b3","source":{"kind":"arxiv","id":"2403.02671","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02671","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02671v1","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02671","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"pith_short_12","alias_value":"5Z3HWK3YALJL","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"pith_short_16","alias_value":"5Z3HWK3YALJLRDXF","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"pith_short_8","alias_value":"5Z3HWK3Y","created_at":"2026-07-05T07:52:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5Z3HWK3YALJLRDXFI4ZP3BL63C","target":"record","payload":{"canonical_record":{"source":{"id":"2403.02671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-05T05:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"c8e02624aa678f3f3f545f84093846d44b087fffba0dfd0aac110a434484d435","abstract_canon_sha256":"a96e11a3c08dc5f57604291aa5829109463d541e47ce90ed372ed02477aa626b"},"schema_version":"1.0"},"canonical_sha256":"ee767b2b7802d2b88ee54732fd857ed8864ef046c5c7038987cc2c4efcad01b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:20.752112Z","signature_b64":"/0Cal5Bh5dqpNPBs6Ok83b+hYQ3gczUCFeHptPi+l8PYllbU+5+V65zkACc6DPS6n74SfQvaWxUrKKRn7QHfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee767b2b7802d2b88ee54732fd857ed8864ef046c5c7038987cc2c4efcad01b3","last_reissued_at":"2026-07-05T07:52:20.751675Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:20.751675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.02671","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-05T07:52:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OE90oMBDN9imQeE51w4mGSzecHt3vyw9DGAMdfzlp/XOkcmdD/Up1sjS5+SWDnmXyLAV6Wq146fir95FL9LkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:21:18.013530Z"},"content_sha256":"d3b405c6b2eebb31404036da98b17a1db5ddc903099b357627aadba792f3b052","schema_version":"1.0","event_id":"sha256:d3b405c6b2eebb31404036da98b17a1db5ddc903099b357627aadba792f3b052"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5Z3HWK3YALJLRDXFI4ZP3BL63C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the convergence of conditional gradient method for unbounded multiobjective optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Liping Tang, Wang Chen, Xinmin Yang, Yong Zhao","submitted_at":"2024-03-05T05:50:30Z","abstract_excerpt":"This paper focuses on developing a conditional gradient algorithm for multiobjective optimization problems with an unbounded feasible region. We employ the concept of recession cone to establish the well-defined nature of the algorithm. The asymptotic convergence property and the iteration-complexity bound are established under mild assumptions. Numerical examples are provided to verify the algorithmic performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02671","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/2403.02671/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:52:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HcEESE+1XT8szh1xefQPJQYP1UuJjkuZFO+y8+DlCQdvGgjcP/TOYqrAxItCv/+k3tnUHeNM1kNtArJX0lJ2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:21:18.014045Z"},"content_sha256":"0666e396a46f438dcf572df01cf71d87e9afb852e47466cfb965d5d5edf0d932","schema_version":"1.0","event_id":"sha256:0666e396a46f438dcf572df01cf71d87e9afb852e47466cfb965d5d5edf0d932"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Z3HWK3YALJLRDXFI4ZP3BL63C/bundle.json","state_url":"https://pith.science/pith/5Z3HWK3YALJLRDXFI4ZP3BL63C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Z3HWK3YALJLRDXFI4ZP3BL63C/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-03T16:21:18Z","links":{"resolver":"https://pith.science/pith/5Z3HWK3YALJLRDXFI4ZP3BL63C","bundle":"https://pith.science/pith/5Z3HWK3YALJLRDXFI4ZP3BL63C/bundle.json","state":"https://pith.science/pith/5Z3HWK3YALJLRDXFI4ZP3BL63C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Z3HWK3YALJLRDXFI4ZP3BL63C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5Z3HWK3YALJLRDXFI4ZP3BL63C","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":"a96e11a3c08dc5f57604291aa5829109463d541e47ce90ed372ed02477aa626b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-05T05:50:30Z","title_canon_sha256":"c8e02624aa678f3f3f545f84093846d44b087fffba0dfd0aac110a434484d435"},"schema_version":"1.0","source":{"id":"2403.02671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02671","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02671v1","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02671","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"pith_short_12","alias_value":"5Z3HWK3YALJL","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"pith_short_16","alias_value":"5Z3HWK3YALJLRDXF","created_at":"2026-07-05T07:52:20Z"},{"alias_kind":"pith_short_8","alias_value":"5Z3HWK3Y","created_at":"2026-07-05T07:52:20Z"}],"graph_snapshots":[{"event_id":"sha256:0666e396a46f438dcf572df01cf71d87e9afb852e47466cfb965d5d5edf0d932","target":"graph","created_at":"2026-07-05T07:52:20Z","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/2403.02671/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper focuses on developing a conditional gradient algorithm for multiobjective optimization problems with an unbounded feasible region. We employ the concept of recession cone to establish the well-defined nature of the algorithm. The asymptotic convergence property and the iteration-complexity bound are established under mild assumptions. Numerical examples are provided to verify the algorithmic performance.","authors_text":"Liping Tang, Wang Chen, Xinmin Yang, Yong Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-05T05:50:30Z","title":"On the convergence of conditional gradient method for unbounded multiobjective optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02671","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:d3b405c6b2eebb31404036da98b17a1db5ddc903099b357627aadba792f3b052","target":"record","created_at":"2026-07-05T07:52:20Z","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":"a96e11a3c08dc5f57604291aa5829109463d541e47ce90ed372ed02477aa626b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-05T05:50:30Z","title_canon_sha256":"c8e02624aa678f3f3f545f84093846d44b087fffba0dfd0aac110a434484d435"},"schema_version":"1.0","source":{"id":"2403.02671","kind":"arxiv","version":1}},"canonical_sha256":"ee767b2b7802d2b88ee54732fd857ed8864ef046c5c7038987cc2c4efcad01b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee767b2b7802d2b88ee54732fd857ed8864ef046c5c7038987cc2c4efcad01b3","first_computed_at":"2026-07-05T07:52:20.751675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:52:20.751675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/0Cal5Bh5dqpNPBs6Ok83b+hYQ3gczUCFeHptPi+l8PYllbU+5+V65zkACc6DPS6n74SfQvaWxUrKKRn7QHfBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:52:20.752112Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.02671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3b405c6b2eebb31404036da98b17a1db5ddc903099b357627aadba792f3b052","sha256:0666e396a46f438dcf572df01cf71d87e9afb852e47466cfb965d5d5edf0d932"],"state_sha256":"e5d13ea477ca6c8317ef552df76293c42c366042be8e2271ca502f58596a201d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04Ie0xTIIW/UMew9ay5G1RLYbf/fF33V57hCXdH1DfAafgEmw5MzlDkJo/aflns+/Xx0M0flOiw4uVgdUAbrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:21:18.019779Z","bundle_sha256":"e0098f609fa00dd441052f3664149f1491a9706a94170e91303a6e8850df0e13"}}