{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6GGET3YYEYQQJOM6R37VLZSU62","short_pith_number":"pith:6GGET3YY","canonical_record":{"source":{"id":"2605.10919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-11T17:53:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51b7e53fc8bfa30a92160387b6d74aeaa1a747575755c3973fdea2e1fac1f146","abstract_canon_sha256":"afe01e322a6f4df989583719d30db501a91fbe57f88a3d2fc8edc798b178f7a0"},"schema_version":"1.0"},"canonical_sha256":"f18c49ef18262104b99e8eff55e654f697b766dd65f4611aa08c1d3554414d03","source":{"kind":"arxiv","id":"2605.10919","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10919","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10919v2","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10919","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"pith_short_12","alias_value":"6GGET3YYEYQQ","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"pith_short_16","alias_value":"6GGET3YYEYQQJOM6","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"pith_short_8","alias_value":"6GGET3YY","created_at":"2026-05-20T00:03:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6GGET3YYEYQQJOM6R37VLZSU62","target":"record","payload":{"canonical_record":{"source":{"id":"2605.10919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-11T17:53:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51b7e53fc8bfa30a92160387b6d74aeaa1a747575755c3973fdea2e1fac1f146","abstract_canon_sha256":"afe01e322a6f4df989583719d30db501a91fbe57f88a3d2fc8edc798b178f7a0"},"schema_version":"1.0"},"canonical_sha256":"f18c49ef18262104b99e8eff55e654f697b766dd65f4611aa08c1d3554414d03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:17.100890Z","signature_b64":"XyGftJMWgtAtXOgvzkBjkDVwsxZ6Xi2b5/xH/DQ6LBjmNduhrUpyCIzBQC2JOY+RvQeZ1D+XHkJmkVPKX5p0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f18c49ef18262104b99e8eff55e654f697b766dd65f4611aa08c1d3554414d03","last_reissued_at":"2026-05-20T00:03:17.099943Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:17.099943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.10919","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-05-20T00:03:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubOBOSFAecb9iry5GR7JQhZSSvjQu1exZI0VJYntYsplN9paoX8ceqMThMsYR6J7343icSdzbOyAfz67c0oHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:38:46.667438Z"},"content_sha256":"ff15e5c2bb59e37d71e7227d9f5155b63eb50365297ad6c82b7360cdd3754e47","schema_version":"1.0","event_id":"sha256:ff15e5c2bb59e37d71e7227d9f5155b63eb50365297ad6c82b7360cdd3754e47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6GGET3YYEYQQJOM6R37VLZSU62","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Access Expectation in DNA Storage and Fountain Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Fully symmetric fountain codes achieve a normalized random access expectation of approximately 0.7869.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christoph Hofmeister, Eitan Yaakobi, Rawad Bitar","submitted_at":"2026-05-11T17:53:13Z","abstract_excerpt":"Motivated by DNA data storage, we study the expected number of coded symbols drawn from a linear code until a desired information symbol can be decoded - the random access expectation. We focus on generator matrices with a type of symmetry, conjectured in prior work to be optimal, which we call fully symmetric. We point out an equivalence between binary fully symmetric codes and LT codes. Using this observation, we analyze the random access expectation of binary fully symmetric codes under a peeling decoder, in the large blocklength limit. Under these assumptions, the random access expectation"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Under these assumptions, the random access expectation, normalized by the number of information symbols, is at least π/4 ≈ 0.7854, while a value of ≈ 0.7869 is achievable.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The focus on generator matrices with a type of symmetry conjectured in prior work to be optimal (fully symmetric), the equivalence to LT codes, and the validity of the peeling decoder analysis in the large blocklength limit.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Binary fully symmetric codes (equivalent to LT codes) have normalized random access expectation at least π/4 ≈0.7854 under peeling decoder in large blocklength limit, with ≈0.7869 achievable.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Fully symmetric fountain codes achieve a normalized random access expectation of approximately 0.7869.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3fc9612b43dcdfbf2c3a3ffa389bc22d0f024916a3c456bdba1fc9378f9ddc26"},"source":{"id":"2605.10919","kind":"arxiv","version":2},"verdict":{"id":"a0819a1c-c719-4fd8-a503-697567fb6351","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T03:16:47.214087Z","strongest_claim":"Under these assumptions, the random access expectation, normalized by the number of information symbols, is at least π/4 ≈ 0.7854, while a value of ≈ 0.7869 is achievable.","one_line_summary":"Binary fully symmetric codes (equivalent to LT codes) have normalized random access expectation at least π/4 ≈0.7854 under peeling decoder in large blocklength limit, with ≈0.7869 achievable.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The focus on generator matrices with a type of symmetry conjectured in prior work to be optimal (fully symmetric), the equivalence to LT codes, and the validity of the peeling decoder analysis in the large blocklength limit.","pith_extraction_headline":"Fully symmetric fountain codes achieve a normalized random access expectation of approximately 0.7869."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.10919/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:37:08.243131Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T10:31:17.210287Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:54:13.711197Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"9a2c508533fad1f83c59f4e4eba0e2a65f297d97a795aee195d5e7ba304a49dc"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":3,"snapshot_sha256":"866ba6bc140579c9730d111728ba17cfc37bb31c1b63085bb0ef893941f25502"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"a0819a1c-c719-4fd8-a503-697567fb6351"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xex7WyU1hPqlNJ0fKQM2O7FU0c4I9LWEqODWyDolk4S2VERUlDuHPyfK7cyhGZ5ifmWSmFYuVlcABVuX16VpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:38:46.668122Z"},"content_sha256":"424e3ded85fb432962e4da1dc3775be24c8e7a20b006c8a7be3db7dc9f552bf6","schema_version":"1.0","event_id":"sha256:424e3ded85fb432962e4da1dc3775be24c8e7a20b006c8a7be3db7dc9f552bf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GGET3YYEYQQJOM6R37VLZSU62/bundle.json","state_url":"https://pith.science/pith/6GGET3YYEYQQJOM6R37VLZSU62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GGET3YYEYQQJOM6R37VLZSU62/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-25T06:38:46Z","links":{"resolver":"https://pith.science/pith/6GGET3YYEYQQJOM6R37VLZSU62","bundle":"https://pith.science/pith/6GGET3YYEYQQJOM6R37VLZSU62/bundle.json","state":"https://pith.science/pith/6GGET3YYEYQQJOM6R37VLZSU62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GGET3YYEYQQJOM6R37VLZSU62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6GGET3YYEYQQJOM6R37VLZSU62","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":"afe01e322a6f4df989583719d30db501a91fbe57f88a3d2fc8edc798b178f7a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-11T17:53:13Z","title_canon_sha256":"51b7e53fc8bfa30a92160387b6d74aeaa1a747575755c3973fdea2e1fac1f146"},"schema_version":"1.0","source":{"id":"2605.10919","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10919","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10919v2","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10919","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"pith_short_12","alias_value":"6GGET3YYEYQQ","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"pith_short_16","alias_value":"6GGET3YYEYQQJOM6","created_at":"2026-05-20T00:03:17Z"},{"alias_kind":"pith_short_8","alias_value":"6GGET3YY","created_at":"2026-05-20T00:03:17Z"}],"graph_snapshots":[{"event_id":"sha256:424e3ded85fb432962e4da1dc3775be24c8e7a20b006c8a7be3db7dc9f552bf6","target":"graph","created_at":"2026-05-20T00:03:17Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Under these assumptions, the random access expectation, normalized by the number of information symbols, is at least π/4 ≈ 0.7854, while a value of ≈ 0.7869 is achievable."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The focus on generator matrices with a type of symmetry conjectured in prior work to be optimal (fully symmetric), the equivalence to LT codes, and the validity of the peeling decoder analysis in the large blocklength limit."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Binary fully symmetric codes (equivalent to LT codes) have normalized random access expectation at least π/4 ≈0.7854 under peeling decoder in large blocklength limit, with ≈0.7869 achievable."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Fully symmetric fountain codes achieve a normalized random access expectation of approximately 0.7869."}],"snapshot_sha256":"3fc9612b43dcdfbf2c3a3ffa389bc22d0f024916a3c456bdba1fc9378f9ddc26"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"866ba6bc140579c9730d111728ba17cfc37bb31c1b63085bb0ef893941f25502"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:37:08.243131Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T10:31:17.210287Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T08:54:13.711197Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.10919/integrity.json","findings":[],"snapshot_sha256":"9a2c508533fad1f83c59f4e4eba0e2a65f297d97a795aee195d5e7ba304a49dc","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by DNA data storage, we study the expected number of coded symbols drawn from a linear code until a desired information symbol can be decoded - the random access expectation. We focus on generator matrices with a type of symmetry, conjectured in prior work to be optimal, which we call fully symmetric. We point out an equivalence between binary fully symmetric codes and LT codes. Using this observation, we analyze the random access expectation of binary fully symmetric codes under a peeling decoder, in the large blocklength limit. Under these assumptions, the random access expectation","authors_text":"Christoph Hofmeister, Eitan Yaakobi, Rawad Bitar","cross_cats":["math.IT"],"headline":"Fully symmetric fountain codes achieve a normalized random access expectation of approximately 0.7869.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-11T17:53:13Z","title":"Random Access Expectation in DNA Storage and Fountain Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.10919","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T03:16:47.214087Z","id":"a0819a1c-c719-4fd8-a503-697567fb6351","model_set":{"reader":"grok-4.3"},"one_line_summary":"Binary fully symmetric codes (equivalent to LT codes) have normalized random access expectation at least π/4 ≈0.7854 under peeling decoder in large blocklength limit, with ≈0.7869 achievable.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Fully symmetric fountain codes achieve a normalized random access expectation of approximately 0.7869.","strongest_claim":"Under these assumptions, the random access expectation, normalized by the number of information symbols, is at least π/4 ≈ 0.7854, while a value of ≈ 0.7869 is achievable.","weakest_assumption":"The focus on generator matrices with a type of symmetry conjectured in prior work to be optimal (fully symmetric), the equivalence to LT codes, and the validity of the peeling decoder analysis in the large blocklength limit."}},"verdict_id":"a0819a1c-c719-4fd8-a503-697567fb6351"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ff15e5c2bb59e37d71e7227d9f5155b63eb50365297ad6c82b7360cdd3754e47","target":"record","created_at":"2026-05-20T00:03:17Z","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":"afe01e322a6f4df989583719d30db501a91fbe57f88a3d2fc8edc798b178f7a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-11T17:53:13Z","title_canon_sha256":"51b7e53fc8bfa30a92160387b6d74aeaa1a747575755c3973fdea2e1fac1f146"},"schema_version":"1.0","source":{"id":"2605.10919","kind":"arxiv","version":2}},"canonical_sha256":"f18c49ef18262104b99e8eff55e654f697b766dd65f4611aa08c1d3554414d03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f18c49ef18262104b99e8eff55e654f697b766dd65f4611aa08c1d3554414d03","first_computed_at":"2026-05-20T00:03:17.099943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:17.099943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XyGftJMWgtAtXOgvzkBjkDVwsxZ6Xi2b5/xH/DQ6LBjmNduhrUpyCIzBQC2JOY+RvQeZ1D+XHkJmkVPKX5p0Bg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:17.100890Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.10919","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff15e5c2bb59e37d71e7227d9f5155b63eb50365297ad6c82b7360cdd3754e47","sha256:424e3ded85fb432962e4da1dc3775be24c8e7a20b006c8a7be3db7dc9f552bf6"],"state_sha256":"c01207e1df87bd461be7961c12d9e744c559a798dbf6e936f22b85eb79f17aa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ux0YYLuAQNjF1LvzT08O+krPUdrz8pLGqHBu0YPJa//QFB+7zx+SkVPXvoeYHCRylJk3TWLZwYF+mKLN2pf0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T06:38:46.671270Z","bundle_sha256":"86be0d15b0bf82eeffbff37e00f8ff1713adb798d31c298f085f6c90a61cae3e"}}