{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VECKCWV5Z6SCPKHA2EUQOVBETM","short_pith_number":"pith:VECKCWV5","canonical_record":{"source":{"id":"1211.4014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T20:32:57Z","cross_cats_sorted":["cs.MM","cs.NI","math.IT"],"title_canon_sha256":"708283b416ed10364a1c0a6e5b68e3daf2c1fbe63d562cdb6111abe672610c0e","abstract_canon_sha256":"5aa5ca9e022c2b59de0fb6df0c4c5b5046f5612c1cede1a02f7942874fb61256"},"schema_version":"1.0"},"canonical_sha256":"a904a15abdcfa427a8e0d1290754249b0102e34e1fcec87b76eb44df58ed6711","source":{"kind":"arxiv","id":"1211.4014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4014","created_at":"2026-05-18T03:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4014v1","created_at":"2026-05-18T03:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4014","created_at":"2026-05-18T03:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"VECKCWV5Z6SC","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VECKCWV5Z6SCPKHA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VECKCWV5","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VECKCWV5Z6SCPKHA2EUQOVBETM","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T20:32:57Z","cross_cats_sorted":["cs.MM","cs.NI","math.IT"],"title_canon_sha256":"708283b416ed10364a1c0a6e5b68e3daf2c1fbe63d562cdb6111abe672610c0e","abstract_canon_sha256":"5aa5ca9e022c2b59de0fb6df0c4c5b5046f5612c1cede1a02f7942874fb61256"},"schema_version":"1.0"},"canonical_sha256":"a904a15abdcfa427a8e0d1290754249b0102e34e1fcec87b76eb44df58ed6711","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:37.331688Z","signature_b64":"Ar6dcsceufBPLeyvL3lKiOAQ1XOqvPWFsyo0W9itXLVBqaphMfGnqbM0wYHkhFobEPFdDw6nmPk6tTvHLjvZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a904a15abdcfa427a8e0d1290754249b0102e34e1fcec87b76eb44df58ed6711","last_reissued_at":"2026-05-18T03:40:37.330936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:37.330936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4014","source_version":1,"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-18T03:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8lqDeVj2oNMdI4AFpL84HqNEXB9T7kHAOWWGpS1JdmdlTgttDglB5aEHREfWEG0H74dvfAT9Q+PT+PZnKmrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:33:41.838850Z"},"content_sha256":"ac17e699b42de9e28b924cd05ff784dfda63fa902fa6a28a3e2458269a26103f","schema_version":"1.0","event_id":"sha256:ac17e699b42de9e28b924cd05ff784dfda63fa902fa6a28a3e2458269a26103f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VECKCWV5Z6SCPKHA2EUQOVBETM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intermediate Performance Analysis of Growth Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Nikolaos Thomos, Pascal Frossard, Rethnakaran Pulikkoonattu","submitted_at":"2012-11-16T20:32:57Z","abstract_excerpt":"Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly useful in applications where performance increases with the number of decoded data units. In this paper, we provide a generic analytical framework for studying the asymptotic performance of Growth codes in different settings. Our analysis based on Wormald method applies to any class of Rateless codes that does not include a precoding step. We eva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4014","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"},"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-18T03:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/X7rFZAPfn2lE0Pph3Fh/OJNCJPMhJzGmOW8yx6fmsoBSdJRQjaGpN04iaSWN5QBKsG5oh728XW3Uva3nIRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:33:41.839199Z"},"content_sha256":"94c8f2b5355e871bc90791250cc9930ca9f9cf8d580339847ed7ed90d6d6c8f0","schema_version":"1.0","event_id":"sha256:94c8f2b5355e871bc90791250cc9930ca9f9cf8d580339847ed7ed90d6d6c8f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VECKCWV5Z6SCPKHA2EUQOVBETM/bundle.json","state_url":"https://pith.science/pith/VECKCWV5Z6SCPKHA2EUQOVBETM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VECKCWV5Z6SCPKHA2EUQOVBETM/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-06-08T22:33:41Z","links":{"resolver":"https://pith.science/pith/VECKCWV5Z6SCPKHA2EUQOVBETM","bundle":"https://pith.science/pith/VECKCWV5Z6SCPKHA2EUQOVBETM/bundle.json","state":"https://pith.science/pith/VECKCWV5Z6SCPKHA2EUQOVBETM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VECKCWV5Z6SCPKHA2EUQOVBETM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VECKCWV5Z6SCPKHA2EUQOVBETM","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":"5aa5ca9e022c2b59de0fb6df0c4c5b5046f5612c1cede1a02f7942874fb61256","cross_cats_sorted":["cs.MM","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T20:32:57Z","title_canon_sha256":"708283b416ed10364a1c0a6e5b68e3daf2c1fbe63d562cdb6111abe672610c0e"},"schema_version":"1.0","source":{"id":"1211.4014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4014","created_at":"2026-05-18T03:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4014v1","created_at":"2026-05-18T03:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4014","created_at":"2026-05-18T03:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"VECKCWV5Z6SC","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VECKCWV5Z6SCPKHA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VECKCWV5","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:94c8f2b5355e871bc90791250cc9930ca9f9cf8d580339847ed7ed90d6d6c8f0","target":"graph","created_at":"2026-05-18T03:40:37Z","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":"Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly useful in applications where performance increases with the number of decoded data units. In this paper, we provide a generic analytical framework for studying the asymptotic performance of Growth codes in different settings. Our analysis based on Wormald method applies to any class of Rateless codes that does not include a precoding step. We eva","authors_text":"Nikolaos Thomos, Pascal Frossard, Rethnakaran Pulikkoonattu","cross_cats":["cs.MM","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T20:32:57Z","title":"Intermediate Performance Analysis of Growth Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4014","kind":"arxiv","version":1},"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:ac17e699b42de9e28b924cd05ff784dfda63fa902fa6a28a3e2458269a26103f","target":"record","created_at":"2026-05-18T03:40:37Z","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":"5aa5ca9e022c2b59de0fb6df0c4c5b5046f5612c1cede1a02f7942874fb61256","cross_cats_sorted":["cs.MM","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T20:32:57Z","title_canon_sha256":"708283b416ed10364a1c0a6e5b68e3daf2c1fbe63d562cdb6111abe672610c0e"},"schema_version":"1.0","source":{"id":"1211.4014","kind":"arxiv","version":1}},"canonical_sha256":"a904a15abdcfa427a8e0d1290754249b0102e34e1fcec87b76eb44df58ed6711","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a904a15abdcfa427a8e0d1290754249b0102e34e1fcec87b76eb44df58ed6711","first_computed_at":"2026-05-18T03:40:37.330936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:37.330936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ar6dcsceufBPLeyvL3lKiOAQ1XOqvPWFsyo0W9itXLVBqaphMfGnqbM0wYHkhFobEPFdDw6nmPk6tTvHLjvZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:37.331688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac17e699b42de9e28b924cd05ff784dfda63fa902fa6a28a3e2458269a26103f","sha256:94c8f2b5355e871bc90791250cc9930ca9f9cf8d580339847ed7ed90d6d6c8f0"],"state_sha256":"1b96cc3150e8d04e42c0bab234e616a45c13d55598508130907b652943ff9d57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5QXAO4HvWarO2Uxee5VJ1M3I7v/zhEQmpvFk+LdSe23GDzZN5Y5BZZB8+puE3GlmYiSsuDddgiRFi9F0CuUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:33:41.841173Z","bundle_sha256":"6f49c5bdc3e729d9bb59a576406931ac089a75bde24582bcdc12d47e0e49a4d2"}}