{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HUPPV3MZWHXXAA2QKN646KYCN2","short_pith_number":"pith:HUPPV3MZ","canonical_record":{"source":{"id":"2501.09330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-16T07:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"6baf208be7fefb44c63b6bc4219581d811ab0188d6286d53cc6fd49cd7ca3a08","abstract_canon_sha256":"ea6a2ed1be20de188d982e7dedb3d1437e467d5a1fab1ccb1d2b9823a523b856"},"schema_version":"1.0"},"canonical_sha256":"3d1efaed99b1ef700350537dcf2b026e8daf680d06b7b6bf03fe3c199dfab4ee","source":{"kind":"arxiv","id":"2501.09330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.09330","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"2501.09330v1","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.09330","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"HUPPV3MZWHXX","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"pith_short_16","alias_value":"HUPPV3MZWHXXAA2Q","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"pith_short_8","alias_value":"HUPPV3MZ","created_at":"2026-07-05T10:01:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HUPPV3MZWHXXAA2QKN646KYCN2","target":"record","payload":{"canonical_record":{"source":{"id":"2501.09330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-16T07:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"6baf208be7fefb44c63b6bc4219581d811ab0188d6286d53cc6fd49cd7ca3a08","abstract_canon_sha256":"ea6a2ed1be20de188d982e7dedb3d1437e467d5a1fab1ccb1d2b9823a523b856"},"schema_version":"1.0"},"canonical_sha256":"3d1efaed99b1ef700350537dcf2b026e8daf680d06b7b6bf03fe3c199dfab4ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:45.261057Z","signature_b64":"UAaIELxcTvyEj1dAD63Br5SWiYUDMmEDnvqdDQo0jEcPtRzHMi6KGfQ6R1ww6dgYxRi+fTFnw9/3oSj204grBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d1efaed99b1ef700350537dcf2b026e8daf680d06b7b6bf03fe3c199dfab4ee","last_reissued_at":"2026-07-05T10:01:45.260662Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:45.260662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.09330","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-07-05T10:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UP9KR1GJ5Nmqn8CoXg4NLMCEN7FCy3hks1YLnX64NZWUvEVyHK2/GjorQrotIdmtgHoAKOcON4G9Kd4qMoD4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:12:06.610744Z"},"content_sha256":"c0fe6616bae7b3b693b9d95aad1b5852d1c5b27ae45b4501170c51182d4285da","schema_version":"1.0","event_id":"sha256:c0fe6616bae7b3b693b9d95aad1b5852d1c5b27ae45b4501170c51182d4285da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HUPPV3MZWHXXAA2QKN646KYCN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Infinite-Player Games with Player-to-Strategy Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Carlos Martin, Tuomas Sandholm","submitted_at":"2025-01-16T07:01:01Z","abstract_excerpt":"We present a new approach to solving games with a countably or uncountably infinite number of players. Such games are often used to model multiagent systems with a large number of agents. The latter are frequently encountered in economics, financial markets, crowd dynamics, congestion analysis, epidemiology, and population ecology, among other fields. Our two primary contributions are as follows. First, we present a way to represent strategy profiles for an infinite number of players, which we name a Player-to-Strategy Network (P2SN). Such a network maps players to strategies, and exploits the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.09330","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.09330/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-05T10:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bQBMmIGsgTc49pYDWLVmWT1GnzwRhoQqJ7SZuNUEeW9Ly2O2E+mnbibTxQcc7fZTHDjop7GL7piLDq/1x43nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:12:06.611667Z"},"content_sha256":"c32b6d0c0c3369b71c17b3ae3dbce0716c606067c8a8af62bf77f7d0ce77a8e1","schema_version":"1.0","event_id":"sha256:c32b6d0c0c3369b71c17b3ae3dbce0716c606067c8a8af62bf77f7d0ce77a8e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUPPV3MZWHXXAA2QKN646KYCN2/bundle.json","state_url":"https://pith.science/pith/HUPPV3MZWHXXAA2QKN646KYCN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUPPV3MZWHXXAA2QKN646KYCN2/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-13T02:12:06Z","links":{"resolver":"https://pith.science/pith/HUPPV3MZWHXXAA2QKN646KYCN2","bundle":"https://pith.science/pith/HUPPV3MZWHXXAA2QKN646KYCN2/bundle.json","state":"https://pith.science/pith/HUPPV3MZWHXXAA2QKN646KYCN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUPPV3MZWHXXAA2QKN646KYCN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HUPPV3MZWHXXAA2QKN646KYCN2","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":"ea6a2ed1be20de188d982e7dedb3d1437e467d5a1fab1ccb1d2b9823a523b856","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-16T07:01:01Z","title_canon_sha256":"6baf208be7fefb44c63b6bc4219581d811ab0188d6286d53cc6fd49cd7ca3a08"},"schema_version":"1.0","source":{"id":"2501.09330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.09330","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"2501.09330v1","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.09330","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"HUPPV3MZWHXX","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"pith_short_16","alias_value":"HUPPV3MZWHXXAA2Q","created_at":"2026-07-05T10:01:45Z"},{"alias_kind":"pith_short_8","alias_value":"HUPPV3MZ","created_at":"2026-07-05T10:01:45Z"}],"graph_snapshots":[{"event_id":"sha256:c32b6d0c0c3369b71c17b3ae3dbce0716c606067c8a8af62bf77f7d0ce77a8e1","target":"graph","created_at":"2026-07-05T10:01:45Z","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/2501.09330/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new approach to solving games with a countably or uncountably infinite number of players. Such games are often used to model multiagent systems with a large number of agents. The latter are frequently encountered in economics, financial markets, crowd dynamics, congestion analysis, epidemiology, and population ecology, among other fields. Our two primary contributions are as follows. First, we present a way to represent strategy profiles for an infinite number of players, which we name a Player-to-Strategy Network (P2SN). Such a network maps players to strategies, and exploits the","authors_text":"Carlos Martin, Tuomas Sandholm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-16T07:01:01Z","title":"Solving Infinite-Player Games with Player-to-Strategy Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.09330","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:c0fe6616bae7b3b693b9d95aad1b5852d1c5b27ae45b4501170c51182d4285da","target":"record","created_at":"2026-07-05T10:01:45Z","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":"ea6a2ed1be20de188d982e7dedb3d1437e467d5a1fab1ccb1d2b9823a523b856","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-16T07:01:01Z","title_canon_sha256":"6baf208be7fefb44c63b6bc4219581d811ab0188d6286d53cc6fd49cd7ca3a08"},"schema_version":"1.0","source":{"id":"2501.09330","kind":"arxiv","version":1}},"canonical_sha256":"3d1efaed99b1ef700350537dcf2b026e8daf680d06b7b6bf03fe3c199dfab4ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d1efaed99b1ef700350537dcf2b026e8daf680d06b7b6bf03fe3c199dfab4ee","first_computed_at":"2026-07-05T10:01:45.260662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:01:45.260662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UAaIELxcTvyEj1dAD63Br5SWiYUDMmEDnvqdDQo0jEcPtRzHMi6KGfQ6R1ww6dgYxRi+fTFnw9/3oSj204grBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:01:45.261057Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.09330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0fe6616bae7b3b693b9d95aad1b5852d1c5b27ae45b4501170c51182d4285da","sha256:c32b6d0c0c3369b71c17b3ae3dbce0716c606067c8a8af62bf77f7d0ce77a8e1"],"state_sha256":"b029d0969f1572ced0e94bd8260efbb37482df4a188d0f5765a0ce556a3cfc77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hXl4EZEDa3+7LBUaLhqIEG+nqgReAL9KqPrIJA1v+oDH0oqFfS4/rBz1eoGFyvl3lAMUztn+mil6OUJ0qiryDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:12:06.624207Z","bundle_sha256":"429cd4a4f8fcf0d46b4e0783885ce595060c0c64760bed441c533c5f48ce5183"}}