{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:SRDMFKOA7MYDOOOWSXMQRML24V","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":"37b8d063a6577790d8b20a2f1e5cd8e21c860dfcc519e6edbb8f60625165c52e","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:12:41Z","title_canon_sha256":"db46585c2ece030e7d66ac0c2265d9e06d6e134a311f1007982cde1a2b5dc03e"},"schema_version":"1.0","source":{"id":"cs/0205039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205039","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205039v1","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205039","created_at":"2026-05-18T01:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"SRDMFKOA7MYD","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"SRDMFKOA7MYDOOOW","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"SRDMFKOA","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:bcbf2b6a32e11ca25e7632f5208f634dbb9f210fb9c76aaf6404dba2ba0279cd","target":"graph","created_at":"2026-05-18T01:22:44Z","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"},"paper":{"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","authors_text":"Neal E. Young","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:12:41Z","title":"Sequential and Parallel Algorithms for Mixed Packing and Covering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205039","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:031ec5e13afa03620edd428da4ff2b70b1afca63956321bbc5ff719a1ec6fe20","target":"record","created_at":"2026-05-18T01:22:44Z","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":"37b8d063a6577790d8b20a2f1e5cd8e21c860dfcc519e6edbb8f60625165c52e","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T15:12:41Z","title_canon_sha256":"db46585c2ece030e7d66ac0c2265d9e06d6e134a311f1007982cde1a2b5dc03e"},"schema_version":"1.0","source":{"id":"cs/0205039","kind":"arxiv","version":1}},"canonical_sha256":"9446c2a9c0fb303739d695d908b17ae5456b62a01c21f839a556a11456af5727","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9446c2a9c0fb303739d695d908b17ae5456b62a01c21f839a556a11456af5727","first_computed_at":"2026-05-18T01:22:44.395598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:44.395598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gy08IBRerBTU+lasW3gy0t5vKcNuNpEhKN4zhHTTL8UDdc3AZshmaCRrpkJsHUGZZVuNaycuZE8rH+C/M29lDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:44.396167Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:031ec5e13afa03620edd428da4ff2b70b1afca63956321bbc5ff719a1ec6fe20","sha256:bcbf2b6a32e11ca25e7632f5208f634dbb9f210fb9c76aaf6404dba2ba0279cd"],"state_sha256":"ebff716a3cc87fe2df95e61d8e80e52ffb7710542d6fa4b47efff13f0937c239"}