{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:A7KXXXCL3LKWYAB3ZDWDPYGJJZ","short_pith_number":"pith:A7KXXXCL","canonical_record":{"source":{"id":"2602.15225","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-16T22:08:52Z","cross_cats_sorted":[],"title_canon_sha256":"ec2aa16f8beecbfb0d9a211a70ed6202a948641c213c34fbaab8ebba435a51b6","abstract_canon_sha256":"1eefada5d74ae173b8f03c0954dfe5bc72e39bd1d326c2756a2ac032614f8cb5"},"schema_version":"1.0"},"canonical_sha256":"07d57bdc4bdad56c003bc8ec37e0c94e4d5e2abab77f73e79127d1123a1f8dda","source":{"kind":"arxiv","id":"2602.15225","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.15225","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"2602.15225v2","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.15225","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"A7KXXXCL3LKW","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"pith_short_16","alias_value":"A7KXXXCL3LKWYAB3","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"pith_short_8","alias_value":"A7KXXXCL","created_at":"2026-07-30T01:23:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:A7KXXXCL3LKWYAB3ZDWDPYGJJZ","target":"record","payload":{"canonical_record":{"source":{"id":"2602.15225","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-16T22:08:52Z","cross_cats_sorted":[],"title_canon_sha256":"ec2aa16f8beecbfb0d9a211a70ed6202a948641c213c34fbaab8ebba435a51b6","abstract_canon_sha256":"1eefada5d74ae173b8f03c0954dfe5bc72e39bd1d326c2756a2ac032614f8cb5"},"schema_version":"1.0"},"canonical_sha256":"07d57bdc4bdad56c003bc8ec37e0c94e4d5e2abab77f73e79127d1123a1f8dda","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d57bdc4bdad56c003bc8ec37e0c94e4d5e2abab77f73e79127d1123a1f8dda","last_reissued_at":"2026-07-30T01:23:47.376728Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:23:47.376728Z"},"source_kind":"arxiv","source_id":"2602.15225","source_version":2,"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-07-30T01:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyP8zWaX+tC6Rb8W7yoYvhMJD3Ce3/xQN6qa1bXyqAVE236VNmdzPMSnk/QUdb5URon+8X+Tssow0xRFF4yEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T04:18:09.969518Z"},"content_sha256":"6a0c6c9b04d07ec593c5e1c655b3ab65b39563d55c05ffedf7fb8c698e3e9ec6","schema_version":"1.0","event_id":"sha256:6a0c6c9b04d07ec593c5e1c655b3ab65b39563d55c05ffedf7fb8c698e3e9ec6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:A7KXXXCL3LKWYAB3ZDWDPYGJJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equilibria in Large Position-Optimization Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Anish Thilagar, Mary Monroe, Melody Hsu, Rafael Frongillo","submitted_at":"2026-02-16T22:08:52Z","abstract_excerpt":"We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\\mathcal{Y}$, the $n$ players each choose a position in a space $\\mathcal{X}$. A player's utility is the $Q$-mass of targets they are closest to under some proximity measure, with ties broken evenly. Our model captures Hotelling games and forecasting competitions, among other applications. We show that for sufficiently large $n$, both pure and symmetric mixed Nash equilibria exist, and moreover are extreme: all players play on a finite set of pseudo-targ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.15225","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.15225/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-30T01:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAEWJWXSTgapj7vLUXwnDdV2w+Puii7DosBVp6jSnYAmk2ZzmBvHLDRNyAPpNfxQaqVDFQutJXf2rD+oXPd6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T04:18:09.970042Z"},"content_sha256":"84c7f00428581bd32bd80603db80937ced4317e445661b9dfc607a4ad41b3f66","schema_version":"1.0","event_id":"sha256:84c7f00428581bd32bd80603db80937ced4317e445661b9dfc607a4ad41b3f66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7KXXXCL3LKWYAB3ZDWDPYGJJZ/bundle.json","state_url":"https://pith.science/pith/A7KXXXCL3LKWYAB3ZDWDPYGJJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7KXXXCL3LKWYAB3ZDWDPYGJJZ/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-08-24T04:18:09Z","links":{"resolver":"https://pith.science/pith/A7KXXXCL3LKWYAB3ZDWDPYGJJZ","bundle":"https://pith.science/pith/A7KXXXCL3LKWYAB3ZDWDPYGJJZ/bundle.json","state":"https://pith.science/pith/A7KXXXCL3LKWYAB3ZDWDPYGJJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7KXXXCL3LKWYAB3ZDWDPYGJJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A7KXXXCL3LKWYAB3ZDWDPYGJJZ","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":"1eefada5d74ae173b8f03c0954dfe5bc72e39bd1d326c2756a2ac032614f8cb5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-16T22:08:52Z","title_canon_sha256":"ec2aa16f8beecbfb0d9a211a70ed6202a948641c213c34fbaab8ebba435a51b6"},"schema_version":"1.0","source":{"id":"2602.15225","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.15225","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"2602.15225v2","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.15225","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"A7KXXXCL3LKW","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"pith_short_16","alias_value":"A7KXXXCL3LKWYAB3","created_at":"2026-07-30T01:23:47Z"},{"alias_kind":"pith_short_8","alias_value":"A7KXXXCL","created_at":"2026-07-30T01:23:47Z"}],"graph_snapshots":[{"event_id":"sha256:84c7f00428581bd32bd80603db80937ced4317e445661b9dfc607a4ad41b3f66","target":"graph","created_at":"2026-07-30T01:23:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.15225/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\\mathcal{Y}$, the $n$ players each choose a position in a space $\\mathcal{X}$. A player's utility is the $Q$-mass of targets they are closest to under some proximity measure, with ties broken evenly. Our model captures Hotelling games and forecasting competitions, among other applications. We show that for sufficiently large $n$, both pure and symmetric mixed Nash equilibria exist, and moreover are extreme: all players play on a finite set of pseudo-targ","authors_text":"Anish Thilagar, Mary Monroe, Melody Hsu, Rafael Frongillo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-16T22:08:52Z","title":"Equilibria in Large Position-Optimization Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.15225","kind":"arxiv","version":2},"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:6a0c6c9b04d07ec593c5e1c655b3ab65b39563d55c05ffedf7fb8c698e3e9ec6","target":"record","created_at":"2026-07-30T01:23:47Z","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":"1eefada5d74ae173b8f03c0954dfe5bc72e39bd1d326c2756a2ac032614f8cb5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-16T22:08:52Z","title_canon_sha256":"ec2aa16f8beecbfb0d9a211a70ed6202a948641c213c34fbaab8ebba435a51b6"},"schema_version":"1.0","source":{"id":"2602.15225","kind":"arxiv","version":2}},"canonical_sha256":"07d57bdc4bdad56c003bc8ec37e0c94e4d5e2abab77f73e79127d1123a1f8dda","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07d57bdc4bdad56c003bc8ec37e0c94e4d5e2abab77f73e79127d1123a1f8dda","first_computed_at":"2026-07-30T01:23:47.376728Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:23:47.376728Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2602.15225","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a0c6c9b04d07ec593c5e1c655b3ab65b39563d55c05ffedf7fb8c698e3e9ec6","sha256:84c7f00428581bd32bd80603db80937ced4317e445661b9dfc607a4ad41b3f66"],"state_sha256":"e3cee49776280b5883555572d90ce67dbe41ae6f71e0ac8a36100ec3d6f96410"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fenI/DalELW6O4WJHf/pJdgBYE7cVO3ABxva0qqLktU5xDiH1Hmr9gORfUI9StlYtofkilC/KkYpMWl7R1vmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T04:18:09.975212Z","bundle_sha256":"f0819ce92a88e92c61c66cc770815dcfc9bda00cdc41d30b2899067aad3c7ef8"}}