{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:X7UUNTGRM75GA6JYVVA6HPPYXK","short_pith_number":"pith:X7UUNTGR","canonical_record":{"source":{"id":"1105.6374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T19:48:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"208018d2442d05be914a309f647bf96037c8c2108c5825885728857d7a6b3c54","abstract_canon_sha256":"324d2306dc916be4cdb0fccbcc0ac505a8fc6976e6bf2b184f2ff8e4932622af"},"schema_version":"1.0"},"canonical_sha256":"bfe946ccd167fa607938ad41e3bdf8ba9efee1727cb8b5324d47dbfb2e4bae81","source":{"kind":"arxiv","id":"1105.6374","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6374","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6374v1","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6374","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"X7UUNTGRM75G","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X7UUNTGRM75GA6JY","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X7UUNTGR","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:X7UUNTGRM75GA6JYVVA6HPPYXK","target":"record","payload":{"canonical_record":{"source":{"id":"1105.6374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T19:48:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"208018d2442d05be914a309f647bf96037c8c2108c5825885728857d7a6b3c54","abstract_canon_sha256":"324d2306dc916be4cdb0fccbcc0ac505a8fc6976e6bf2b184f2ff8e4932622af"},"schema_version":"1.0"},"canonical_sha256":"bfe946ccd167fa607938ad41e3bdf8ba9efee1727cb8b5324d47dbfb2e4bae81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:59.622351Z","signature_b64":"656BJRREXCx1YNm5lutNPYU4tw+RwuI0PmFiHHkiQMwvt28WHKNwhrqYZH/znCjeqPgCgav6kqBqxHoRXhhAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfe946ccd167fa607938ad41e3bdf8ba9efee1727cb8b5324d47dbfb2e4bae81","last_reissued_at":"2026-05-18T04:20:59.621723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:59.621723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.6374","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-18T04:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pmy9tEDEG0jFRiJ5VXwGWkz06SAxad8qng3PfpCN3Th4ThKh4us6e381fvZdWj7iLSyfsddRjQ/WTHor2A2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:11:55.211806Z"},"content_sha256":"fff2eaf77105044ce92b9f0c801edd800565410e38432e95526608eb115613d5","schema_version":"1.0","event_id":"sha256:fff2eaf77105044ce92b9f0c801edd800565410e38432e95526608eb115613d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:X7UUNTGRM75GA6JYVVA6HPPYXK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universality for the Noisy Slepian-Wolf Problem Via Spatial Coupling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arvind Yedla, Henry D. Pfister, Krishna Narayanan","submitted_at":"2011-05-31T19:48:17Z","abstract_excerpt":"We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded and transmitted over two independent binary memoryless symmetric channels. Each channel capacity is assumed to be characterized by a single parameter which is not known at the transmitter. The receiver has knowledge of both the source correlation and the channel parameters. We call a system universal if it retains near-capacity performance without channel knowledge at the transmitter. Kudekar et al. recently showed that terminated low-density parity-check (LDPC) convolutional codes (a.k.a. spatially-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6374","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-18T04:20:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3bvX5v1TFKaKVj6WsOvDGkR+ru1BCw9Wcqn8I5sUUDHL7pglocnjupbRqmE4ikmGc/EWzGRJa9yLXY8lOkLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:11:55.212157Z"},"content_sha256":"5ba0588ef435ef2bcad853ed8195f6c42bdd4d57a13226f460544a9672a1e6e7","schema_version":"1.0","event_id":"sha256:5ba0588ef435ef2bcad853ed8195f6c42bdd4d57a13226f460544a9672a1e6e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7UUNTGRM75GA6JYVVA6HPPYXK/bundle.json","state_url":"https://pith.science/pith/X7UUNTGRM75GA6JYVVA6HPPYXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7UUNTGRM75GA6JYVVA6HPPYXK/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-02T02:11:55Z","links":{"resolver":"https://pith.science/pith/X7UUNTGRM75GA6JYVVA6HPPYXK","bundle":"https://pith.science/pith/X7UUNTGRM75GA6JYVVA6HPPYXK/bundle.json","state":"https://pith.science/pith/X7UUNTGRM75GA6JYVVA6HPPYXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7UUNTGRM75GA6JYVVA6HPPYXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:X7UUNTGRM75GA6JYVVA6HPPYXK","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":"324d2306dc916be4cdb0fccbcc0ac505a8fc6976e6bf2b184f2ff8e4932622af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T19:48:17Z","title_canon_sha256":"208018d2442d05be914a309f647bf96037c8c2108c5825885728857d7a6b3c54"},"schema_version":"1.0","source":{"id":"1105.6374","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6374","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6374v1","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6374","created_at":"2026-05-18T04:20:59Z"},{"alias_kind":"pith_short_12","alias_value":"X7UUNTGRM75G","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"X7UUNTGRM75GA6JY","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"X7UUNTGR","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:5ba0588ef435ef2bcad853ed8195f6c42bdd4d57a13226f460544a9672a1e6e7","target":"graph","created_at":"2026-05-18T04:20:59Z","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 consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded and transmitted over two independent binary memoryless symmetric channels. Each channel capacity is assumed to be characterized by a single parameter which is not known at the transmitter. The receiver has knowledge of both the source correlation and the channel parameters. We call a system universal if it retains near-capacity performance without channel knowledge at the transmitter. Kudekar et al. recently showed that terminated low-density parity-check (LDPC) convolutional codes (a.k.a. spatially-co","authors_text":"Arvind Yedla, Henry D. Pfister, Krishna Narayanan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T19:48:17Z","title":"Universality for the Noisy Slepian-Wolf Problem Via Spatial Coupling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6374","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:fff2eaf77105044ce92b9f0c801edd800565410e38432e95526608eb115613d5","target":"record","created_at":"2026-05-18T04:20:59Z","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":"324d2306dc916be4cdb0fccbcc0ac505a8fc6976e6bf2b184f2ff8e4932622af","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T19:48:17Z","title_canon_sha256":"208018d2442d05be914a309f647bf96037c8c2108c5825885728857d7a6b3c54"},"schema_version":"1.0","source":{"id":"1105.6374","kind":"arxiv","version":1}},"canonical_sha256":"bfe946ccd167fa607938ad41e3bdf8ba9efee1727cb8b5324d47dbfb2e4bae81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfe946ccd167fa607938ad41e3bdf8ba9efee1727cb8b5324d47dbfb2e4bae81","first_computed_at":"2026-05-18T04:20:59.621723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:59.621723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"656BJRREXCx1YNm5lutNPYU4tw+RwuI0PmFiHHkiQMwvt28WHKNwhrqYZH/znCjeqPgCgav6kqBqxHoRXhhAAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:59.622351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.6374","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fff2eaf77105044ce92b9f0c801edd800565410e38432e95526608eb115613d5","sha256:5ba0588ef435ef2bcad853ed8195f6c42bdd4d57a13226f460544a9672a1e6e7"],"state_sha256":"c57372361f4060fa5d64b92b75cb1d67a1d6fbee7e0fb9ad40d4e4edbeefd8d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BaVgvLfvICenVXR055oXAK9uHbpEI1jB8Z5fUD8/g69FLWP90MpDgVEiBE28+zdC4ejNEcFbROoITdXezpgpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:11:55.214236Z","bundle_sha256":"d34170f4186398f1c78910f15a8c680a6e34574d8e7d0f908d002ed60ebb98a3"}}