{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YL2UC4W4NYYAXVCBRMXPR5E6MI","short_pith_number":"pith:YL2UC4W4","schema_version":"1.0","canonical_sha256":"c2f54172dc6e300bd4418b2ef8f49e62212beec32d5a539d1e0c7686fa2ba723","source":{"kind":"arxiv","id":"1407.3263","version":2},"attestation_state":"computed","paper":{"title":"LP-Based Algorithms for Capacitated Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hyung-Chan An, Mohit Singh, Ola Svensson","submitted_at":"2014-07-11T19:51:06Z","abstract_excerpt":"Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic methodologies, such as LP-rounding and primal-dual method, have been applied to and evolved from algorithms for this problem. Unfortunately, this collection of powerful algorithmic techniques had not yet been applicable to the more general capacitated facility location problem. In fact, all of the known algorithms with good performance guarantees we"},"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":"1407.3263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-11T19:51:06Z","cross_cats_sorted":[],"title_canon_sha256":"c196d5fd4dedf64153a05bc79613210797d62df6faf848bc542ad12d853eee67","abstract_canon_sha256":"8536086bc893b4b59d36d668b090d2bd822ce312d2cfc2e58c18de1ffc42feb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:47.500687Z","signature_b64":"R5xhTTfynx9rfj1rsKcxXBzMj1JcJwaw3EzAinXMROnnUdEcEnF/TstmbY7axZO7ao6hjXhooDURpi2djcmkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2f54172dc6e300bd4418b2ef8f49e62212beec32d5a539d1e0c7686fa2ba723","last_reissued_at":"2026-05-18T02:42:47.500139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:47.500139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LP-Based Algorithms for Capacitated Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hyung-Chan An, Mohit Singh, Ola Svensson","submitted_at":"2014-07-11T19:51:06Z","abstract_excerpt":"Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic methodologies, such as LP-rounding and primal-dual method, have been applied to and evolved from algorithms for this problem. Unfortunately, this collection of powerful algorithmic techniques had not yet been applicable to the more general capacitated facility location problem. In fact, all of the known algorithms with good performance guarantees we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3263","kind":"arxiv","version":2},"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":"1407.3263","created_at":"2026-05-18T02:42:47.500226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3263v2","created_at":"2026-05-18T02:42:47.500226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3263","created_at":"2026-05-18T02:42:47.500226+00:00"},{"alias_kind":"pith_short_12","alias_value":"YL2UC4W4NYYA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YL2UC4W4NYYAXVCB","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YL2UC4W4","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/YL2UC4W4NYYAXVCBRMXPR5E6MI","json":"https://pith.science/pith/YL2UC4W4NYYAXVCBRMXPR5E6MI.json","graph_json":"https://pith.science/api/pith-number/YL2UC4W4NYYAXVCBRMXPR5E6MI/graph.json","events_json":"https://pith.science/api/pith-number/YL2UC4W4NYYAXVCBRMXPR5E6MI/events.json","paper":"https://pith.science/paper/YL2UC4W4"},"agent_actions":{"view_html":"https://pith.science/pith/YL2UC4W4NYYAXVCBRMXPR5E6MI","download_json":"https://pith.science/pith/YL2UC4W4NYYAXVCBRMXPR5E6MI.json","view_paper":"https://pith.science/paper/YL2UC4W4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3263&json=true","fetch_graph":"https://pith.science/api/pith-number/YL2UC4W4NYYAXVCBRMXPR5E6MI/graph.json","fetch_events":"https://pith.science/api/pith-number/YL2UC4W4NYYAXVCBRMXPR5E6MI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YL2UC4W4NYYAXVCBRMXPR5E6MI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YL2UC4W4NYYAXVCBRMXPR5E6MI/action/storage_attestation","attest_author":"https://pith.science/pith/YL2UC4W4NYYAXVCBRMXPR5E6MI/action/author_attestation","sign_citation":"https://pith.science/pith/YL2UC4W4NYYAXVCBRMXPR5E6MI/action/citation_signature","submit_replication":"https://pith.science/pith/YL2UC4W4NYYAXVCBRMXPR5E6MI/action/replication_record"}},"created_at":"2026-05-18T02:42:47.500226+00:00","updated_at":"2026-05-18T02:42:47.500226+00:00"}