{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XZ3JWCOCVT7CWGCYJNFB6LR4W2","short_pith_number":"pith:XZ3JWCOC","schema_version":"1.0","canonical_sha256":"be769b09c2acfe2b18584b4a1f2e3cb681c199a9546e9fa197dc4f5789f62227","source":{"kind":"arxiv","id":"1406.2951","version":4},"attestation_state":"computed","paper":{"title":"An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Bartosz Rybicki, Jaros{\\l}aw Byrka, Khoa Trinh, Thomas Pensyl","submitted_at":"2014-06-11T16:14:27Z","abstract_excerpt":"Dependent rounding is a useful technique for optimization problems with hard budget constraints. This framework naturally leads to \\emph{negative correlation} properties. However, what if an application naturally calls for dependent rounding on the one hand, and desires \\emph{positive} correlation on the other? More generally, we develop algorithms that guarantee the known properties of dependent rounding, but also have nearly best-possible behavior - near-independence, which generalizes positive correlation - on \"small\" subsets of the variables. The recent breakthrough of Li & Svensson for th"},"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":"1406.2951","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-11T16:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"8605e76bd64ecb2f7ff02c9389ef3b909ab4b505f23f93eea10e4f007a3952f8","abstract_canon_sha256":"7569f5b38445f9b8d7f528959d2201dda18776ea5619d1b73b58fe964f6dd02a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:26.778033Z","signature_b64":"f4mT3hCcRFHsOvG7lAwKd3PxFhNNtjFou6+pfiivv5zdNmZVkgza355GzYzHQMRwouQVMD5O3g9+FBAtEvBsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be769b09c2acfe2b18584b4a1f2e3cb681c199a9546e9fa197dc4f5789f62227","last_reissued_at":"2026-05-18T01:16:26.777449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:26.777449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Bartosz Rybicki, Jaros{\\l}aw Byrka, Khoa Trinh, Thomas Pensyl","submitted_at":"2014-06-11T16:14:27Z","abstract_excerpt":"Dependent rounding is a useful technique for optimization problems with hard budget constraints. This framework naturally leads to \\emph{negative correlation} properties. However, what if an application naturally calls for dependent rounding on the one hand, and desires \\emph{positive} correlation on the other? More generally, we develop algorithms that guarantee the known properties of dependent rounding, but also have nearly best-possible behavior - near-independence, which generalizes positive correlation - on \"small\" subsets of the variables. The recent breakthrough of Li & Svensson for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2951","kind":"arxiv","version":4},"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":"1406.2951","created_at":"2026-05-18T01:16:26.777532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2951v4","created_at":"2026-05-18T01:16:26.777532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2951","created_at":"2026-05-18T01:16:26.777532+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZ3JWCOCVT7C","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZ3JWCOCVT7CWGCY","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZ3JWCOC","created_at":"2026-05-18T12:28:57.508820+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/XZ3JWCOCVT7CWGCYJNFB6LR4W2","json":"https://pith.science/pith/XZ3JWCOCVT7CWGCYJNFB6LR4W2.json","graph_json":"https://pith.science/api/pith-number/XZ3JWCOCVT7CWGCYJNFB6LR4W2/graph.json","events_json":"https://pith.science/api/pith-number/XZ3JWCOCVT7CWGCYJNFB6LR4W2/events.json","paper":"https://pith.science/paper/XZ3JWCOC"},"agent_actions":{"view_html":"https://pith.science/pith/XZ3JWCOCVT7CWGCYJNFB6LR4W2","download_json":"https://pith.science/pith/XZ3JWCOCVT7CWGCYJNFB6LR4W2.json","view_paper":"https://pith.science/paper/XZ3JWCOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2951&json=true","fetch_graph":"https://pith.science/api/pith-number/XZ3JWCOCVT7CWGCYJNFB6LR4W2/graph.json","fetch_events":"https://pith.science/api/pith-number/XZ3JWCOCVT7CWGCYJNFB6LR4W2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZ3JWCOCVT7CWGCYJNFB6LR4W2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZ3JWCOCVT7CWGCYJNFB6LR4W2/action/storage_attestation","attest_author":"https://pith.science/pith/XZ3JWCOCVT7CWGCYJNFB6LR4W2/action/author_attestation","sign_citation":"https://pith.science/pith/XZ3JWCOCVT7CWGCYJNFB6LR4W2/action/citation_signature","submit_replication":"https://pith.science/pith/XZ3JWCOCVT7CWGCYJNFB6LR4W2/action/replication_record"}},"created_at":"2026-05-18T01:16:26.777532+00:00","updated_at":"2026-05-18T01:16:26.777532+00:00"}