{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QKR6R3I3NAFTEWKDG6OJBZNCZE","short_pith_number":"pith:QKR6R3I3","canonical_record":{"source":{"id":"1109.6166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T11:09:04Z","cross_cats_sorted":[],"title_canon_sha256":"944eda1ac6aa201d3a00c8c22bfcfa568db738627231f4c513eea58ac1ad429d","abstract_canon_sha256":"c7aa9065721487f1169a6295feac5584d33b3a20b7d18441be070f0da16bffb1"},"schema_version":"1.0"},"canonical_sha256":"82a3e8ed1b680b325943379c90e5a2c926f1bca805fcdb4d7521579b17e4ed46","source":{"kind":"arxiv","id":"1109.6166","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6166","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6166v3","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6166","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"QKR6R3I3NAFT","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKR6R3I3NAFTEWKD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKR6R3I3","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QKR6R3I3NAFTEWKDG6OJBZNCZE","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T11:09:04Z","cross_cats_sorted":[],"title_canon_sha256":"944eda1ac6aa201d3a00c8c22bfcfa568db738627231f4c513eea58ac1ad429d","abstract_canon_sha256":"c7aa9065721487f1169a6295feac5584d33b3a20b7d18441be070f0da16bffb1"},"schema_version":"1.0"},"canonical_sha256":"82a3e8ed1b680b325943379c90e5a2c926f1bca805fcdb4d7521579b17e4ed46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:26.059508Z","signature_b64":"5Todv9QgYz5m0FY+i7QZLilIwXQmO3RoMh4ItFot5DfrQtP9rfPhk42yhOtN9IxzryYyoTj94E0w5ZBsIxyIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a3e8ed1b680b325943379c90e5a2c926f1bca805fcdb4d7521579b17e4ed46","last_reissued_at":"2026-05-18T03:54:26.059080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:26.059080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6166","source_version":3,"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-18T03:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJcXwnI7/6+ifgLBhkJDdEgu9R67Ja/RiXugTFjwEjG38+7rZHDdCUX0fyn8+qe4qzIp48KPFrvczEnGkgXrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:44:20.438029Z"},"content_sha256":"d46263bbe97f9edc652a7ca9ebcb62ed81f7df398c4fbc454a51a65eb7f3d826","schema_version":"1.0","event_id":"sha256:d46263bbe97f9edc652a7ca9ebcb62ed81f7df398c4fbc454a51a65eb7f3d826"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QKR6R3I3NAFTEWKDG6OJBZNCZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heavy Traffic Approximation of Equilibria in Resource Sharing Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Loc Bui, Ramesh Johari, Yu Wu","submitted_at":"2011-09-28T11:09:04Z","abstract_excerpt":"We consider a model of priced resource sharing that combines both queueing behavior and strategic behavior. We study a priority service model where a single server allocates its capacity to agents in proportion to their payment to the system, and users from different classes act to minimize the sum of their cost for processing delay and payment. As the exact processing time of this system is hard to compute, we introduce the notion of heavy traffic equilibrium as an approximation of the Nash equilibrium, derived by considering the asymptotic regime where the system load approaches capacity. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6166","kind":"arxiv","version":3},"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-18T03:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMznjbfWD+2pUn9FfkC0LOQ7XI1ws3yDBzpumbVhdqfP/8OyQZXfIqyy17gkh3rieignDQEItNAswzNVPD15DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:44:20.438388Z"},"content_sha256":"a2eb230e003fe9e8ab27ae53cedd93911da96d6834d14f7adeeaaad1cf880122","schema_version":"1.0","event_id":"sha256:a2eb230e003fe9e8ab27ae53cedd93911da96d6834d14f7adeeaaad1cf880122"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKR6R3I3NAFTEWKDG6OJBZNCZE/bundle.json","state_url":"https://pith.science/pith/QKR6R3I3NAFTEWKDG6OJBZNCZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKR6R3I3NAFTEWKDG6OJBZNCZE/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-08T22:44:20Z","links":{"resolver":"https://pith.science/pith/QKR6R3I3NAFTEWKDG6OJBZNCZE","bundle":"https://pith.science/pith/QKR6R3I3NAFTEWKDG6OJBZNCZE/bundle.json","state":"https://pith.science/pith/QKR6R3I3NAFTEWKDG6OJBZNCZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKR6R3I3NAFTEWKDG6OJBZNCZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QKR6R3I3NAFTEWKDG6OJBZNCZE","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":"c7aa9065721487f1169a6295feac5584d33b3a20b7d18441be070f0da16bffb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T11:09:04Z","title_canon_sha256":"944eda1ac6aa201d3a00c8c22bfcfa568db738627231f4c513eea58ac1ad429d"},"schema_version":"1.0","source":{"id":"1109.6166","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6166","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6166v3","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6166","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"QKR6R3I3NAFT","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKR6R3I3NAFTEWKD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKR6R3I3","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:a2eb230e003fe9e8ab27ae53cedd93911da96d6834d14f7adeeaaad1cf880122","target":"graph","created_at":"2026-05-18T03:54:26Z","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":"We consider a model of priced resource sharing that combines both queueing behavior and strategic behavior. We study a priority service model where a single server allocates its capacity to agents in proportion to their payment to the system, and users from different classes act to minimize the sum of their cost for processing delay and payment. As the exact processing time of this system is hard to compute, we introduce the notion of heavy traffic equilibrium as an approximation of the Nash equilibrium, derived by considering the asymptotic regime where the system load approaches capacity. We","authors_text":"Loc Bui, Ramesh Johari, Yu Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T11:09:04Z","title":"Heavy Traffic Approximation of Equilibria in Resource Sharing Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6166","kind":"arxiv","version":3},"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:d46263bbe97f9edc652a7ca9ebcb62ed81f7df398c4fbc454a51a65eb7f3d826","target":"record","created_at":"2026-05-18T03:54:26Z","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":"c7aa9065721487f1169a6295feac5584d33b3a20b7d18441be070f0da16bffb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T11:09:04Z","title_canon_sha256":"944eda1ac6aa201d3a00c8c22bfcfa568db738627231f4c513eea58ac1ad429d"},"schema_version":"1.0","source":{"id":"1109.6166","kind":"arxiv","version":3}},"canonical_sha256":"82a3e8ed1b680b325943379c90e5a2c926f1bca805fcdb4d7521579b17e4ed46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82a3e8ed1b680b325943379c90e5a2c926f1bca805fcdb4d7521579b17e4ed46","first_computed_at":"2026-05-18T03:54:26.059080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:26.059080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Todv9QgYz5m0FY+i7QZLilIwXQmO3RoMh4ItFot5DfrQtP9rfPhk42yhOtN9IxzryYyoTj94E0w5ZBsIxyIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:26.059508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6166","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d46263bbe97f9edc652a7ca9ebcb62ed81f7df398c4fbc454a51a65eb7f3d826","sha256:a2eb230e003fe9e8ab27ae53cedd93911da96d6834d14f7adeeaaad1cf880122"],"state_sha256":"c14135efa8c67822f49b668ae666be1b4a3518d71f788c0e742646b5bbdf76ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K3Hr/WU0Jnv9ar/sRPiYBO2WtEvNIjpBgT+INc6PyGN07XpqiLgtK+bnGe93eedeKaEn3kOCx2lv293Gw5WgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:44:20.440515Z","bundle_sha256":"6f3a2ae3b1f5d62e41b8d0bfc3952c9ab1ea8a9dc7b8c901ab3fffa2763ef48e"}}