{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TWJYYGYIJSFC7QFZO37ECO5AB6","short_pith_number":"pith:TWJYYGYI","schema_version":"1.0","canonical_sha256":"9d938c1b084c8a2fc0b976fe413ba00fb5303015f5ca27c2a49707200b037b1d","source":{"kind":"arxiv","id":"1501.04843","version":1},"attestation_state":"computed","paper":{"title":"Discrete Voronoi Games and $\\epsilon$-Nets, in Two and Three Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Aritra Banik, Jean-Lou De Carufel, Michiel Smid","submitted_at":"2015-01-20T15:16:12Z","abstract_excerpt":"The one-round discrete Voronoi game, with respect to a $n$-point user set $U$, consists of two players Player 1 ($\\mathcal{P}_1$) and Player 2 ($\\mathcal{P}_2$). At first, $\\mathcal{P}_1$ chooses a set of facilities $F_1$ following which $\\mathcal{P}_2$ chooses another set of facilities $F_2$, disjoint from $F_1$. The payoff of $\\mathcal{P}_2$ is defined as the cardinality of the set of points in $U$ which are closer to a facility in $F_2$ than to every facility in $F_1$, and the payoff of $\\mathcal{P}_1$ is the difference between the number of users in $U$ and the payoff of $\\mathcal{P}_2$. T"},"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":"1501.04843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-01-20T15:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"45309d16492cf122c1a7a968f546a22ece050f1fefb64f9648014a2d01e9c96e","abstract_canon_sha256":"8e32429aa8509a466c3ce387126f3d837aea882284c84cfe6bab76f0f12fee7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:02.128987Z","signature_b64":"aY+6rRb07dW+WOLjG3BJsWND7M7V19wAzq5UBGqMln6oZIjE7ea/dp5Wy9qLbdKcc100MS1OH1GZneG2uu8kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d938c1b084c8a2fc0b976fe413ba00fb5303015f5ca27c2a49707200b037b1d","last_reissued_at":"2026-05-18T02:29:02.128393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:02.128393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Voronoi Games and $\\epsilon$-Nets, in Two and Three Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Aritra Banik, Jean-Lou De Carufel, Michiel Smid","submitted_at":"2015-01-20T15:16:12Z","abstract_excerpt":"The one-round discrete Voronoi game, with respect to a $n$-point user set $U$, consists of two players Player 1 ($\\mathcal{P}_1$) and Player 2 ($\\mathcal{P}_2$). At first, $\\mathcal{P}_1$ chooses a set of facilities $F_1$ following which $\\mathcal{P}_2$ chooses another set of facilities $F_2$, disjoint from $F_1$. The payoff of $\\mathcal{P}_2$ is defined as the cardinality of the set of points in $U$ which are closer to a facility in $F_2$ than to every facility in $F_1$, and the payoff of $\\mathcal{P}_1$ is the difference between the number of users in $U$ and the payoff of $\\mathcal{P}_2$. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04843","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":"1501.04843","created_at":"2026-05-18T02:29:02.128463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04843v1","created_at":"2026-05-18T02:29:02.128463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04843","created_at":"2026-05-18T02:29:02.128463+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWJYYGYIJSFC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWJYYGYIJSFC7QFZ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWJYYGYI","created_at":"2026-05-18T12:29:42.218222+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/TWJYYGYIJSFC7QFZO37ECO5AB6","json":"https://pith.science/pith/TWJYYGYIJSFC7QFZO37ECO5AB6.json","graph_json":"https://pith.science/api/pith-number/TWJYYGYIJSFC7QFZO37ECO5AB6/graph.json","events_json":"https://pith.science/api/pith-number/TWJYYGYIJSFC7QFZO37ECO5AB6/events.json","paper":"https://pith.science/paper/TWJYYGYI"},"agent_actions":{"view_html":"https://pith.science/pith/TWJYYGYIJSFC7QFZO37ECO5AB6","download_json":"https://pith.science/pith/TWJYYGYIJSFC7QFZO37ECO5AB6.json","view_paper":"https://pith.science/paper/TWJYYGYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04843&json=true","fetch_graph":"https://pith.science/api/pith-number/TWJYYGYIJSFC7QFZO37ECO5AB6/graph.json","fetch_events":"https://pith.science/api/pith-number/TWJYYGYIJSFC7QFZO37ECO5AB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWJYYGYIJSFC7QFZO37ECO5AB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWJYYGYIJSFC7QFZO37ECO5AB6/action/storage_attestation","attest_author":"https://pith.science/pith/TWJYYGYIJSFC7QFZO37ECO5AB6/action/author_attestation","sign_citation":"https://pith.science/pith/TWJYYGYIJSFC7QFZO37ECO5AB6/action/citation_signature","submit_replication":"https://pith.science/pith/TWJYYGYIJSFC7QFZO37ECO5AB6/action/replication_record"}},"created_at":"2026-05-18T02:29:02.128463+00:00","updated_at":"2026-05-18T02:29:02.128463+00:00"}