{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AHX3NQOVRSEIWR4MC3ATUODHSJ","short_pith_number":"pith:AHX3NQOV","canonical_record":{"source":{"id":"1909.12387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-26T21:02:51Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"ed38f22a2ba3334d81e05b0efee8cf4a6abb3b5e833715cbe607e6e49b538fe8","abstract_canon_sha256":"185dc55beeb1a3862856d796cea54898c0fd844de7149888c454c54ac8bbfa69"},"schema_version":"1.0"},"canonical_sha256":"01efb6c1d58c888b478c16c13a3867927598a62c42a693e120da11b7eded2a33","source":{"kind":"arxiv","id":"1909.12387","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AHX3NQOVRSEIWR4MC3ATUODHSJ","target":"record","payload":{"canonical_record":{"source":{"id":"1909.12387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-26T21:02:51Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"ed38f22a2ba3334d81e05b0efee8cf4a6abb3b5e833715cbe607e6e49b538fe8","abstract_canon_sha256":"185dc55beeb1a3862856d796cea54898c0fd844de7149888c454c54ac8bbfa69"},"schema_version":"1.0"},"canonical_sha256":"01efb6c1d58c888b478c16c13a3867927598a62c42a693e120da11b7eded2a33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:36.848038Z","signature_b64":"PI8wQfgKh46teznob5nUc6XWE8txdbYe8hcrKE2Z2MrA8LHtV+oVZb5nFJncTS8bi/bVRK5nqP1w+Y/NLi90BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01efb6c1d58c888b478c16c13a3867927598a62c42a693e120da11b7eded2a33","last_reissued_at":"2026-07-05T00:11:36.847626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:36.847626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.12387","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-07-05T00:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZF9drKApssjmSuodbHwQKFGstmZtOSdaWTzLwjN7bW/41BeArhQ0smEAclh0/jUxJzXOyvT365pdLAAXNISjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-29T08:52:02.003789Z"},"content_sha256":"78cd1a0dac3985ac8ac717408cf736307f9ab447f939c09b2b508f92e2388ff0","schema_version":"1.0","event_id":"sha256:78cd1a0dac3985ac8ac717408cf736307f9ab447f939c09b2b508f92e2388ff0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AHX3NQOVRSEIWR4MC3ATUODHSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster width-dependent algorithm for mixed packing and covering LPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"math.OC","authors_text":"Digvijay Boob, Di Wang, Saurabh Sawlani","submitted_at":"2019-09-26T21:02:51Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.12387","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.12387/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-05T00:11:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wI8EINJierx4dZ6i1PdHGO811H2Kwv9JKhvkxkzerGoiEG9S8dzht1GEQ4MGHdSQXZj1vicqd2JLmKewHzerDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-29T08:52:02.004172Z"},"content_sha256":"83dddbefe4da1f8337aab23700704d5cdc718218312be5e068f795b5546b4ad3","schema_version":"1.0","event_id":"sha256:83dddbefe4da1f8337aab23700704d5cdc718218312be5e068f795b5546b4ad3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/bundle.json","state_url":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/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-07-29T08:52:02Z","links":{"resolver":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ","bundle":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/bundle.json","state":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUZiXUNxvKUyCmGbn9EVjH+rzxbwedplWmxmVyCReHMZtzjRBsoj0m8v/qF7KCJvSeqoICC4etx0yUFMTnlFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-29T08:52:02.008761Z","bundle_sha256":"b430195f9b53063d974c205887cb1c4689e406fb58c6d6f04cfc5ffa933d9505"}}