{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L7FPOPBV7HKR3WQGAQMYIDSFZ6","short_pith_number":"pith:L7FPOPBV","schema_version":"1.0","canonical_sha256":"5fcaf73c35f9d51dda060419840e45cf92dc34d941ee7d88e3dea3bdb7476327","source":{"kind":"arxiv","id":"1310.3695","version":2},"attestation_state":"computed","paper":{"title":"Lowest Density MDS Array Codes for Reliable Smart Meter Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Filippo Tosato, Magnus Sandell","submitted_at":"2013-10-14T14:33:17Z","abstract_excerpt":"In this paper we introduce a lowest density MDS array code which is applied to a Smart Meter network to introduce reliability. By treating the network as distributed storage with multiple sources, information can be exchanged between the nodes in the network allowing each node to store parity symbols relating to data from other nodes. A lowest density MDS array code is then applied to make the network robust against outages, ensuring low overhead and data transfers. We show the minimum amount of overhead required to be able to recover from r node erasures in an n node network and explicitly de"},"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":"1310.3695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-14T14:33:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b1b7c57f4600ad15cf6be094252801a99f1d9582b4e4684f7bfebce905003a0e","abstract_canon_sha256":"0d5b8b837f805ff91ee239829667ec6bd9504c16924732ffd8ed6a5ce107bc44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:54.154521Z","signature_b64":"0WtOWyCTLXhNZDWKOVQKDcgcX+I5qd4yxV/322UiMu1VWPg/QlypLtcBoEBgJ0b6UqC0E8XxanCfRDjIMTKkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fcaf73c35f9d51dda060419840e45cf92dc34d941ee7d88e3dea3bdb7476327","last_reissued_at":"2026-05-18T03:07:54.153839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:54.153839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lowest Density MDS Array Codes for Reliable Smart Meter Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Filippo Tosato, Magnus Sandell","submitted_at":"2013-10-14T14:33:17Z","abstract_excerpt":"In this paper we introduce a lowest density MDS array code which is applied to a Smart Meter network to introduce reliability. By treating the network as distributed storage with multiple sources, information can be exchanged between the nodes in the network allowing each node to store parity symbols relating to data from other nodes. A lowest density MDS array code is then applied to make the network robust against outages, ensuring low overhead and data transfers. We show the minimum amount of overhead required to be able to recover from r node erasures in an n node network and explicitly de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3695","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":"1310.3695","created_at":"2026-05-18T03:07:54.153956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3695v2","created_at":"2026-05-18T03:07:54.153956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3695","created_at":"2026-05-18T03:07:54.153956+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7FPOPBV7HKR","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7FPOPBV7HKR3WQG","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7FPOPBV","created_at":"2026-05-18T12:27:51.066281+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/L7FPOPBV7HKR3WQGAQMYIDSFZ6","json":"https://pith.science/pith/L7FPOPBV7HKR3WQGAQMYIDSFZ6.json","graph_json":"https://pith.science/api/pith-number/L7FPOPBV7HKR3WQGAQMYIDSFZ6/graph.json","events_json":"https://pith.science/api/pith-number/L7FPOPBV7HKR3WQGAQMYIDSFZ6/events.json","paper":"https://pith.science/paper/L7FPOPBV"},"agent_actions":{"view_html":"https://pith.science/pith/L7FPOPBV7HKR3WQGAQMYIDSFZ6","download_json":"https://pith.science/pith/L7FPOPBV7HKR3WQGAQMYIDSFZ6.json","view_paper":"https://pith.science/paper/L7FPOPBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3695&json=true","fetch_graph":"https://pith.science/api/pith-number/L7FPOPBV7HKR3WQGAQMYIDSFZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/L7FPOPBV7HKR3WQGAQMYIDSFZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7FPOPBV7HKR3WQGAQMYIDSFZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7FPOPBV7HKR3WQGAQMYIDSFZ6/action/storage_attestation","attest_author":"https://pith.science/pith/L7FPOPBV7HKR3WQGAQMYIDSFZ6/action/author_attestation","sign_citation":"https://pith.science/pith/L7FPOPBV7HKR3WQGAQMYIDSFZ6/action/citation_signature","submit_replication":"https://pith.science/pith/L7FPOPBV7HKR3WQGAQMYIDSFZ6/action/replication_record"}},"created_at":"2026-05-18T03:07:54.153956+00:00","updated_at":"2026-05-18T03:07:54.153956+00:00"}