{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UVEHTM4ELKDJFSPQQBMNSBE7RK","short_pith_number":"pith:UVEHTM4E","schema_version":"1.0","canonical_sha256":"a54879b3845a8692c9f08058d9049f8a9f447743a95459106d221ddea17e3657","source":{"kind":"arxiv","id":"1012.5834","version":5},"attestation_state":"computed","paper":{"title":"Maximum Lifetime for Data Regeneration in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Rong Zheng, Soji Omiwade","submitted_at":"2010-12-28T20:36:09Z","abstract_excerpt":"Robust distributed storage systems dedicated to wireless sensor networks utilize several nodes to redundantly store sensed data so that when some storage nodes fail, the sensed data can still be reconstructed. For the same level of redundancy, erasure coding based approaches are known to require less data storage space than replication methods.\n  To maintain the same level of redundancy when one storage node fails, erasure coded data can be restored onto some other storage node by having this node download respective pieces from other live storage nodes. Previous works showed that the benefits"},"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":"1012.5834","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-12-28T20:36:09Z","cross_cats_sorted":[],"title_canon_sha256":"78fccd9caf78ea4aceb69d45c108cfe20f65d077c852e2b1c309e46e956457de","abstract_canon_sha256":"fbe14966022ee6a42a755f3ff96d1dfd5afd5d7ecf6fa5b79b53f169d7e19074"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:03.728721Z","signature_b64":"QZYUD1b6mt/zXUKxQY4JuRzJbMzcI/HZFA/X/1D5uSN0AFpChbzLbPV6q2VAwLBsCFPHawj74+Gy79ju9mOZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a54879b3845a8692c9f08058d9049f8a9f447743a95459106d221ddea17e3657","last_reissued_at":"2026-05-18T04:20:03.728253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:03.728253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Lifetime for Data Regeneration in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Rong Zheng, Soji Omiwade","submitted_at":"2010-12-28T20:36:09Z","abstract_excerpt":"Robust distributed storage systems dedicated to wireless sensor networks utilize several nodes to redundantly store sensed data so that when some storage nodes fail, the sensed data can still be reconstructed. For the same level of redundancy, erasure coding based approaches are known to require less data storage space than replication methods.\n  To maintain the same level of redundancy when one storage node fails, erasure coded data can be restored onto some other storage node by having this node download respective pieces from other live storage nodes. Previous works showed that the benefits"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5834","kind":"arxiv","version":5},"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":"1012.5834","created_at":"2026-05-18T04:20:03.728324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5834v5","created_at":"2026-05-18T04:20:03.728324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5834","created_at":"2026-05-18T04:20:03.728324+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVEHTM4ELKDJ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVEHTM4ELKDJFSPQ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVEHTM4E","created_at":"2026-05-18T12:26:15.391820+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/UVEHTM4ELKDJFSPQQBMNSBE7RK","json":"https://pith.science/pith/UVEHTM4ELKDJFSPQQBMNSBE7RK.json","graph_json":"https://pith.science/api/pith-number/UVEHTM4ELKDJFSPQQBMNSBE7RK/graph.json","events_json":"https://pith.science/api/pith-number/UVEHTM4ELKDJFSPQQBMNSBE7RK/events.json","paper":"https://pith.science/paper/UVEHTM4E"},"agent_actions":{"view_html":"https://pith.science/pith/UVEHTM4ELKDJFSPQQBMNSBE7RK","download_json":"https://pith.science/pith/UVEHTM4ELKDJFSPQQBMNSBE7RK.json","view_paper":"https://pith.science/paper/UVEHTM4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5834&json=true","fetch_graph":"https://pith.science/api/pith-number/UVEHTM4ELKDJFSPQQBMNSBE7RK/graph.json","fetch_events":"https://pith.science/api/pith-number/UVEHTM4ELKDJFSPQQBMNSBE7RK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVEHTM4ELKDJFSPQQBMNSBE7RK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVEHTM4ELKDJFSPQQBMNSBE7RK/action/storage_attestation","attest_author":"https://pith.science/pith/UVEHTM4ELKDJFSPQQBMNSBE7RK/action/author_attestation","sign_citation":"https://pith.science/pith/UVEHTM4ELKDJFSPQQBMNSBE7RK/action/citation_signature","submit_replication":"https://pith.science/pith/UVEHTM4ELKDJFSPQQBMNSBE7RK/action/replication_record"}},"created_at":"2026-05-18T04:20:03.728324+00:00","updated_at":"2026-05-18T04:20:03.728324+00:00"}