{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:KBDJBYHYTW4DGM6AVWQ2TQAUBE","short_pith_number":"pith:KBDJBYHY","canonical_record":{"source":{"id":"2111.00695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-01T04:32:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c41b6e5859825247196e3a0089cd3193f25b25968aad3e0ae67d1998328a2f33","abstract_canon_sha256":"5cda13b80a2b61586236c5b099edb17099db267591f01f4855ad202965ac8246"},"schema_version":"1.0"},"canonical_sha256":"504690e0f89db83333c0ada1a9c01409129e1394d61ebdbbfc4ff061498ab2a8","source":{"kind":"arxiv","id":"2111.00695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00695","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00695v1","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00695","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"KBDJBYHYTW4D","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"KBDJBYHYTW4DGM6A","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"KBDJBYHY","created_at":"2026-07-05T03:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:KBDJBYHYTW4DGM6AVWQ2TQAUBE","target":"record","payload":{"canonical_record":{"source":{"id":"2111.00695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-01T04:32:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c41b6e5859825247196e3a0089cd3193f25b25968aad3e0ae67d1998328a2f33","abstract_canon_sha256":"5cda13b80a2b61586236c5b099edb17099db267591f01f4855ad202965ac8246"},"schema_version":"1.0"},"canonical_sha256":"504690e0f89db83333c0ada1a9c01409129e1394d61ebdbbfc4ff061498ab2a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:45.819952Z","signature_b64":"GOn0uUlzR6Qf4XICTpMKk7ajbuWten811byrOut1C9UZOLUm3JJYSon6ngQUIPY6rBvVIlfFioCcwRHEGm2vBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"504690e0f89db83333c0ada1a9c01409129e1394d61ebdbbfc4ff061498ab2a8","last_reissued_at":"2026-07-05T03:27:45.819411Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:45.819411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.00695","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-05T03:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ooxkFpej3J+FdTvsOfqpXGizB7KnbJNJebM152bQ64cNCiiu2/Tr8rRUpiCc6eqzWzYYKHj65Wo2eX8Aip1eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T22:48:01.755459Z"},"content_sha256":"ff0a3c4a52571c018eb4ef9facc6ff7a3e261df0300888da0b3d22d70cb156cf","schema_version":"1.0","event_id":"sha256:ff0a3c4a52571c018eb4ef9facc6ff7a3e261df0300888da0b3d22d70cb156cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:KBDJBYHYTW4DGM6AVWQ2TQAUBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noise Error Pattern Generation Based on Successive Addition-Subtraction for Guessing Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang Wu, Jing Xu, Kan Yu, Ming Zhan, Zhibo Pang","submitted_at":"2021-11-01T04:32:26Z","abstract_excerpt":"Guessing random additive noise decoding (GRAND) algorithm has emerged as an excellent decoding strategy that can meet both the high reliability and low latency constraints. This paper proposes a successive addition-subtraction algorithm to generate noise error permutations. A noise error patterns generation scheme is presented by embedding the \"1\" and \"0\" bursts alternately. Then detailed procedures of the proposed algorithm are presented, and its correctness is also demonstrated through theoretical derivations. The aim of this work is to provide a preliminary paradigm and reference for future"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00695","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/2111.00695/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-05T03:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LyomOnostGHLYq4CnQCCbR7XwESI8kPT5rPXHb1nBHlupAlgq1pAXaAB9ogE4nP06POajq+e2G7y6aNM4ckNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T22:48:01.756046Z"},"content_sha256":"3e1d16e0f2028628c5624b7570d64bfa735c836f25eeebe5d49dfe55d3fc40bb","schema_version":"1.0","event_id":"sha256:3e1d16e0f2028628c5624b7570d64bfa735c836f25eeebe5d49dfe55d3fc40bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBDJBYHYTW4DGM6AVWQ2TQAUBE/bundle.json","state_url":"https://pith.science/pith/KBDJBYHYTW4DGM6AVWQ2TQAUBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBDJBYHYTW4DGM6AVWQ2TQAUBE/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-18T22:48:01Z","links":{"resolver":"https://pith.science/pith/KBDJBYHYTW4DGM6AVWQ2TQAUBE","bundle":"https://pith.science/pith/KBDJBYHYTW4DGM6AVWQ2TQAUBE/bundle.json","state":"https://pith.science/pith/KBDJBYHYTW4DGM6AVWQ2TQAUBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBDJBYHYTW4DGM6AVWQ2TQAUBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:KBDJBYHYTW4DGM6AVWQ2TQAUBE","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":"5cda13b80a2b61586236c5b099edb17099db267591f01f4855ad202965ac8246","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-01T04:32:26Z","title_canon_sha256":"c41b6e5859825247196e3a0089cd3193f25b25968aad3e0ae67d1998328a2f33"},"schema_version":"1.0","source":{"id":"2111.00695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00695","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00695v1","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00695","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"KBDJBYHYTW4D","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"KBDJBYHYTW4DGM6A","created_at":"2026-07-05T03:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"KBDJBYHY","created_at":"2026-07-05T03:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:3e1d16e0f2028628c5624b7570d64bfa735c836f25eeebe5d49dfe55d3fc40bb","target":"graph","created_at":"2026-07-05T03:27:45Z","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/2111.00695/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Guessing random additive noise decoding (GRAND) algorithm has emerged as an excellent decoding strategy that can meet both the high reliability and low latency constraints. This paper proposes a successive addition-subtraction algorithm to generate noise error permutations. A noise error patterns generation scheme is presented by embedding the \"1\" and \"0\" bursts alternately. Then detailed procedures of the proposed algorithm are presented, and its correctness is also demonstrated through theoretical derivations. The aim of this work is to provide a preliminary paradigm and reference for future","authors_text":"Fang Wu, Jing Xu, Kan Yu, Ming Zhan, Zhibo Pang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-01T04:32:26Z","title":"Noise Error Pattern Generation Based on Successive Addition-Subtraction for Guessing Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00695","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:ff0a3c4a52571c018eb4ef9facc6ff7a3e261df0300888da0b3d22d70cb156cf","target":"record","created_at":"2026-07-05T03:27:45Z","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":"5cda13b80a2b61586236c5b099edb17099db267591f01f4855ad202965ac8246","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-01T04:32:26Z","title_canon_sha256":"c41b6e5859825247196e3a0089cd3193f25b25968aad3e0ae67d1998328a2f33"},"schema_version":"1.0","source":{"id":"2111.00695","kind":"arxiv","version":1}},"canonical_sha256":"504690e0f89db83333c0ada1a9c01409129e1394d61ebdbbfc4ff061498ab2a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"504690e0f89db83333c0ada1a9c01409129e1394d61ebdbbfc4ff061498ab2a8","first_computed_at":"2026-07-05T03:27:45.819411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:27:45.819411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GOn0uUlzR6Qf4XICTpMKk7ajbuWten811byrOut1C9UZOLUm3JJYSon6ngQUIPY6rBvVIlfFioCcwRHEGm2vBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:27:45.819952Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.00695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff0a3c4a52571c018eb4ef9facc6ff7a3e261df0300888da0b3d22d70cb156cf","sha256:3e1d16e0f2028628c5624b7570d64bfa735c836f25eeebe5d49dfe55d3fc40bb"],"state_sha256":"386540b8e3efabc94cf1b6ca79cfee6bf413ab573c42199aafbf234b8bfcabbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLChAD1ipOCnQJH07f2EuyWBxS1bVweg0eE3C/nGRnJZXa1D0HahWpyjZvzsHaI8JX4Tj7erqJGryiNHivnlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T22:48:01.760690Z","bundle_sha256":"4cc22f97797595b98ddfda45dc5a6f7316ccc54ae0a5f0ae87c52fd563229802"}}