{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PMO3TFUBON35HZGBDNUR3XELVV","short_pith_number":"pith:PMO3TFUB","schema_version":"1.0","canonical_sha256":"7b1db996817377d3e4c11b691ddc8bad54f6b37feace5d6ed09c4483a78be667","source":{"kind":"arxiv","id":"2502.20568","version":2},"attestation_state":"computed","paper":{"title":"A Tutorial on Multi-time Scale Optimization Models and Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Asha Ramanujam, Can Li","submitted_at":"2025-02-27T22:15:55Z","abstract_excerpt":"Systems across different industries consist of interrelated processes and decisions in different time scales including long-time decisions and short-term decisions. To optimize such systems, the most effective approach is to formulate and solve multi-time scale optimization models that integrate various decision layers. In this tutorial, we provide an overview of multi-time scale optimization models and review the algorithms used to solve them. We also discuss the metric Value of the Multi-scale Model (VMM) introduced to quantify the benefits of using multi-time scale optimization models as op"},"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":"2502.20568","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-27T22:15:55Z","cross_cats_sorted":[],"title_canon_sha256":"7e01e2d8b961762ee0c17813086cd0e5e876cd6ae760b9fd1ecc8cda4b1931b8","abstract_canon_sha256":"fd3cd9e8e59d95c313e14fcb3b1d7bbba1c7761cee3eafce65478a010fcd22e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:23.082033Z","signature_b64":"pklySxRTzw7yOekKzgn4jC6/6fIpFVWJA8KOxSoSYomKPujIn1mufswkpElCc0QGvyVW8QsX7kCzKQl96qh2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b1db996817377d3e4c11b691ddc8bad54f6b37feace5d6ed09c4483a78be667","last_reissued_at":"2026-07-05T10:38:23.081603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:23.081603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tutorial on Multi-time Scale Optimization Models and Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Asha Ramanujam, Can Li","submitted_at":"2025-02-27T22:15:55Z","abstract_excerpt":"Systems across different industries consist of interrelated processes and decisions in different time scales including long-time decisions and short-term decisions. To optimize such systems, the most effective approach is to formulate and solve multi-time scale optimization models that integrate various decision layers. In this tutorial, we provide an overview of multi-time scale optimization models and review the algorithms used to solve them. We also discuss the metric Value of the Multi-scale Model (VMM) introduced to quantify the benefits of using multi-time scale optimization models as op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.20568","kind":"arxiv","version":2},"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/2502.20568/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":"2502.20568","created_at":"2026-07-05T10:38:23.081661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.20568v2","created_at":"2026-07-05T10:38:23.081661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.20568","created_at":"2026-07-05T10:38:23.081661+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMO3TFUBON35","created_at":"2026-07-05T10:38:23.081661+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMO3TFUBON35HZGB","created_at":"2026-07-05T10:38:23.081661+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMO3TFUB","created_at":"2026-07-05T10:38:23.081661+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02255","citing_title":"SafeOR-Gym: A Benchmark Suite for Safe Reinforcement Learning Algorithms on Practical Operations Research Problems","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PMO3TFUBON35HZGBDNUR3XELVV","json":"https://pith.science/pith/PMO3TFUBON35HZGBDNUR3XELVV.json","graph_json":"https://pith.science/api/pith-number/PMO3TFUBON35HZGBDNUR3XELVV/graph.json","events_json":"https://pith.science/api/pith-number/PMO3TFUBON35HZGBDNUR3XELVV/events.json","paper":"https://pith.science/paper/PMO3TFUB"},"agent_actions":{"view_html":"https://pith.science/pith/PMO3TFUBON35HZGBDNUR3XELVV","download_json":"https://pith.science/pith/PMO3TFUBON35HZGBDNUR3XELVV.json","view_paper":"https://pith.science/paper/PMO3TFUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.20568&json=true","fetch_graph":"https://pith.science/api/pith-number/PMO3TFUBON35HZGBDNUR3XELVV/graph.json","fetch_events":"https://pith.science/api/pith-number/PMO3TFUBON35HZGBDNUR3XELVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMO3TFUBON35HZGBDNUR3XELVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMO3TFUBON35HZGBDNUR3XELVV/action/storage_attestation","attest_author":"https://pith.science/pith/PMO3TFUBON35HZGBDNUR3XELVV/action/author_attestation","sign_citation":"https://pith.science/pith/PMO3TFUBON35HZGBDNUR3XELVV/action/citation_signature","submit_replication":"https://pith.science/pith/PMO3TFUBON35HZGBDNUR3XELVV/action/replication_record"}},"created_at":"2026-07-05T10:38:23.081661+00:00","updated_at":"2026-07-05T10:38:23.081661+00:00"}