{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JCXCMLSSIUYMM7DNAAETRLXH43","short_pith_number":"pith:JCXCMLSS","canonical_record":{"source":{"id":"1308.3161","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-14T15:45:51Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"5f6137c5ac163b6df0023bf2c3a928ba1f5fca7ecc9ebb1e9347822fd379fcba","abstract_canon_sha256":"7f2cf905a4e4067d53baab98253052b735cbd29eb142e1da681e94beab33e5cd"},"schema_version":"1.0"},"canonical_sha256":"48ae262e524530c67c6d000938aee7e6df7c56d59ce875f456453c17ed255fb7","source":{"kind":"arxiv","id":"1308.3161","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3161","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3161v3","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3161","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"JCXCMLSSIUYM","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JCXCMLSSIUYMM7DN","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JCXCMLSS","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JCXCMLSSIUYMM7DNAAETRLXH43","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3161","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-14T15:45:51Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"5f6137c5ac163b6df0023bf2c3a928ba1f5fca7ecc9ebb1e9347822fd379fcba","abstract_canon_sha256":"7f2cf905a4e4067d53baab98253052b735cbd29eb142e1da681e94beab33e5cd"},"schema_version":"1.0"},"canonical_sha256":"48ae262e524530c67c6d000938aee7e6df7c56d59ce875f456453c17ed255fb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:20.691019Z","signature_b64":"HXiJ7IV1yfxAu3T8FBIZvaG4ERZF1BB/Xma7EYZ+uff5ypM6rVCm6kTUo0Uv09fw0lFeIxrds2osy69g7cV/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48ae262e524530c67c6d000938aee7e6df7c56d59ce875f456453c17ed255fb7","last_reissued_at":"2026-05-18T03:02:20.690261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:20.690261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3161","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:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/BpthjC5u+N1kG4UTZFPasB1PYiVWP2B3cLH76lpcJDnKXLLsZD92ukKbefQCYbafus77WofXb95gP/cwVaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:57:11.817828Z"},"content_sha256":"f7f09ce6a4bd89b24a7c349d8323d654af0a1207e1618fe7ca0b3c0e34b6850b","schema_version":"1.0","event_id":"sha256:f7f09ce6a4bd89b24a7c349d8323d654af0a1207e1618fe7ca0b3c0e34b6850b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JCXCMLSSIUYMM7DNAAETRLXH43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing Games with Progressive Filling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Alexander Skopalik, Kevin Schewior, Martin Hoefer, Tobias Harks","submitted_at":"2013-08-14T15:45:51Z","abstract_excerpt":"Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).\n  We present a variety of results for equilibria in PFGs. We show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3161","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:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOeJMXh1b1I8Cs5mQy8dFxEaE5l9AE150eQT8qy/JLjE/gJ0tppISWlrNJNQ0KddXwxLgmLNMKqP3gSnTBh8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:57:11.818512Z"},"content_sha256":"3ac0b9fa661140ba2a9ff171a464e8cfdf9645156c65b16a6e37c9d85b419b94","schema_version":"1.0","event_id":"sha256:3ac0b9fa661140ba2a9ff171a464e8cfdf9645156c65b16a6e37c9d85b419b94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCXCMLSSIUYMM7DNAAETRLXH43/bundle.json","state_url":"https://pith.science/pith/JCXCMLSSIUYMM7DNAAETRLXH43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCXCMLSSIUYMM7DNAAETRLXH43/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-20T21:57:11Z","links":{"resolver":"https://pith.science/pith/JCXCMLSSIUYMM7DNAAETRLXH43","bundle":"https://pith.science/pith/JCXCMLSSIUYMM7DNAAETRLXH43/bundle.json","state":"https://pith.science/pith/JCXCMLSSIUYMM7DNAAETRLXH43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCXCMLSSIUYMM7DNAAETRLXH43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JCXCMLSSIUYMM7DNAAETRLXH43","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":"7f2cf905a4e4067d53baab98253052b735cbd29eb142e1da681e94beab33e5cd","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-14T15:45:51Z","title_canon_sha256":"5f6137c5ac163b6df0023bf2c3a928ba1f5fca7ecc9ebb1e9347822fd379fcba"},"schema_version":"1.0","source":{"id":"1308.3161","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3161","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3161v3","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3161","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"JCXCMLSSIUYM","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JCXCMLSSIUYMM7DN","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JCXCMLSS","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:3ac0b9fa661140ba2a9ff171a464e8cfdf9645156c65b16a6e37c9d85b419b94","target":"graph","created_at":"2026-05-18T03:02:20Z","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":"Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).\n  We present a variety of results for equilibria in PFGs. We show th","authors_text":"Alexander Skopalik, Kevin Schewior, Martin Hoefer, Tobias Harks","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-14T15:45:51Z","title":"Routing Games with Progressive Filling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3161","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:f7f09ce6a4bd89b24a7c349d8323d654af0a1207e1618fe7ca0b3c0e34b6850b","target":"record","created_at":"2026-05-18T03:02:20Z","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":"7f2cf905a4e4067d53baab98253052b735cbd29eb142e1da681e94beab33e5cd","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-14T15:45:51Z","title_canon_sha256":"5f6137c5ac163b6df0023bf2c3a928ba1f5fca7ecc9ebb1e9347822fd379fcba"},"schema_version":"1.0","source":{"id":"1308.3161","kind":"arxiv","version":3}},"canonical_sha256":"48ae262e524530c67c6d000938aee7e6df7c56d59ce875f456453c17ed255fb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48ae262e524530c67c6d000938aee7e6df7c56d59ce875f456453c17ed255fb7","first_computed_at":"2026-05-18T03:02:20.690261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:20.690261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HXiJ7IV1yfxAu3T8FBIZvaG4ERZF1BB/Xma7EYZ+uff5ypM6rVCm6kTUo0Uv09fw0lFeIxrds2osy69g7cV/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:20.691019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3161","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7f09ce6a4bd89b24a7c349d8323d654af0a1207e1618fe7ca0b3c0e34b6850b","sha256:3ac0b9fa661140ba2a9ff171a464e8cfdf9645156c65b16a6e37c9d85b419b94"],"state_sha256":"fe8d47438a060877717fcec1ecfc513e0a803ea0fab95a51ca7c9dc3b2f8b5db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VchoYeYd1EL6HKl3+Cupt8koNFCsaQg831oA4b+kgBfyMAvZFoaR3Yx018Fbj4ScKizdE2/o/eRHLE6xIPUBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T21:57:11.822549Z","bundle_sha256":"a3850b64758e516311296a1aab289a4dfeadfda34d3edbe7b62fd748d0c5b38c"}}