{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QBKRHWGUYR2WWW3YN364YCO3NB","short_pith_number":"pith:QBKRHWGU","canonical_record":{"source":{"id":"2007.15520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-30T15:20:14Z","cross_cats_sorted":[],"title_canon_sha256":"71cc90384229d87b9856d0c5a68f5ccb9d7a6e6770714fa89153ccd7f4222e6f","abstract_canon_sha256":"f2961d31dc2e3b7034aeab443c432dea27c9e24b506e32ba183f9483030eee8f"},"schema_version":"1.0"},"canonical_sha256":"805513d8d4c4756b5b786efdcc09db686a2b421baeb140c6735ee682bb1eb748","source":{"kind":"arxiv","id":"2007.15520","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.15520","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"2007.15520v2","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.15520","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"QBKRHWGUYR2W","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"pith_short_16","alias_value":"QBKRHWGUYR2WWW3Y","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"pith_short_8","alias_value":"QBKRHWGU","created_at":"2026-07-05T01:23:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QBKRHWGUYR2WWW3YN364YCO3NB","target":"record","payload":{"canonical_record":{"source":{"id":"2007.15520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-30T15:20:14Z","cross_cats_sorted":[],"title_canon_sha256":"71cc90384229d87b9856d0c5a68f5ccb9d7a6e6770714fa89153ccd7f4222e6f","abstract_canon_sha256":"f2961d31dc2e3b7034aeab443c432dea27c9e24b506e32ba183f9483030eee8f"},"schema_version":"1.0"},"canonical_sha256":"805513d8d4c4756b5b786efdcc09db686a2b421baeb140c6735ee682bb1eb748","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:37.071049Z","signature_b64":"+qzR2EXXWhIqbPBaKxCPHrd6smJ0FqlLxku5Hyyxhe1FngmDubeqCao9DldHU0KyhQhV4mk2Bl0hQ0leo+ClDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"805513d8d4c4756b5b786efdcc09db686a2b421baeb140c6735ee682bb1eb748","last_reissued_at":"2026-07-05T01:23:37.070453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:37.070453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.15520","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-07-05T01:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9RiGzaSnrBXqJG0i+LWxnhkNAmSPAb1ZrnZHVFep5Q1U7ymPtjcCs8S6Y0eCH1RAISOVUB33pp8NyZkrjlNFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:14:23.180427Z"},"content_sha256":"8e70efbf849cc02899826e055ed6fcb5ba65224d90838ac7a2b4f79e45395e2b","schema_version":"1.0","event_id":"sha256:8e70efbf849cc02899826e055ed6fcb5ba65224d90838ac7a2b4f79e45395e2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QBKRHWGUYR2WWW3YN364YCO3NB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving approximate pure Nash equilibria in congestion games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexander Skopalik, Vipin Ravindran Vijayalakshmi","submitted_at":"2020-07-30T15:20:14Z","abstract_excerpt":"Congestion games constitute an important class of games to model resource allocation by different users. As computing an exact or even an approximate pure Nash equilibrium is in general PLS-complete, Caragiannis et al. (2011) present a polynomial-time algorithm that computes a ($2 + \\epsilon$)-approximate pure Nash equilibria for games with linear cost functions and further results for polynomial cost functions. We show that this factor can be improved to $(1.61+\\epsilon)$ and further improved results for polynomial cost functions, by a seemingly simple modification to their algorithm by allow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.15520","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.15520/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-05T01:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gynCMoL+672IPBcEDX48FoH/6xZIcY9zUCF63FpPFEiveOGxzZCV5Z4NZXn89HjaviMIt/yLP/4wkTsd0JT0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:14:23.182438Z"},"content_sha256":"8b6432fec27703745044aa9e265b467d4573581862718f424bc4af21e9d3090b","schema_version":"1.0","event_id":"sha256:8b6432fec27703745044aa9e265b467d4573581862718f424bc4af21e9d3090b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QBKRHWGUYR2WWW3YN364YCO3NB/bundle.json","state_url":"https://pith.science/pith/QBKRHWGUYR2WWW3YN364YCO3NB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QBKRHWGUYR2WWW3YN364YCO3NB/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-18T17:14:23Z","links":{"resolver":"https://pith.science/pith/QBKRHWGUYR2WWW3YN364YCO3NB","bundle":"https://pith.science/pith/QBKRHWGUYR2WWW3YN364YCO3NB/bundle.json","state":"https://pith.science/pith/QBKRHWGUYR2WWW3YN364YCO3NB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QBKRHWGUYR2WWW3YN364YCO3NB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QBKRHWGUYR2WWW3YN364YCO3NB","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":"f2961d31dc2e3b7034aeab443c432dea27c9e24b506e32ba183f9483030eee8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-30T15:20:14Z","title_canon_sha256":"71cc90384229d87b9856d0c5a68f5ccb9d7a6e6770714fa89153ccd7f4222e6f"},"schema_version":"1.0","source":{"id":"2007.15520","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.15520","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"2007.15520v2","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.15520","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"QBKRHWGUYR2W","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"pith_short_16","alias_value":"QBKRHWGUYR2WWW3Y","created_at":"2026-07-05T01:23:37Z"},{"alias_kind":"pith_short_8","alias_value":"QBKRHWGU","created_at":"2026-07-05T01:23:37Z"}],"graph_snapshots":[{"event_id":"sha256:8b6432fec27703745044aa9e265b467d4573581862718f424bc4af21e9d3090b","target":"graph","created_at":"2026-07-05T01:23:37Z","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/2007.15520/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Congestion games constitute an important class of games to model resource allocation by different users. As computing an exact or even an approximate pure Nash equilibrium is in general PLS-complete, Caragiannis et al. (2011) present a polynomial-time algorithm that computes a ($2 + \\epsilon$)-approximate pure Nash equilibria for games with linear cost functions and further results for polynomial cost functions. We show that this factor can be improved to $(1.61+\\epsilon)$ and further improved results for polynomial cost functions, by a seemingly simple modification to their algorithm by allow","authors_text":"Alexander Skopalik, Vipin Ravindran Vijayalakshmi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-30T15:20:14Z","title":"Improving approximate pure Nash equilibria in congestion games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.15520","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:8e70efbf849cc02899826e055ed6fcb5ba65224d90838ac7a2b4f79e45395e2b","target":"record","created_at":"2026-07-05T01:23:37Z","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":"f2961d31dc2e3b7034aeab443c432dea27c9e24b506e32ba183f9483030eee8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-30T15:20:14Z","title_canon_sha256":"71cc90384229d87b9856d0c5a68f5ccb9d7a6e6770714fa89153ccd7f4222e6f"},"schema_version":"1.0","source":{"id":"2007.15520","kind":"arxiv","version":2}},"canonical_sha256":"805513d8d4c4756b5b786efdcc09db686a2b421baeb140c6735ee682bb1eb748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"805513d8d4c4756b5b786efdcc09db686a2b421baeb140c6735ee682bb1eb748","first_computed_at":"2026-07-05T01:23:37.070453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:23:37.070453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+qzR2EXXWhIqbPBaKxCPHrd6smJ0FqlLxku5Hyyxhe1FngmDubeqCao9DldHU0KyhQhV4mk2Bl0hQ0leo+ClDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:23:37.071049Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.15520","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e70efbf849cc02899826e055ed6fcb5ba65224d90838ac7a2b4f79e45395e2b","sha256:8b6432fec27703745044aa9e265b467d4573581862718f424bc4af21e9d3090b"],"state_sha256":"c778454df7a55c11af32a4a7fbb88c59665d19b35a3a97d5a2b837bd47c7f30c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lij7hqz3mf25p+5fPc6J5BFSEu34rKSsla4avhG0TWbYAdHJOBEHT/X4l7F403a9IOAXsAOSMYtkVZMQnpZ4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:14:23.189172Z","bundle_sha256":"8e212ae4f5c1ff4d4c79ac4d6653f773bdd0b0c5fe8c6d649cdc137b0a1a5486"}}