{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YOMRS3B4VOOEUDWE6G4WQSK4YH","short_pith_number":"pith:YOMRS3B4","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"},"canonical_sha256":"c399196c3cab9c4a0ec4f1b968495cc1f9fcca109477fefbf08bbd798644725b","source":{"kind":"arxiv","id":"1511.02517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02517","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02517v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02517","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"YOMRS3B4VOOE","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YOMRS3B4VOOEUDWE","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YOMRS3B4","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YOMRS3B4VOOEUDWE6G4WQSK4YH","target":"record","payload":{"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"},"canonical_sha256":"c399196c3cab9c4a0ec4f1b968495cc1f9fcca109477fefbf08bbd798644725b","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"},"source_kind":"arxiv","source_id":"1511.02517","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-05-18T01:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8EAmFaqoCVF8GI3oL3nJw9fYjI3hI0/lTbXz/YdbS16TPYh+O470NBp1AtZXITT24Lf6p+WYabLW28uI5XXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:02:46.961346Z"},"content_sha256":"e72a7efc8ee7e9fe07b64db9e67e6bfae31e05771ab6e3161dd333ebc26548fa","schema_version":"1.0","event_id":"sha256:e72a7efc8ee7e9fe07b64db9e67e6bfae31e05771ab6e3161dd333ebc26548fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YOMRS3B4VOOEUDWE6G4WQSK4YH","target":"graph","payload":{"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"},"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-05-18T01:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K57+i/MJTX079wtuA3xXBEIVQT5Mei3EDDkEysNMb97zLUL9d6SuGVy1fo5nyCQFVcSUFT7yg1HmNh3N3cdGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:02:46.961699Z"},"content_sha256":"1ced8b38025ff7e7ca264dfbc3bc98ae04a521c2f7fefccfae06a22f2cf8c51b","schema_version":"1.0","event_id":"sha256:1ced8b38025ff7e7ca264dfbc3bc98ae04a521c2f7fefccfae06a22f2cf8c51b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/bundle.json","state_url":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/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-06-02T18:02:46Z","links":{"resolver":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH","bundle":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/bundle.json","state":"https://pith.science/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOMRS3B4VOOEUDWE6G4WQSK4YH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YOMRS3B4VOOEUDWE6G4WQSK4YH","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":"237197636f6bc081b65fe3ddeb81dc604a60216cd98ea0e8f352f74567f7f072","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T19:23:07Z","title_canon_sha256":"f36e598826dafd744e2411b8db0bef7d8e2ed44895a11b787e9ee4a30a6ab5db"},"schema_version":"1.0","source":{"id":"1511.02517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02517","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02517v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02517","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"YOMRS3B4VOOE","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YOMRS3B4VOOEUDWE","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YOMRS3B4","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:1ced8b38025ff7e7ca264dfbc3bc98ae04a521c2f7fefccfae06a22f2cf8c51b","target":"graph","created_at":"2026-05-18T01:27:30Z","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"},"paper":{"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 ","authors_text":"Douglas J. Leith, V\\'ictor Valls","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T19:23:07Z","title":"Descent With Approximate Multipliers is Enough: Generalising Max-Weight"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02517","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:e72a7efc8ee7e9fe07b64db9e67e6bfae31e05771ab6e3161dd333ebc26548fa","target":"record","created_at":"2026-05-18T01:27:30Z","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":"237197636f6bc081b65fe3ddeb81dc604a60216cd98ea0e8f352f74567f7f072","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-08T19:23:07Z","title_canon_sha256":"f36e598826dafd744e2411b8db0bef7d8e2ed44895a11b787e9ee4a30a6ab5db"},"schema_version":"1.0","source":{"id":"1511.02517","kind":"arxiv","version":1}},"canonical_sha256":"c399196c3cab9c4a0ec4f1b968495cc1f9fcca109477fefbf08bbd798644725b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c399196c3cab9c4a0ec4f1b968495cc1f9fcca109477fefbf08bbd798644725b","first_computed_at":"2026-05-18T01:27:30.037970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:30.037970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IqrMMCpErLCWYhtL04CC/kCUpQq75JdhjApBq1Df16Qp9c87pxMsn74FYpapYS7M+RZuFK/kWPKgP7uVQSWXDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:30.038518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e72a7efc8ee7e9fe07b64db9e67e6bfae31e05771ab6e3161dd333ebc26548fa","sha256:1ced8b38025ff7e7ca264dfbc3bc98ae04a521c2f7fefccfae06a22f2cf8c51b"],"state_sha256":"b5838e809638b56330b55b7fb9ea97c15522ff0556280ffbbf5a5612961bcbd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACqjWpdyxobX26zVy+ts8KyMS4dal9YhTrS/ewAEeD7TqxhpRsiUuMv5SIWSNf4TQRVSqxYQgg0EXCzxMy02Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:02:46.963696Z","bundle_sha256":"12d598ea40b5883a5acccdf233be955708694458b20e3dc8bccf8c0d5c5e7fb9"}}