{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:Z376OPAGMVTVSUCE5NK6LMPRU4","short_pith_number":"pith:Z376OPAG","schema_version":"1.0","canonical_sha256":"ceffe73c066567595044eb55e5b1f1a72c6aa98e8c1ad1425183c78fe5ce5521","source":{"kind":"arxiv","id":"0801.1987","version":2},"attestation_state":"computed","paper":{"title":"A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Koufogiannakis, Neal E. Young","submitted_at":"2008-01-13T22:04:49Z","abstract_excerpt":"We give an approximation algorithm for packing and covering linear programs (linear programs with non-negative coefficients). Given a constraint matrix with n non-zeros, r rows, and c columns, the algorithm computes feasible primal and dual solutions whose costs are within a factor of 1+eps of the optimal cost in time O((r+c)log(n)/eps^2 + n)."},"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":"0801.1987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-01-13T22:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"3cb4dd4096f68414708458720cd785467c8e8b1e81adcc445e752961a68598a0","abstract_canon_sha256":"d5ccfe89b9df2ed925c74c2762dcbae0e4cb499940dc7136cc304b7d0c20924c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:59.457769Z","signature_b64":"nXuHw4+LlYKjI87eZ0xXse1qupaqyvBs76Yy2Z4ZNZ5f0i503AqTNvgmBxzcJGgAcQTGAxZJ7YS2agX6u6g0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceffe73c066567595044eb55e5b1f1a72c6aa98e8c1ad1425183c78fe5ce5521","last_reissued_at":"2026-05-18T01:59:59.457158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:59.457158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christos Koufogiannakis, Neal E. Young","submitted_at":"2008-01-13T22:04:49Z","abstract_excerpt":"We give an approximation algorithm for packing and covering linear programs (linear programs with non-negative coefficients). Given a constraint matrix with n non-zeros, r rows, and c columns, the algorithm computes feasible primal and dual solutions whose costs are within a factor of 1+eps of the optimal cost in time O((r+c)log(n)/eps^2 + n)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.1987","kind":"arxiv","version":2},"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":"0801.1987","created_at":"2026-05-18T01:59:59.457234+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.1987v2","created_at":"2026-05-18T01:59:59.457234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.1987","created_at":"2026-05-18T01:59:59.457234+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z376OPAGMVTV","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z376OPAGMVTVSUCE","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z376OPAG","created_at":"2026-05-18T12:25:58.018023+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/Z376OPAGMVTVSUCE5NK6LMPRU4","json":"https://pith.science/pith/Z376OPAGMVTVSUCE5NK6LMPRU4.json","graph_json":"https://pith.science/api/pith-number/Z376OPAGMVTVSUCE5NK6LMPRU4/graph.json","events_json":"https://pith.science/api/pith-number/Z376OPAGMVTVSUCE5NK6LMPRU4/events.json","paper":"https://pith.science/paper/Z376OPAG"},"agent_actions":{"view_html":"https://pith.science/pith/Z376OPAGMVTVSUCE5NK6LMPRU4","download_json":"https://pith.science/pith/Z376OPAGMVTVSUCE5NK6LMPRU4.json","view_paper":"https://pith.science/paper/Z376OPAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.1987&json=true","fetch_graph":"https://pith.science/api/pith-number/Z376OPAGMVTVSUCE5NK6LMPRU4/graph.json","fetch_events":"https://pith.science/api/pith-number/Z376OPAGMVTVSUCE5NK6LMPRU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z376OPAGMVTVSUCE5NK6LMPRU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z376OPAGMVTVSUCE5NK6LMPRU4/action/storage_attestation","attest_author":"https://pith.science/pith/Z376OPAGMVTVSUCE5NK6LMPRU4/action/author_attestation","sign_citation":"https://pith.science/pith/Z376OPAGMVTVSUCE5NK6LMPRU4/action/citation_signature","submit_replication":"https://pith.science/pith/Z376OPAGMVTVSUCE5NK6LMPRU4/action/replication_record"}},"created_at":"2026-05-18T01:59:59.457234+00:00","updated_at":"2026-05-18T01:59:59.457234+00:00"}