{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:SRDMFKOA7MYDOOOWSXMQRML24V","short_pith_number":"pith:SRDMFKOA","schema_version":"1.0","canonical_sha256":"9446c2a9c0fb303739d695d908b17ae5456b62a01c21f839a556a11456af5727","source":{"kind":"arxiv","id":"cs/0205039","version":1},"attestation_state":"computed","paper":{"title":"Sequential and Parallel Algorithms for Mixed Packing and Covering","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Neal E. Young","submitted_at":"2002-05-18T15:12:41Z","abstract_excerpt":"Mixed packing and covering problems are problems that can be formulated as linear programs using only non-negative coefficients. Examples include multicommodity network flow, the Held-Karp lower bound on TSP, fractional relaxations of set cover, bin-packing, knapsack, scheduling problems, minimum-weight triangulation, etc. This paper gives approximation algorithms for the general class of problems. The sequential algorithm is a simple greedy algorithm that can be implemented to find an epsilon-approximate solution in O(epsilon^-2 log m) linear-time iterations. The parallel algorithm does compa"},"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":"cs/0205039","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:12:41Z","cross_cats_sorted":[],"title_canon_sha256":"db46585c2ece030e7d66ac0c2265d9e06d6e134a311f1007982cde1a2b5dc03e","abstract_canon_sha256":"37b8d063a6577790d8b20a2f1e5cd8e21c860dfcc519e6edbb8f60625165c52e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:44.396167Z","signature_b64":"gy08IBRerBTU+lasW3gy0t5vKcNuNpEhKN4zhHTTL8UDdc3AZshmaCRrpkJsHUGZZVuNaycuZE8rH+C/M29lDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9446c2a9c0fb303739d695d908b17ae5456b62a01c21f839a556a11456af5727","last_reissued_at":"2026-05-18T01:22:44.395598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:44.395598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential and Parallel Algorithms for Mixed Packing and Covering","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Neal E. Young","submitted_at":"2002-05-18T15:12:41Z","abstract_excerpt":"Mixed packing and covering problems are problems that can be formulated as linear programs using only non-negative coefficients. Examples include multicommodity network flow, the Held-Karp lower bound on TSP, fractional relaxations of set cover, bin-packing, knapsack, scheduling problems, minimum-weight triangulation, etc. This paper gives approximation algorithms for the general class of problems. The sequential algorithm is a simple greedy algorithm that can be implemented to find an epsilon-approximate solution in O(epsilon^-2 log m) linear-time iterations. The parallel algorithm does compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205039","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":"cs/0205039","created_at":"2026-05-18T01:22:44.395683+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205039v1","created_at":"2026-05-18T01:22:44.395683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205039","created_at":"2026-05-18T01:22:44.395683+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRDMFKOA7MYD","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRDMFKOA7MYDOOOW","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRDMFKOA","created_at":"2026-05-18T12:25:51.375804+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/SRDMFKOA7MYDOOOWSXMQRML24V","json":"https://pith.science/pith/SRDMFKOA7MYDOOOWSXMQRML24V.json","graph_json":"https://pith.science/api/pith-number/SRDMFKOA7MYDOOOWSXMQRML24V/graph.json","events_json":"https://pith.science/api/pith-number/SRDMFKOA7MYDOOOWSXMQRML24V/events.json","paper":"https://pith.science/paper/SRDMFKOA"},"agent_actions":{"view_html":"https://pith.science/pith/SRDMFKOA7MYDOOOWSXMQRML24V","download_json":"https://pith.science/pith/SRDMFKOA7MYDOOOWSXMQRML24V.json","view_paper":"https://pith.science/paper/SRDMFKOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205039&json=true","fetch_graph":"https://pith.science/api/pith-number/SRDMFKOA7MYDOOOWSXMQRML24V/graph.json","fetch_events":"https://pith.science/api/pith-number/SRDMFKOA7MYDOOOWSXMQRML24V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRDMFKOA7MYDOOOWSXMQRML24V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRDMFKOA7MYDOOOWSXMQRML24V/action/storage_attestation","attest_author":"https://pith.science/pith/SRDMFKOA7MYDOOOWSXMQRML24V/action/author_attestation","sign_citation":"https://pith.science/pith/SRDMFKOA7MYDOOOWSXMQRML24V/action/citation_signature","submit_replication":"https://pith.science/pith/SRDMFKOA7MYDOOOWSXMQRML24V/action/replication_record"}},"created_at":"2026-05-18T01:22:44.395683+00:00","updated_at":"2026-05-18T01:22:44.395683+00:00"}