{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HDUQPJWQYRJJUJFYFBQQZABUG4","short_pith_number":"pith:HDUQPJWQ","canonical_record":{"source":{"id":"2311.08827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-15T10:02:42Z","cross_cats_sorted":[],"title_canon_sha256":"7a395d7100be5bf2a6160a374e10e1f015c2af840d7aeec1976b5babbceb55f5","abstract_canon_sha256":"e87695bf2194942c965948e6c2802ecfeb5f579e5f450a594b5eda6a21f75264"},"schema_version":"1.0"},"canonical_sha256":"38e907a6d0c4529a24b828610c803437333598b14836271122bf5c4e1cb9fbe3","source":{"kind":"arxiv","id":"2311.08827","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.08827","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"2311.08827v2","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08827","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"HDUQPJWQYRJJ","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"pith_short_16","alias_value":"HDUQPJWQYRJJUJFY","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"pith_short_8","alias_value":"HDUQPJWQ","created_at":"2026-07-05T07:29:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HDUQPJWQYRJJUJFYFBQQZABUG4","target":"record","payload":{"canonical_record":{"source":{"id":"2311.08827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-15T10:02:42Z","cross_cats_sorted":[],"title_canon_sha256":"7a395d7100be5bf2a6160a374e10e1f015c2af840d7aeec1976b5babbceb55f5","abstract_canon_sha256":"e87695bf2194942c965948e6c2802ecfeb5f579e5f450a594b5eda6a21f75264"},"schema_version":"1.0"},"canonical_sha256":"38e907a6d0c4529a24b828610c803437333598b14836271122bf5c4e1cb9fbe3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:54.673514Z","signature_b64":"UAGTxR4l3lCXJE5qWeknFvRZ7qEAt57BQBCeEyStmZxL3Ri1k6cDMUagvw+BU9Yh/VjpPgoBa6SvxJtGRwUNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e907a6d0c4529a24b828610c803437333598b14836271122bf5c4e1cb9fbe3","last_reissued_at":"2026-07-05T07:29:54.673028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:54.673028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.08827","source_version":2,"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-07-05T07:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lAqlESMU/qta9Z7YCqJ38X7u/TMVyB/EI8cjQVLVfJs8GSNk3gUn+VNoghIgbZs/AYZxZDkSpJf7xd2eB7qPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:10:19.637123Z"},"content_sha256":"46f82be10b08cdc63dea6600de677a7aa3342ee2c63e8675cf842a597bd880a7","schema_version":"1.0","event_id":"sha256:46f82be10b08cdc63dea6600de677a7aa3342ee2c63e8675cf842a597bd880a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HDUQPJWQYRJJUJFYFBQQZABUG4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deep Reinforcement Learning Approach to Efficient Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daokuan Zhu, Jie Lu, Tianqi Xu","submitted_at":"2023-11-15T10:02:42Z","abstract_excerpt":"In distributed optimization, the practical problem-solving performance is essentially sensitive to algorithm selection, parameter setting, problem type and data pattern. Thus, it is often laborious to acquire a highly efficient method for a given specific problem. In this paper, we propose a learning-based method to achieve efficient distributed optimization over networked systems. Specifically, a deep reinforcement learning (DRL) framework is developed for adaptive configuration within a parameterized unifying algorithmic form, which incorporates an abundance of decentralized first-order and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08827","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/2311.08827/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"},"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-07-05T07:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O504oSvAMKUlbnjl7qTV6XY4SEmdXc6A3RghrZ/g+Rqs6WAqF5Hn/mtQA2GiG5m3V+Uexw7w3EuPROYAUGD1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:10:19.637656Z"},"content_sha256":"5dafd952e6a72b4d7699b3e84952004bde2bf6e2d4f0eae99a95448f5bddabfe","schema_version":"1.0","event_id":"sha256:5dafd952e6a72b4d7699b3e84952004bde2bf6e2d4f0eae99a95448f5bddabfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDUQPJWQYRJJUJFYFBQQZABUG4/bundle.json","state_url":"https://pith.science/pith/HDUQPJWQYRJJUJFYFBQQZABUG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDUQPJWQYRJJUJFYFBQQZABUG4/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-08-14T08:10:19Z","links":{"resolver":"https://pith.science/pith/HDUQPJWQYRJJUJFYFBQQZABUG4","bundle":"https://pith.science/pith/HDUQPJWQYRJJUJFYFBQQZABUG4/bundle.json","state":"https://pith.science/pith/HDUQPJWQYRJJUJFYFBQQZABUG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDUQPJWQYRJJUJFYFBQQZABUG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HDUQPJWQYRJJUJFYFBQQZABUG4","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":"e87695bf2194942c965948e6c2802ecfeb5f579e5f450a594b5eda6a21f75264","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-15T10:02:42Z","title_canon_sha256":"7a395d7100be5bf2a6160a374e10e1f015c2af840d7aeec1976b5babbceb55f5"},"schema_version":"1.0","source":{"id":"2311.08827","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.08827","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"2311.08827v2","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08827","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"HDUQPJWQYRJJ","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"pith_short_16","alias_value":"HDUQPJWQYRJJUJFY","created_at":"2026-07-05T07:29:54Z"},{"alias_kind":"pith_short_8","alias_value":"HDUQPJWQ","created_at":"2026-07-05T07:29:54Z"}],"graph_snapshots":[{"event_id":"sha256:5dafd952e6a72b4d7699b3e84952004bde2bf6e2d4f0eae99a95448f5bddabfe","target":"graph","created_at":"2026-07-05T07:29:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.08827/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In distributed optimization, the practical problem-solving performance is essentially sensitive to algorithm selection, parameter setting, problem type and data pattern. Thus, it is often laborious to acquire a highly efficient method for a given specific problem. In this paper, we propose a learning-based method to achieve efficient distributed optimization over networked systems. Specifically, a deep reinforcement learning (DRL) framework is developed for adaptive configuration within a parameterized unifying algorithmic form, which incorporates an abundance of decentralized first-order and ","authors_text":"Daokuan Zhu, Jie Lu, Tianqi Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-15T10:02:42Z","title":"A Deep Reinforcement Learning Approach to Efficient Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08827","kind":"arxiv","version":2},"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:46f82be10b08cdc63dea6600de677a7aa3342ee2c63e8675cf842a597bd880a7","target":"record","created_at":"2026-07-05T07:29:54Z","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":"e87695bf2194942c965948e6c2802ecfeb5f579e5f450a594b5eda6a21f75264","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-15T10:02:42Z","title_canon_sha256":"7a395d7100be5bf2a6160a374e10e1f015c2af840d7aeec1976b5babbceb55f5"},"schema_version":"1.0","source":{"id":"2311.08827","kind":"arxiv","version":2}},"canonical_sha256":"38e907a6d0c4529a24b828610c803437333598b14836271122bf5c4e1cb9fbe3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38e907a6d0c4529a24b828610c803437333598b14836271122bf5c4e1cb9fbe3","first_computed_at":"2026-07-05T07:29:54.673028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:29:54.673028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UAGTxR4l3lCXJE5qWeknFvRZ7qEAt57BQBCeEyStmZxL3Ri1k6cDMUagvw+BU9Yh/VjpPgoBa6SvxJtGRwUNCw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:29:54.673514Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.08827","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46f82be10b08cdc63dea6600de677a7aa3342ee2c63e8675cf842a597bd880a7","sha256:5dafd952e6a72b4d7699b3e84952004bde2bf6e2d4f0eae99a95448f5bddabfe"],"state_sha256":"550f205177ffac7e8b471fb2ad137d4b68c029e2d98d93327fdf6bc279708855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWT8pqRL0syR8p8V90mm79Vm9m2BhONsMwsgBQFeGyIJGNAwOfl2+3KQtMcw59MoW00LcD/+bh2GPa2D+/9uBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:10:19.642721Z","bundle_sha256":"ff6249253ef5899c923bdcbe561f84c64b070ee0878c6f9afa69bebead108cd6"}}