{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OFL56DSMO4PIEQM347FXVZBET4","short_pith_number":"pith:OFL56DSM","canonical_record":{"source":{"id":"1512.09239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-12-31T08:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"f521a956c4d788a6cc9b784dddf414fb2a5643b4e223c9ce38bd6df2d584e7ae","abstract_canon_sha256":"93069b2aa34de5a217909bb6549bd0728d5399b9c7af16ca697084ec79a78f57"},"schema_version":"1.0"},"canonical_sha256":"7157df0e4c771e82419be7cb7ae4249f155e641e6ae7fb1b237c893f8f9c7c16","source":{"kind":"arxiv","id":"1512.09239","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09239","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09239v1","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09239","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"pith_short_12","alias_value":"OFL56DSMO4PI","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OFL56DSMO4PIEQM3","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OFL56DSM","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OFL56DSMO4PIEQM347FXVZBET4","target":"record","payload":{"canonical_record":{"source":{"id":"1512.09239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-12-31T08:21:35Z","cross_cats_sorted":[],"title_canon_sha256":"f521a956c4d788a6cc9b784dddf414fb2a5643b4e223c9ce38bd6df2d584e7ae","abstract_canon_sha256":"93069b2aa34de5a217909bb6549bd0728d5399b9c7af16ca697084ec79a78f57"},"schema_version":"1.0"},"canonical_sha256":"7157df0e4c771e82419be7cb7ae4249f155e641e6ae7fb1b237c893f8f9c7c16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:32.929062Z","signature_b64":"tNDxEciFX3d9oh0+TRvCYxvj4bMHmZniFQKFnvlrjwQOczNtDvDGJv4HcOe5GYbQ5bsiwoQYfI71Er6RJpU2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7157df0e4c771e82419be7cb7ae4249f155e641e6ae7fb1b237c893f8f9c7c16","last_reissued_at":"2026-05-18T01:23:32.928193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:32.928193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.09239","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-18T01:23:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LvrjkPuz10ygypvJBmRvWIAuWi9C1TtL9eI97RU7UaxuTeRoOkNraYYFVE+WBBVC8dkBQxxpdYP+8sxnu0iDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:46:01.483393Z"},"content_sha256":"9f2d8f0b995e6d756967da5227fe491ca76e34a29c52b55791c61aa2d3bad03b","schema_version":"1.0","event_id":"sha256:9f2d8f0b995e6d756967da5227fe491ca76e34a29c52b55791c61aa2d3bad03b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OFL56DSMO4PIEQM347FXVZBET4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Load Balancing Congestion Games and their Asymptotic Behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Corinne Touati, Eitan Altman (MAESTRO)","submitted_at":"2015-12-31T08:21:35Z","abstract_excerpt":"A central question in routing games has been to establish conditions for the uniqueness of the equilibrium, either in terms of network topology or in terms of costs. This question is well understood in two classes of routing games. The first is the non-atomic routing introduced by Wardrop on 1952 in the context of road traffic in which each player (car) is infinitesimally small; a single car has a negligible impact on the congestion. Each car wishes to minimize its expected delay. Under arbitrary topology, such games are known to have a convex potential and thus a unique equilibrium. The secon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09239","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-18T01:23:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VrQ/c64BeZ/ZT1qhYjce8WPQmUr7mHesdf3TsmnbdFuv80Btca8Q/cwmscDwQl6gjqE/9OuRDxYAwNGEbI2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:46:01.483743Z"},"content_sha256":"d000b7af503be5757cbdbec916136306144bdcb6225ee1282cb429fe9fb284ea","schema_version":"1.0","event_id":"sha256:d000b7af503be5757cbdbec916136306144bdcb6225ee1282cb429fe9fb284ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFL56DSMO4PIEQM347FXVZBET4/bundle.json","state_url":"https://pith.science/pith/OFL56DSMO4PIEQM347FXVZBET4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFL56DSMO4PIEQM347FXVZBET4/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-10T22:46:01Z","links":{"resolver":"https://pith.science/pith/OFL56DSMO4PIEQM347FXVZBET4","bundle":"https://pith.science/pith/OFL56DSMO4PIEQM347FXVZBET4/bundle.json","state":"https://pith.science/pith/OFL56DSMO4PIEQM347FXVZBET4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFL56DSMO4PIEQM347FXVZBET4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OFL56DSMO4PIEQM347FXVZBET4","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":"93069b2aa34de5a217909bb6549bd0728d5399b9c7af16ca697084ec79a78f57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-12-31T08:21:35Z","title_canon_sha256":"f521a956c4d788a6cc9b784dddf414fb2a5643b4e223c9ce38bd6df2d584e7ae"},"schema_version":"1.0","source":{"id":"1512.09239","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.09239","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"arxiv_version","alias_value":"1512.09239v1","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09239","created_at":"2026-05-18T01:23:32Z"},{"alias_kind":"pith_short_12","alias_value":"OFL56DSMO4PI","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OFL56DSMO4PIEQM3","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OFL56DSM","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:d000b7af503be5757cbdbec916136306144bdcb6225ee1282cb429fe9fb284ea","target":"graph","created_at":"2026-05-18T01:23:32Z","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":"A central question in routing games has been to establish conditions for the uniqueness of the equilibrium, either in terms of network topology or in terms of costs. This question is well understood in two classes of routing games. The first is the non-atomic routing introduced by Wardrop on 1952 in the context of road traffic in which each player (car) is infinitesimally small; a single car has a negligible impact on the congestion. Each car wishes to minimize its expected delay. Under arbitrary topology, such games are known to have a convex potential and thus a unique equilibrium. The secon","authors_text":"Corinne Touati, Eitan Altman (MAESTRO)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-12-31T08:21:35Z","title":"Load Balancing Congestion Games and their Asymptotic Behavior"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09239","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:9f2d8f0b995e6d756967da5227fe491ca76e34a29c52b55791c61aa2d3bad03b","target":"record","created_at":"2026-05-18T01:23:32Z","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":"93069b2aa34de5a217909bb6549bd0728d5399b9c7af16ca697084ec79a78f57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-12-31T08:21:35Z","title_canon_sha256":"f521a956c4d788a6cc9b784dddf414fb2a5643b4e223c9ce38bd6df2d584e7ae"},"schema_version":"1.0","source":{"id":"1512.09239","kind":"arxiv","version":1}},"canonical_sha256":"7157df0e4c771e82419be7cb7ae4249f155e641e6ae7fb1b237c893f8f9c7c16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7157df0e4c771e82419be7cb7ae4249f155e641e6ae7fb1b237c893f8f9c7c16","first_computed_at":"2026-05-18T01:23:32.928193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:32.928193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tNDxEciFX3d9oh0+TRvCYxvj4bMHmZniFQKFnvlrjwQOczNtDvDGJv4HcOe5GYbQ5bsiwoQYfI71Er6RJpU2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:32.929062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.09239","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f2d8f0b995e6d756967da5227fe491ca76e34a29c52b55791c61aa2d3bad03b","sha256:d000b7af503be5757cbdbec916136306144bdcb6225ee1282cb429fe9fb284ea"],"state_sha256":"4478a726d8af7f4779fb9b85aed4a06cc910d847e33418981bf2eff77b724d6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a16/dP4hhhZTj7wv91plPf1Y+/p6mhMw2QkJBhbXmQ3er4+A5qEHWZLigO9BjX/0Kv8qvBCfdlh/5KdFbR9ODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:46:01.485662Z","bundle_sha256":"1ab6f40e82674412f4e2a7b1b22559582926443ebd6316ae59db4944ce6c0b59"}}