{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BLRY7QSKZO3R6MIZBQ3FPFCVMM","short_pith_number":"pith:BLRY7QSK","canonical_record":{"source":{"id":"1810.01436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-10-02T18:11:20Z","cross_cats_sorted":[],"title_canon_sha256":"ba02b1a2d782ed29bfc7f3aa63aacd11695044381eee0ac623bf2b6b79ef6a99","abstract_canon_sha256":"4f436da34d84df2311acee91847b7f898524f34102b7727ca1fd4ea63a8f2cd0"},"schema_version":"1.0"},"canonical_sha256":"0ae38fc24acbb71f31190c36579455630b76c0f678aa35255231d25d5e704803","source":{"kind":"arxiv","id":"1810.01436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01436","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01436v1","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01436","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"pith_short_12","alias_value":"BLRY7QSKZO3R","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BLRY7QSKZO3R6MIZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BLRY7QSK","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BLRY7QSKZO3R6MIZBQ3FPFCVMM","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-10-02T18:11:20Z","cross_cats_sorted":[],"title_canon_sha256":"ba02b1a2d782ed29bfc7f3aa63aacd11695044381eee0ac623bf2b6b79ef6a99","abstract_canon_sha256":"4f436da34d84df2311acee91847b7f898524f34102b7727ca1fd4ea63a8f2cd0"},"schema_version":"1.0"},"canonical_sha256":"0ae38fc24acbb71f31190c36579455630b76c0f678aa35255231d25d5e704803","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:12.256764Z","signature_b64":"ycS1IZhf1ZVvdnLvGyIJM6DRgW0Ozdl76WFowUmkrpLu7HovLDc+68gU01OmG584X+9DbO4FK7A8ep4s0Qb0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ae38fc24acbb71f31190c36579455630b76c0f678aa35255231d25d5e704803","last_reissued_at":"2026-05-18T00:04:12.255915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:12.255915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01436","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-18T00:04:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dcl7etp06K7yJOYgwdM7fiuInIj8YfCg3aj3pO8iogByI4j/HebpBq+ocWjYnuGlFmY+KnsNfvT1LTrGguQICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:54:26.411778Z"},"content_sha256":"ddc90ca679e5d2b73ccd11deb81738eedeaf94686beed99c4a2ca2672b854f4e","schema_version":"1.0","event_id":"sha256:ddc90ca679e5d2b73ccd11deb81738eedeaf94686beed99c4a2ca2672b854f4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BLRY7QSKZO3R6MIZBQ3FPFCVMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Estimation of Equilibria of Large Congestion Games with Heterogeneous Players","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Cheng Wan, Nadia Oudjane, Olivier Beaude, Paulin Jacquot","submitted_at":"2018-10-02T18:11:20Z","abstract_excerpt":"Computing an equilibrium in congestion games can be challenging when the number of players is large. Yet, it is a problem to be addressed in practice, for instance to forecast the state of the system and be able to control it. In this work, we analyze the case of generalized atomic congestion games, with coupling constraints, and with players that are heterogeneous through their action sets and their utility functions. We obtain an approximation of the variational Nash equilibria---a notion generalizing Nash equilibria in the presence of coupling constraints---of a large atomic congestion game"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01436","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-18T00:04:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpT6xN1gsMyXTkMY6YtWP22AhVnFCHgw80vAjFBHnkChHKcf7o8YQOVyXMY7dEgUTl0k9MLHuUrv9OYuStQCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:54:26.412131Z"},"content_sha256":"2df2253d2d87c62485662e91fbbc94873743d3c83e266978e90fb8083ae54c42","schema_version":"1.0","event_id":"sha256:2df2253d2d87c62485662e91fbbc94873743d3c83e266978e90fb8083ae54c42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLRY7QSKZO3R6MIZBQ3FPFCVMM/bundle.json","state_url":"https://pith.science/pith/BLRY7QSKZO3R6MIZBQ3FPFCVMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLRY7QSKZO3R6MIZBQ3FPFCVMM/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-06-02T21:54:26Z","links":{"resolver":"https://pith.science/pith/BLRY7QSKZO3R6MIZBQ3FPFCVMM","bundle":"https://pith.science/pith/BLRY7QSKZO3R6MIZBQ3FPFCVMM/bundle.json","state":"https://pith.science/pith/BLRY7QSKZO3R6MIZBQ3FPFCVMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLRY7QSKZO3R6MIZBQ3FPFCVMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BLRY7QSKZO3R6MIZBQ3FPFCVMM","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":"4f436da34d84df2311acee91847b7f898524f34102b7727ca1fd4ea63a8f2cd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-10-02T18:11:20Z","title_canon_sha256":"ba02b1a2d782ed29bfc7f3aa63aacd11695044381eee0ac623bf2b6b79ef6a99"},"schema_version":"1.0","source":{"id":"1810.01436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01436","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01436v1","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01436","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"pith_short_12","alias_value":"BLRY7QSKZO3R","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BLRY7QSKZO3R6MIZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BLRY7QSK","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:2df2253d2d87c62485662e91fbbc94873743d3c83e266978e90fb8083ae54c42","target":"graph","created_at":"2026-05-18T00:04:12Z","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":"Computing an equilibrium in congestion games can be challenging when the number of players is large. Yet, it is a problem to be addressed in practice, for instance to forecast the state of the system and be able to control it. In this work, we analyze the case of generalized atomic congestion games, with coupling constraints, and with players that are heterogeneous through their action sets and their utility functions. We obtain an approximation of the variational Nash equilibria---a notion generalizing Nash equilibria in the presence of coupling constraints---of a large atomic congestion game","authors_text":"Cheng Wan, Nadia Oudjane, Olivier Beaude, Paulin Jacquot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-10-02T18:11:20Z","title":"Efficient Estimation of Equilibria of Large Congestion Games with Heterogeneous Players"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01436","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:ddc90ca679e5d2b73ccd11deb81738eedeaf94686beed99c4a2ca2672b854f4e","target":"record","created_at":"2026-05-18T00:04:12Z","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":"4f436da34d84df2311acee91847b7f898524f34102b7727ca1fd4ea63a8f2cd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-10-02T18:11:20Z","title_canon_sha256":"ba02b1a2d782ed29bfc7f3aa63aacd11695044381eee0ac623bf2b6b79ef6a99"},"schema_version":"1.0","source":{"id":"1810.01436","kind":"arxiv","version":1}},"canonical_sha256":"0ae38fc24acbb71f31190c36579455630b76c0f678aa35255231d25d5e704803","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ae38fc24acbb71f31190c36579455630b76c0f678aa35255231d25d5e704803","first_computed_at":"2026-05-18T00:04:12.255915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:12.255915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ycS1IZhf1ZVvdnLvGyIJM6DRgW0Ozdl76WFowUmkrpLu7HovLDc+68gU01OmG584X+9DbO4FK7A8ep4s0Qb0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:12.256764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddc90ca679e5d2b73ccd11deb81738eedeaf94686beed99c4a2ca2672b854f4e","sha256:2df2253d2d87c62485662e91fbbc94873743d3c83e266978e90fb8083ae54c42"],"state_sha256":"099f637203a14aa4b06283efcd139b301d8e02b2c3f7469f95a36b23120cc14e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfUypG8lASCtH7FezmQki6hpUVy0iXPU2NfSCXgJzHsuD81hnOThtPixKBqI2SubnB2++uHG7GOMm0OxtZNzDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:54:26.414046Z","bundle_sha256":"2b4fb9b4a3c71772b33552664e4cc97833802aed48814b9b0b2c270708ba35e8"}}