{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LWJJ5WLW5PZ72VQ3VCCIVYA54X","short_pith_number":"pith:LWJJ5WLW","schema_version":"1.0","canonical_sha256":"5d929ed976ebf3fd561ba8848ae01de5ee332612afc16e030c04208a884865a1","source":{"kind":"arxiv","id":"2412.21068","version":1},"attestation_state":"computed","paper":{"title":"Finite Horizon Optimization: Framework and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dmitry Rybin, Yushun Zhang, Zhi-Quan Luo","submitted_at":"2024-12-30T16:35:47Z","abstract_excerpt":"In modern engineering scenarios, there is often a strict upper bound on the number of algorithm iterations that can be performed within a given time limit. This raises the question of optimal algorithmic configuration for a fixed and finite iteration budget. In this work, we introduce the framework of finite horizon optimization, which focuses on optimizing the algorithm performance under a strict iteration budget $T$. We apply this framework to linear programming (LP) and propose Finite Horizon stepsize rule for the primal-dual method. The main challenge in the stepsize design is controlling "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.21068","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-30T16:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"0e29d89c9541f016c717e90744f7f40a6c2de5f6ab1be0884aadd59d7fc70d22","abstract_canon_sha256":"46f3968205fb42ddac2e104b8d115c511d335fb9092e62df844a161b69570e54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:26.778389Z","signature_b64":"PZe5NUXRGXaBf3eQjGDp4BLkv0CLY6Vc+Tc/AmZ0eibJCIn2/6IZpPRPIMfMTZokn85ALc5zBRXDXWKQg1bfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d929ed976ebf3fd561ba8848ae01de5ee332612afc16e030c04208a884865a1","last_reissued_at":"2026-07-05T09:55:26.777879Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:26.777879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Horizon Optimization: Framework and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dmitry Rybin, Yushun Zhang, Zhi-Quan Luo","submitted_at":"2024-12-30T16:35:47Z","abstract_excerpt":"In modern engineering scenarios, there is often a strict upper bound on the number of algorithm iterations that can be performed within a given time limit. This raises the question of optimal algorithmic configuration for a fixed and finite iteration budget. In this work, we introduce the framework of finite horizon optimization, which focuses on optimizing the algorithm performance under a strict iteration budget $T$. We apply this framework to linear programming (LP) and propose Finite Horizon stepsize rule for the primal-dual method. The main challenge in the stepsize design is controlling "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.21068","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/2412.21068/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.21068","created_at":"2026-07-05T09:55:26.777938+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.21068v1","created_at":"2026-07-05T09:55:26.777938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.21068","created_at":"2026-07-05T09:55:26.777938+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWJJ5WLW5PZ7","created_at":"2026-07-05T09:55:26.777938+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWJJ5WLW5PZ72VQ3","created_at":"2026-07-05T09:55:26.777938+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWJJ5WLW","created_at":"2026-07-05T09:55:26.777938+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LWJJ5WLW5PZ72VQ3VCCIVYA54X","json":"https://pith.science/pith/LWJJ5WLW5PZ72VQ3VCCIVYA54X.json","graph_json":"https://pith.science/api/pith-number/LWJJ5WLW5PZ72VQ3VCCIVYA54X/graph.json","events_json":"https://pith.science/api/pith-number/LWJJ5WLW5PZ72VQ3VCCIVYA54X/events.json","paper":"https://pith.science/paper/LWJJ5WLW"},"agent_actions":{"view_html":"https://pith.science/pith/LWJJ5WLW5PZ72VQ3VCCIVYA54X","download_json":"https://pith.science/pith/LWJJ5WLW5PZ72VQ3VCCIVYA54X.json","view_paper":"https://pith.science/paper/LWJJ5WLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.21068&json=true","fetch_graph":"https://pith.science/api/pith-number/LWJJ5WLW5PZ72VQ3VCCIVYA54X/graph.json","fetch_events":"https://pith.science/api/pith-number/LWJJ5WLW5PZ72VQ3VCCIVYA54X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWJJ5WLW5PZ72VQ3VCCIVYA54X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWJJ5WLW5PZ72VQ3VCCIVYA54X/action/storage_attestation","attest_author":"https://pith.science/pith/LWJJ5WLW5PZ72VQ3VCCIVYA54X/action/author_attestation","sign_citation":"https://pith.science/pith/LWJJ5WLW5PZ72VQ3VCCIVYA54X/action/citation_signature","submit_replication":"https://pith.science/pith/LWJJ5WLW5PZ72VQ3VCCIVYA54X/action/replication_record"}},"created_at":"2026-07-05T09:55:26.777938+00:00","updated_at":"2026-07-05T09:55:26.777938+00:00"}