{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:75BESAR2O3TA3JPROFRYXMRFXM","short_pith_number":"pith:75BESAR2","schema_version":"1.0","canonical_sha256":"ff4249023a76e60da5f171638bb225bb1c81059bcc8ba5971e4dc5f5e0ac6a37","source":{"kind":"arxiv","id":"1301.4478","version":1},"attestation_state":"computed","paper":{"title":"Local-Search based Approximation Algorithms for Mobile Facility Location Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Sara Ahmadian, Zachary Friggstad","submitted_at":"2013-01-18T20:05:12Z","abstract_excerpt":"We consider the {\\em mobile facility location} (\\mfl) problem. We are given a set of facilities and clients located in a common metric space. The goal is to move each facility from its initial location to a destination and assign each client to the destination of some facility so as to minimize the sum of the movement-costs of the facilities and the client-assignment costs. This abstracts facility-location settings where one has the flexibility of moving facilities from their current locations to other destinations so as to serve clients more efficiently by reducing their assignment costs.\n  W"},"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":"1301.4478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-18T20:05:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e7da93b25ecaf9d8188b90c90e344bf35d4326506764af1241328bf781e89539","abstract_canon_sha256":"14730ba88a6ff2b29622789d61447f1da1342916e5427de09c4c31ca788151bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:05.347522Z","signature_b64":"XcPZe0ow3LnZLFo7uA8D8mfdEiTPVMtjjMnZUvWn/kS2s9Ha91IGrFZgeYMbHU8K088ABgTc2qiizIko9rv3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff4249023a76e60da5f171638bb225bb1c81059bcc8ba5971e4dc5f5e0ac6a37","last_reissued_at":"2026-05-18T03:36:05.346912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:05.346912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local-Search based Approximation Algorithms for Mobile Facility Location Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Sara Ahmadian, Zachary Friggstad","submitted_at":"2013-01-18T20:05:12Z","abstract_excerpt":"We consider the {\\em mobile facility location} (\\mfl) problem. We are given a set of facilities and clients located in a common metric space. The goal is to move each facility from its initial location to a destination and assign each client to the destination of some facility so as to minimize the sum of the movement-costs of the facilities and the client-assignment costs. This abstracts facility-location settings where one has the flexibility of moving facilities from their current locations to other destinations so as to serve clients more efficiently by reducing their assignment costs.\n  W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4478","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":"1301.4478","created_at":"2026-05-18T03:36:05.346990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4478v1","created_at":"2026-05-18T03:36:05.346990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4478","created_at":"2026-05-18T03:36:05.346990+00:00"},{"alias_kind":"pith_short_12","alias_value":"75BESAR2O3TA","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"75BESAR2O3TA3JPR","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"75BESAR2","created_at":"2026-05-18T12:27:36.564083+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/75BESAR2O3TA3JPROFRYXMRFXM","json":"https://pith.science/pith/75BESAR2O3TA3JPROFRYXMRFXM.json","graph_json":"https://pith.science/api/pith-number/75BESAR2O3TA3JPROFRYXMRFXM/graph.json","events_json":"https://pith.science/api/pith-number/75BESAR2O3TA3JPROFRYXMRFXM/events.json","paper":"https://pith.science/paper/75BESAR2"},"agent_actions":{"view_html":"https://pith.science/pith/75BESAR2O3TA3JPROFRYXMRFXM","download_json":"https://pith.science/pith/75BESAR2O3TA3JPROFRYXMRFXM.json","view_paper":"https://pith.science/paper/75BESAR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4478&json=true","fetch_graph":"https://pith.science/api/pith-number/75BESAR2O3TA3JPROFRYXMRFXM/graph.json","fetch_events":"https://pith.science/api/pith-number/75BESAR2O3TA3JPROFRYXMRFXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75BESAR2O3TA3JPROFRYXMRFXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75BESAR2O3TA3JPROFRYXMRFXM/action/storage_attestation","attest_author":"https://pith.science/pith/75BESAR2O3TA3JPROFRYXMRFXM/action/author_attestation","sign_citation":"https://pith.science/pith/75BESAR2O3TA3JPROFRYXMRFXM/action/citation_signature","submit_replication":"https://pith.science/pith/75BESAR2O3TA3JPROFRYXMRFXM/action/replication_record"}},"created_at":"2026-05-18T03:36:05.346990+00:00","updated_at":"2026-05-18T03:36:05.346990+00:00"}