{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:34XEMJDHU6EJLZU6UZHKLFCZH3","short_pith_number":"pith:34XEMJDH","canonical_record":{"source":{"id":"1809.07637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-19T16:38:43Z","cross_cats_sorted":[],"title_canon_sha256":"daa44353c7d9dc4e0a104c08d595134fd229d0551a5573af3fe20d178b3db8bf","abstract_canon_sha256":"7590a326cff92fdb3d1027cab22c083c97a7fc82aa5ef6a76af043ebe7e0555a"},"schema_version":"1.0"},"canonical_sha256":"df2e462467a78895e69ea64ea594593ecfd560b06d36e12853d7a85e633b96a8","source":{"kind":"arxiv","id":"1809.07637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07637","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07637v1","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07637","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"34XEMJDHU6EJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"34XEMJDHU6EJLZU6","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"34XEMJDH","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:34XEMJDHU6EJLZU6UZHKLFCZH3","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-19T16:38:43Z","cross_cats_sorted":[],"title_canon_sha256":"daa44353c7d9dc4e0a104c08d595134fd229d0551a5573af3fe20d178b3db8bf","abstract_canon_sha256":"7590a326cff92fdb3d1027cab22c083c97a7fc82aa5ef6a76af043ebe7e0555a"},"schema_version":"1.0"},"canonical_sha256":"df2e462467a78895e69ea64ea594593ecfd560b06d36e12853d7a85e633b96a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:15.669499Z","signature_b64":"gH8nfyffTHAOJwtaOzdmQNAo9UJ37UmAauy621BoxNv+KHnfyobH1BUlBHuA6oOCk/luulZ+WzqBpevmn65fAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df2e462467a78895e69ea64ea594593ecfd560b06d36e12853d7a85e633b96a8","last_reissued_at":"2026-05-18T00:05:15.668797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:15.668797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07637","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-18T00:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aKRX3vPicpKPkq8zWCWLGq8BPCOQ6tN6mZlTtZf/B8Hq7piT4ck1OQK5z6EEyBLiWSQsI7Us5rKySb3ExzG2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:58:56.747720Z"},"content_sha256":"3d1d31c33a8659b68e97d06fb1a2bfd2993401a9806a86ce326005b2a9cab869","schema_version":"1.0","event_id":"sha256:3d1d31c33a8659b68e97d06fb1a2bfd2993401a9806a86ce326005b2a9cab869"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:34XEMJDHU6EJLZU6UZHKLFCZH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A game theoretic approach to a network allocation problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Barbara Franci, Fabio Fagnani","submitted_at":"2018-09-19T16:38:43Z","abstract_excerpt":"In this paper, we consider a network allocation problem motivated by peer-to-peer cloud storage models. The setting is that of a network of units (e.g. computers) that collaborate and offer each other space for the back up of the data of each unit. We formulate the problem as an optimization problem, we cast it into a game theoretic setting and we then propose a decentralized allocation algorithm based on the log-linear learning rule. Our main technical result is to prove the convergence of the algorithm to the optimal allocation. We also present some simulations that show the feasibility of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07637","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-18T00:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VGv+x3D/X92ug4bOoZGsDRBl2+nC4W2jnboc+k2nBSDSCs4Dhbbqmi6clz0+sGf0ZEfuiyE3xQI6wGclPuWXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:58:56.748067Z"},"content_sha256":"3a933d8cf2d9c78ec2772cd9e77f642e4f7f99b9aee8641765f2942f3c100f64","schema_version":"1.0","event_id":"sha256:3a933d8cf2d9c78ec2772cd9e77f642e4f7f99b9aee8641765f2942f3c100f64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34XEMJDHU6EJLZU6UZHKLFCZH3/bundle.json","state_url":"https://pith.science/pith/34XEMJDHU6EJLZU6UZHKLFCZH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34XEMJDHU6EJLZU6UZHKLFCZH3/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-02T20:58:56Z","links":{"resolver":"https://pith.science/pith/34XEMJDHU6EJLZU6UZHKLFCZH3","bundle":"https://pith.science/pith/34XEMJDHU6EJLZU6UZHKLFCZH3/bundle.json","state":"https://pith.science/pith/34XEMJDHU6EJLZU6UZHKLFCZH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34XEMJDHU6EJLZU6UZHKLFCZH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:34XEMJDHU6EJLZU6UZHKLFCZH3","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":"7590a326cff92fdb3d1027cab22c083c97a7fc82aa5ef6a76af043ebe7e0555a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-19T16:38:43Z","title_canon_sha256":"daa44353c7d9dc4e0a104c08d595134fd229d0551a5573af3fe20d178b3db8bf"},"schema_version":"1.0","source":{"id":"1809.07637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07637","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07637v1","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07637","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"34XEMJDHU6EJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"34XEMJDHU6EJLZU6","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"34XEMJDH","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:3a933d8cf2d9c78ec2772cd9e77f642e4f7f99b9aee8641765f2942f3c100f64","target":"graph","created_at":"2026-05-18T00:05:15Z","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 consider a network allocation problem motivated by peer-to-peer cloud storage models. The setting is that of a network of units (e.g. computers) that collaborate and offer each other space for the back up of the data of each unit. We formulate the problem as an optimization problem, we cast it into a game theoretic setting and we then propose a decentralized allocation algorithm based on the log-linear learning rule. Our main technical result is to prove the convergence of the algorithm to the optimal allocation. We also present some simulations that show the feasibility of o","authors_text":"Barbara Franci, Fabio Fagnani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-19T16:38:43Z","title":"A game theoretic approach to a network allocation problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07637","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:3d1d31c33a8659b68e97d06fb1a2bfd2993401a9806a86ce326005b2a9cab869","target":"record","created_at":"2026-05-18T00:05:15Z","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":"7590a326cff92fdb3d1027cab22c083c97a7fc82aa5ef6a76af043ebe7e0555a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-19T16:38:43Z","title_canon_sha256":"daa44353c7d9dc4e0a104c08d595134fd229d0551a5573af3fe20d178b3db8bf"},"schema_version":"1.0","source":{"id":"1809.07637","kind":"arxiv","version":1}},"canonical_sha256":"df2e462467a78895e69ea64ea594593ecfd560b06d36e12853d7a85e633b96a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df2e462467a78895e69ea64ea594593ecfd560b06d36e12853d7a85e633b96a8","first_computed_at":"2026-05-18T00:05:15.668797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:15.668797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gH8nfyffTHAOJwtaOzdmQNAo9UJ37UmAauy621BoxNv+KHnfyobH1BUlBHuA6oOCk/luulZ+WzqBpevmn65fAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:15.669499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d1d31c33a8659b68e97d06fb1a2bfd2993401a9806a86ce326005b2a9cab869","sha256:3a933d8cf2d9c78ec2772cd9e77f642e4f7f99b9aee8641765f2942f3c100f64"],"state_sha256":"99bc57db3296d5eb8cdd8668d1979de02d8a282595c2fba5a02418d006a67a47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uqyz6p3DMWbKkph0kMWlIESY+AWssgMMUcgJt1plp9jU7noOMSwvDp7kgrJVoc0/1afed8KIkKP2LHEkhiUzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:58:56.750005Z","bundle_sha256":"b425a925653650229ad160dd33ef433337300d2f80e155894834ea7e4f3a5817"}}