{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G6YY2NVWCOUSVOPMRISYEH6KOW","short_pith_number":"pith:G6YY2NVW","schema_version":"1.0","canonical_sha256":"37b18d36b613a92ab9ec8a25821fca75a54357d6d4456238ac93f89db0cfaa85","source":{"kind":"arxiv","id":"1511.06468","version":1},"attestation_state":"computed","paper":{"title":"Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Di Wang, Michael Mahoney, Nishanth Mohan, Satish Rao","submitted_at":"2015-11-20T01:10:13Z","abstract_excerpt":"We provide improved parallel approximation algorithms for the important class of packing and covering linear programs. In particular, we present new parallel $\\epsilon$-approximate packing and covering solvers which run in $\\tilde{O}(1/\\epsilon^2)$ expected time, i.e., in expectation they take $\\tilde{O}(1/\\epsilon^2)$ iterations and they do $\\tilde{O}(N/\\epsilon^2)$ total work, where $N$ is the size of the constraint matrix and $\\epsilon$ is the error parameter, and where the $\\tilde{O}$ hides logarithmic factors. To achieve our improvement, we introduce an algorithmic technique of broader 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":"1511.06468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-20T01:10:13Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"41b8f29630e00d670883ae80ee80e95a82216d91a71336cbc7e72bb1fd68336d","abstract_canon_sha256":"67f530707fb076b1a186bfe5a90f8580987d155c22a230878388330524d78b23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:24.456905Z","signature_b64":"ae3rwAANmSXLN2o2p6yg005PINCj/65ZelHDbmi8o2/EbZHRq6oHRG2bBHXDA9R+pi0E6Cfil8QZUJDxoE6aAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37b18d36b613a92ab9ec8a25821fca75a54357d6d4456238ac93f89db0cfaa85","last_reissued_at":"2026-05-18T01:26:24.456371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:24.456371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Parallel Solver for Positive Linear Programs via Dynamically-Bucketed Selective Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Di Wang, Michael Mahoney, Nishanth Mohan, Satish Rao","submitted_at":"2015-11-20T01:10:13Z","abstract_excerpt":"We provide improved parallel approximation algorithms for the important class of packing and covering linear programs. In particular, we present new parallel $\\epsilon$-approximate packing and covering solvers which run in $\\tilde{O}(1/\\epsilon^2)$ expected time, i.e., in expectation they take $\\tilde{O}(1/\\epsilon^2)$ iterations and they do $\\tilde{O}(N/\\epsilon^2)$ total work, where $N$ is the size of the constraint matrix and $\\epsilon$ is the error parameter, and where the $\\tilde{O}$ hides logarithmic factors. To achieve our improvement, we introduce an algorithmic technique of broader in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06468","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":""},"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":"1511.06468","created_at":"2026-05-18T01:26:24.456462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06468v1","created_at":"2026-05-18T01:26:24.456462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06468","created_at":"2026-05-18T01:26:24.456462+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6YY2NVWCOUS","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6YY2NVWCOUSVOPM","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6YY2NVW","created_at":"2026-05-18T12:29:22.688609+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/G6YY2NVWCOUSVOPMRISYEH6KOW","json":"https://pith.science/pith/G6YY2NVWCOUSVOPMRISYEH6KOW.json","graph_json":"https://pith.science/api/pith-number/G6YY2NVWCOUSVOPMRISYEH6KOW/graph.json","events_json":"https://pith.science/api/pith-number/G6YY2NVWCOUSVOPMRISYEH6KOW/events.json","paper":"https://pith.science/paper/G6YY2NVW"},"agent_actions":{"view_html":"https://pith.science/pith/G6YY2NVWCOUSVOPMRISYEH6KOW","download_json":"https://pith.science/pith/G6YY2NVWCOUSVOPMRISYEH6KOW.json","view_paper":"https://pith.science/paper/G6YY2NVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06468&json=true","fetch_graph":"https://pith.science/api/pith-number/G6YY2NVWCOUSVOPMRISYEH6KOW/graph.json","fetch_events":"https://pith.science/api/pith-number/G6YY2NVWCOUSVOPMRISYEH6KOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6YY2NVWCOUSVOPMRISYEH6KOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6YY2NVWCOUSVOPMRISYEH6KOW/action/storage_attestation","attest_author":"https://pith.science/pith/G6YY2NVWCOUSVOPMRISYEH6KOW/action/author_attestation","sign_citation":"https://pith.science/pith/G6YY2NVWCOUSVOPMRISYEH6KOW/action/citation_signature","submit_replication":"https://pith.science/pith/G6YY2NVWCOUSVOPMRISYEH6KOW/action/replication_record"}},"created_at":"2026-05-18T01:26:24.456462+00:00","updated_at":"2026-05-18T01:26:24.456462+00:00"}