{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YOMRS3B4VOOEUDWE6G4WQSK4YH","short_pith_number":"pith:YOMRS3B4","schema_version":"1.0","canonical_sha256":"c399196c3cab9c4a0ec4f1b968495cc1f9fcca109477fefbf08bbd798644725b","source":{"kind":"arxiv","id":"1511.02517","version":1},"attestation_state":"computed","paper":{"title":"Descent With Approximate Multipliers is Enough: Generalising Max-Weight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Douglas J. Leith, V\\'ictor Valls","submitted_at":"2015-11-08T19:23:07Z","abstract_excerpt":"We study the use of approximate Lagrange multipliers and discrete actions in solving convex optimisation problems. We observe that descent, which can be ensured using a wide range of approaches (gradient, subgradient, Newton, etc.), is orthogonal to the choice of multipliers. Using the Skorokhod representation for a queueing process we show that approximate multipliers can be constructed in a number of ways. These observations lead to the generalisation of (i) essentially any descent method to encompass use of discrete actions and queues and (ii) max-weight scheduling to encompass new descent "},"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":"1511.02517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T19:23:07Z","cross_cats_sorted":[],"title_canon_sha256":"f36e598826dafd744e2411b8db0bef7d8e2ed44895a11b787e9ee4a30a6ab5db","abstract_canon_sha256":"237197636f6bc081b65fe3ddeb81dc604a60216cd98ea0e8f352f74567f7f072"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:30.038518Z","signature_b64":"IqrMMCpErLCWYhtL04CC/kCUpQq75JdhjApBq1Df16Qp9c87pxMsn74FYpapYS7M+RZuFK/kWPKgP7uVQSWXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c399196c3cab9c4a0ec4f1b968495cc1f9fcca109477fefbf08bbd798644725b","last_reissued_at":"2026-05-18T01:27:30.037970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:30.037970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Descent With Approximate Multipliers is Enough: Generalising Max-Weight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Douglas J. Leith, V\\'ictor Valls","submitted_at":"2015-11-08T19:23:07Z","abstract_excerpt":"We study the use of approximate Lagrange multipliers and discrete actions in solving convex optimisation problems. We observe that descent, which can be ensured using a wide range of approaches (gradient, subgradient, Newton, etc.), is orthogonal to the choice of multipliers. Using the Skorokhod representation for a queueing process we show that approximate multipliers can be constructed in a number of ways. These observations lead to the generalisation of (i) essentially any descent method to encompass use of discrete actions and queues and (ii) max-weight scheduling to encompass new descent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02517","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":""},"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":"1511.02517","created_at":"2026-05-18T01:27:30.038045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02517v1","created_at":"2026-05-18T01:27:30.038045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02517","created_at":"2026-05-18T01:27:30.038045+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOMRS3B4VOOE","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOMRS3B4VOOEUDWE","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOMRS3B4","created_at":"2026-05-18T12:29:50.041715+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/YOMRS3B4VOOEUDWE6G4WQSK4YH","json":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH.json","graph_json":"https://pith.science/api/pith-number/YOMRS3B4VOOEUDWE6G4WQSK4YH/graph.json","events_json":"https://pith.science/api/pith-number/YOMRS3B4VOOEUDWE6G4WQSK4YH/events.json","paper":"https://pith.science/paper/YOMRS3B4"},"agent_actions":{"view_html":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH","download_json":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH.json","view_paper":"https://pith.science/paper/YOMRS3B4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02517&json=true","fetch_graph":"https://pith.science/api/pith-number/YOMRS3B4VOOEUDWE6G4WQSK4YH/graph.json","fetch_events":"https://pith.science/api/pith-number/YOMRS3B4VOOEUDWE6G4WQSK4YH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/action/storage_attestation","attest_author":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/action/author_attestation","sign_citation":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/action/citation_signature","submit_replication":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/action/replication_record"}},"created_at":"2026-05-18T01:27:30.038045+00:00","updated_at":"2026-05-18T01:27:30.038045+00:00"}