{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WC757F3Q3CAFKTSNNTVDMEDLUY","short_pith_number":"pith:WC757F3Q","schema_version":"1.0","canonical_sha256":"b0bfdf9770d880554e4d6cea36106ba600dfe177de741d7494d06bfcd74bc077","source":{"kind":"arxiv","id":"1207.5542","version":1},"attestation_state":"computed","paper":{"title":"LT Codes For Efficient and Reliable Distributed Storage Systems Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yongge Wang","submitted_at":"2012-07-23T21:30:49Z","abstract_excerpt":"LT codes and digital fountain techniques have received significant attention from both academics and industry in the past few years. There have also been extensive interests in applying LT code techniques to distributed storage systems such as cloud data storage in recent years. However, Plank and Thomason's experimental results show that LDPC code performs well only asymptotically when the number of data fragments increases and it has the worst performance for small number of data fragments (e.g., less than 100). In their INFOCOM 2012 paper, Cao, Yu, Yang, Lou, and Hou proposed to use exhaust"},"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":"1207.5542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-23T21:30:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4391395f071b22f46e75dca30a644e04d81f8a05944edce849e617efdeefe53e","abstract_canon_sha256":"26be9a50444b33da871c68650b519751539d5703528cff295d4b354e78d59102"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:22.628220Z","signature_b64":"RBmfoPXGcnnJXU4CAnJ5bd7GKEsi5+vEZzITCloL+vpgkgeWJ4tR0bGAzZimdNHcylmEM7/3pYbM7FDYP9TgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0bfdf9770d880554e4d6cea36106ba600dfe177de741d7494d06bfcd74bc077","last_reissued_at":"2026-05-18T03:50:22.627566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:22.627566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LT Codes For Efficient and Reliable Distributed Storage Systems Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yongge Wang","submitted_at":"2012-07-23T21:30:49Z","abstract_excerpt":"LT codes and digital fountain techniques have received significant attention from both academics and industry in the past few years. There have also been extensive interests in applying LT code techniques to distributed storage systems such as cloud data storage in recent years. However, Plank and Thomason's experimental results show that LDPC code performs well only asymptotically when the number of data fragments increases and it has the worst performance for small number of data fragments (e.g., less than 100). In their INFOCOM 2012 paper, Cao, Yu, Yang, Lou, and Hou proposed to use exhaust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5542","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.5542","created_at":"2026-05-18T03:50:22.627645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5542v1","created_at":"2026-05-18T03:50:22.627645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5542","created_at":"2026-05-18T03:50:22.627645+00:00"},{"alias_kind":"pith_short_12","alias_value":"WC757F3Q3CAF","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WC757F3Q3CAFKTSN","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WC757F3Q","created_at":"2026-05-18T12:27:25.539911+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/WC757F3Q3CAFKTSNNTVDMEDLUY","json":"https://pith.science/pith/WC757F3Q3CAFKTSNNTVDMEDLUY.json","graph_json":"https://pith.science/api/pith-number/WC757F3Q3CAFKTSNNTVDMEDLUY/graph.json","events_json":"https://pith.science/api/pith-number/WC757F3Q3CAFKTSNNTVDMEDLUY/events.json","paper":"https://pith.science/paper/WC757F3Q"},"agent_actions":{"view_html":"https://pith.science/pith/WC757F3Q3CAFKTSNNTVDMEDLUY","download_json":"https://pith.science/pith/WC757F3Q3CAFKTSNNTVDMEDLUY.json","view_paper":"https://pith.science/paper/WC757F3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5542&json=true","fetch_graph":"https://pith.science/api/pith-number/WC757F3Q3CAFKTSNNTVDMEDLUY/graph.json","fetch_events":"https://pith.science/api/pith-number/WC757F3Q3CAFKTSNNTVDMEDLUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WC757F3Q3CAFKTSNNTVDMEDLUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WC757F3Q3CAFKTSNNTVDMEDLUY/action/storage_attestation","attest_author":"https://pith.science/pith/WC757F3Q3CAFKTSNNTVDMEDLUY/action/author_attestation","sign_citation":"https://pith.science/pith/WC757F3Q3CAFKTSNNTVDMEDLUY/action/citation_signature","submit_replication":"https://pith.science/pith/WC757F3Q3CAFKTSNNTVDMEDLUY/action/replication_record"}},"created_at":"2026-05-18T03:50:22.627645+00:00","updated_at":"2026-05-18T03:50:22.627645+00:00"}