{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TU3J6OIXOLR5TM3B43NWTDYFTT","short_pith_number":"pith:TU3J6OIX","schema_version":"1.0","canonical_sha256":"9d369f391772e3d9b361e6db698f059ceb6c512460e4cf54a56c811120e55737","source":{"kind":"arxiv","id":"1206.3014","version":1},"attestation_state":"computed","paper":{"title":"Round-Robin Streaming with Generations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emina Soljanin, Morten Videb{\\ae}k Pedersen, P\\'eter Vingelmann, Yao Li","submitted_at":"2012-06-14T06:12:04Z","abstract_excerpt":"We consider three types of application layer coding for streaming over lossy links: random linear coding, systematic random linear coding, and structured coding. The file being streamed is divided into sub-blocks (generations). Code symbols are formed by combining data belonging to the same generation, and transmitted in a round-robin fashion. We compare the schemes based on delivery packet count, net throughput, and energy consumption for a range of generation sizes. We determine these performance measures both analytically and in an experimental configuration. We find our analytical predicti"},"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":"1206.3014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-14T06:12:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"212b8d662cdd2fb1544e3ea4bc578ca6c14b255db802519a57fe75138c4f6e30","abstract_canon_sha256":"555166180fa3409a4abbcb36e51777fa7a8d9b16bba14c23e9a5056292fb4486"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:33.037860Z","signature_b64":"clHS99wKOhR4/wiXLkrWpvm5luvOOSaKEex5g691ifymWER1aOt1sAlUTI20L1uzpwfXZT5OcjpUSPPZ4Pu6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d369f391772e3d9b361e6db698f059ceb6c512460e4cf54a56c811120e55737","last_reissued_at":"2026-05-18T03:53:33.037158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:33.037158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Round-Robin Streaming with Generations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emina Soljanin, Morten Videb{\\ae}k Pedersen, P\\'eter Vingelmann, Yao Li","submitted_at":"2012-06-14T06:12:04Z","abstract_excerpt":"We consider three types of application layer coding for streaming over lossy links: random linear coding, systematic random linear coding, and structured coding. The file being streamed is divided into sub-blocks (generations). Code symbols are formed by combining data belonging to the same generation, and transmitted in a round-robin fashion. We compare the schemes based on delivery packet count, net throughput, and energy consumption for a range of generation sizes. We determine these performance measures both analytically and in an experimental configuration. We find our analytical predicti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3014","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":"1206.3014","created_at":"2026-05-18T03:53:33.037273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3014v1","created_at":"2026-05-18T03:53:33.037273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3014","created_at":"2026-05-18T03:53:33.037273+00:00"},{"alias_kind":"pith_short_12","alias_value":"TU3J6OIXOLR5","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TU3J6OIXOLR5TM3B","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TU3J6OIX","created_at":"2026-05-18T12:27:23.164592+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/TU3J6OIXOLR5TM3B43NWTDYFTT","json":"https://pith.science/pith/TU3J6OIXOLR5TM3B43NWTDYFTT.json","graph_json":"https://pith.science/api/pith-number/TU3J6OIXOLR5TM3B43NWTDYFTT/graph.json","events_json":"https://pith.science/api/pith-number/TU3J6OIXOLR5TM3B43NWTDYFTT/events.json","paper":"https://pith.science/paper/TU3J6OIX"},"agent_actions":{"view_html":"https://pith.science/pith/TU3J6OIXOLR5TM3B43NWTDYFTT","download_json":"https://pith.science/pith/TU3J6OIXOLR5TM3B43NWTDYFTT.json","view_paper":"https://pith.science/paper/TU3J6OIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3014&json=true","fetch_graph":"https://pith.science/api/pith-number/TU3J6OIXOLR5TM3B43NWTDYFTT/graph.json","fetch_events":"https://pith.science/api/pith-number/TU3J6OIXOLR5TM3B43NWTDYFTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TU3J6OIXOLR5TM3B43NWTDYFTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TU3J6OIXOLR5TM3B43NWTDYFTT/action/storage_attestation","attest_author":"https://pith.science/pith/TU3J6OIXOLR5TM3B43NWTDYFTT/action/author_attestation","sign_citation":"https://pith.science/pith/TU3J6OIXOLR5TM3B43NWTDYFTT/action/citation_signature","submit_replication":"https://pith.science/pith/TU3J6OIXOLR5TM3B43NWTDYFTT/action/replication_record"}},"created_at":"2026-05-18T03:53:33.037273+00:00","updated_at":"2026-05-18T03:53:33.037273+00:00"}