{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:JZMLGCJVR7MXHNHWB7NZCRLFNS","short_pith_number":"pith:JZMLGCJV","canonical_record":{"source":{"id":"2006.06492","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-11T15:01:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8bc12774c8dd471361f2cae688f62e549aeb775af0320feb5af82feaddc326a9","abstract_canon_sha256":"99b724b6695c2e9f414e1b7458eccbf00b048bf6b523735cfce957585baa8630"},"schema_version":"1.0"},"canonical_sha256":"4e58b309358fd973b4f60fdb9145656c8fbf4d278505a2d8b1484e22cf289479","source":{"kind":"arxiv","id":"2006.06492","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.06492","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"arxiv_version","alias_value":"2006.06492v4","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.06492","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"pith_short_12","alias_value":"JZMLGCJVR7MX","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"pith_short_16","alias_value":"JZMLGCJVR7MXHNHW","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"pith_short_8","alias_value":"JZMLGCJV","created_at":"2026-07-05T05:36:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:JZMLGCJVR7MXHNHWB7NZCRLFNS","target":"record","payload":{"canonical_record":{"source":{"id":"2006.06492","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-11T15:01:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8bc12774c8dd471361f2cae688f62e549aeb775af0320feb5af82feaddc326a9","abstract_canon_sha256":"99b724b6695c2e9f414e1b7458eccbf00b048bf6b523735cfce957585baa8630"},"schema_version":"1.0"},"canonical_sha256":"4e58b309358fd973b4f60fdb9145656c8fbf4d278505a2d8b1484e22cf289479","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:28.310397Z","signature_b64":"1xa60QdqJoTmTxlzpPjV01Hm2RPaxkhvspwEc/pU6YKbHCAddq5cs+aQV93nbX9WqKa6xFc0YM55PAXsqa2PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e58b309358fd973b4f60fdb9145656c8fbf4d278505a2d8b1484e22cf289479","last_reissued_at":"2026-07-05T05:36:28.309897Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:28.309897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.06492","source_version":4,"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-05T05:36:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2gdZ1lAYa+OQx+cQZbGgJrlgOLG0FS7f0DbVg9lfOEo40U7Med2deVx9VQ+gDJGXY/vE9+qcAMGsW4UFdU8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:39:42.514967Z"},"content_sha256":"0b88f451020944708c3d591e04eb05d17d4f70db3a047a15b3a63de75e635fd8","schema_version":"1.0","event_id":"sha256:0b88f451020944708c3d591e04eb05d17d4f70db3a047a15b3a63de75e635fd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:JZMLGCJVR7MXHNHWB7NZCRLFNS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Basis-Finding Algorithm for Decoding Fountain Codes for DNA-Based Data Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kui Cai, Xuan He","submitted_at":"2020-06-11T15:01:00Z","abstract_excerpt":"In this paper, we consider the decoding of fountain codes where the received symbols may have errors. It is motivated by the application of fountain codes in DNA-based data storage systems where the inner code decoding, which generally has undetectable errors, is performed before the outer fountain code decoding. We propose a novel and efficient decoding algorithm, namely basis-finding algorithm (BFA), followed by three implementations. The key idea of the BFA is to find a basis of the received symbols, and then use the most reliable basis elements to recover the source symbols with the inacti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.06492","kind":"arxiv","version":4},"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/2006.06492/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-05T05:36:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtuZUevsrrvrjVSjYUSM8SYXul0eBPoY+JOjn6bmOHnx6LnYR63dCpfEzc9gn1tlEbUPpB/WgGa9KePJQD8LBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:39:42.515358Z"},"content_sha256":"8a2a893c837e9567ba8420152353afd57c1eefa7d634077d5bf242580a9afc6d","schema_version":"1.0","event_id":"sha256:8a2a893c837e9567ba8420152353afd57c1eefa7d634077d5bf242580a9afc6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZMLGCJVR7MXHNHWB7NZCRLFNS/bundle.json","state_url":"https://pith.science/pith/JZMLGCJVR7MXHNHWB7NZCRLFNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZMLGCJVR7MXHNHWB7NZCRLFNS/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-07-07T08:39:42Z","links":{"resolver":"https://pith.science/pith/JZMLGCJVR7MXHNHWB7NZCRLFNS","bundle":"https://pith.science/pith/JZMLGCJVR7MXHNHWB7NZCRLFNS/bundle.json","state":"https://pith.science/pith/JZMLGCJVR7MXHNHWB7NZCRLFNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZMLGCJVR7MXHNHWB7NZCRLFNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:JZMLGCJVR7MXHNHWB7NZCRLFNS","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":"99b724b6695c2e9f414e1b7458eccbf00b048bf6b523735cfce957585baa8630","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-11T15:01:00Z","title_canon_sha256":"8bc12774c8dd471361f2cae688f62e549aeb775af0320feb5af82feaddc326a9"},"schema_version":"1.0","source":{"id":"2006.06492","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.06492","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"arxiv_version","alias_value":"2006.06492v4","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.06492","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"pith_short_12","alias_value":"JZMLGCJVR7MX","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"pith_short_16","alias_value":"JZMLGCJVR7MXHNHW","created_at":"2026-07-05T05:36:28Z"},{"alias_kind":"pith_short_8","alias_value":"JZMLGCJV","created_at":"2026-07-05T05:36:28Z"}],"graph_snapshots":[{"event_id":"sha256:8a2a893c837e9567ba8420152353afd57c1eefa7d634077d5bf242580a9afc6d","target":"graph","created_at":"2026-07-05T05:36:28Z","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/2006.06492/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider the decoding of fountain codes where the received symbols may have errors. It is motivated by the application of fountain codes in DNA-based data storage systems where the inner code decoding, which generally has undetectable errors, is performed before the outer fountain code decoding. We propose a novel and efficient decoding algorithm, namely basis-finding algorithm (BFA), followed by three implementations. The key idea of the BFA is to find a basis of the received symbols, and then use the most reliable basis elements to recover the source symbols with the inacti","authors_text":"Kui Cai, Xuan He","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-11T15:01:00Z","title":"Basis-Finding Algorithm for Decoding Fountain Codes for DNA-Based Data Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.06492","kind":"arxiv","version":4},"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:0b88f451020944708c3d591e04eb05d17d4f70db3a047a15b3a63de75e635fd8","target":"record","created_at":"2026-07-05T05:36:28Z","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":"99b724b6695c2e9f414e1b7458eccbf00b048bf6b523735cfce957585baa8630","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-06-11T15:01:00Z","title_canon_sha256":"8bc12774c8dd471361f2cae688f62e549aeb775af0320feb5af82feaddc326a9"},"schema_version":"1.0","source":{"id":"2006.06492","kind":"arxiv","version":4}},"canonical_sha256":"4e58b309358fd973b4f60fdb9145656c8fbf4d278505a2d8b1484e22cf289479","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e58b309358fd973b4f60fdb9145656c8fbf4d278505a2d8b1484e22cf289479","first_computed_at":"2026-07-05T05:36:28.309897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:36:28.309897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1xa60QdqJoTmTxlzpPjV01Hm2RPaxkhvspwEc/pU6YKbHCAddq5cs+aQV93nbX9WqKa6xFc0YM55PAXsqa2PAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:36:28.310397Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.06492","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b88f451020944708c3d591e04eb05d17d4f70db3a047a15b3a63de75e635fd8","sha256:8a2a893c837e9567ba8420152353afd57c1eefa7d634077d5bf242580a9afc6d"],"state_sha256":"0b3b943a9a2fec4ef8c5dcb22e3d6fc47f12e555c41374dc6805d8633f077649"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gU60Gjk50PWK93p9or+n5IM3vlM7rQYT6NefOlUTpUDXhTNi/kGQeDALx3L3kV9Su2a+Eho48QHAx4wDLtISAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:39:42.517367Z","bundle_sha256":"952c5fa04940a62d5189a4096715438b67f5e0ea49d646040388220d15f3eab9"}}