{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7YBGJUF4HXMOMKHSTT5LLSIC3L","short_pith_number":"pith:7YBGJUF4","canonical_record":{"source":{"id":"1611.05975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-18T05:02:41Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"ca7d2cfa6d3b1587a7192b5a3fc1cf8836338fe4f0d067acd53dd03a714f0d93","abstract_canon_sha256":"d4675c3d4be11974925e6d387badc2f6da2c99af454d526fddfd544007f4e7a6"},"schema_version":"1.0"},"canonical_sha256":"fe0264d0bc3dd8e628f29cfab5c902dadb2464ffb5ae4c05b6589fcec992f8e7","source":{"kind":"arxiv","id":"1611.05975","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05975","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05975v1","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05975","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"7YBGJUF4HXMO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7YBGJUF4HXMOMKHS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7YBGJUF4","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7YBGJUF4HXMOMKHSTT5LLSIC3L","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-18T05:02:41Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"ca7d2cfa6d3b1587a7192b5a3fc1cf8836338fe4f0d067acd53dd03a714f0d93","abstract_canon_sha256":"d4675c3d4be11974925e6d387badc2f6da2c99af454d526fddfd544007f4e7a6"},"schema_version":"1.0"},"canonical_sha256":"fe0264d0bc3dd8e628f29cfab5c902dadb2464ffb5ae4c05b6589fcec992f8e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:43.359029Z","signature_b64":"fX10aMJil7qH42BwpEWhJl0djvsDXmydMm+5j2NYjMgq52L5yM6hWR22JvAK7viM928m4UTgdqAMFIhJEEJtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe0264d0bc3dd8e628f29cfab5c902dadb2464ffb5ae4c05b6589fcec992f8e7","last_reissued_at":"2026-05-18T00:57:43.358464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:43.358464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05975","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-18T00:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xC3Q488dztvVYAufcFdxL27Hj98XYjqeLOJ1qTdHLROcs6EHgGHgNyC0uBfYorQhXGCTG6Lx/tRC6SDY6f1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:55:50.771874Z"},"content_sha256":"9889e6a8a6ed9c14db0f57c0afb8875af26c44f6df102df92d46507f89620804","schema_version":"1.0","event_id":"sha256:9889e6a8a6ed9c14db0f57c0afb8875af26c44f6df102df92d46507f89620804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7YBGJUF4HXMOMKHSTT5LLSIC3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardware-Based Linear Program Decoding with the Alternating Direction Method of Multipliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Glenn Gulak, Mario Milicevic, Mitchell Wasson, Stark C. Draper","submitted_at":"2016-11-18T05:02:41Z","abstract_excerpt":"We present a hardware-based implementation of Linear Program (LP) decoding for binary linear codes. LP decoding frames error-correction as an optimization problem. In contrast, variants of Belief Propagation (BP) decoding frame error-correction as a problem of graphical inference. LP decoding has several advantages over BP-based methods, including convergence guarantees and better error-rate performance in high-reliability channels. The latter makes LP decoding attractive for optical transport and storage applications. However, LP decoding, when implemented with general solvers, does not scale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05975","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-18T00:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"io+FhhuSbwIQe5Sh7JePGhY2KO9bo5lS5uUx4OBMEpuBHRSuaMjjtSRLih+v5hUtCOGsv4oZNpIJtg4wDPykBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:55:50.772571Z"},"content_sha256":"89e4602907494171f1a7fbaead238d695bf36368a6029663af359bc7c4b6bb07","schema_version":"1.0","event_id":"sha256:89e4602907494171f1a7fbaead238d695bf36368a6029663af359bc7c4b6bb07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YBGJUF4HXMOMKHSTT5LLSIC3L/bundle.json","state_url":"https://pith.science/pith/7YBGJUF4HXMOMKHSTT5LLSIC3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YBGJUF4HXMOMKHSTT5LLSIC3L/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-05T03:55:50Z","links":{"resolver":"https://pith.science/pith/7YBGJUF4HXMOMKHSTT5LLSIC3L","bundle":"https://pith.science/pith/7YBGJUF4HXMOMKHSTT5LLSIC3L/bundle.json","state":"https://pith.science/pith/7YBGJUF4HXMOMKHSTT5LLSIC3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YBGJUF4HXMOMKHSTT5LLSIC3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7YBGJUF4HXMOMKHSTT5LLSIC3L","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":"d4675c3d4be11974925e6d387badc2f6da2c99af454d526fddfd544007f4e7a6","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-18T05:02:41Z","title_canon_sha256":"ca7d2cfa6d3b1587a7192b5a3fc1cf8836338fe4f0d067acd53dd03a714f0d93"},"schema_version":"1.0","source":{"id":"1611.05975","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05975","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05975v1","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05975","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"7YBGJUF4HXMO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7YBGJUF4HXMOMKHS","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7YBGJUF4","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:89e4602907494171f1a7fbaead238d695bf36368a6029663af359bc7c4b6bb07","target":"graph","created_at":"2026-05-18T00:57:43Z","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":"We present a hardware-based implementation of Linear Program (LP) decoding for binary linear codes. LP decoding frames error-correction as an optimization problem. In contrast, variants of Belief Propagation (BP) decoding frame error-correction as a problem of graphical inference. LP decoding has several advantages over BP-based methods, including convergence guarantees and better error-rate performance in high-reliability channels. The latter makes LP decoding attractive for optical transport and storage applications. However, LP decoding, when implemented with general solvers, does not scale","authors_text":"Glenn Gulak, Mario Milicevic, Mitchell Wasson, Stark C. Draper","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-18T05:02:41Z","title":"Hardware-Based Linear Program Decoding with the Alternating Direction Method of Multipliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05975","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:9889e6a8a6ed9c14db0f57c0afb8875af26c44f6df102df92d46507f89620804","target":"record","created_at":"2026-05-18T00:57:43Z","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":"d4675c3d4be11974925e6d387badc2f6da2c99af454d526fddfd544007f4e7a6","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-18T05:02:41Z","title_canon_sha256":"ca7d2cfa6d3b1587a7192b5a3fc1cf8836338fe4f0d067acd53dd03a714f0d93"},"schema_version":"1.0","source":{"id":"1611.05975","kind":"arxiv","version":1}},"canonical_sha256":"fe0264d0bc3dd8e628f29cfab5c902dadb2464ffb5ae4c05b6589fcec992f8e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe0264d0bc3dd8e628f29cfab5c902dadb2464ffb5ae4c05b6589fcec992f8e7","first_computed_at":"2026-05-18T00:57:43.358464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:43.358464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fX10aMJil7qH42BwpEWhJl0djvsDXmydMm+5j2NYjMgq52L5yM6hWR22JvAK7viM928m4UTgdqAMFIhJEEJtCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:43.359029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05975","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9889e6a8a6ed9c14db0f57c0afb8875af26c44f6df102df92d46507f89620804","sha256:89e4602907494171f1a7fbaead238d695bf36368a6029663af359bc7c4b6bb07"],"state_sha256":"e4d76b05198cef4b7262a0fdba7af2d9f7b93ec9c14d51cb5692eae7663b43da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUcG8RVQkTPiG5mm+WBxFenOqYSwe4ozfQXl2MuPyn3gTpzTtEG5w7YXoxGLhVptC+p5Y+J17Xem8Bb8uMPyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:55:50.776236Z","bundle_sha256":"4e3a17b7b28b21bdfa9e1375fba8994b64f5e732397d7f5484e930d3d7d54d1d"}}