{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PW372HPERYP323S2VD6NGG4DA3","short_pith_number":"pith:PW372HPE","canonical_record":{"source":{"id":"1310.3487","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-10-13T14:33:53Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"573ef8e938278c65f7a35b70e7ace0511028539787d7bdb977c444375c3ea600","abstract_canon_sha256":"065d40b4cc717a1fff18041b8c957cc16b0703cb8f8a9d71ce573641c4568894"},"schema_version":"1.0"},"canonical_sha256":"7db7fd1de48e1fbd6e5aa8fcd31b8306dad9621ff0d9a7514abddb0bb0f5cad1","source":{"kind":"arxiv","id":"1310.3487","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3487","created_at":"2026-05-18T01:00:54Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3487v4","created_at":"2026-05-18T01:00:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3487","created_at":"2026-05-18T01:00:54Z"},{"alias_kind":"pith_short_12","alias_value":"PW372HPERYP3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PW372HPERYP323S2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PW372HPE","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PW372HPERYP323S2VD6NGG4DA3","target":"record","payload":{"canonical_record":{"source":{"id":"1310.3487","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-10-13T14:33:53Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"573ef8e938278c65f7a35b70e7ace0511028539787d7bdb977c444375c3ea600","abstract_canon_sha256":"065d40b4cc717a1fff18041b8c957cc16b0703cb8f8a9d71ce573641c4568894"},"schema_version":"1.0"},"canonical_sha256":"7db7fd1de48e1fbd6e5aa8fcd31b8306dad9621ff0d9a7514abddb0bb0f5cad1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:54.267606Z","signature_b64":"pdVtsRtOT2h+L9d4y73MJYZMWLr9LKEoTAu8ff2OyRflu+F1F31UmFIP9np9NSJ7PhTEhAsK3zAv75ECY6EYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7db7fd1de48e1fbd6e5aa8fcd31b8306dad9621ff0d9a7514abddb0bb0f5cad1","last_reissued_at":"2026-05-18T01:00:54.266978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:54.266978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.3487","source_version":4,"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:00:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRrxxQ69NhLtxzMRaIQIslSaSn9/1v8jqNJ4Cmq9mEsgl+iEezy2QJx/WOYF4N5RKQkB5mcfadbzijR4pp/1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:40:22.282516Z"},"content_sha256":"04188cd845c4ba7815bf20e899d471689c0457aa610e007536b233ca34c0be4d","schema_version":"1.0","event_id":"sha256:04188cd845c4ba7815bf20e899d471689c0457aa610e007536b233ca34c0be4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PW372HPERYP323S2VD6NGG4DA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coalitions in Routing Games: A Worst-Case Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Ariel Orda, Gideon Blocq","submitted_at":"2013-10-13T14:33:53Z","abstract_excerpt":"We investigate a routing game that allows for the creation of coalitions, within the framework of cooperative game theory. Specifically, we describe the cost of each coalition as its maximin value. This represents the performance that the coalition can guarantee itself, under any (including worst) conditions. We then investigate fundamental solution concepts of the considered cooperative game, namely the core and a variant of the min-max fair nucleolus.\n  We consider two types of routing games based on the agents' Performance Objectives, namely bottleneck routing games and additive routing gam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3487","kind":"arxiv","version":4},"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:00:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzRppDEN3zK7LbHzm4/lD/8hOSnYObFxXwynG22UdEh0/8zacUu3ZCuyc4f1qBoOHCzMMdetGI102iXo1nfpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:40:22.282867Z"},"content_sha256":"d0a383a78ee03633f854e7547bd8cd85495f7395c276fa62db6ab301f4f84173","schema_version":"1.0","event_id":"sha256:d0a383a78ee03633f854e7547bd8cd85495f7395c276fa62db6ab301f4f84173"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PW372HPERYP323S2VD6NGG4DA3/bundle.json","state_url":"https://pith.science/pith/PW372HPERYP323S2VD6NGG4DA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PW372HPERYP323S2VD6NGG4DA3/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-28T13:40:22Z","links":{"resolver":"https://pith.science/pith/PW372HPERYP323S2VD6NGG4DA3","bundle":"https://pith.science/pith/PW372HPERYP323S2VD6NGG4DA3/bundle.json","state":"https://pith.science/pith/PW372HPERYP323S2VD6NGG4DA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PW372HPERYP323S2VD6NGG4DA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PW372HPERYP323S2VD6NGG4DA3","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":"065d40b4cc717a1fff18041b8c957cc16b0703cb8f8a9d71ce573641c4568894","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-10-13T14:33:53Z","title_canon_sha256":"573ef8e938278c65f7a35b70e7ace0511028539787d7bdb977c444375c3ea600"},"schema_version":"1.0","source":{"id":"1310.3487","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3487","created_at":"2026-05-18T01:00:54Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3487v4","created_at":"2026-05-18T01:00:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3487","created_at":"2026-05-18T01:00:54Z"},{"alias_kind":"pith_short_12","alias_value":"PW372HPERYP3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PW372HPERYP323S2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PW372HPE","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:d0a383a78ee03633f854e7547bd8cd85495f7395c276fa62db6ab301f4f84173","target":"graph","created_at":"2026-05-18T01:00:54Z","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 investigate a routing game that allows for the creation of coalitions, within the framework of cooperative game theory. Specifically, we describe the cost of each coalition as its maximin value. This represents the performance that the coalition can guarantee itself, under any (including worst) conditions. We then investigate fundamental solution concepts of the considered cooperative game, namely the core and a variant of the min-max fair nucleolus.\n  We consider two types of routing games based on the agents' Performance Objectives, namely bottleneck routing games and additive routing gam","authors_text":"Ariel Orda, Gideon Blocq","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-10-13T14:33:53Z","title":"Coalitions in Routing Games: A Worst-Case Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3487","kind":"arxiv","version":4},"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:04188cd845c4ba7815bf20e899d471689c0457aa610e007536b233ca34c0be4d","target":"record","created_at":"2026-05-18T01:00:54Z","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":"065d40b4cc717a1fff18041b8c957cc16b0703cb8f8a9d71ce573641c4568894","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-10-13T14:33:53Z","title_canon_sha256":"573ef8e938278c65f7a35b70e7ace0511028539787d7bdb977c444375c3ea600"},"schema_version":"1.0","source":{"id":"1310.3487","kind":"arxiv","version":4}},"canonical_sha256":"7db7fd1de48e1fbd6e5aa8fcd31b8306dad9621ff0d9a7514abddb0bb0f5cad1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7db7fd1de48e1fbd6e5aa8fcd31b8306dad9621ff0d9a7514abddb0bb0f5cad1","first_computed_at":"2026-05-18T01:00:54.266978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:54.266978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pdVtsRtOT2h+L9d4y73MJYZMWLr9LKEoTAu8ff2OyRflu+F1F31UmFIP9np9NSJ7PhTEhAsK3zAv75ECY6EYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:54.267606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3487","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04188cd845c4ba7815bf20e899d471689c0457aa610e007536b233ca34c0be4d","sha256:d0a383a78ee03633f854e7547bd8cd85495f7395c276fa62db6ab301f4f84173"],"state_sha256":"d079cea8989af42f9e3749a806004b33f9f9ce036a192ee6e7244b31fc3d38a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPo7229Kb/3bA4PtHZNI1u3/kLbOzufn9Cwcp+i9x++t5N88a1A33YV3mQbwlrpQY75Z8o2SqvkSUyRkJwJpCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:40:22.284867Z","bundle_sha256":"6fe2d0b63724576074047700dec64e99a7825240fb71b3d580765fa4d3e89441"}}