{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2HY7QPLI6HFEYWDKITGTRZWVOX","short_pith_number":"pith:2HY7QPLI","schema_version":"1.0","canonical_sha256":"d1f1f83d68f1ca4c586a44cd38e6d575c570c22b8855efcf53b1d2b92bc28d39","source":{"kind":"arxiv","id":"1809.05791","version":1},"attestation_state":"computed","paper":{"title":"Constant factor FPT approximation for capacitated k-median","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Marcinkowski, Jaros{\\l}aw Byrka, Marek Adamczyk, Micha{\\l} W{\\l}odarczyk, Syed M. Meesum","submitted_at":"2018-09-16T01:42:13Z","abstract_excerpt":"Capacitated k-median is one of the few outstanding optimization problems for which the existence of a polynomial time constant factor approximation algorithm remains an open problem. In a series of recent papers algorithms producing solutions violating either the number of facilities or the capacity by a multiplicative factor were obtained. However, to produce solutions without violations appears to be hard and potentially requires different algorithmic techniques. Notably, if parameterized by the number of facilities $k$, the problem is also $W[2]$ hard, making the existence of an exact FPT a"},"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":"1809.05791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-16T01:42:13Z","cross_cats_sorted":[],"title_canon_sha256":"a12d1c8470515e7c91c1ca2f0456a596a9caa6ee0f453779c9d2cea19327f120","abstract_canon_sha256":"fa947eadd9de16d80c2673ddb5d3bfaec087cca832ecf9a000408dc938246f54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:36.495013Z","signature_b64":"14aQnO6NuXnWtm5lE5cz/8k3LbcJeTpLPQT0+ET9TYEwx2szn8O/x3OK1EEsxYg0Ssf6Vn3CBjoflS6LLuJyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1f1f83d68f1ca4c586a44cd38e6d575c570c22b8855efcf53b1d2b92bc28d39","last_reissued_at":"2026-05-18T00:05:36.494448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:36.494448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant factor FPT approximation for capacitated k-median","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Marcinkowski, Jaros{\\l}aw Byrka, Marek Adamczyk, Micha{\\l} W{\\l}odarczyk, Syed M. Meesum","submitted_at":"2018-09-16T01:42:13Z","abstract_excerpt":"Capacitated k-median is one of the few outstanding optimization problems for which the existence of a polynomial time constant factor approximation algorithm remains an open problem. In a series of recent papers algorithms producing solutions violating either the number of facilities or the capacity by a multiplicative factor were obtained. However, to produce solutions without violations appears to be hard and potentially requires different algorithmic techniques. Notably, if parameterized by the number of facilities $k$, the problem is also $W[2]$ hard, making the existence of an exact FPT a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05791","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":"1809.05791","created_at":"2026-05-18T00:05:36.494553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05791v1","created_at":"2026-05-18T00:05:36.494553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05791","created_at":"2026-05-18T00:05:36.494553+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HY7QPLI6HFE","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HY7QPLI6HFEYWDK","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HY7QPLI","created_at":"2026-05-18T12:32:02.567920+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/2HY7QPLI6HFEYWDKITGTRZWVOX","json":"https://pith.science/pith/2HY7QPLI6HFEYWDKITGTRZWVOX.json","graph_json":"https://pith.science/api/pith-number/2HY7QPLI6HFEYWDKITGTRZWVOX/graph.json","events_json":"https://pith.science/api/pith-number/2HY7QPLI6HFEYWDKITGTRZWVOX/events.json","paper":"https://pith.science/paper/2HY7QPLI"},"agent_actions":{"view_html":"https://pith.science/pith/2HY7QPLI6HFEYWDKITGTRZWVOX","download_json":"https://pith.science/pith/2HY7QPLI6HFEYWDKITGTRZWVOX.json","view_paper":"https://pith.science/paper/2HY7QPLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05791&json=true","fetch_graph":"https://pith.science/api/pith-number/2HY7QPLI6HFEYWDKITGTRZWVOX/graph.json","fetch_events":"https://pith.science/api/pith-number/2HY7QPLI6HFEYWDKITGTRZWVOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HY7QPLI6HFEYWDKITGTRZWVOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HY7QPLI6HFEYWDKITGTRZWVOX/action/storage_attestation","attest_author":"https://pith.science/pith/2HY7QPLI6HFEYWDKITGTRZWVOX/action/author_attestation","sign_citation":"https://pith.science/pith/2HY7QPLI6HFEYWDKITGTRZWVOX/action/citation_signature","submit_replication":"https://pith.science/pith/2HY7QPLI6HFEYWDKITGTRZWVOX/action/replication_record"}},"created_at":"2026-05-18T00:05:36.494553+00:00","updated_at":"2026-05-18T00:05:36.494553+00:00"}