{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5IJCHXKPU4DLK7LRSB3TQMCBZN","short_pith_number":"pith:5IJCHXKP","canonical_record":{"source":{"id":"1206.2448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-12T07:31:28Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"52df9b559308ca46b0c9a953cf48a6fb404766c5346ec1fe8ad2fee0e7c67234","abstract_canon_sha256":"64f21810286c3ab95c01e9e48d08eeb10e07ad936d40f365f0ba2ba2a3d96f6b"},"schema_version":"1.0"},"canonical_sha256":"ea1223dd4fa706b57d719077383041cb6e2726fb471a5d371bc6ab10517b6655","source":{"kind":"arxiv","id":"1206.2448","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2448","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2448v2","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2448","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"5IJCHXKPU4DL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5IJCHXKPU4DLK7LR","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5IJCHXKP","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5IJCHXKPU4DLK7LRSB3TQMCBZN","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-12T07:31:28Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"52df9b559308ca46b0c9a953cf48a6fb404766c5346ec1fe8ad2fee0e7c67234","abstract_canon_sha256":"64f21810286c3ab95c01e9e48d08eeb10e07ad936d40f365f0ba2ba2a3d96f6b"},"schema_version":"1.0"},"canonical_sha256":"ea1223dd4fa706b57d719077383041cb6e2726fb471a5d371bc6ab10517b6655","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:57.361494Z","signature_b64":"JRzzWdl+rN5X8d2yQB25YWux8zKcKUKItbFteE3NvW1vDO5T7KM1E9nGWj+tqi4W2npQY2Ve1mQkv5ZNC5JgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea1223dd4fa706b57d719077383041cb6e2726fb471a5d371bc6ab10517b6655","last_reissued_at":"2026-05-18T03:17:57.360791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:57.360791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2448","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-18T03:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7a6DCw+czB92YheecqLrM2o7tifEQ/FZpW7X/uagZ5lst8q5No2/GkBH33dnQv8AifMtk1ryHuXO6amPuyljBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:19:39.559389Z"},"content_sha256":"647ea3b8f0484bfe6bdd20c6ec6847720b5da04c6c69df047e1bf8b4e2fd556c","schema_version":"1.0","event_id":"sha256:647ea3b8f0484bfe6bdd20c6ec6847720b5da04c6c69df047e1bf8b4e2fd556c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5IJCHXKPU4DLK7LRSB3TQMCBZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.GT","authors_text":"Dariusz G\\c{a}sior, Maciej Drwal","submitted_at":"2012-06-12T07:31:28Z","abstract_excerpt":"In this paper we introduce a capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents. Motivated by the idea of self-managed networks, in the developed framework decision-making entities are associated with individual transmission links, deciding on the way they split capacity among concurrent flows. An efficient decentralized algorithm is given for computing strongly Pareto-optimal strategies, constituting a pure Nash equilibrium. Subsequently, we discuss the properties of the introduced game related to the Price"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2448","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-18T03:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jVnYkxBEBvHppzXtRsWwEaa0YTr9K4PUDFiIuPhlrfUvcas1URrba91mFkZG9BEzgJGaQjspjX40tVO3F/9HDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:19:39.559743Z"},"content_sha256":"a2eba7d8113bdd342069c7d3551b4352ecfdce445d69dff508723864a4443bf5","schema_version":"1.0","event_id":"sha256:a2eba7d8113bdd342069c7d3551b4352ecfdce445d69dff508723864a4443bf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IJCHXKPU4DLK7LRSB3TQMCBZN/bundle.json","state_url":"https://pith.science/pith/5IJCHXKPU4DLK7LRSB3TQMCBZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IJCHXKPU4DLK7LRSB3TQMCBZN/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-05T13:19:39Z","links":{"resolver":"https://pith.science/pith/5IJCHXKPU4DLK7LRSB3TQMCBZN","bundle":"https://pith.science/pith/5IJCHXKPU4DLK7LRSB3TQMCBZN/bundle.json","state":"https://pith.science/pith/5IJCHXKPU4DLK7LRSB3TQMCBZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IJCHXKPU4DLK7LRSB3TQMCBZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5IJCHXKPU4DLK7LRSB3TQMCBZN","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":"64f21810286c3ab95c01e9e48d08eeb10e07ad936d40f365f0ba2ba2a3d96f6b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-12T07:31:28Z","title_canon_sha256":"52df9b559308ca46b0c9a953cf48a6fb404766c5346ec1fe8ad2fee0e7c67234"},"schema_version":"1.0","source":{"id":"1206.2448","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2448","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2448v2","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2448","created_at":"2026-05-18T03:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"5IJCHXKPU4DL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5IJCHXKPU4DLK7LR","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5IJCHXKP","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:a2eba7d8113bdd342069c7d3551b4352ecfdce445d69dff508723864a4443bf5","target":"graph","created_at":"2026-05-18T03:17:57Z","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":"In this paper we introduce a capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents. Motivated by the idea of self-managed networks, in the developed framework decision-making entities are associated with individual transmission links, deciding on the way they split capacity among concurrent flows. An efficient decentralized algorithm is given for computing strongly Pareto-optimal strategies, constituting a pure Nash equilibrium. Subsequently, we discuss the properties of the introduced game related to the Price","authors_text":"Dariusz G\\c{a}sior, Maciej Drwal","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-12T07:31:28Z","title":"Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2448","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:647ea3b8f0484bfe6bdd20c6ec6847720b5da04c6c69df047e1bf8b4e2fd556c","target":"record","created_at":"2026-05-18T03:17:57Z","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":"64f21810286c3ab95c01e9e48d08eeb10e07ad936d40f365f0ba2ba2a3d96f6b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-06-12T07:31:28Z","title_canon_sha256":"52df9b559308ca46b0c9a953cf48a6fb404766c5346ec1fe8ad2fee0e7c67234"},"schema_version":"1.0","source":{"id":"1206.2448","kind":"arxiv","version":2}},"canonical_sha256":"ea1223dd4fa706b57d719077383041cb6e2726fb471a5d371bc6ab10517b6655","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea1223dd4fa706b57d719077383041cb6e2726fb471a5d371bc6ab10517b6655","first_computed_at":"2026-05-18T03:17:57.360791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:57.360791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JRzzWdl+rN5X8d2yQB25YWux8zKcKUKItbFteE3NvW1vDO5T7KM1E9nGWj+tqi4W2npQY2Ve1mQkv5ZNC5JgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:57.361494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2448","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:647ea3b8f0484bfe6bdd20c6ec6847720b5da04c6c69df047e1bf8b4e2fd556c","sha256:a2eba7d8113bdd342069c7d3551b4352ecfdce445d69dff508723864a4443bf5"],"state_sha256":"b1019ce6d1b9bc18489139f2a69aec9a777fcc0f1908046b97fd6694d0f97b65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9V1h5+Eu41mqTEJM+evWqse/nCKfbIob62NErcTAKfnWpuYctc/httxVlAypYZn5lyi1UGNDuyG5qvze68PBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:19:39.561669Z","bundle_sha256":"b49293be6ba6a12d4a4a75c58e35dd249167f7887f5853dba77e1b14b9f42d70"}}