{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZSRD24WGTZTT4QUXFRQB5HBLH2","short_pith_number":"pith:ZSRD24WG","canonical_record":{"source":{"id":"1504.06231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T15:54:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4d1ac185c850dad70e4450914533971e17678e3e7e09c739f11bb9e7ade06f98","abstract_canon_sha256":"13f82a046dc001f7658d8156ab998d3cdd9b82fd2f6c0cb1e840be3c5c8111f1"},"schema_version":"1.0"},"canonical_sha256":"cca23d72c69e673e42972c601e9c2b3eb0a0fbb9916abcdd890c12b1f0f78257","source":{"kind":"arxiv","id":"1504.06231","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06231","created_at":"2026-05-18T01:23:29Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06231v2","created_at":"2026-05-18T01:23:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06231","created_at":"2026-05-18T01:23:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZSRD24WGTZTT","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZSRD24WGTZTT4QUX","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZSRD24WG","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZSRD24WGTZTT4QUXFRQB5HBLH2","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T15:54:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4d1ac185c850dad70e4450914533971e17678e3e7e09c739f11bb9e7ade06f98","abstract_canon_sha256":"13f82a046dc001f7658d8156ab998d3cdd9b82fd2f6c0cb1e840be3c5c8111f1"},"schema_version":"1.0"},"canonical_sha256":"cca23d72c69e673e42972c601e9c2b3eb0a0fbb9916abcdd890c12b1f0f78257","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:29.337678Z","signature_b64":"mDJXbyNXpO1+22D6GBj4NC2HIilog+I5KFN8QlMV2YBFOF9JH7bxmSlLR/EC6JhR8UqAG4r2oUzefvFrdk2fCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cca23d72c69e673e42972c601e9c2b3eb0a0fbb9916abcdd890c12b1f0f78257","last_reissued_at":"2026-05-18T01:23:29.336959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:29.336959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06231","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-18T01:23:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8X8+kqCdHH0lXcqlVk/e09WqVc0Gj2lcf8W65wA3B/upbiBF29dY/2hmyACK1IapvSfIKBQ22nVPkhx8xGlbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:46:03.091956Z"},"content_sha256":"b3418e30efb9605d3bb1ef01150f274728899f7f853add6039352987d7849c98","schema_version":"1.0","event_id":"sha256:b3418e30efb9605d3bb1ef01150f274728899f7f853add6039352987d7849c98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZSRD24WGTZTT4QUXFRQB5HBLH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repair Scheduling in Wireless Distributed Storage with D2D Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Fredrik Br\\\"annstr\\\"om, Iryna Andriyanova, Jesper Pedersen","submitted_at":"2015-04-23T15:54:13Z","abstract_excerpt":"We consider distributed storage (DS) for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code. When requesting a piece of content, a user retrieves the content from the mobile devices using device-to-device communication or, if not possible, from the base station (BS), at the expense of a higher communication cost. We consider the repair problem when a device that stores data leaves the network. In particular, we introduce a repair scheduling where repair is performed ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06231","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-18T01:23:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2ilMM+DlgA+Kw1fKUsiIe5mpA7TcQqOzn2eg0jqUXcYkErqx0naBae9ZKtnPcO+PVHJDWM6d4rvH+MaO1YRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:46:03.092363Z"},"content_sha256":"bfbb73afaa97c9adad560048d03dd94ce2de88fafac9308f48b8c54974b427b4","schema_version":"1.0","event_id":"sha256:bfbb73afaa97c9adad560048d03dd94ce2de88fafac9308f48b8c54974b427b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/bundle.json","state_url":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/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-05-30T11:46:03Z","links":{"resolver":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2","bundle":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/bundle.json","state":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZSRD24WGTZTT4QUXFRQB5HBLH2","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":"13f82a046dc001f7658d8156ab998d3cdd9b82fd2f6c0cb1e840be3c5c8111f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T15:54:13Z","title_canon_sha256":"4d1ac185c850dad70e4450914533971e17678e3e7e09c739f11bb9e7ade06f98"},"schema_version":"1.0","source":{"id":"1504.06231","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06231","created_at":"2026-05-18T01:23:29Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06231v2","created_at":"2026-05-18T01:23:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06231","created_at":"2026-05-18T01:23:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZSRD24WGTZTT","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZSRD24WGTZTT4QUX","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZSRD24WG","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:bfbb73afaa97c9adad560048d03dd94ce2de88fafac9308f48b8c54974b427b4","target":"graph","created_at":"2026-05-18T01:23:29Z","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":"We consider distributed storage (DS) for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code. When requesting a piece of content, a user retrieves the content from the mobile devices using device-to-device communication or, if not possible, from the base station (BS), at the expense of a higher communication cost. We consider the repair problem when a device that stores data leaves the network. In particular, we introduce a repair scheduling where repair is performed (","authors_text":"Alexandre Graell i Amat, Fredrik Br\\\"annstr\\\"om, Iryna Andriyanova, Jesper Pedersen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T15:54:13Z","title":"Repair Scheduling in Wireless Distributed Storage with D2D Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06231","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:b3418e30efb9605d3bb1ef01150f274728899f7f853add6039352987d7849c98","target":"record","created_at":"2026-05-18T01:23:29Z","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":"13f82a046dc001f7658d8156ab998d3cdd9b82fd2f6c0cb1e840be3c5c8111f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-23T15:54:13Z","title_canon_sha256":"4d1ac185c850dad70e4450914533971e17678e3e7e09c739f11bb9e7ade06f98"},"schema_version":"1.0","source":{"id":"1504.06231","kind":"arxiv","version":2}},"canonical_sha256":"cca23d72c69e673e42972c601e9c2b3eb0a0fbb9916abcdd890c12b1f0f78257","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cca23d72c69e673e42972c601e9c2b3eb0a0fbb9916abcdd890c12b1f0f78257","first_computed_at":"2026-05-18T01:23:29.336959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:29.336959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mDJXbyNXpO1+22D6GBj4NC2HIilog+I5KFN8QlMV2YBFOF9JH7bxmSlLR/EC6JhR8UqAG4r2oUzefvFrdk2fCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:29.337678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06231","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3418e30efb9605d3bb1ef01150f274728899f7f853add6039352987d7849c98","sha256:bfbb73afaa97c9adad560048d03dd94ce2de88fafac9308f48b8c54974b427b4"],"state_sha256":"616cb8e5d1e9dd1bcda54979a2a0a7e3de951a866de4c0fc6192f2ef83ff6b57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VUuyeYD6HB6bMMcCMRvztUvQ/TKa/ai4req72pRmZGjeApoEsMvIJMfXHpnYG4Wr2X6rttca4ziybXjhhStgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:46:03.095534Z","bundle_sha256":"9300ae2d5238a94a8f15b2092bc23f0d859577942490d8921c267a0406d57c81"}}