{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6DIWBS4AEDINNGX3SVMOBEFZXX","short_pith_number":"pith:6DIWBS4A","canonical_record":{"source":{"id":"1311.4759","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T14:54:58Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"800ba817d7e5d8e57ded074bc2ac00d027d62cd51175f956ddfd3b9b71447795","abstract_canon_sha256":"c2e2f3d99e8b389ad5818ed48ef57839065215c6486b1909f9ff269dd421df48"},"schema_version":"1.0"},"canonical_sha256":"f0d160cb8020d0d69afb9558e090b9bde20fe700943061dfee1b211c11a17142","source":{"kind":"arxiv","id":"1311.4759","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4759","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4759v4","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4759","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"pith_short_12","alias_value":"6DIWBS4AEDIN","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6DIWBS4AEDINNGX3","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6DIWBS4A","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6DIWBS4AEDINNGX3SVMOBEFZXX","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4759","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T14:54:58Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"800ba817d7e5d8e57ded074bc2ac00d027d62cd51175f956ddfd3b9b71447795","abstract_canon_sha256":"c2e2f3d99e8b389ad5818ed48ef57839065215c6486b1909f9ff269dd421df48"},"schema_version":"1.0"},"canonical_sha256":"f0d160cb8020d0d69afb9558e090b9bde20fe700943061dfee1b211c11a17142","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:00.708196Z","signature_b64":"ZfK9qOR1fnxxl65nrMo1L1d59eMDZw2sFWJhTKM4HugzoLT4NbrjO1O4mXM7xPdX/+5Dc35p9jqg3j1B1wGLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0d160cb8020d0d69afb9558e090b9bde20fe700943061dfee1b211c11a17142","last_reissued_at":"2026-05-18T02:43:00.707652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:00.707652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4759","source_version":4,"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:43:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ve4+2LumniuY/WA+hBPVlAVRZh8lhb6G9CreKkt7l8cR969YZ9/1n4cHXpu6S30xYL6i+Vx9MCQt9mKw10HcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:14:12.956892Z"},"content_sha256":"431ffcd8763145c24e9c5706fb960ed4b6d4541a1f756f10350272db2d82961b","schema_version":"1.0","event_id":"sha256:431ffcd8763145c24e9c5706fb960ed4b6d4541a1f756f10350272db2d82961b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6DIWBS4AEDINNGX3SVMOBEFZXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Hard Capacitated $k$-facility Location Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Dion Gijswijt, Karen Aardal, Pieter van den Berg, Shanfei Li","submitted_at":"2013-11-19T14:54:58Z","abstract_excerpt":"We study the capacitated $k$-facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a constant number $k$. It costs $f_i$ to open facility $i$, and $c_{ij}$ for facility $i$ to serve one unit of demand from client $j$. The objective is to open at most $k$ facilities serving all the demands and satisfying the capacity constraints while minimizing the sum of service and opening costs.\n  In this paper, we give the first fully polynomial time approximation scheme (FPTAS) for the single-sink (single-client) capacitated $k$-facility lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4759","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"},"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:43:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Io0y+U0/FknXl8uKmHcP9CFdsCkUIdlwFtmSjcvdHpH9jiyZUKfLLV9nbUAv35zHB1sf/tRUEUeqEan0VSJnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:14:12.957253Z"},"content_sha256":"fb1c127708cb85bfe655fe811b2372c9738da2ee61af3818cbb1ccf721f09dc7","schema_version":"1.0","event_id":"sha256:fb1c127708cb85bfe655fe811b2372c9738da2ee61af3818cbb1ccf721f09dc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DIWBS4AEDINNGX3SVMOBEFZXX/bundle.json","state_url":"https://pith.science/pith/6DIWBS4AEDINNGX3SVMOBEFZXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DIWBS4AEDINNGX3SVMOBEFZXX/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-06-02T03:14:12Z","links":{"resolver":"https://pith.science/pith/6DIWBS4AEDINNGX3SVMOBEFZXX","bundle":"https://pith.science/pith/6DIWBS4AEDINNGX3SVMOBEFZXX/bundle.json","state":"https://pith.science/pith/6DIWBS4AEDINNGX3SVMOBEFZXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DIWBS4AEDINNGX3SVMOBEFZXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6DIWBS4AEDINNGX3SVMOBEFZXX","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":"c2e2f3d99e8b389ad5818ed48ef57839065215c6486b1909f9ff269dd421df48","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T14:54:58Z","title_canon_sha256":"800ba817d7e5d8e57ded074bc2ac00d027d62cd51175f956ddfd3b9b71447795"},"schema_version":"1.0","source":{"id":"1311.4759","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4759","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4759v4","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4759","created_at":"2026-05-18T02:43:00Z"},{"alias_kind":"pith_short_12","alias_value":"6DIWBS4AEDIN","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6DIWBS4AEDINNGX3","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6DIWBS4A","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:fb1c127708cb85bfe655fe811b2372c9738da2ee61af3818cbb1ccf721f09dc7","target":"graph","created_at":"2026-05-18T02:43:00Z","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 study the capacitated $k$-facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a constant number $k$. It costs $f_i$ to open facility $i$, and $c_{ij}$ for facility $i$ to serve one unit of demand from client $j$. The objective is to open at most $k$ facilities serving all the demands and satisfying the capacity constraints while minimizing the sum of service and opening costs.\n  In this paper, we give the first fully polynomial time approximation scheme (FPTAS) for the single-sink (single-client) capacitated $k$-facility lo","authors_text":"Dion Gijswijt, Karen Aardal, Pieter van den Berg, Shanfei Li","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T14:54:58Z","title":"Approximation Algorithms for Hard Capacitated $k$-facility Location Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4759","kind":"arxiv","version":4},"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:431ffcd8763145c24e9c5706fb960ed4b6d4541a1f756f10350272db2d82961b","target":"record","created_at":"2026-05-18T02:43:00Z","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":"c2e2f3d99e8b389ad5818ed48ef57839065215c6486b1909f9ff269dd421df48","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T14:54:58Z","title_canon_sha256":"800ba817d7e5d8e57ded074bc2ac00d027d62cd51175f956ddfd3b9b71447795"},"schema_version":"1.0","source":{"id":"1311.4759","kind":"arxiv","version":4}},"canonical_sha256":"f0d160cb8020d0d69afb9558e090b9bde20fe700943061dfee1b211c11a17142","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0d160cb8020d0d69afb9558e090b9bde20fe700943061dfee1b211c11a17142","first_computed_at":"2026-05-18T02:43:00.707652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:00.707652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZfK9qOR1fnxxl65nrMo1L1d59eMDZw2sFWJhTKM4HugzoLT4NbrjO1O4mXM7xPdX/+5Dc35p9jqg3j1B1wGLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:00.708196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4759","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:431ffcd8763145c24e9c5706fb960ed4b6d4541a1f756f10350272db2d82961b","sha256:fb1c127708cb85bfe655fe811b2372c9738da2ee61af3818cbb1ccf721f09dc7"],"state_sha256":"0d0ba81b0ee97778ec3bc3cf50037ba68e092b737b8f85efbc0e4a11b061ad79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiwRgIXpi1jjP/Cpk+i/4qHaExG9ob4GgHe4i/zZpGiTtQD7y0XxnX1ZTd/2tH5BwNZNlFhcrZlwhvvFU7lXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:14:12.959193Z","bundle_sha256":"e6967401e0e6d54d8398554b999702bee37b20fec0256d0a10598c508f8bb9a5"}}