{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RG3GSMLLXQKU2NS3IO7ZHYGMYW","short_pith_number":"pith:RG3GSMLL","canonical_record":{"source":{"id":"1902.01178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-04T13:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"6a42a67f9684cefbf15c3a84b6371dffba265ef4395d74b0cdb70d0ef96ddeed","abstract_canon_sha256":"15519f87347233b44040615fa8f20c37db01636b46095da6adfdc4e99af14095"},"schema_version":"1.0"},"canonical_sha256":"89b669316bbc154d365b43bf93e0ccc58e0347c5d261348c0d76a0fd7f286fcb","source":{"kind":"arxiv","id":"1902.01178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01178","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01178v1","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01178","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"pith_short_12","alias_value":"RG3GSMLLXQKU","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"pith_short_16","alias_value":"RG3GSMLLXQKU2NS3","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"pith_short_8","alias_value":"RG3GSMLL","created_at":"2026-07-05T01:07:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RG3GSMLLXQKU2NS3IO7ZHYGMYW","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-04T13:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"6a42a67f9684cefbf15c3a84b6371dffba265ef4395d74b0cdb70d0ef96ddeed","abstract_canon_sha256":"15519f87347233b44040615fa8f20c37db01636b46095da6adfdc4e99af14095"},"schema_version":"1.0"},"canonical_sha256":"89b669316bbc154d365b43bf93e0ccc58e0347c5d261348c0d76a0fd7f286fcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:48.666388Z","signature_b64":"+uqYMCB83oV080+DtdFFwYZ7UEOi7xj21SqIw4Z8tkOumzHIhcO4VNGTJ6gPwqJ/GCihenurrRjkqX9LkZAmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89b669316bbc154d365b43bf93e0ccc58e0347c5d261348c0d76a0fd7f286fcb","last_reissued_at":"2026-07-05T01:07:48.665900Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:48.665900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01178","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-07-05T01:07:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhCZSbIDzXSMHhz5tpzx3OUfgbz7SsR4+f8AzwmKPafai256SrM8nKVh/F8EnPUlpyI8S8XlPE58EuEvGKo5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:12:51.704422Z"},"content_sha256":"60da2bd1ca6dd82d8adef4dd9533c1e1b4150c3698b436bbb62173edde13ca65","schema_version":"1.0","event_id":"sha256:60da2bd1ca6dd82d8adef4dd9533c1e1b4150c3698b436bbb62173edde13ca65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RG3GSMLLXQKU2NS3IO7ZHYGMYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Decoding of Staircase Codes: The Soft-aided Bit-marking (SABM) Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alex Alvarado, Bin Chen, Gabriele Liga, Jianqiang Li, Kun Xu, Xiong Deng, Yi Lei, Zizheng Cao","submitted_at":"2019-02-04T13:48:41Z","abstract_excerpt":"Staircase codes (SCCs) are typically decoded using iterative bounded-distance decoding (BDD) and hard decisions. In this paper, a novel decoding algorithm is proposed, which partially uses soft information from the channel. The proposed algorithm is based on marking certain number of highly reliable and highly unreliable bits. These marked bits are used to improve the miscorrection-detection capability of the SCC decoder and the error-correcting capability of BDD. For SCCs with $2$-error-correcting Bose-Chaudhuri-Hocquenghem component codes, our algorithm improves upon standard SCC decoding by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01178","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.01178/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-05T01:07:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzXacLh6Yfi3QRzewFlMntCbBmii3sdhezbm+A1XMIDkn934pZz2kOGNgFksibbcdvq6Wx34c4wef7OTMqQBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:12:51.705018Z"},"content_sha256":"38c65b04eb20c224fe6e69bf507dcfa85bf497a7e0c69709d5a2b5cb5a24915c","schema_version":"1.0","event_id":"sha256:38c65b04eb20c224fe6e69bf507dcfa85bf497a7e0c69709d5a2b5cb5a24915c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RG3GSMLLXQKU2NS3IO7ZHYGMYW/bundle.json","state_url":"https://pith.science/pith/RG3GSMLLXQKU2NS3IO7ZHYGMYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RG3GSMLLXQKU2NS3IO7ZHYGMYW/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-08-16T16:12:51Z","links":{"resolver":"https://pith.science/pith/RG3GSMLLXQKU2NS3IO7ZHYGMYW","bundle":"https://pith.science/pith/RG3GSMLLXQKU2NS3IO7ZHYGMYW/bundle.json","state":"https://pith.science/pith/RG3GSMLLXQKU2NS3IO7ZHYGMYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RG3GSMLLXQKU2NS3IO7ZHYGMYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RG3GSMLLXQKU2NS3IO7ZHYGMYW","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":"15519f87347233b44040615fa8f20c37db01636b46095da6adfdc4e99af14095","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-04T13:48:41Z","title_canon_sha256":"6a42a67f9684cefbf15c3a84b6371dffba265ef4395d74b0cdb70d0ef96ddeed"},"schema_version":"1.0","source":{"id":"1902.01178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01178","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01178v1","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01178","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"pith_short_12","alias_value":"RG3GSMLLXQKU","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"pith_short_16","alias_value":"RG3GSMLLXQKU2NS3","created_at":"2026-07-05T01:07:48Z"},{"alias_kind":"pith_short_8","alias_value":"RG3GSMLL","created_at":"2026-07-05T01:07:48Z"}],"graph_snapshots":[{"event_id":"sha256:38c65b04eb20c224fe6e69bf507dcfa85bf497a7e0c69709d5a2b5cb5a24915c","target":"graph","created_at":"2026-07-05T01:07:48Z","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/1902.01178/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Staircase codes (SCCs) are typically decoded using iterative bounded-distance decoding (BDD) and hard decisions. In this paper, a novel decoding algorithm is proposed, which partially uses soft information from the channel. The proposed algorithm is based on marking certain number of highly reliable and highly unreliable bits. These marked bits are used to improve the miscorrection-detection capability of the SCC decoder and the error-correcting capability of BDD. For SCCs with $2$-error-correcting Bose-Chaudhuri-Hocquenghem component codes, our algorithm improves upon standard SCC decoding by","authors_text":"Alex Alvarado, Bin Chen, Gabriele Liga, Jianqiang Li, Kun Xu, Xiong Deng, Yi Lei, Zizheng Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-04T13:48:41Z","title":"Improved Decoding of Staircase Codes: The Soft-aided Bit-marking (SABM) Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01178","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:60da2bd1ca6dd82d8adef4dd9533c1e1b4150c3698b436bbb62173edde13ca65","target":"record","created_at":"2026-07-05T01:07:48Z","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":"15519f87347233b44040615fa8f20c37db01636b46095da6adfdc4e99af14095","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-04T13:48:41Z","title_canon_sha256":"6a42a67f9684cefbf15c3a84b6371dffba265ef4395d74b0cdb70d0ef96ddeed"},"schema_version":"1.0","source":{"id":"1902.01178","kind":"arxiv","version":1}},"canonical_sha256":"89b669316bbc154d365b43bf93e0ccc58e0347c5d261348c0d76a0fd7f286fcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89b669316bbc154d365b43bf93e0ccc58e0347c5d261348c0d76a0fd7f286fcb","first_computed_at":"2026-07-05T01:07:48.665900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:07:48.665900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+uqYMCB83oV080+DtdFFwYZ7UEOi7xj21SqIw4Z8tkOumzHIhcO4VNGTJ6gPwqJ/GCihenurrRjkqX9LkZAmBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:07:48.666388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60da2bd1ca6dd82d8adef4dd9533c1e1b4150c3698b436bbb62173edde13ca65","sha256:38c65b04eb20c224fe6e69bf507dcfa85bf497a7e0c69709d5a2b5cb5a24915c"],"state_sha256":"8a4356a9ed94e8a41904388563979f81f151042d80ab4fbfb6d121e876f1d770"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5zi4/tV6FqdXhQOSWGAeQum/NqoUeWQAeglFbzezYueBsF7bMd6Z2wTu524XsVuoTdeG5Hih/OevySLw1mIsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:12:51.710088Z","bundle_sha256":"5d276b6ff431363bee859c88f76913e6123d2627cf9bcb692b5c218653aae6d3"}}