{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2HY7QPLI6HFEYWDKITGTRZWVOX","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":"fa947eadd9de16d80c2673ddb5d3bfaec087cca832ecf9a000408dc938246f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-16T01:42:13Z","title_canon_sha256":"a12d1c8470515e7c91c1ca2f0456a596a9caa6ee0f453779c9d2cea19327f120"},"schema_version":"1.0","source":{"id":"1809.05791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05791","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05791v1","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05791","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"2HY7QPLI6HFE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2HY7QPLI6HFEYWDK","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2HY7QPLI","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:0f5bd10d9d49a1d41ec9b038877b90f1324246db9e14f74af158024577a44ae0","target":"graph","created_at":"2026-05-18T00:05: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":"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","authors_text":"Jan Marcinkowski, Jaros{\\l}aw Byrka, Marek Adamczyk, Micha{\\l} W{\\l}odarczyk, Syed M. Meesum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-16T01:42:13Z","title":"Constant factor FPT approximation for capacitated k-median"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05791","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:2578575d1bfe09c4ec831caf04daa081fe69354abf4b1c1629a6e6049e2c53f6","target":"record","created_at":"2026-05-18T00:05: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":"fa947eadd9de16d80c2673ddb5d3bfaec087cca832ecf9a000408dc938246f54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-16T01:42:13Z","title_canon_sha256":"a12d1c8470515e7c91c1ca2f0456a596a9caa6ee0f453779c9d2cea19327f120"},"schema_version":"1.0","source":{"id":"1809.05791","kind":"arxiv","version":1}},"canonical_sha256":"d1f1f83d68f1ca4c586a44cd38e6d575c570c22b8855efcf53b1d2b92bc28d39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1f1f83d68f1ca4c586a44cd38e6d575c570c22b8855efcf53b1d2b92bc28d39","first_computed_at":"2026-05-18T00:05:36.494448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:36.494448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"14aQnO6NuXnWtm5lE5cz/8k3LbcJeTpLPQT0+ET9TYEwx2szn8O/x3OK1EEsxYg0Ssf6Vn3CBjoflS6LLuJyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:36.495013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2578575d1bfe09c4ec831caf04daa081fe69354abf4b1c1629a6e6049e2c53f6","sha256:0f5bd10d9d49a1d41ec9b038877b90f1324246db9e14f74af158024577a44ae0"],"state_sha256":"53b597e3a4e4f46cb9ccd79e0c7f9a5ad3baf80c97009afd67842ac2d4d5edb3"}