{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BQ6MXII2IMKE6C6RSDTJYYHXUQ","short_pith_number":"pith:BQ6MXII2","canonical_record":{"source":{"id":"1710.01634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-04T14:46:51Z","cross_cats_sorted":[],"title_canon_sha256":"71c17b4ae8c07ba27ba21ffdd3c486ea9d843b2d1e52fa945c18d72d15a14c85","abstract_canon_sha256":"c4a954a403ab4e41c70c2194683f0186038484203a2499bcfc15b79d6edd4bc6"},"schema_version":"1.0"},"canonical_sha256":"0c3ccba11a43144f0bd190e69c60f7a433f72e44180d2102fd5c72243676a3fd","source":{"kind":"arxiv","id":"1710.01634","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01634","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01634v2","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01634","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"pith_short_12","alias_value":"BQ6MXII2IMKE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BQ6MXII2IMKE6C6R","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BQ6MXII2","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BQ6MXII2IMKE6C6RSDTJYYHXUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-04T14:46:51Z","cross_cats_sorted":[],"title_canon_sha256":"71c17b4ae8c07ba27ba21ffdd3c486ea9d843b2d1e52fa945c18d72d15a14c85","abstract_canon_sha256":"c4a954a403ab4e41c70c2194683f0186038484203a2499bcfc15b79d6edd4bc6"},"schema_version":"1.0"},"canonical_sha256":"0c3ccba11a43144f0bd190e69c60f7a433f72e44180d2102fd5c72243676a3fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:36.654812Z","signature_b64":"hpIK4Pqnz5cvi31GsyQyyfzMOpfw24qQuakROi9tYnRECaCBAlzHGhDtA1rxa2RPOyn3qBjI0bgSeujzF/4kBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c3ccba11a43144f0bd190e69c60f7a433f72e44180d2102fd5c72243676a3fd","last_reissued_at":"2026-05-18T00:29:36.654111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:36.654111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01634","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-05-18T00:29:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvzuIpiUfEydqnnx1q5vxlweDijwejVBqs4FvlUwu+IkDSsctezzpMdSgYVlTKxY6IcDWLxjaSOG6QfTNnoHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T16:52:22.686548Z"},"content_sha256":"0d73c6deafab14dcd3f2ded0971d904cb88ca135c43ab4fb95b67f8a6a70d6cd","schema_version":"1.0","event_id":"sha256:0d73c6deafab14dcd3f2ded0971d904cb88ca135c43ab4fb95b67f8a6a70d6cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BQ6MXII2IMKE6C6RSDTJYYHXUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexander Skopalik, Grammateia Kotsialou, Martin Gairing, Matthias Feldotto","submitted_at":"2017-10-04T14:46:51Z","abstract_excerpt":"We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply samp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01634","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":""},"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:29:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cg6fN0a+frZLORZ3oM2IxQFSowxZM82R6vEnmTPlfZrteplHbDDsyYSmiBIBvaWkAlbDDFnDCfBGBTAt0UO1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T16:52:22.686896Z"},"content_sha256":"4cc3229738b4984ca5f98cdf0af93360183c7de633c2d46171ef69e871ea8406","schema_version":"1.0","event_id":"sha256:4cc3229738b4984ca5f98cdf0af93360183c7de633c2d46171ef69e871ea8406"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQ6MXII2IMKE6C6RSDTJYYHXUQ/bundle.json","state_url":"https://pith.science/pith/BQ6MXII2IMKE6C6RSDTJYYHXUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQ6MXII2IMKE6C6RSDTJYYHXUQ/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-05-21T16:52:22Z","links":{"resolver":"https://pith.science/pith/BQ6MXII2IMKE6C6RSDTJYYHXUQ","bundle":"https://pith.science/pith/BQ6MXII2IMKE6C6RSDTJYYHXUQ/bundle.json","state":"https://pith.science/pith/BQ6MXII2IMKE6C6RSDTJYYHXUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQ6MXII2IMKE6C6RSDTJYYHXUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BQ6MXII2IMKE6C6RSDTJYYHXUQ","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":"c4a954a403ab4e41c70c2194683f0186038484203a2499bcfc15b79d6edd4bc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-04T14:46:51Z","title_canon_sha256":"71c17b4ae8c07ba27ba21ffdd3c486ea9d843b2d1e52fa945c18d72d15a14c85"},"schema_version":"1.0","source":{"id":"1710.01634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01634","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01634v2","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01634","created_at":"2026-05-18T00:29:36Z"},{"alias_kind":"pith_short_12","alias_value":"BQ6MXII2IMKE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BQ6MXII2IMKE6C6R","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BQ6MXII2","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:4cc3229738b4984ca5f98cdf0af93360183c7de633c2d46171ef69e871ea8406","target":"graph","created_at":"2026-05-18T00:29:36Z","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 study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply samp","authors_text":"Alexander Skopalik, Grammateia Kotsialou, Martin Gairing, Matthias Feldotto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-04T14:46:51Z","title":"Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01634","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:0d73c6deafab14dcd3f2ded0971d904cb88ca135c43ab4fb95b67f8a6a70d6cd","target":"record","created_at":"2026-05-18T00:29:36Z","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":"c4a954a403ab4e41c70c2194683f0186038484203a2499bcfc15b79d6edd4bc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-10-04T14:46:51Z","title_canon_sha256":"71c17b4ae8c07ba27ba21ffdd3c486ea9d843b2d1e52fa945c18d72d15a14c85"},"schema_version":"1.0","source":{"id":"1710.01634","kind":"arxiv","version":2}},"canonical_sha256":"0c3ccba11a43144f0bd190e69c60f7a433f72e44180d2102fd5c72243676a3fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c3ccba11a43144f0bd190e69c60f7a433f72e44180d2102fd5c72243676a3fd","first_computed_at":"2026-05-18T00:29:36.654111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:36.654111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hpIK4Pqnz5cvi31GsyQyyfzMOpfw24qQuakROi9tYnRECaCBAlzHGhDtA1rxa2RPOyn3qBjI0bgSeujzF/4kBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:36.654812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d73c6deafab14dcd3f2ded0971d904cb88ca135c43ab4fb95b67f8a6a70d6cd","sha256:4cc3229738b4984ca5f98cdf0af93360183c7de633c2d46171ef69e871ea8406"],"state_sha256":"ce5453b317d498162d13fc467ed2e71da357357ae896c8838557ab247f4d1895"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MiaByLuENOff6XpbU4YkSjVHN1H+OKAKMjKnbrSx3OFVLMsiNsq6T9OmvOjDLmzWYpQ29Y+GH2oKeG2xKTQLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T16:52:22.688873Z","bundle_sha256":"daa2ddbaa1c796ec0aa57addf4e76b8014f2561f1591b64df3617e6209d426ff"}}