{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CABF32TIHU6EGD2CV7PABVI7RU","short_pith_number":"pith:CABF32TI","canonical_record":{"source":{"id":"1305.3333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-15T01:22:15Z","cross_cats_sorted":[],"title_canon_sha256":"152a94119321a2d496985fde0b2fd20e52a20c65cc2b6a3a2a0f353aea7711f2","abstract_canon_sha256":"f6a43085d252f86796fa5bfc156e13d2bc4a53babc35aa2e58989434f1b01149"},"schema_version":"1.0"},"canonical_sha256":"10025dea683d3c430f42afde00d51f8d18ccb1a8977fb0787564aaa860601853","source":{"kind":"arxiv","id":"1305.3333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3333","created_at":"2026-05-18T03:25:36Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3333v1","created_at":"2026-05-18T03:25:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3333","created_at":"2026-05-18T03:25:36Z"},{"alias_kind":"pith_short_12","alias_value":"CABF32TIHU6E","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CABF32TIHU6EGD2C","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CABF32TI","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CABF32TIHU6EGD2CV7PABVI7RU","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-15T01:22:15Z","cross_cats_sorted":[],"title_canon_sha256":"152a94119321a2d496985fde0b2fd20e52a20c65cc2b6a3a2a0f353aea7711f2","abstract_canon_sha256":"f6a43085d252f86796fa5bfc156e13d2bc4a53babc35aa2e58989434f1b01149"},"schema_version":"1.0"},"canonical_sha256":"10025dea683d3c430f42afde00d51f8d18ccb1a8977fb0787564aaa860601853","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:36.140580Z","signature_b64":"CSD3npiQa+sYUT4qzRqw4m+Zq5bmDDi93H+1cTX9sFuimxuz5yN6MPxd8ctmBL0w3VzF0iLVBVSXQeWfJ10QCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10025dea683d3c430f42afde00d51f8d18ccb1a8977fb0787564aaa860601853","last_reissued_at":"2026-05-18T03:25:36.139967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:36.139967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3333","source_version":1,"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-18T03:25:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fep783qBdmnYPtg3zDqeZ5YtZSOsfOPNoTvqWgQ7NgcQTcUkzyP4zwuU+4lN07/C0EY0aSZmTeHz1BhJtfEYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:02:21.850492Z"},"content_sha256":"bde64b71d2b2b7c7c10fec7964960a5e01c8bc79ace7c72f3f035a419a46ba8a","schema_version":"1.0","event_id":"sha256:bde64b71d2b2b7c7c10fec7964960a5e01c8bc79ace7c72f3f035a419a46ba8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CABF32TIHU6EGD2CV7PABVI7RU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategy-Proof Facility Location for Concave Cost Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christos Tzamos, Dimitris Fotakis","submitted_at":"2013-05-15T01:22:15Z","abstract_excerpt":"We consider k-Facility Location games, where n strategic agents report their locations on the real line, and a mechanism maps them to k facilities. Each agent seeks to minimize his connection cost, given by a nonnegative increasing function of his distance to the nearest facility. Departing from previous work, that mostly considers the identity cost function, we are interested in mechanisms without payments that are (group) strategyproof for any given cost function, and achieve a good approximation ratio for the social cost and/or the maximum cost of the agents.\n  We present a randomized mecha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3333","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"},"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-18T03:25:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10LKNWM16miExrKWznXczQbmBeUk2LUZnZ+aKNJ/oarKtldRdIFsDxlFIrKcBfc9OlEd0NdaT46dHzSbSdf3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:02:21.851217Z"},"content_sha256":"900540efdf158dd4368b4a01561c8de275d0a6b6eda1cddbf77e9b24b085dbc5","schema_version":"1.0","event_id":"sha256:900540efdf158dd4368b4a01561c8de275d0a6b6eda1cddbf77e9b24b085dbc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CABF32TIHU6EGD2CV7PABVI7RU/bundle.json","state_url":"https://pith.science/pith/CABF32TIHU6EGD2CV7PABVI7RU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CABF32TIHU6EGD2CV7PABVI7RU/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-11T06:02:21Z","links":{"resolver":"https://pith.science/pith/CABF32TIHU6EGD2CV7PABVI7RU","bundle":"https://pith.science/pith/CABF32TIHU6EGD2CV7PABVI7RU/bundle.json","state":"https://pith.science/pith/CABF32TIHU6EGD2CV7PABVI7RU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CABF32TIHU6EGD2CV7PABVI7RU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CABF32TIHU6EGD2CV7PABVI7RU","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":"f6a43085d252f86796fa5bfc156e13d2bc4a53babc35aa2e58989434f1b01149","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-15T01:22:15Z","title_canon_sha256":"152a94119321a2d496985fde0b2fd20e52a20c65cc2b6a3a2a0f353aea7711f2"},"schema_version":"1.0","source":{"id":"1305.3333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3333","created_at":"2026-05-18T03:25:36Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3333v1","created_at":"2026-05-18T03:25:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3333","created_at":"2026-05-18T03:25:36Z"},{"alias_kind":"pith_short_12","alias_value":"CABF32TIHU6E","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CABF32TIHU6EGD2C","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CABF32TI","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:900540efdf158dd4368b4a01561c8de275d0a6b6eda1cddbf77e9b24b085dbc5","target":"graph","created_at":"2026-05-18T03:25: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":"We consider k-Facility Location games, where n strategic agents report their locations on the real line, and a mechanism maps them to k facilities. Each agent seeks to minimize his connection cost, given by a nonnegative increasing function of his distance to the nearest facility. Departing from previous work, that mostly considers the identity cost function, we are interested in mechanisms without payments that are (group) strategyproof for any given cost function, and achieve a good approximation ratio for the social cost and/or the maximum cost of the agents.\n  We present a randomized mecha","authors_text":"Christos Tzamos, Dimitris Fotakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-15T01:22:15Z","title":"Strategy-Proof Facility Location for Concave Cost Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3333","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:bde64b71d2b2b7c7c10fec7964960a5e01c8bc79ace7c72f3f035a419a46ba8a","target":"record","created_at":"2026-05-18T03:25: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":"f6a43085d252f86796fa5bfc156e13d2bc4a53babc35aa2e58989434f1b01149","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-15T01:22:15Z","title_canon_sha256":"152a94119321a2d496985fde0b2fd20e52a20c65cc2b6a3a2a0f353aea7711f2"},"schema_version":"1.0","source":{"id":"1305.3333","kind":"arxiv","version":1}},"canonical_sha256":"10025dea683d3c430f42afde00d51f8d18ccb1a8977fb0787564aaa860601853","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10025dea683d3c430f42afde00d51f8d18ccb1a8977fb0787564aaa860601853","first_computed_at":"2026-05-18T03:25:36.139967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:36.139967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSD3npiQa+sYUT4qzRqw4m+Zq5bmDDi93H+1cTX9sFuimxuz5yN6MPxd8ctmBL0w3VzF0iLVBVSXQeWfJ10QCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:36.140580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bde64b71d2b2b7c7c10fec7964960a5e01c8bc79ace7c72f3f035a419a46ba8a","sha256:900540efdf158dd4368b4a01561c8de275d0a6b6eda1cddbf77e9b24b085dbc5"],"state_sha256":"f31d0f16a3755f28977cefad6778e6ed02defa3f9315ab9bbd76d4171851460c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mALWECRdEHItaMR54Z72faLlYwu7VFcyBBi3uimAPYbaCviZVwk2pu1q0cCSjhgHHElOHl1iJ62FEZXPWtYWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:02:21.855818Z","bundle_sha256":"e8f42c50967126db8d3a37023e0190a5cfbacfc07ee065927718f9e5ea7f2193"}}