{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4QCSP7MLPMA32454WSHKW2QI4X","short_pith_number":"pith:4QCSP7ML","canonical_record":{"source":{"id":"1508.02439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-10T21:56:20Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"28086373619783070b95681f98b533c24524b8b062e23c35fa8dec8d25bc9c78","abstract_canon_sha256":"5bca7a49748737779e012d5698f565374eb65e3ffb77960feda3386ce3d34687"},"schema_version":"1.0"},"canonical_sha256":"e40527fd8b7b01bd73bcb48eab6a08e5cb0c683246505a6121d795a2704227ba","source":{"kind":"arxiv","id":"1508.02439","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02439","created_at":"2026-05-18T01:30:57Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02439v2","created_at":"2026-05-18T01:30:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02439","created_at":"2026-05-18T01:30:57Z"},{"alias_kind":"pith_short_12","alias_value":"4QCSP7MLPMA3","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4QCSP7MLPMA32454","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4QCSP7ML","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4QCSP7MLPMA32454WSHKW2QI4X","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-10T21:56:20Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"28086373619783070b95681f98b533c24524b8b062e23c35fa8dec8d25bc9c78","abstract_canon_sha256":"5bca7a49748737779e012d5698f565374eb65e3ffb77960feda3386ce3d34687"},"schema_version":"1.0"},"canonical_sha256":"e40527fd8b7b01bd73bcb48eab6a08e5cb0c683246505a6121d795a2704227ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:57.912054Z","signature_b64":"V84psc+5dla3ZI/yTju9iGaeEmZ5OrZBdNis26J37iFB0838UebDGSJGCjY3xDMBVbr9ltrIPN7hw2HDtODFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e40527fd8b7b01bd73bcb48eab6a08e5cb0c683246505a6121d795a2704227ba","last_reissued_at":"2026-05-18T01:30:57.911427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:57.911427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02439","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-05-18T01:30:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ShN9XCjzAXHnWi7JWQL+UGW4c9kzm68VwzFBNjVnrpp1orPtRfIwhx9ysU7WN785XavxoP9lea/JmaEmzqOoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:04:42.614405Z"},"content_sha256":"e32ad69e86e1af05f365d20a6d132fa1219f0c669925de1c6c66efbdc9055279","schema_version":"1.0","event_id":"sha256:e32ad69e86e1af05f365d20a6d132fa1219f0c669925de1c6c66efbdc9055279"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4QCSP7MLPMA32454WSHKW2QI4X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Di Wang, Michael W. Mahoney, Satish Rao","submitted_at":"2015-08-10T21:56:20Z","abstract_excerpt":"The linear coupling method was introduced recently by Allen-Zhu and Orecchia for solving convex optimization problems with first order methods, and it provides a conceptually simple way to integrate a gradient descent step and mirror descent step in each iteration. The high-level approach of the linear coupling method is very flexible, and it has shown initial promise by providing improved algorithms for packing and covering linear programs. Somewhat surprisingly, however, while the dependence of the convergence rate on the error parameter $\\epsilon$ for packing problems was improved to $O(1/\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02439","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":""},"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:30:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86X/n0yzKdh5ZbILB4mTe+w9mKjW4o2x1XXPjHHLNsIdwa6lBq4v6O0CHrEL7N2pY2h7eQlZl1dh5JKdSxOuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:04:42.614780Z"},"content_sha256":"bd749dcdda81e8c885f1654854e72ad70c3595fb0fab536a6a00d561112476f5","schema_version":"1.0","event_id":"sha256:bd749dcdda81e8c885f1654854e72ad70c3595fb0fab536a6a00d561112476f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QCSP7MLPMA32454WSHKW2QI4X/bundle.json","state_url":"https://pith.science/pith/4QCSP7MLPMA32454WSHKW2QI4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QCSP7MLPMA32454WSHKW2QI4X/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-05-28T12:04:42Z","links":{"resolver":"https://pith.science/pith/4QCSP7MLPMA32454WSHKW2QI4X","bundle":"https://pith.science/pith/4QCSP7MLPMA32454WSHKW2QI4X/bundle.json","state":"https://pith.science/pith/4QCSP7MLPMA32454WSHKW2QI4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QCSP7MLPMA32454WSHKW2QI4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4QCSP7MLPMA32454WSHKW2QI4X","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":"5bca7a49748737779e012d5698f565374eb65e3ffb77960feda3386ce3d34687","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-10T21:56:20Z","title_canon_sha256":"28086373619783070b95681f98b533c24524b8b062e23c35fa8dec8d25bc9c78"},"schema_version":"1.0","source":{"id":"1508.02439","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02439","created_at":"2026-05-18T01:30:57Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02439v2","created_at":"2026-05-18T01:30:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02439","created_at":"2026-05-18T01:30:57Z"},{"alias_kind":"pith_short_12","alias_value":"4QCSP7MLPMA3","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4QCSP7MLPMA32454","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4QCSP7ML","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:bd749dcdda81e8c885f1654854e72ad70c3595fb0fab536a6a00d561112476f5","target":"graph","created_at":"2026-05-18T01:30:57Z","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":"The linear coupling method was introduced recently by Allen-Zhu and Orecchia for solving convex optimization problems with first order methods, and it provides a conceptually simple way to integrate a gradient descent step and mirror descent step in each iteration. The high-level approach of the linear coupling method is very flexible, and it has shown initial promise by providing improved algorithms for packing and covering linear programs. Somewhat surprisingly, however, while the dependence of the convergence rate on the error parameter $\\epsilon$ for packing problems was improved to $O(1/\\","authors_text":"Di Wang, Michael W. Mahoney, Satish Rao","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-10T21:56:20Z","title":"Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02439","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:e32ad69e86e1af05f365d20a6d132fa1219f0c669925de1c6c66efbdc9055279","target":"record","created_at":"2026-05-18T01:30:57Z","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":"5bca7a49748737779e012d5698f565374eb65e3ffb77960feda3386ce3d34687","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-10T21:56:20Z","title_canon_sha256":"28086373619783070b95681f98b533c24524b8b062e23c35fa8dec8d25bc9c78"},"schema_version":"1.0","source":{"id":"1508.02439","kind":"arxiv","version":2}},"canonical_sha256":"e40527fd8b7b01bd73bcb48eab6a08e5cb0c683246505a6121d795a2704227ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e40527fd8b7b01bd73bcb48eab6a08e5cb0c683246505a6121d795a2704227ba","first_computed_at":"2026-05-18T01:30:57.911427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:57.911427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V84psc+5dla3ZI/yTju9iGaeEmZ5OrZBdNis26J37iFB0838UebDGSJGCjY3xDMBVbr9ltrIPN7hw2HDtODFBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:57.912054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02439","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e32ad69e86e1af05f365d20a6d132fa1219f0c669925de1c6c66efbdc9055279","sha256:bd749dcdda81e8c885f1654854e72ad70c3595fb0fab536a6a00d561112476f5"],"state_sha256":"2364da8f3b9ea5967f309e16e867b2252eea18b92cd573b624f98de6dc1e4743"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYAJ33DGQzrOqbkN5RXl4ayKVPPaLXPdNPWXSTGJSpD8GvGnTyjgoyISmZ7cySticuoHsnxy5jiNbqNYXfxwDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:04:42.616793Z","bundle_sha256":"40d3fa558c2007788ac567d48c90bbfaa61159fc6330e9ee6b5153bfb46c285c"}}