{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GCCWJVXCJDN7XCIDFOSTCLAQF5","short_pith_number":"pith:GCCWJVXC","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"},"canonical_sha256":"308564d6e248dbfb89032ba5312c102f60a64257258939820fe58ffb767428ed","source":{"kind":"arxiv","id":"1907.06602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06602","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06602v1","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06602","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"GCCWJVXCJDN7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GCCWJVXCJDN7XCID","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GCCWJVXC","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GCCWJVXCJDN7XCIDFOSTCLAQF5","target":"record","payload":{"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"},"canonical_sha256":"308564d6e248dbfb89032ba5312c102f60a64257258939820fe58ffb767428ed","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"},"source_kind":"arxiv","source_id":"1907.06602","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-17T23:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSwv2/5DoeceFlKVSuf+V+r2vgMrJjZ1oCJcztcvxHhb4qwC2FMW1CNu1zrbUSHo+5x4NqvUvhlp29NyHPDUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:44:21.276847Z"},"content_sha256":"2df7d42df7934a0d04166bfa22b6e11a4a4db86686d417d1c31d5cd12972d56b","schema_version":"1.0","event_id":"sha256:2df7d42df7934a0d04166bfa22b6e11a4a4db86686d417d1c31d5cd12972d56b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GCCWJVXCJDN7XCIDFOSTCLAQF5","target":"graph","payload":{"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"},"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-17T23:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNo9ct04RTDT9x21zwG/7M80kNJLRhNNL4AfCJCALPUYiszyRI5QNZW6J1xbyO0LY3EaejPjfMNl2nZ+dmuKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:44:21.277529Z"},"content_sha256":"872dccf636c26b4ee9c2c55a0a57276e799306851d6599819f6501c65c082b9c","schema_version":"1.0","event_id":"sha256:872dccf636c26b4ee9c2c55a0a57276e799306851d6599819f6501c65c082b9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/bundle.json","state_url":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/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-05-26T15:44:21Z","links":{"resolver":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5","bundle":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/bundle.json","state":"https://pith.science/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCCWJVXCJDN7XCIDFOSTCLAQF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GCCWJVXCJDN7XCIDFOSTCLAQF5","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":"9de34eb1020dbe959171447c6cc887a0ee1009a2171a67b7df4cf3795ebc69b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-15T16:55:56Z","title_canon_sha256":"fe3ffd3b23448a3a490f358d0000a63a5a4edb685c5b7f8c7d7be14a2ecad194"},"schema_version":"1.0","source":{"id":"1907.06602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06602","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06602v1","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06602","created_at":"2026-05-17T23:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"GCCWJVXCJDN7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GCCWJVXCJDN7XCID","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GCCWJVXC","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:872dccf636c26b4ee9c2c55a0a57276e799306851d6599819f6501c65c082b9c","target":"graph","created_at":"2026-05-17T23:40:37Z","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":"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","authors_text":"Avi Cohen, David Peleg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-15T16:55:56Z","title":"Hotelling Games with Multiple Line Faults"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06602","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:2df7d42df7934a0d04166bfa22b6e11a4a4db86686d417d1c31d5cd12972d56b","target":"record","created_at":"2026-05-17T23:40:37Z","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":"9de34eb1020dbe959171447c6cc887a0ee1009a2171a67b7df4cf3795ebc69b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-15T16:55:56Z","title_canon_sha256":"fe3ffd3b23448a3a490f358d0000a63a5a4edb685c5b7f8c7d7be14a2ecad194"},"schema_version":"1.0","source":{"id":"1907.06602","kind":"arxiv","version":1}},"canonical_sha256":"308564d6e248dbfb89032ba5312c102f60a64257258939820fe58ffb767428ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"308564d6e248dbfb89032ba5312c102f60a64257258939820fe58ffb767428ed","first_computed_at":"2026-05-17T23:40:37.302598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:37.302598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qDEtFdFH0nMuipMzL32UAfNqNTT4CanfnDL3A9gbPHiNKzlFxQvvhtFq6S+/OG1fmeL7Fzu1acuJPLaXfwHZCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:37.303180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2df7d42df7934a0d04166bfa22b6e11a4a4db86686d417d1c31d5cd12972d56b","sha256:872dccf636c26b4ee9c2c55a0a57276e799306851d6599819f6501c65c082b9c"],"state_sha256":"00feb03a8c1a181d19cd4b6091d737ddc29f2bff986ec6de6695fcccacb2c04c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juJAy1Eq27qJ232alFQZmFCx1h7ZR6diV58JQEhaKyf6OXRUEuR5YZXPUX3rfLIu28yVR697/zizTt1qzfHoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:44:21.281037Z","bundle_sha256":"87b86ac5e3f820b63e724b357265615371f783a4bb9e311ab6e562a90b8c2b16"}}