{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UPKGSVL6C6XYKFTWVVY2LRVNV7","short_pith_number":"pith:UPKGSVL6","canonical_record":{"source":{"id":"1802.06481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-19T01:30:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"304c69278a938ca068f52f563178affa72319326bcf8e37c3eb82a487fc37636","abstract_canon_sha256":"bf4196cf82ae82497d18118206808c0e57f2a0b93449b8a9091e09fbbfcc7224"},"schema_version":"1.0"},"canonical_sha256":"a3d469557e17af851676ad71a5c6adaff636823ee857cc0b4d6a5d606becb3f6","source":{"kind":"arxiv","id":"1802.06481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06481","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06481v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06481","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"UPKGSVL6C6XY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UPKGSVL6C6XYKFTW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UPKGSVL6","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UPKGSVL6C6XYKFTWVVY2LRVNV7","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-19T01:30:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"304c69278a938ca068f52f563178affa72319326bcf8e37c3eb82a487fc37636","abstract_canon_sha256":"bf4196cf82ae82497d18118206808c0e57f2a0b93449b8a9091e09fbbfcc7224"},"schema_version":"1.0"},"canonical_sha256":"a3d469557e17af851676ad71a5c6adaff636823ee857cc0b4d6a5d606becb3f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.159075Z","signature_b64":"d+A4CDaclPVPh1xsCvEZRYBpePzk3YyfoZoaR0w1sEfZMyFfqPcs0rtQ1ixTC77Liwa7gvmAQZDYEuSgP3iMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3d469557e17af851676ad71a5c6adaff636823ee857cc0b4d6a5d606becb3f6","last_reissued_at":"2026-05-18T00:23:03.158374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.158374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06481","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:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrYr6q3XRT0KqS9p8GeBRpr6+byihESPw6XtYXbnOgX5OxX3+uAC7Gm+Jks4oowCwpTL/+o9oC91vQnWnVa1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:28:45.501049Z"},"content_sha256":"e14d1f2d9586d912d7e59f91ef14bf96d6eb9986e4821d42c185b4752e46b97f","schema_version":"1.0","event_id":"sha256:e14d1f2d9586d912d7e59f91ef14bf96d6eb9986e4821d42c185b4752e46b97f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UPKGSVL6C6XYKFTWVVY2LRVNV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite-Length Construction of High Performance Spatially-Coupled Codes via Optimized Partitioning and Lifting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Hareedy, Homa Esfahanizadeh, Lara Dolecek","submitted_at":"2018-02-19T01:30:33Z","abstract_excerpt":"Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying block code into a number of components and coupling their copies together. In this paper, we first introduce a general approach for the enumeration of detrimental combinatorial objects in the graph of finite-length SC codes. Our approach is general in the sense that it effectively works for SC codes with various column weights and memories. Next, we present a tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06481","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:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ycofvt2bMzntpgmn+ugD6JlCUjzrpD6KtJ/KE29Lz+2mPbefywJz2Ieto24udw+qeiDZmA+WIQ4/XnQPal3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:28:45.501694Z"},"content_sha256":"0e58893cfb5d001c2e01b875116b27bbaf7cb004ef51ae8dda06ea90c351c550","schema_version":"1.0","event_id":"sha256:0e58893cfb5d001c2e01b875116b27bbaf7cb004ef51ae8dda06ea90c351c550"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/bundle.json","state_url":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/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-05-31T14:28:45Z","links":{"resolver":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7","bundle":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/bundle.json","state":"https://pith.science/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPKGSVL6C6XYKFTWVVY2LRVNV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UPKGSVL6C6XYKFTWVVY2LRVNV7","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":"bf4196cf82ae82497d18118206808c0e57f2a0b93449b8a9091e09fbbfcc7224","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-19T01:30:33Z","title_canon_sha256":"304c69278a938ca068f52f563178affa72319326bcf8e37c3eb82a487fc37636"},"schema_version":"1.0","source":{"id":"1802.06481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06481","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06481v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06481","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"UPKGSVL6C6XY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UPKGSVL6C6XYKFTW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UPKGSVL6","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:0e58893cfb5d001c2e01b875116b27bbaf7cb004ef51ae8dda06ea90c351c550","target":"graph","created_at":"2026-05-18T00:23:03Z","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":"Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying block code into a number of components and coupling their copies together. In this paper, we first introduce a general approach for the enumeration of detrimental combinatorial objects in the graph of finite-length SC codes. Our approach is general in the sense that it effectively works for SC codes with various column weights and memories. Next, we present a tw","authors_text":"Ahmed Hareedy, Homa Esfahanizadeh, Lara Dolecek","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-19T01:30:33Z","title":"Finite-Length Construction of High Performance Spatially-Coupled Codes via Optimized Partitioning and Lifting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06481","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:e14d1f2d9586d912d7e59f91ef14bf96d6eb9986e4821d42c185b4752e46b97f","target":"record","created_at":"2026-05-18T00:23:03Z","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":"bf4196cf82ae82497d18118206808c0e57f2a0b93449b8a9091e09fbbfcc7224","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-19T01:30:33Z","title_canon_sha256":"304c69278a938ca068f52f563178affa72319326bcf8e37c3eb82a487fc37636"},"schema_version":"1.0","source":{"id":"1802.06481","kind":"arxiv","version":1}},"canonical_sha256":"a3d469557e17af851676ad71a5c6adaff636823ee857cc0b4d6a5d606becb3f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3d469557e17af851676ad71a5c6adaff636823ee857cc0b4d6a5d606becb3f6","first_computed_at":"2026-05-18T00:23:03.158374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.158374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d+A4CDaclPVPh1xsCvEZRYBpePzk3YyfoZoaR0w1sEfZMyFfqPcs0rtQ1ixTC77Liwa7gvmAQZDYEuSgP3iMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.159075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e14d1f2d9586d912d7e59f91ef14bf96d6eb9986e4821d42c185b4752e46b97f","sha256:0e58893cfb5d001c2e01b875116b27bbaf7cb004ef51ae8dda06ea90c351c550"],"state_sha256":"5a5e806ee7725a300f3dadd6df1c84e2e20602e417ab67485935b989459ab296"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eD9p+2W/esbHRBdJzFiVRN3j5EqlbwVXtE+2Pr88HuavFkKrdtWQzAkSsUV7Vn6+LJGNV/JupJp1J/be9T53BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:28:45.505675Z","bundle_sha256":"e27fa76e6c806dab9169747675f7a21fbe0690884d79ab99cb01862a6464a6f7"}}