{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:73KSUVYJMUQ6PQC6E3BKADI4T3","short_pith_number":"pith:73KSUVYJ","schema_version":"1.0","canonical_sha256":"fed52a57096521e7c05e26c2a00d1c9edb0d051ea9ef695b2f25695812ae41b9","source":{"kind":"arxiv","id":"2505.09030","version":1},"attestation_state":"computed","paper":{"title":"Aging-Aware Battery Control via Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Giray Ogut, Obidike Nnorom Jr., Philip Levis, Stephen Boyd","submitted_at":"2025-05-13T23:56:16Z","abstract_excerpt":"We consider the task of controlling a battery while balancing two competing objectives that evolve over different time scales. The short-term objective, such as arbitrage or load smoothing, improves with more battery cycling, while the long-term objective is to maximize battery lifetime, which discourages cycling. Using a semi-empirical aging model, we formulate this problem as a convex optimization problem. We use model predictive control (MPC) with a convex approximation of aging dynamics to optimally manage the trade-off between performance and degradation. Through simulations, we quantify "},"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":"2505.09030","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-13T23:56:16Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"c147a5f5c1f88feda46a80181e505dc18d4cd9858a60eef7f9d8a71fadf1c76e","abstract_canon_sha256":"e8bc93a4becfc3528b14c74abcb3f838fa4fc7134e359875aa1d594264101e76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:49.153020Z","signature_b64":"BrjqfoQc2TWjHsvvgnTfQPaZsT4eeDCC8MCdBTT1LrKt67v2+auePqKQ4wIF+J7Zlyj1TYMb+azZYcxLZZdrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fed52a57096521e7c05e26c2a00d1c9edb0d051ea9ef695b2f25695812ae41b9","last_reissued_at":"2026-07-05T11:02:49.152519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:49.152519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aging-Aware Battery Control via Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Giray Ogut, Obidike Nnorom Jr., Philip Levis, Stephen Boyd","submitted_at":"2025-05-13T23:56:16Z","abstract_excerpt":"We consider the task of controlling a battery while balancing two competing objectives that evolve over different time scales. The short-term objective, such as arbitrage or load smoothing, improves with more battery cycling, while the long-term objective is to maximize battery lifetime, which discourages cycling. Using a semi-empirical aging model, we formulate this problem as a convex optimization problem. We use model predictive control (MPC) with a convex approximation of aging dynamics to optimally manage the trade-off between performance and degradation. Through simulations, we quantify "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09030","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/2505.09030/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":"2505.09030","created_at":"2026-07-05T11:02:49.152588+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.09030v1","created_at":"2026-07-05T11:02:49.152588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09030","created_at":"2026-07-05T11:02:49.152588+00:00"},{"alias_kind":"pith_short_12","alias_value":"73KSUVYJMUQ6","created_at":"2026-07-05T11:02:49.152588+00:00"},{"alias_kind":"pith_short_16","alias_value":"73KSUVYJMUQ6PQC6","created_at":"2026-07-05T11:02:49.152588+00:00"},{"alias_kind":"pith_short_8","alias_value":"73KSUVYJ","created_at":"2026-07-05T11:02:49.152588+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11513","citing_title":"Automatic Generation of Explicit Quadratic Programming Solvers","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/73KSUVYJMUQ6PQC6E3BKADI4T3","json":"https://pith.science/pith/73KSUVYJMUQ6PQC6E3BKADI4T3.json","graph_json":"https://pith.science/api/pith-number/73KSUVYJMUQ6PQC6E3BKADI4T3/graph.json","events_json":"https://pith.science/api/pith-number/73KSUVYJMUQ6PQC6E3BKADI4T3/events.json","paper":"https://pith.science/paper/73KSUVYJ"},"agent_actions":{"view_html":"https://pith.science/pith/73KSUVYJMUQ6PQC6E3BKADI4T3","download_json":"https://pith.science/pith/73KSUVYJMUQ6PQC6E3BKADI4T3.json","view_paper":"https://pith.science/paper/73KSUVYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.09030&json=true","fetch_graph":"https://pith.science/api/pith-number/73KSUVYJMUQ6PQC6E3BKADI4T3/graph.json","fetch_events":"https://pith.science/api/pith-number/73KSUVYJMUQ6PQC6E3BKADI4T3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73KSUVYJMUQ6PQC6E3BKADI4T3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73KSUVYJMUQ6PQC6E3BKADI4T3/action/storage_attestation","attest_author":"https://pith.science/pith/73KSUVYJMUQ6PQC6E3BKADI4T3/action/author_attestation","sign_citation":"https://pith.science/pith/73KSUVYJMUQ6PQC6E3BKADI4T3/action/citation_signature","submit_replication":"https://pith.science/pith/73KSUVYJMUQ6PQC6E3BKADI4T3/action/replication_record"}},"created_at":"2026-07-05T11:02:49.152588+00:00","updated_at":"2026-07-05T11:02:49.152588+00:00"}