{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HLLJTLST4YX3Q3JZT3TPDUZX6D","short_pith_number":"pith:HLLJTLST","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"},"canonical_sha256":"3ad699ae53e62fb86d399ee6f1d337f0dac57668b0dbe0cdf00a74cbe2da771e","source":{"kind":"arxiv","id":"2602.10020","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.10020","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"2602.10020v2","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10020","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"HLLJTLST4YX3","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"pith_short_16","alias_value":"HLLJTLST4YX3Q3JZ","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"pith_short_8","alias_value":"HLLJTLST","created_at":"2026-07-21T00:19:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HLLJTLST4YX3Q3JZT3TPDUZX6D","target":"record","payload":{"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"},"canonical_sha256":"3ad699ae53e62fb86d399ee6f1d337f0dac57668b0dbe0cdf00a74cbe2da771e","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"},"source_kind":"arxiv","source_id":"2602.10020","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-21T00:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8B+c55yDehvJiTMJZBnzQkwe7LWgSu/FZgBYH3Wi395F9VhZ9bhOZUap2so11TgC1lCrnw70mEJq4wKl94/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:11:09.664361Z"},"content_sha256":"b3b36f3f97680e18a7614cc5bbd757d28e854e50f04308a7d25d29240982a304","schema_version":"1.0","event_id":"sha256:b3b36f3f97680e18a7614cc5bbd757d28e854e50f04308a7d25d29240982a304"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HLLJTLST4YX3Q3JZT3TPDUZX6D","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-21T00:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0O6JZ9W6J8UhrPnr33AlrK3saJ5WGT38rSgAsRd5w2A+Oink8DlLy2VRzmYKZYbnHx5K0Uf5fH+NSmeQxf18Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:11:09.665091Z"},"content_sha256":"7e00298aee445b709510db4ae57a169e00b24337384dbbdec8a862e7f13d69a3","schema_version":"1.0","event_id":"sha256:7e00298aee445b709510db4ae57a169e00b24337384dbbdec8a862e7f13d69a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/bundle.json","state_url":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T09:11:09Z","links":{"resolver":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D","bundle":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/bundle.json","state":"https://pith.science/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLLJTLST4YX3Q3JZT3TPDUZX6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HLLJTLST4YX3Q3JZT3TPDUZX6D","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"592e1e1d2cd85c1f15accdc6dbbf26997cdd0f929551dccdab5d334c1cc4adc1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-02-10T17:42:02Z","title_canon_sha256":"6b030290262267bc474498cb50ef1849fc906c9669cc8a9611dba372c0671144"},"schema_version":"1.0","source":{"id":"2602.10020","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.10020","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"2602.10020v2","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10020","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"HLLJTLST4YX3","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"pith_short_16","alias_value":"HLLJTLST4YX3Q3JZ","created_at":"2026-07-21T00:19:55Z"},{"alias_kind":"pith_short_8","alias_value":"HLLJTLST","created_at":"2026-07-21T00:19:55Z"}],"graph_snapshots":[{"event_id":"sha256:7e00298aee445b709510db4ae57a169e00b24337384dbbdec8a862e7f13d69a3","target":"graph","created_at":"2026-07-21T00:19:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.10020/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jingfan Meng, Jun Xu (Jim), Qianru Yu, Tianji Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-02-10T17:42:02Z","title":"METTLE: Efficient Streaming Erasure Code with Peeling Decodability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.10020","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b3b36f3f97680e18a7614cc5bbd757d28e854e50f04308a7d25d29240982a304","target":"record","created_at":"2026-07-21T00:19:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"592e1e1d2cd85c1f15accdc6dbbf26997cdd0f929551dccdab5d334c1cc4adc1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-02-10T17:42:02Z","title_canon_sha256":"6b030290262267bc474498cb50ef1849fc906c9669cc8a9611dba372c0671144"},"schema_version":"1.0","source":{"id":"2602.10020","kind":"arxiv","version":2}},"canonical_sha256":"3ad699ae53e62fb86d399ee6f1d337f0dac57668b0dbe0cdf00a74cbe2da771e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ad699ae53e62fb86d399ee6f1d337f0dac57668b0dbe0cdf00a74cbe2da771e","first_computed_at":"2026-07-21T00:19:55.682907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T00:19:55.682907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wCP8LvHEd4Fg/fWn1oZlCYIjK9GZnqBc8jucSJ+Y6ZdZNRg2CgwIGhvyvelUki/CI0P0QOwb5/TGGp4kKW1nAg==","signature_status":"signed_v1","signed_at":"2026-07-21T00:19:55.683881Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.10020","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3b36f3f97680e18a7614cc5bbd757d28e854e50f04308a7d25d29240982a304","sha256:7e00298aee445b709510db4ae57a169e00b24337384dbbdec8a862e7f13d69a3"],"state_sha256":"05fbb19710893a35c15cede1abc71dd11bdc2f77af5bf90c09b7080bd907a49f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFp19Sh35XX2TpTKIklHD0790W6G26eo7YfJYCPjPz85x2mVdlxw/al9QaTniY0vGuCuVilTsRMNW1XXubUzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T09:11:09.670135Z","bundle_sha256":"b2c3913c4942ef8699f893450b08be54482ee0e84be393c8af5a035b63a29f97"}}