{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GCCWJVXCJDN7XCIDFOSTCLAQF5","short_pith_number":"pith:GCCWJVXC","schema_version":"1.0","canonical_sha256":"308564d6e248dbfb89032ba5312c102f60a64257258939820fe58ffb767428ed","source":{"kind":"arxiv","id":"1907.06602","version":1},"attestation_state":"computed","paper":{"title":"Hotelling Games with Multiple Line Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Avi Cohen, David Peleg","submitted_at":"2019-07-15T16:55:56Z","abstract_excerpt":"The Hotelling game consists of n servers each choosing a point on the line segment, so as to maximize the amount of clients it attracts. Clients are uniformly distributed along the line, and each client buys from the closest server. In this paper, we study a fault-prone version of the Hotelling game, where the line fails at multiple random locations. Each failure disconnects the line, blocking the passage of clients. We show that the game admits a Nash equilibrium if and only if the rate of faults exceeds a certain threshold, and calculate that threshold approximately. Moreover, when a Nash eq"},"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":"1907.06602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-15T16:55:56Z","cross_cats_sorted":[],"title_canon_sha256":"fe3ffd3b23448a3a490f358d0000a63a5a4edb685c5b7f8c7d7be14a2ecad194","abstract_canon_sha256":"9de34eb1020dbe959171447c6cc887a0ee1009a2171a67b7df4cf3795ebc69b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:37.303180Z","signature_b64":"qDEtFdFH0nMuipMzL32UAfNqNTT4CanfnDL3A9gbPHiNKzlFxQvvhtFq6S+/OG1fmeL7Fzu1acuJPLaXfwHZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"308564d6e248dbfb89032ba5312c102f60a64257258939820fe58ffb767428ed","last_reissued_at":"2026-05-17T23:40:37.302598Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:37.302598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hotelling Games with Multiple Line Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Avi Cohen, David Peleg","submitted_at":"2019-07-15T16:55:56Z","abstract_excerpt":"The Hotelling game consists of n servers each choosing a point on the line segment, so as to maximize the amount of clients it attracts. Clients are uniformly distributed along the line, and each client buys from the closest server. In this paper, we study a fault-prone version of the Hotelling game, where the line fails at multiple random locations. Each failure disconnects the line, blocking the passage of clients. We show that the game admits a Nash equilibrium if and only if the rate of faults exceeds a certain threshold, and calculate that threshold approximately. Moreover, when a Nash eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06602","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":"1907.06602","created_at":"2026-05-17T23:40:37.302679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06602v1","created_at":"2026-05-17T23:40:37.302679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06602","created_at":"2026-05-17T23:40:37.302679+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCCWJVXCJDN7","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCCWJVXCJDN7XCID","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCCWJVXC","created_at":"2026-05-18T12:33:18.533446+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/GCCWJVXCJDN7XCIDFOSTCLAQF5","json":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5.json","graph_json":"https://pith.science/api/pith-number/GCCWJVXCJDN7XCIDFOSTCLAQF5/graph.json","events_json":"https://pith.science/api/pith-number/GCCWJVXCJDN7XCIDFOSTCLAQF5/events.json","paper":"https://pith.science/paper/GCCWJVXC"},"agent_actions":{"view_html":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5","download_json":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5.json","view_paper":"https://pith.science/paper/GCCWJVXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06602&json=true","fetch_graph":"https://pith.science/api/pith-number/GCCWJVXCJDN7XCIDFOSTCLAQF5/graph.json","fetch_events":"https://pith.science/api/pith-number/GCCWJVXCJDN7XCIDFOSTCLAQF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/action/storage_attestation","attest_author":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/action/author_attestation","sign_citation":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/action/citation_signature","submit_replication":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/action/replication_record"}},"created_at":"2026-05-17T23:40:37.302679+00:00","updated_at":"2026-05-17T23:40:37.302679+00:00"}