{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AHX3NQOVRSEIWR4MC3ATUODHSJ","short_pith_number":"pith:AHX3NQOV","schema_version":"1.0","canonical_sha256":"01efb6c1d58c888b478c16c13a3867927598a62c42a693e120da11b7eded2a33","source":{"kind":"arxiv","id":"1909.12387","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1909.12387","created_at":"2026-07-05T00:11:36.847693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.12387v1","created_at":"2026-07-05T00:11:36.847693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.12387","created_at":"2026-07-05T00:11:36.847693+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHX3NQOVRSEI","created_at":"2026-07-05T00:11:36.847693+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHX3NQOVRSEIWR4M","created_at":"2026-07-05T00:11:36.847693+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHX3NQOV","created_at":"2026-07-05T00:11:36.847693+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ","json":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ.json","graph_json":"https://pith.science/api/pith-number/AHX3NQOVRSEIWR4MC3ATUODHSJ/graph.json","events_json":"https://pith.science/api/pith-number/AHX3NQOVRSEIWR4MC3ATUODHSJ/events.json","paper":"https://pith.science/paper/AHX3NQOV"},"agent_actions":{"view_html":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ","download_json":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ.json","view_paper":"https://pith.science/paper/AHX3NQOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.12387&json=true","fetch_graph":"https://pith.science/api/pith-number/AHX3NQOVRSEIWR4MC3ATUODHSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/AHX3NQOVRSEIWR4MC3ATUODHSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/action/storage_attestation","attest_author":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/action/author_attestation","sign_citation":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/action/citation_signature","submit_replication":"https://pith.science/pith/AHX3NQOVRSEIWR4MC3ATUODHSJ/action/replication_record"}},"created_at":"2026-07-05T00:11:36.847693+00:00","updated_at":"2026-07-05T00:11:36.847693+00:00"}