{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E54T7S3SLCFBHIIEBX4NYCMGJG","short_pith_number":"pith:E54T7S3S","schema_version":"1.0","canonical_sha256":"27793fcb72588a13a1040df8dc098649a1df3f8640b52dcd0b2cd6265f5b7403","source":{"kind":"arxiv","id":"1701.05842","version":1},"attestation_state":"computed","paper":{"title":"A game theoretic approach to a network cloud storage problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Barbara Franci, Fabio Fagnani","submitted_at":"2017-01-20T16:12:01Z","abstract_excerpt":"The use of game theory in the design and control of large scale networked systems is becoming increasingly more important. In this paper, we follow this approach to efficiently solve a network allocation problem motivated by peer-to- peer cloud storage models as alternatives to classical centralized cloud storage services. To this aim, we propose an allocation algorithm that allows the units to use their neighbors to store a back up of their data. We prove convergence, characterize the final allocation, and corroborate our analysis with extensive numerical simulation that shows the good perfor"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.05842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-20T16:12:01Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"a7cf7c3a4066709d89f935b63ea150159344f5de74694ce84cbc1eeec56dc3a3","abstract_canon_sha256":"b5968d285ef24ca9176c7a5ae0d4066e7e5344749e04e7dad9de524d33566615"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:24.572843Z","signature_b64":"TgJ0/WjUqewNXWkjDPMf4YDd4fOzGop5rWVGA5d9dhJWkZOWV0d7iFtRoHIEM1Ai/HzXZNRsQh01HFaK2S14Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27793fcb72588a13a1040df8dc098649a1df3f8640b52dcd0b2cd6265f5b7403","last_reissued_at":"2026-05-18T00:52:24.572180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:24.572180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A game theoretic approach to a network cloud storage problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Barbara Franci, Fabio Fagnani","submitted_at":"2017-01-20T16:12:01Z","abstract_excerpt":"The use of game theory in the design and control of large scale networked systems is becoming increasingly more important. In this paper, we follow this approach to efficiently solve a network allocation problem motivated by peer-to- peer cloud storage models as alternatives to classical centralized cloud storage services. To this aim, we propose an allocation algorithm that allows the units to use their neighbors to store a back up of their data. We prove convergence, characterize the final allocation, and corroborate our analysis with extensive numerical simulation that shows the good perfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05842","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.05842","created_at":"2026-05-18T00:52:24.572266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05842v1","created_at":"2026-05-18T00:52:24.572266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05842","created_at":"2026-05-18T00:52:24.572266+00:00"},{"alias_kind":"pith_short_12","alias_value":"E54T7S3SLCFB","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E54T7S3SLCFBHIIE","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E54T7S3S","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG","json":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG.json","graph_json":"https://pith.science/api/pith-number/E54T7S3SLCFBHIIEBX4NYCMGJG/graph.json","events_json":"https://pith.science/api/pith-number/E54T7S3SLCFBHIIEBX4NYCMGJG/events.json","paper":"https://pith.science/paper/E54T7S3S"},"agent_actions":{"view_html":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG","download_json":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG.json","view_paper":"https://pith.science/paper/E54T7S3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05842&json=true","fetch_graph":"https://pith.science/api/pith-number/E54T7S3SLCFBHIIEBX4NYCMGJG/graph.json","fetch_events":"https://pith.science/api/pith-number/E54T7S3SLCFBHIIEBX4NYCMGJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/action/storage_attestation","attest_author":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/action/author_attestation","sign_citation":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/action/citation_signature","submit_replication":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/action/replication_record"}},"created_at":"2026-05-18T00:52:24.572266+00:00","updated_at":"2026-05-18T00:52:24.572266+00:00"}