{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:E54T7S3SLCFBHIIEBX4NYCMGJG","short_pith_number":"pith:E54T7S3S","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"},"canonical_sha256":"27793fcb72588a13a1040df8dc098649a1df3f8640b52dcd0b2cd6265f5b7403","source":{"kind":"arxiv","id":"1701.05842","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05842","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05842v1","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05842","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"E54T7S3SLCFB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E54T7S3SLCFBHIIE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E54T7S3S","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:E54T7S3SLCFBHIIEBX4NYCMGJG","target":"record","payload":{"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"},"canonical_sha256":"27793fcb72588a13a1040df8dc098649a1df3f8640b52dcd0b2cd6265f5b7403","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"},"source_kind":"arxiv","source_id":"1701.05842","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:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QoUAmacQsQLrxiJCDx4xtYwberCAf+2gljJUEcHksCrfi5IpPiWRTmIsP8UGHUizTkQDgwdUvWyajDio5jL9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:44:11.845649Z"},"content_sha256":"a95b751d6d1e7448e364318f462db4d510029ff5dd9e9c225e2456f2c0701634","schema_version":"1.0","event_id":"sha256:a95b751d6d1e7448e364318f462db4d510029ff5dd9e9c225e2456f2c0701634"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:E54T7S3SLCFBHIIEBX4NYCMGJG","target":"graph","payload":{"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"},"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:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwMKlLWTMfY5bMzczddeN3SfCLO3wlR86WMecbbZE2AKJ+7HhVzILosF+/9jeuNSu9YLgn9byxXP9at0+m2pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:44:11.845983Z"},"content_sha256":"54471ae81c9bf9e43594e7eb1ac0f3f14e7a7dc05443af25ca136aa44a8d951c","schema_version":"1.0","event_id":"sha256:54471ae81c9bf9e43594e7eb1ac0f3f14e7a7dc05443af25ca136aa44a8d951c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/bundle.json","state_url":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/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-03T02:44:11Z","links":{"resolver":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG","bundle":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/bundle.json","state":"https://pith.science/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E54T7S3SLCFBHIIEBX4NYCMGJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E54T7S3SLCFBHIIEBX4NYCMGJG","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":"b5968d285ef24ca9176c7a5ae0d4066e7e5344749e04e7dad9de524d33566615","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-20T16:12:01Z","title_canon_sha256":"a7cf7c3a4066709d89f935b63ea150159344f5de74694ce84cbc1eeec56dc3a3"},"schema_version":"1.0","source":{"id":"1701.05842","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05842","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05842v1","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05842","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"E54T7S3SLCFB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E54T7S3SLCFBHIIE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E54T7S3S","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:54471ae81c9bf9e43594e7eb1ac0f3f14e7a7dc05443af25ca136aa44a8d951c","target":"graph","created_at":"2026-05-18T00:52:24Z","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":"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","authors_text":"Barbara Franci, Fabio Fagnani","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-20T16:12:01Z","title":"A game theoretic approach to a network cloud storage problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05842","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:a95b751d6d1e7448e364318f462db4d510029ff5dd9e9c225e2456f2c0701634","target":"record","created_at":"2026-05-18T00:52:24Z","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":"b5968d285ef24ca9176c7a5ae0d4066e7e5344749e04e7dad9de524d33566615","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-20T16:12:01Z","title_canon_sha256":"a7cf7c3a4066709d89f935b63ea150159344f5de74694ce84cbc1eeec56dc3a3"},"schema_version":"1.0","source":{"id":"1701.05842","kind":"arxiv","version":1}},"canonical_sha256":"27793fcb72588a13a1040df8dc098649a1df3f8640b52dcd0b2cd6265f5b7403","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27793fcb72588a13a1040df8dc098649a1df3f8640b52dcd0b2cd6265f5b7403","first_computed_at":"2026-05-18T00:52:24.572180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:24.572180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TgJ0/WjUqewNXWkjDPMf4YDd4fOzGop5rWVGA5d9dhJWkZOWV0d7iFtRoHIEM1Ai/HzXZNRsQh01HFaK2S14Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:24.572843Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05842","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a95b751d6d1e7448e364318f462db4d510029ff5dd9e9c225e2456f2c0701634","sha256:54471ae81c9bf9e43594e7eb1ac0f3f14e7a7dc05443af25ca136aa44a8d951c"],"state_sha256":"f3acc8ca369da13f0bb8654ecc083b144233e41092e4775f7a5a489e8848a868"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"re84uHX+coRVs/+nrvc+QsngZd3sbpg0LtVLqHHBJ1q322vvhOx2DB/jvAS4XJrOk8R25T4nOl8paShhXNhJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:44:11.847865Z","bundle_sha256":"bfd2c59b65f359f604160eac1178a2a0b071016dc8f1b22987bfd6637b2ea81a"}}