{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AHX3NQOVRSEIWR4MC3ATUODHSJ","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":"185dc55beeb1a3862856d796cea54898c0fd844de7149888c454c54ac8bbfa69","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-26T21:02:51Z","title_canon_sha256":"ed38f22a2ba3334d81e05b0efee8cf4a6abb3b5e833715cbe607e6e49b538fe8"},"schema_version":"1.0","source":{"id":"1909.12387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.12387","created_at":"2026-07-05T00:11:36Z"},{"alias_kind":"arxiv_version","alias_value":"1909.12387v1","created_at":"2026-07-05T00:11:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.12387","created_at":"2026-07-05T00:11:36Z"},{"alias_kind":"pith_short_12","alias_value":"AHX3NQOVRSEI","created_at":"2026-07-05T00:11:36Z"},{"alias_kind":"pith_short_16","alias_value":"AHX3NQOVRSEIWR4M","created_at":"2026-07-05T00:11:36Z"},{"alias_kind":"pith_short_8","alias_value":"AHX3NQOV","created_at":"2026-07-05T00:11:36Z"}],"graph_snapshots":[{"event_id":"sha256:83dddbefe4da1f8337aab23700704d5cdc718218312be5e068f795b5546b4ad3","target":"graph","created_at":"2026-07-05T00:11:36Z","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/1909.12387/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we give a faster width-dependent algorithm for mixed packing-covering LPs. Mixed packing-covering LPs are fundamental to combinatorial optimization in computer science and operations research. Our algorithm finds a $1+\\eps$ approximate solution in time $O(Nw/ \\eps)$, where $N$ is number of nonzero entries in the constraint matrix and $w$ is the maximum number of nonzeros in any constraint. This run-time is better than Nesterov's smoothing algorithm which requires $O(N\\sqrt{n}w/ \\eps)$ where $n$ is the dimension of the problem. Our work utilizes the framework of area convexity in","authors_text":"Digvijay Boob, Di Wang, Saurabh Sawlani","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-26T21:02:51Z","title":"Faster width-dependent algorithm for mixed packing and covering LPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.12387","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:78cd1a0dac3985ac8ac717408cf736307f9ab447f939c09b2b508f92e2388ff0","target":"record","created_at":"2026-07-05T00:11:36Z","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":"185dc55beeb1a3862856d796cea54898c0fd844de7149888c454c54ac8bbfa69","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-26T21:02:51Z","title_canon_sha256":"ed38f22a2ba3334d81e05b0efee8cf4a6abb3b5e833715cbe607e6e49b538fe8"},"schema_version":"1.0","source":{"id":"1909.12387","kind":"arxiv","version":1}},"canonical_sha256":"01efb6c1d58c888b478c16c13a3867927598a62c42a693e120da11b7eded2a33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01efb6c1d58c888b478c16c13a3867927598a62c42a693e120da11b7eded2a33","first_computed_at":"2026-07-05T00:11:36.847626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:11:36.847626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PI8wQfgKh46teznob5nUc6XWE8txdbYe8hcrKE2Z2MrA8LHtV+oVZb5nFJncTS8bi/bVRK5nqP1w+Y/NLi90BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:11:36.848038Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.12387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78cd1a0dac3985ac8ac717408cf736307f9ab447f939c09b2b508f92e2388ff0","sha256:83dddbefe4da1f8337aab23700704d5cdc718218312be5e068f795b5546b4ad3"],"state_sha256":"d5645545ca7faa929f70e9e9fce7cf6f408a7040a2e5ea1a40ec98401932e4b7"}