{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:K22WANTVTW27JAIHSMRG7EQRXH","short_pith_number":"pith:K22WANTV","canonical_record":{"source":{"id":"1503.08913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T04:44:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25a9048bdd1110f1c5e61a864b3f0e68796f5799c6597a8798cf5a0c8f195adf","abstract_canon_sha256":"8ccb96a68d9d8652eeb317bbfce1f0fd53520788baa9bd7a6b2d7d573f498c0d"},"schema_version":"1.0"},"canonical_sha256":"56b56036759db5f4810793226f9211b9eed780e3f04160afdab30cf874f08e76","source":{"kind":"arxiv","id":"1503.08913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08913","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08913v1","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08913","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"K22WANTVTW27","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K22WANTVTW27JAIH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K22WANTV","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:K22WANTVTW27JAIHSMRG7EQRXH","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T04:44:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25a9048bdd1110f1c5e61a864b3f0e68796f5799c6597a8798cf5a0c8f195adf","abstract_canon_sha256":"8ccb96a68d9d8652eeb317bbfce1f0fd53520788baa9bd7a6b2d7d573f498c0d"},"schema_version":"1.0"},"canonical_sha256":"56b56036759db5f4810793226f9211b9eed780e3f04160afdab30cf874f08e76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:51.872516Z","signature_b64":"h6JMp9wmW2e/kvtz6rMYU1OnbCE8fOiReWfT4zz7IsMOehy4kWTumaJGuTGMb9s6gLbo33HIXTk9kF9QF6CHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56b56036759db5f4810793226f9211b9eed780e3f04160afdab30cf874f08e76","last_reissued_at":"2026-05-18T02:19:51.871882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:51.871882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08913","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-05-18T02:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fuiTRwCMxWiYGu5YjPaP+XWzRehgG88FrnxPj6rDTqZJaxDh60c82+5YWdfPRPbw71QK/dT0XEO4/jINVxm5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:54:50.450404Z"},"content_sha256":"7a59b8e4736298972c7836e81f8af8c65b928e5a1ecbb83cb4198d2229e72670","schema_version":"1.0","event_id":"sha256:7a59b8e4736298972c7836e81f8af8c65b928e5a1ecbb83cb4198d2229e72670"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:K22WANTVTW27JAIHSMRG7EQRXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding LDPC codes via Noisy Gradient Descent Bit-Flipping with Re-Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chris Winstead, Gopalakrishnan Sundararajan, Tasnuva Tithi","submitted_at":"2015-03-31T04:44:32Z","abstract_excerpt":"In this paper, we consider the performance of the Noisy Gradient Descent Bit Flipping (NGDBF) algorithm under re-decoding of failed frames. NGDBF is a recent algorithm that uses a non-deterministic gradient descent search to decode low-density parity check (LDPC) codes. The proposed re-decode procedure obtains improved performance because the perturbations are independent at each re-decoding phase, therefore increasing the likelihood of successful decoding. We examine the benefits of re-decoding for an LDPC code from the IEEE 802.3an standard, and find that only a small fraction of re-decoded "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08913","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"},"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-05-18T02:19:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUk+JhRITW1G1rDwYVz91wZ6QIiFmlse5y2gbCNUCODB5E74TdOuj7D5mCUMyhKQ8fJ6uHbpymnK5olK1+OWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:54:50.450749Z"},"content_sha256":"86ac09bd232858f730939c7e25d3f9c2ad0adeb673123b2c05be2370b271930b","schema_version":"1.0","event_id":"sha256:86ac09bd232858f730939c7e25d3f9c2ad0adeb673123b2c05be2370b271930b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K22WANTVTW27JAIHSMRG7EQRXH/bundle.json","state_url":"https://pith.science/pith/K22WANTVTW27JAIHSMRG7EQRXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K22WANTVTW27JAIHSMRG7EQRXH/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-06-27T06:54:50Z","links":{"resolver":"https://pith.science/pith/K22WANTVTW27JAIHSMRG7EQRXH","bundle":"https://pith.science/pith/K22WANTVTW27JAIHSMRG7EQRXH/bundle.json","state":"https://pith.science/pith/K22WANTVTW27JAIHSMRG7EQRXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K22WANTVTW27JAIHSMRG7EQRXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:K22WANTVTW27JAIHSMRG7EQRXH","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":"8ccb96a68d9d8652eeb317bbfce1f0fd53520788baa9bd7a6b2d7d573f498c0d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T04:44:32Z","title_canon_sha256":"25a9048bdd1110f1c5e61a864b3f0e68796f5799c6597a8798cf5a0c8f195adf"},"schema_version":"1.0","source":{"id":"1503.08913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08913","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08913v1","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08913","created_at":"2026-05-18T02:19:51Z"},{"alias_kind":"pith_short_12","alias_value":"K22WANTVTW27","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K22WANTVTW27JAIH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K22WANTV","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:86ac09bd232858f730939c7e25d3f9c2ad0adeb673123b2c05be2370b271930b","target":"graph","created_at":"2026-05-18T02:19:51Z","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"},"paper":{"abstract_excerpt":"In this paper, we consider the performance of the Noisy Gradient Descent Bit Flipping (NGDBF) algorithm under re-decoding of failed frames. NGDBF is a recent algorithm that uses a non-deterministic gradient descent search to decode low-density parity check (LDPC) codes. The proposed re-decode procedure obtains improved performance because the perturbations are independent at each re-decoding phase, therefore increasing the likelihood of successful decoding. We examine the benefits of re-decoding for an LDPC code from the IEEE 802.3an standard, and find that only a small fraction of re-decoded ","authors_text":"Chris Winstead, Gopalakrishnan Sundararajan, Tasnuva Tithi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T04:44:32Z","title":"Decoding LDPC codes via Noisy Gradient Descent Bit-Flipping with Re-Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08913","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:7a59b8e4736298972c7836e81f8af8c65b928e5a1ecbb83cb4198d2229e72670","target":"record","created_at":"2026-05-18T02:19:51Z","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":"8ccb96a68d9d8652eeb317bbfce1f0fd53520788baa9bd7a6b2d7d573f498c0d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-31T04:44:32Z","title_canon_sha256":"25a9048bdd1110f1c5e61a864b3f0e68796f5799c6597a8798cf5a0c8f195adf"},"schema_version":"1.0","source":{"id":"1503.08913","kind":"arxiv","version":1}},"canonical_sha256":"56b56036759db5f4810793226f9211b9eed780e3f04160afdab30cf874f08e76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56b56036759db5f4810793226f9211b9eed780e3f04160afdab30cf874f08e76","first_computed_at":"2026-05-18T02:19:51.871882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:51.871882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h6JMp9wmW2e/kvtz6rMYU1OnbCE8fOiReWfT4zz7IsMOehy4kWTumaJGuTGMb9s6gLbo33HIXTk9kF9QF6CHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:51.872516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a59b8e4736298972c7836e81f8af8c65b928e5a1ecbb83cb4198d2229e72670","sha256:86ac09bd232858f730939c7e25d3f9c2ad0adeb673123b2c05be2370b271930b"],"state_sha256":"4f2a4307a809c8f401e05815ff747aec64c157edf3f55cbec2e1c7418e6e9119"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8W5tWTqJpI7TrR2+PG3x4ObXEWIJbH40ycaOxBe0tQiFvTPfIEGjn7rsOL0l7l0635lqa1JUWFlMN8CcBuxYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:54:50.452563Z","bundle_sha256":"6d2eb499530407d01f776506ee44bf0f2cc4e1092f6235d5dac5215b7329aaf5"}}