{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7MCI5TOIVPXJNGQPD3HIMKJNCL","short_pith_number":"pith:7MCI5TOI","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"},"canonical_sha256":"fb048ecdc8abee969a0f1ece86292d12c4a7a725b4e608701075531855d1bbb1","source":{"kind":"arxiv","id":"1407.3015","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3015","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3015v3","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3015","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"7MCI5TOIVPXJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7MCI5TOIVPXJNGQP","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7MCI5TOI","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7MCI5TOIVPXJNGQPD3HIMKJNCL","target":"record","payload":{"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"},"canonical_sha256":"fb048ecdc8abee969a0f1ece86292d12c4a7a725b4e608701075531855d1bbb1","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"},"source_kind":"arxiv","source_id":"1407.3015","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FpvqyYz3eBVoXmHsHbnA4iP9MYoGAdy7jO7ae69dng4FE3iexCSc2MiMciKZU/nslDJFn7vj+ikjPAgEST5DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:00.661644Z"},"content_sha256":"2ebb7860ad04b2d30ee0fb76c9d8ddf4982feabf9aec26131e160d36e5ff550d","schema_version":"1.0","event_id":"sha256:2ebb7860ad04b2d30ee0fb76c9d8ddf4982feabf9aec26131e160d36e5ff550d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7MCI5TOIVPXJNGQPD3HIMKJNCL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SxQg5AEWPDM48jCx4FPnKYLnBhJ9bOPDGZBL1urquEyzsx5WSndKrITpYUV3RZoAUBW+ad79un4fYg5bAPbmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:00.662024Z"},"content_sha256":"793af910e76e82e8e99d9b93e51de590ca479d9aa4d9c394a85b8751907cc722","schema_version":"1.0","event_id":"sha256:793af910e76e82e8e99d9b93e51de590ca479d9aa4d9c394a85b8751907cc722"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/bundle.json","state_url":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T11:51:00Z","links":{"resolver":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL","bundle":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/bundle.json","state":"https://pith.science/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MCI5TOIVPXJNGQPD3HIMKJNCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7MCI5TOIVPXJNGQPD3HIMKJNCL","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":"14d74dd95390880c6585b9b0000218c4cbf40176d8c1ab314f3e74563623e3fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-11T03:17:57Z","title_canon_sha256":"de85b55c34e0be9aa086eea11e359e72ea95748de1e6bf8fb305bbba0837d924"},"schema_version":"1.0","source":{"id":"1407.3015","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3015","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3015v3","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3015","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"7MCI5TOIVPXJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7MCI5TOIVPXJNGQP","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7MCI5TOI","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:793af910e76e82e8e99d9b93e51de590ca479d9aa4d9c394a85b8751907cc722","target":"graph","created_at":"2026-05-18T02:38:36Z","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":"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.","authors_text":"Neal E. Young","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-11T03:17:57Z","title":"Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3015","kind":"arxiv","version":3},"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:2ebb7860ad04b2d30ee0fb76c9d8ddf4982feabf9aec26131e160d36e5ff550d","target":"record","created_at":"2026-05-18T02:38:36Z","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":"14d74dd95390880c6585b9b0000218c4cbf40176d8c1ab314f3e74563623e3fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-11T03:17:57Z","title_canon_sha256":"de85b55c34e0be9aa086eea11e359e72ea95748de1e6bf8fb305bbba0837d924"},"schema_version":"1.0","source":{"id":"1407.3015","kind":"arxiv","version":3}},"canonical_sha256":"fb048ecdc8abee969a0f1ece86292d12c4a7a725b4e608701075531855d1bbb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb048ecdc8abee969a0f1ece86292d12c4a7a725b4e608701075531855d1bbb1","first_computed_at":"2026-05-18T02:38:36.745746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:36.745746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kzpq539k3hUSphrainDrAoRiF6Gs4BZpOOVEw6BIR7UPNoYZO/sF0fWyHiQyDdA6N5JZzViim8iGtnWEU6kBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:36.746453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3015","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ebb7860ad04b2d30ee0fb76c9d8ddf4982feabf9aec26131e160d36e5ff550d","sha256:793af910e76e82e8e99d9b93e51de590ca479d9aa4d9c394a85b8751907cc722"],"state_sha256":"e88fe6a1ac7f573c8c81d91442e3d2533d172d3a7f01d6b81d2c5cac84a6a16b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+NAohLL8vTNLbGMIH5021Pu3dAC7MVme9Pvumtk1zY6sxF3dr2k2bD4nBUpzpKwSqsbHP6z+38UHawim9QWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:51:00.665103Z","bundle_sha256":"7bd204509f3990fdb05b36a11f8a73c38c86320668965a2cc0afbb67f6307305"}}