{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LYSWDLIOSQAZLEETTXPUWNPHPI","short_pith_number":"pith:LYSWDLIO","schema_version":"1.0","canonical_sha256":"5e2561ad0e94019590939ddf4b35e77a150308ecd97bf3d8cbad125be426f727","source":{"kind":"arxiv","id":"1503.03635","version":1},"attestation_state":"computed","paper":{"title":"Scalable Facility Location for Massive Graphs on Pregel-like Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aristides Gionis, Gianmarco De Francisci Morales, Kiran Garimella, Mauro Sozio","submitted_at":"2015-03-12T09:09:37Z","abstract_excerpt":"We propose a new scalable algorithm for facility location. Facility location is a classic problem, where the goal is to select a subset of facilities to open, from a set of candidate facilities F , in order to serve a set of clients C. The objective is to minimize the total cost of opening facilities plus the cost of serving each client from the facility it is assigned to. In this work, we are interested in the graph setting, where the cost of serving a client from a facility is represented by the shortest-path distance on the graph. This setting allows to model natural problems arising in the"},"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":"1503.03635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-12T09:09:37Z","cross_cats_sorted":[],"title_canon_sha256":"45240b1f4ef24e593daa9156a53f7c8e570ae9e022968b92e84a0c407f97f5a8","abstract_canon_sha256":"40af3ec83b84d585992201bf35b66e9169a2bbd65c7dda7cc3490f72fc432db4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:27.798120Z","signature_b64":"pC076l5SYEXaYc/mjsOX5T7kMrDZYE/vdPSH6LEyHNaQSfs99bsx6buIf9FBNzFACCGgDUOm6lNJ8aY47P6fDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e2561ad0e94019590939ddf4b35e77a150308ecd97bf3d8cbad125be426f727","last_reissued_at":"2026-05-18T02:24:27.797433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:27.797433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Facility Location for Massive Graphs on Pregel-like Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aristides Gionis, Gianmarco De Francisci Morales, Kiran Garimella, Mauro Sozio","submitted_at":"2015-03-12T09:09:37Z","abstract_excerpt":"We propose a new scalable algorithm for facility location. Facility location is a classic problem, where the goal is to select a subset of facilities to open, from a set of candidate facilities F , in order to serve a set of clients C. The objective is to minimize the total cost of opening facilities plus the cost of serving each client from the facility it is assigned to. In this work, we are interested in the graph setting, where the cost of serving a client from a facility is represented by the shortest-path distance on the graph. This setting allows to model natural problems arising in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03635","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":"1503.03635","created_at":"2026-05-18T02:24:27.797561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03635v1","created_at":"2026-05-18T02:24:27.797561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03635","created_at":"2026-05-18T02:24:27.797561+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYSWDLIOSQAZ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYSWDLIOSQAZLEET","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYSWDLIO","created_at":"2026-05-18T12:29:29.992203+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/LYSWDLIOSQAZLEETTXPUWNPHPI","json":"https://pith.science/pith/LYSWDLIOSQAZLEETTXPUWNPHPI.json","graph_json":"https://pith.science/api/pith-number/LYSWDLIOSQAZLEETTXPUWNPHPI/graph.json","events_json":"https://pith.science/api/pith-number/LYSWDLIOSQAZLEETTXPUWNPHPI/events.json","paper":"https://pith.science/paper/LYSWDLIO"},"agent_actions":{"view_html":"https://pith.science/pith/LYSWDLIOSQAZLEETTXPUWNPHPI","download_json":"https://pith.science/pith/LYSWDLIOSQAZLEETTXPUWNPHPI.json","view_paper":"https://pith.science/paper/LYSWDLIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03635&json=true","fetch_graph":"https://pith.science/api/pith-number/LYSWDLIOSQAZLEETTXPUWNPHPI/graph.json","fetch_events":"https://pith.science/api/pith-number/LYSWDLIOSQAZLEETTXPUWNPHPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYSWDLIOSQAZLEETTXPUWNPHPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYSWDLIOSQAZLEETTXPUWNPHPI/action/storage_attestation","attest_author":"https://pith.science/pith/LYSWDLIOSQAZLEETTXPUWNPHPI/action/author_attestation","sign_citation":"https://pith.science/pith/LYSWDLIOSQAZLEETTXPUWNPHPI/action/citation_signature","submit_replication":"https://pith.science/pith/LYSWDLIOSQAZLEETTXPUWNPHPI/action/replication_record"}},"created_at":"2026-05-18T02:24:27.797561+00:00","updated_at":"2026-05-18T02:24:27.797561+00:00"}