{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LM5X5OTCP7ERO2V34EPDZ6UKLA","short_pith_number":"pith:LM5X5OTC","canonical_record":{"source":{"id":"1604.01741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-06T19:29:17Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"7b47503cc6575466ee36266ccdb86fdc43dfd40e5fd484ca40aae66d6d59109d","abstract_canon_sha256":"b8289341d233c664c43be5c2a155df565db338b123ddacba74be002f005a984b"},"schema_version":"1.0"},"canonical_sha256":"5b3b7eba627fc9176abbe11e3cfa8a582c77f043f2f523ae96b72877fe3d7abe","source":{"kind":"arxiv","id":"1604.01741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01741","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01741v1","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01741","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"LM5X5OTCP7ER","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LM5X5OTCP7ERO2V3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LM5X5OTC","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LM5X5OTCP7ERO2V34EPDZ6UKLA","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-06T19:29:17Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"7b47503cc6575466ee36266ccdb86fdc43dfd40e5fd484ca40aae66d6d59109d","abstract_canon_sha256":"b8289341d233c664c43be5c2a155df565db338b123ddacba74be002f005a984b"},"schema_version":"1.0"},"canonical_sha256":"5b3b7eba627fc9176abbe11e3cfa8a582c77f043f2f523ae96b72877fe3d7abe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:35.649111Z","signature_b64":"xCTcVBLi/NSAGp9Zc1Y/Vq1+C80+IcooUg463RNVFYCY+jq/Mta5SVAoP6x6qePtejb1wrW2XiCGA5a/1s9tBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b3b7eba627fc9176abbe11e3cfa8a582c77f043f2f523ae96b72877fe3d7abe","last_reissued_at":"2026-05-18T01:17:35.648228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:35.648228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01741","source_version":1,"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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1vtggQy16V5BLwiDbch2TmLa1cRnMuPa+gjUflBg5JxpUPN0dOVLuclvuwPPNWO7cFTIONQad/baguZM4krBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:44:06.653805Z"},"content_sha256":"c9202a6bf928aa98ab13c8ad8594183c7e3d95fe8631190597e5abc2c8904da4","schema_version":"1.0","event_id":"sha256:c9202a6bf928aa98ab13c8ad8594183c7e3d95fe8631190597e5abc2c8904da4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LM5X5OTCP7ERO2V34EPDZ6UKLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cournot-Nash Equilibria for Bandwidth Allocation under Base-Station Cooperation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"A Vergne (Infres), J S Gomez (Infres, Laurent Decreusefond (LTCI), LTCI), P Martins (Infres), Wei Chen","submitted_at":"2016-04-06T19:29:17Z","abstract_excerpt":"-In this paper, a novel resource allocation scheme based on discrete Cournot-Nash equilibria and optimal transport theory is proposed. The originality of this framework lies in the joint optimization of downlink bandwidth allocation and cooperation between base stations. A tractable formalization is given in the form of a quadratic optimization problem. A low complexity approximate solution is derived and theoretically characterized. Simulations highlight the existence of an optimal working point, that maximizes user satisfaction ratio and network load. The impact of the network deployment on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01741","kind":"arxiv","version":1},"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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6bXHDRcV7FFBRiK9OWYlqAxKF1pkeP2VuF3B7a24BXLJKecypn/KnypmFn2Wyeoi5BJTGJvEkZLqcy/+NlX+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:44:06.654145Z"},"content_sha256":"e7894208424c688eaaea54ead5c60276e46fc7074c9f11f5c7ba1f665f899641","schema_version":"1.0","event_id":"sha256:e7894208424c688eaaea54ead5c60276e46fc7074c9f11f5c7ba1f665f899641"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LM5X5OTCP7ERO2V34EPDZ6UKLA/bundle.json","state_url":"https://pith.science/pith/LM5X5OTCP7ERO2V34EPDZ6UKLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LM5X5OTCP7ERO2V34EPDZ6UKLA/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-24T02:44:06Z","links":{"resolver":"https://pith.science/pith/LM5X5OTCP7ERO2V34EPDZ6UKLA","bundle":"https://pith.science/pith/LM5X5OTCP7ERO2V34EPDZ6UKLA/bundle.json","state":"https://pith.science/pith/LM5X5OTCP7ERO2V34EPDZ6UKLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LM5X5OTCP7ERO2V34EPDZ6UKLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LM5X5OTCP7ERO2V34EPDZ6UKLA","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":"b8289341d233c664c43be5c2a155df565db338b123ddacba74be002f005a984b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-06T19:29:17Z","title_canon_sha256":"7b47503cc6575466ee36266ccdb86fdc43dfd40e5fd484ca40aae66d6d59109d"},"schema_version":"1.0","source":{"id":"1604.01741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01741","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01741v1","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01741","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"LM5X5OTCP7ER","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LM5X5OTCP7ERO2V3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LM5X5OTC","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:e7894208424c688eaaea54ead5c60276e46fc7074c9f11f5c7ba1f665f899641","target":"graph","created_at":"2026-05-18T01:17:35Z","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, a novel resource allocation scheme based on discrete Cournot-Nash equilibria and optimal transport theory is proposed. The originality of this framework lies in the joint optimization of downlink bandwidth allocation and cooperation between base stations. A tractable formalization is given in the form of a quadratic optimization problem. A low complexity approximate solution is derived and theoretically characterized. Simulations highlight the existence of an optimal working point, that maximizes user satisfaction ratio and network load. The impact of the network deployment on ","authors_text":"A Vergne (Infres), J S Gomez (Infres, Laurent Decreusefond (LTCI), LTCI), P Martins (Infres), Wei Chen","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-06T19:29:17Z","title":"Cournot-Nash Equilibria for Bandwidth Allocation under Base-Station Cooperation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01741","kind":"arxiv","version":1},"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:c9202a6bf928aa98ab13c8ad8594183c7e3d95fe8631190597e5abc2c8904da4","target":"record","created_at":"2026-05-18T01:17:35Z","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":"b8289341d233c664c43be5c2a155df565db338b123ddacba74be002f005a984b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-06T19:29:17Z","title_canon_sha256":"7b47503cc6575466ee36266ccdb86fdc43dfd40e5fd484ca40aae66d6d59109d"},"schema_version":"1.0","source":{"id":"1604.01741","kind":"arxiv","version":1}},"canonical_sha256":"5b3b7eba627fc9176abbe11e3cfa8a582c77f043f2f523ae96b72877fe3d7abe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b3b7eba627fc9176abbe11e3cfa8a582c77f043f2f523ae96b72877fe3d7abe","first_computed_at":"2026-05-18T01:17:35.648228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:35.648228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xCTcVBLi/NSAGp9Zc1Y/Vq1+C80+IcooUg463RNVFYCY+jq/Mta5SVAoP6x6qePtejb1wrW2XiCGA5a/1s9tBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:35.649111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9202a6bf928aa98ab13c8ad8594183c7e3d95fe8631190597e5abc2c8904da4","sha256:e7894208424c688eaaea54ead5c60276e46fc7074c9f11f5c7ba1f665f899641"],"state_sha256":"ce312946aeb52493cf77dcbac5fcffad6af23883cd0318704f8ddcc7523a5b0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lXMjfPkV4oHup9tv0Kp1B7AU6KqFcZcURNpes8SDMtCxnxkTIQCKWCn9sMCB6Ml3Jnl+tgMwIpr6nkA9VirAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:44:06.656069Z","bundle_sha256":"d5d73c3ec4cf1284f7c5e7f6f2d0d2d759f2a4e97517b63418667f1f5dbaf74c"}}