{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZSRD24WGTZTT4QUXFRQB5HBLH2","short_pith_number":"pith:ZSRD24WG","schema_version":"1.0","canonical_sha256":"cca23d72c69e673e42972c601e9c2b3eb0a0fbb9916abcdd890c12b1f0f78257","source":{"kind":"arxiv","id":"1504.06231","version":2},"attestation_state":"computed","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 ("},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.06231","created_at":"2026-05-18T01:23:29.337075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06231v2","created_at":"2026-05-18T01:23:29.337075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06231","created_at":"2026-05-18T01:23:29.337075+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSRD24WGTZTT","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSRD24WGTZTT4QUX","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSRD24WG","created_at":"2026-05-18T12:29:52.810259+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/ZSRD24WGTZTT4QUXFRQB5HBLH2","json":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2.json","graph_json":"https://pith.science/api/pith-number/ZSRD24WGTZTT4QUXFRQB5HBLH2/graph.json","events_json":"https://pith.science/api/pith-number/ZSRD24WGTZTT4QUXFRQB5HBLH2/events.json","paper":"https://pith.science/paper/ZSRD24WG"},"agent_actions":{"view_html":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2","download_json":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2.json","view_paper":"https://pith.science/paper/ZSRD24WG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06231&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSRD24WGTZTT4QUXFRQB5HBLH2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSRD24WGTZTT4QUXFRQB5HBLH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/action/storage_attestation","attest_author":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/action/author_attestation","sign_citation":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/action/citation_signature","submit_replication":"https://pith.science/pith/ZSRD24WGTZTT4QUXFRQB5HBLH2/action/replication_record"}},"created_at":"2026-05-18T01:23:29.337075+00:00","updated_at":"2026-05-18T01:23:29.337075+00:00"}