{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7MCI5TOIVPXJNGQPD3HIMKJNCL","short_pith_number":"pith:7MCI5TOI","schema_version":"1.0","canonical_sha256":"fb048ecdc8abee969a0f1ece86292d12c4a7a725b4e608701075531855d1bbb1","source":{"kind":"arxiv","id":"1407.3015","version":3},"attestation_state":"computed","paper":{"title":"Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Neal E. Young","submitted_at":"2014-07-11T03:17:57Z","abstract_excerpt":"We describe the first nearly linear-time approximation algorithms for explicitly given mixed packing/covering linear programs, and for (non-metric) fractional facility location. We also describe the first parallel algorithms requiring only near-linear total work and finishing in polylog time. The algorithms compute $(1+\\epsilon)$-approximate solutions in time (and work) $O^*(N/\\epsilon^2)$, where $N$ is the number of non-zeros in the constraint matrix. For facility location, $N$ is the number of eligible client/facility pairs."},"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":"1407.3015","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-11T03:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"de85b55c34e0be9aa086eea11e359e72ea95748de1e6bf8fb305bbba0837d924","abstract_canon_sha256":"14d74dd95390880c6585b9b0000218c4cbf40176d8c1ab314f3e74563623e3fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:36.746453Z","signature_b64":"Kzpq539k3hUSphrainDrAoRiF6Gs4BZpOOVEw6BIR7UPNoYZO/sF0fWyHiQyDdA6N5JZzViim8iGtnWEU6kBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb048ecdc8abee969a0f1ece86292d12c4a7a725b4e608701075531855d1bbb1","last_reissued_at":"2026-05-18T02:38:36.745746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:36.745746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Neal E. Young","submitted_at":"2014-07-11T03:17:57Z","abstract_excerpt":"We describe the first nearly linear-time approximation algorithms for explicitly given mixed packing/covering linear programs, and for (non-metric) fractional facility location. We also describe the first parallel algorithms requiring only near-linear total work and finishing in polylog time. The algorithms compute $(1+\\epsilon)$-approximate solutions in time (and work) $O^*(N/\\epsilon^2)$, where $N$ is the number of non-zeros in the constraint matrix. For facility location, $N$ is the number of eligible client/facility pairs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3015","kind":"arxiv","version":3},"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":"1407.3015","created_at":"2026-05-18T02:38:36.745853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3015v3","created_at":"2026-05-18T02:38:36.745853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3015","created_at":"2026-05-18T02:38:36.745853+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MCI5TOIVPXJ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MCI5TOIVPXJNGQP","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MCI5TOI","created_at":"2026-05-18T12:28:19.803747+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/7MCI5TOIVPXJNGQPD3HIMKJNCL","json":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL.json","graph_json":"https://pith.science/api/pith-number/7MCI5TOIVPXJNGQPD3HIMKJNCL/graph.json","events_json":"https://pith.science/api/pith-number/7MCI5TOIVPXJNGQPD3HIMKJNCL/events.json","paper":"https://pith.science/paper/7MCI5TOI"},"agent_actions":{"view_html":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL","download_json":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL.json","view_paper":"https://pith.science/paper/7MCI5TOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3015&json=true","fetch_graph":"https://pith.science/api/pith-number/7MCI5TOIVPXJNGQPD3HIMKJNCL/graph.json","fetch_events":"https://pith.science/api/pith-number/7MCI5TOIVPXJNGQPD3HIMKJNCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/action/storage_attestation","attest_author":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/action/author_attestation","sign_citation":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/action/citation_signature","submit_replication":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/action/replication_record"}},"created_at":"2026-05-18T02:38:36.745853+00:00","updated_at":"2026-05-18T02:38:36.745853+00:00"}