{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6LUZHBQVLBRHFXIPNVG7VREIBD","short_pith_number":"pith:6LUZHBQV","canonical_record":{"source":{"id":"1108.1161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-04T18:32:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ff6fef743907c74314a01cac007f425238884cbd03681a822bf530cfde94ab4","abstract_canon_sha256":"3d20919854c268420c434fb76c0dd4b89a11791af5b36ba9ba405be0cbec6f77"},"schema_version":"1.0"},"canonical_sha256":"f2e9938615586272dd0f6d4dfac48808fe582ebb58f9662f5c39c9ef19fc6672","source":{"kind":"arxiv","id":"1108.1161","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1161","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1161v1","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1161","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"pith_short_12","alias_value":"6LUZHBQVLBRH","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6LUZHBQVLBRHFXIP","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6LUZHBQV","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6LUZHBQVLBRHFXIPNVG7VREIBD","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-04T18:32:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ff6fef743907c74314a01cac007f425238884cbd03681a822bf530cfde94ab4","abstract_canon_sha256":"3d20919854c268420c434fb76c0dd4b89a11791af5b36ba9ba405be0cbec6f77"},"schema_version":"1.0"},"canonical_sha256":"f2e9938615586272dd0f6d4dfac48808fe582ebb58f9662f5c39c9ef19fc6672","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:12.579404Z","signature_b64":"A4/uaYGCegCc721ry4zE3VOaqpeirp+7pXkDLqv/GdOsAIGUlN9HWmXVWbpIE+Gs0OYexKRPbyrrjC9tsRskDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2e9938615586272dd0f6d4dfac48808fe582ebb58f9662f5c39c9ef19fc6672","last_reissued_at":"2026-05-18T04:16:12.578826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:12.578826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1161","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:16:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2ycJdJauBwni5MOOREPVFy8Ips+rVeO0bkm36vh3jka7n5FSs/MJFADDLJA7J0OLQrgJ8tnPhJVPXbFAUL5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:18:33.253183Z"},"content_sha256":"cf53e976f1e5e8390cdf8f2a6e79de1d013d406bd24340ba2b012fa88a66fd41","schema_version":"1.0","event_id":"sha256:cf53e976f1e5e8390cdf8f2a6e79de1d013d406bd24340ba2b012fa88a66fd41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6LUZHBQVLBRHFXIPNVG7VREIBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On generic erasure correcting sets and related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Harout Aydinian, Rudolf Ahlswede","submitted_at":"2011-08-04T18:32:19Z","abstract_excerpt":"Motivated by iterative decoding techniques for the binary erasure channel Hollmann and Tolhuizen introduced and studied the notion of generic erasure correcting sets for linear codes. A generic $(r,s)$--erasure correcting set generates for all codes of codimension $r$ a parity check matrix that allows iterative decoding of all correctable erasure patterns of size $s$ or less. The problem is to derive bounds on the minimum size $F(r,s)$ of generic erasure correcting sets and to find constructions for such sets. In this paper we continue the study of these sets. We derive better lower and upper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1161","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:16:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rN2UFn3YxvCIhp16yHi/TKDDFR+Oqi7TUZu/XnSZXelXEd4P2y61+T8ROvJawVqyg4J2bFxSQsrNwettJ1btDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:18:33.253575Z"},"content_sha256":"018dc87b5a3e03fb03fc2e22d0ed333aaf40251b89f496441aa6582e0f69eb37","schema_version":"1.0","event_id":"sha256:018dc87b5a3e03fb03fc2e22d0ed333aaf40251b89f496441aa6582e0f69eb37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LUZHBQVLBRHFXIPNVG7VREIBD/bundle.json","state_url":"https://pith.science/pith/6LUZHBQVLBRHFXIPNVG7VREIBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LUZHBQVLBRHFXIPNVG7VREIBD/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-04T19:18:33Z","links":{"resolver":"https://pith.science/pith/6LUZHBQVLBRHFXIPNVG7VREIBD","bundle":"https://pith.science/pith/6LUZHBQVLBRHFXIPNVG7VREIBD/bundle.json","state":"https://pith.science/pith/6LUZHBQVLBRHFXIPNVG7VREIBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LUZHBQVLBRHFXIPNVG7VREIBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6LUZHBQVLBRHFXIPNVG7VREIBD","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":"3d20919854c268420c434fb76c0dd4b89a11791af5b36ba9ba405be0cbec6f77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-04T18:32:19Z","title_canon_sha256":"4ff6fef743907c74314a01cac007f425238884cbd03681a822bf530cfde94ab4"},"schema_version":"1.0","source":{"id":"1108.1161","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1161","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1161v1","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1161","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"pith_short_12","alias_value":"6LUZHBQVLBRH","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6LUZHBQVLBRHFXIP","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6LUZHBQV","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:018dc87b5a3e03fb03fc2e22d0ed333aaf40251b89f496441aa6582e0f69eb37","target":"graph","created_at":"2026-05-18T04:16:12Z","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":"Motivated by iterative decoding techniques for the binary erasure channel Hollmann and Tolhuizen introduced and studied the notion of generic erasure correcting sets for linear codes. A generic $(r,s)$--erasure correcting set generates for all codes of codimension $r$ a parity check matrix that allows iterative decoding of all correctable erasure patterns of size $s$ or less. The problem is to derive bounds on the minimum size $F(r,s)$ of generic erasure correcting sets and to find constructions for such sets. In this paper we continue the study of these sets. We derive better lower and upper ","authors_text":"Harout Aydinian, Rudolf Ahlswede","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-04T18:32:19Z","title":"On generic erasure correcting sets and related problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1161","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:cf53e976f1e5e8390cdf8f2a6e79de1d013d406bd24340ba2b012fa88a66fd41","target":"record","created_at":"2026-05-18T04:16:12Z","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":"3d20919854c268420c434fb76c0dd4b89a11791af5b36ba9ba405be0cbec6f77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-04T18:32:19Z","title_canon_sha256":"4ff6fef743907c74314a01cac007f425238884cbd03681a822bf530cfde94ab4"},"schema_version":"1.0","source":{"id":"1108.1161","kind":"arxiv","version":1}},"canonical_sha256":"f2e9938615586272dd0f6d4dfac48808fe582ebb58f9662f5c39c9ef19fc6672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2e9938615586272dd0f6d4dfac48808fe582ebb58f9662f5c39c9ef19fc6672","first_computed_at":"2026-05-18T04:16:12.578826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:12.578826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A4/uaYGCegCc721ry4zE3VOaqpeirp+7pXkDLqv/GdOsAIGUlN9HWmXVWbpIE+Gs0OYexKRPbyrrjC9tsRskDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:12.579404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1161","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf53e976f1e5e8390cdf8f2a6e79de1d013d406bd24340ba2b012fa88a66fd41","sha256:018dc87b5a3e03fb03fc2e22d0ed333aaf40251b89f496441aa6582e0f69eb37"],"state_sha256":"bc499b9b906073ab25bed7c3568b57df660f8e420de4d3bbf343490bbb8666d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYARRFmsvaLV1In0vBvquLfzsgV3P+HIRXRc5QcfYZiUB92gnu6pqiOQzffjczaj++1O8dxj+PEtfChMW1w7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:18:33.255624Z","bundle_sha256":"c2286a0a5bbc307ccece7b11ccb733f8c9159f250ca165b846e1dbba60b422aa"}}