{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HLLJTLST4YX3Q3JZT3TPDUZX6D","short_pith_number":"pith:HLLJTLST","schema_version":"1.0","canonical_sha256":"3ad699ae53e62fb86d399ee6f1d337f0dac57668b0dbe0cdf00a74cbe2da771e","source":{"kind":"arxiv","id":"2602.10020","version":2},"attestation_state":"computed","paper":{"title":"METTLE: Efficient Streaming Erasure Code with Peeling Decodability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingfan Meng, Jun Xu (Jim), Qianru Yu, Tianji Yang","submitted_at":"2026-02-10T17:42:02Z","abstract_excerpt":"In this work, we solve a long-standing open problem in coding theory with broad applications in networking and systems: designing an erasure code that simultaneously satisfies three requirements: (1) high coding efficiency, (2) low coding complexity, and (3) being a streaming code (defined as one with low decoding latency). We propose METTLE (Multi-Edge Type with Touch-less Leading Edge), the first erasure code to meet all three requirements. Compared to \"streaming RaptorQ\" (RaptorQ configured with a small source block size to ensure a low decoding latency), METTLE is only slightly worse in co"},"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":"2602.10020","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-02-10T17:42:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6b030290262267bc474498cb50ef1849fc906c9669cc8a9611dba372c0671144","abstract_canon_sha256":"592e1e1d2cd85c1f15accdc6dbbf26997cdd0f929551dccdab5d334c1cc4adc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T00:19:55.683881Z","signature_b64":"wCP8LvHEd4Fg/fWn1oZlCYIjK9GZnqBc8jucSJ+Y6ZdZNRg2CgwIGhvyvelUki/CI0P0QOwb5/TGGp4kKW1nAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ad699ae53e62fb86d399ee6f1d337f0dac57668b0dbe0cdf00a74cbe2da771e","last_reissued_at":"2026-07-21T00:19:55.682907Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T00:19:55.682907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"METTLE: Efficient Streaming Erasure Code with Peeling Decodability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingfan Meng, Jun Xu (Jim), Qianru Yu, Tianji Yang","submitted_at":"2026-02-10T17:42:02Z","abstract_excerpt":"In this work, we solve a long-standing open problem in coding theory with broad applications in networking and systems: designing an erasure code that simultaneously satisfies three requirements: (1) high coding efficiency, (2) low coding complexity, and (3) being a streaming code (defined as one with low decoding latency). We propose METTLE (Multi-Edge Type with Touch-less Leading Edge), the first erasure code to meet all three requirements. Compared to \"streaming RaptorQ\" (RaptorQ configured with a small source block size to ensure a low decoding latency), METTLE is only slightly worse in co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.10020","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.10020/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2602.10020","created_at":"2026-07-21T00:19:55.683372+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.10020v2","created_at":"2026-07-21T00:19:55.683372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10020","created_at":"2026-07-21T00:19:55.683372+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLLJTLST4YX3","created_at":"2026-07-21T00:19:55.683372+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLLJTLST4YX3Q3JZ","created_at":"2026-07-21T00:19:55.683372+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLLJTLST","created_at":"2026-07-21T00:19:55.683372+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/HLLJTLST4YX3Q3JZT3TPDUZX6D","json":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D.json","graph_json":"https://pith.science/api/pith-number/HLLJTLST4YX3Q3JZT3TPDUZX6D/graph.json","events_json":"https://pith.science/api/pith-number/HLLJTLST4YX3Q3JZT3TPDUZX6D/events.json","paper":"https://pith.science/paper/HLLJTLST"},"agent_actions":{"view_html":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D","download_json":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D.json","view_paper":"https://pith.science/paper/HLLJTLST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.10020&json=true","fetch_graph":"https://pith.science/api/pith-number/HLLJTLST4YX3Q3JZT3TPDUZX6D/graph.json","fetch_events":"https://pith.science/api/pith-number/HLLJTLST4YX3Q3JZT3TPDUZX6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/action/storage_attestation","attest_author":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/action/author_attestation","sign_citation":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/action/citation_signature","submit_replication":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/action/replication_record"}},"created_at":"2026-07-21T00:19:55.683372+00:00","updated_at":"2026-07-21T00:19:55.683372+00:00"}