{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NNB3DHISKNC6BPBFBP7PYVHPFN","short_pith_number":"pith:NNB3DHIS","canonical_record":{"source":{"id":"1307.5664","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-22T11:56:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c6a3df0988e811575b8af8601392d15349261deef3c15079cf9df65ff0533696","abstract_canon_sha256":"6a316e8b98cf5091cc7561e4edcff27d49d97938fce3dff92cf86c47b0961226"},"schema_version":"1.0"},"canonical_sha256":"6b43b19d125345e0bc250bfefc54ef2b7e69a55747385a9e453d0332c97babc4","source":{"kind":"arxiv","id":"1307.5664","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5664","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5664v3","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5664","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"NNB3DHISKNC6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NNB3DHISKNC6BPBF","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NNB3DHIS","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NNB3DHISKNC6BPBFBP7PYVHPFN","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5664","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-22T11:56:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c6a3df0988e811575b8af8601392d15349261deef3c15079cf9df65ff0533696","abstract_canon_sha256":"6a316e8b98cf5091cc7561e4edcff27d49d97938fce3dff92cf86c47b0961226"},"schema_version":"1.0"},"canonical_sha256":"6b43b19d125345e0bc250bfefc54ef2b7e69a55747385a9e453d0332c97babc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:20.127344Z","signature_b64":"2imcrSstovKv0fcUwSZYVP0HqJLrQDi09BMmZra4M3T0NfVnBi0gr4SJCyS3SPixU4QI6KqW03YNd/GqX0zcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b43b19d125345e0bc250bfefc54ef2b7e69a55747385a9e453d0332c97babc4","last_reissued_at":"2026-05-18T02:20:20.126667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:20.126667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5664","source_version":3,"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-05-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9KXF+v+iHSeQkcyhdXE0I/puiC7qsoJTIAp2cL8nZM++FN66beNKovGr7LmNAxNMSp5//+Np6bHHSyozwxHjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:28:53.686539Z"},"content_sha256":"256220d26d65a35a49f9702875c2ed455b863506d877627e50460b74fa587b44","schema_version":"1.0","event_id":"sha256:256220d26d65a35a49f9702875c2ed455b863506d877627e50460b74fa587b44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NNB3DHISKNC6BPBFBP7PYVHPFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expander Chunked Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baoliu Ye, Bin Tang, Sanglu Lu, Shenghao Yang, Yitong Yin","submitted_at":"2013-07-22T11:56:13Z","abstract_excerpt":"Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the coded packets). During the network transmission, RLNC is performed within each chunk. In this paper, we first introduce a simple transfer matrix model to characterize the transmission of chunks, and derive some basic properties of the model to facilitate the performance analysis. We then focus on the design of overlapped chunked codes, a class of chunked codes whose chunks are non-disjoint subsets of input packets, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5664","kind":"arxiv","version":3},"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"},"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-05-18T02:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6Y6YQofU5M/NZcW1q8V3lpdsrDPBepbqOLiUnknSjw5qQiZ4GJapY58HyXMn96FTvz+QFFYasd78t/4myNXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:28:53.686885Z"},"content_sha256":"9c64a32d6804af05fbad943c8d60bf9982487b85e3f9f09f79c8aba3d5dbfb81","schema_version":"1.0","event_id":"sha256:9c64a32d6804af05fbad943c8d60bf9982487b85e3f9f09f79c8aba3d5dbfb81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNB3DHISKNC6BPBFBP7PYVHPFN/bundle.json","state_url":"https://pith.science/pith/NNB3DHISKNC6BPBFBP7PYVHPFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNB3DHISKNC6BPBFBP7PYVHPFN/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-05-28T00:28:53Z","links":{"resolver":"https://pith.science/pith/NNB3DHISKNC6BPBFBP7PYVHPFN","bundle":"https://pith.science/pith/NNB3DHISKNC6BPBFBP7PYVHPFN/bundle.json","state":"https://pith.science/pith/NNB3DHISKNC6BPBFBP7PYVHPFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNB3DHISKNC6BPBFBP7PYVHPFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NNB3DHISKNC6BPBFBP7PYVHPFN","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":"6a316e8b98cf5091cc7561e4edcff27d49d97938fce3dff92cf86c47b0961226","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-22T11:56:13Z","title_canon_sha256":"c6a3df0988e811575b8af8601392d15349261deef3c15079cf9df65ff0533696"},"schema_version":"1.0","source":{"id":"1307.5664","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5664","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5664v3","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5664","created_at":"2026-05-18T02:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"NNB3DHISKNC6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NNB3DHISKNC6BPBF","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NNB3DHIS","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:9c64a32d6804af05fbad943c8d60bf9982487b85e3f9f09f79c8aba3d5dbfb81","target":"graph","created_at":"2026-05-18T02:20:20Z","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"},"paper":{"abstract_excerpt":"Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the coded packets). During the network transmission, RLNC is performed within each chunk. In this paper, we first introduce a simple transfer matrix model to characterize the transmission of chunks, and derive some basic properties of the model to facilitate the performance analysis. We then focus on the design of overlapped chunked codes, a class of chunked codes whose chunks are non-disjoint subsets of input packets, whic","authors_text":"Baoliu Ye, Bin Tang, Sanglu Lu, Shenghao Yang, Yitong Yin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-22T11:56:13Z","title":"Expander Chunked Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5664","kind":"arxiv","version":3},"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:256220d26d65a35a49f9702875c2ed455b863506d877627e50460b74fa587b44","target":"record","created_at":"2026-05-18T02:20:20Z","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":"6a316e8b98cf5091cc7561e4edcff27d49d97938fce3dff92cf86c47b0961226","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-22T11:56:13Z","title_canon_sha256":"c6a3df0988e811575b8af8601392d15349261deef3c15079cf9df65ff0533696"},"schema_version":"1.0","source":{"id":"1307.5664","kind":"arxiv","version":3}},"canonical_sha256":"6b43b19d125345e0bc250bfefc54ef2b7e69a55747385a9e453d0332c97babc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b43b19d125345e0bc250bfefc54ef2b7e69a55747385a9e453d0332c97babc4","first_computed_at":"2026-05-18T02:20:20.126667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:20.126667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2imcrSstovKv0fcUwSZYVP0HqJLrQDi09BMmZra4M3T0NfVnBi0gr4SJCyS3SPixU4QI6KqW03YNd/GqX0zcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:20.127344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5664","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:256220d26d65a35a49f9702875c2ed455b863506d877627e50460b74fa587b44","sha256:9c64a32d6804af05fbad943c8d60bf9982487b85e3f9f09f79c8aba3d5dbfb81"],"state_sha256":"1bec1cd7c712f2afe3f28a18022d04f585dbbf3c3e7954f98ce2fb2c4e557bde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HTzIDVh/G1122rQJ6scoINzt2bvpu4jPk3nD8A/kArMKwHqzAWg2FCvz4NRDFmaNiuneH1VYJFOPnxQAXaOBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:28:53.688881Z","bundle_sha256":"47d6edefa0cf20b4685529e71cab0b03c9918c81db66274bb27020a79947e733"}}