{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6FFLF7FW5O6U7N6NILSTTUVIHC","short_pith_number":"pith:6FFLF7FW","canonical_record":{"source":{"id":"1010.1911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T11:35:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8101d4accb55d336cd5b88d145328ae8595561906253402ed39ad7780b5a91c8","abstract_canon_sha256":"cdedc40407dc391b8cf1923036689fcd57cf1482cf66aa66ea16a3276d9c2326"},"schema_version":"1.0"},"canonical_sha256":"f14ab2fcb6ebbd4fb7cd42e539d2a83880d5ba0a7dbb4859ee402835a87d6ea2","source":{"kind":"arxiv","id":"1010.1911","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1911","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1911v1","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1911","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"6FFLF7FW5O6U","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6FFLF7FW5O6U7N6N","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6FFLF7FW","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6FFLF7FW5O6U7N6NILSTTUVIHC","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T11:35:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8101d4accb55d336cd5b88d145328ae8595561906253402ed39ad7780b5a91c8","abstract_canon_sha256":"cdedc40407dc391b8cf1923036689fcd57cf1482cf66aa66ea16a3276d9c2326"},"schema_version":"1.0"},"canonical_sha256":"f14ab2fcb6ebbd4fb7cd42e539d2a83880d5ba0a7dbb4859ee402835a87d6ea2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:30.065853Z","signature_b64":"qHcLDr3xdu+e8jsr79OsrpzvvIOjGuxTuGzyCTGrfoqU4X4kV+M8FSHtzEdayjR1+IFCLutxcEL1EH8YCDEmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f14ab2fcb6ebbd4fb7cd42e539d2a83880d5ba0a7dbb4859ee402835a87d6ea2","last_reissued_at":"2026-05-18T04:39:30.065362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:30.065362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1911","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:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8acjroAxhcv12jk9AUnqxts2k3pSJMBvy+tnFrJ05MOOzKqrlZBKSaDqah3PrByiDKhmEdKAonzubyA7kk4nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:58:00.464207Z"},"content_sha256":"c057ecacc990a1457a12f2160411e0dd46650ef9017b4d4f75c53819b933323c","schema_version":"1.0","event_id":"sha256:c057ecacc990a1457a12f2160411e0dd46650ef9017b4d4f75c53819b933323c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6FFLF7FW5O6U7N6NILSTTUVIHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Iryna Andriyanova, Jean-Pierre Tillich","submitted_at":"2010-10-10T11:35:45Z","abstract_excerpt":"This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured. The condition is formulated in terms of degree-1 and degree-2 variable nodes and of low-weight codewords of the underlying code, and it generalizies results known for turbo codes [8] and LDPC codes. Then, we present a new ensemble of low-rate codes, which itself is a subclass of TLDPC codes [4], [5], and which is designed under this necessary condition. The a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1911","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:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLtXC38hJ5tXbWt4beoh8Cmi1ZAsXd2IcKm/uHv/6hpmgxfURvblv3DQkISXpuJi0XuVIVoNNbmaeg2j8SzXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:58:00.464572Z"},"content_sha256":"dfe373203ea4370831475aa04b44444e82b848aa9e3789a4f0486513280ca7e5","schema_version":"1.0","event_id":"sha256:dfe373203ea4370831475aa04b44444e82b848aa9e3789a4f0486513280ca7e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FFLF7FW5O6U7N6NILSTTUVIHC/bundle.json","state_url":"https://pith.science/pith/6FFLF7FW5O6U7N6NILSTTUVIHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FFLF7FW5O6U7N6NILSTTUVIHC/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-07T03:58:00Z","links":{"resolver":"https://pith.science/pith/6FFLF7FW5O6U7N6NILSTTUVIHC","bundle":"https://pith.science/pith/6FFLF7FW5O6U7N6NILSTTUVIHC/bundle.json","state":"https://pith.science/pith/6FFLF7FW5O6U7N6NILSTTUVIHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FFLF7FW5O6U7N6NILSTTUVIHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6FFLF7FW5O6U7N6NILSTTUVIHC","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":"cdedc40407dc391b8cf1923036689fcd57cf1482cf66aa66ea16a3276d9c2326","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T11:35:45Z","title_canon_sha256":"8101d4accb55d336cd5b88d145328ae8595561906253402ed39ad7780b5a91c8"},"schema_version":"1.0","source":{"id":"1010.1911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1911","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1911v1","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1911","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"6FFLF7FW5O6U","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6FFLF7FW5O6U7N6N","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6FFLF7FW","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:dfe373203ea4370831475aa04b44444e82b848aa9e3789a4f0486513280ca7e5","target":"graph","created_at":"2026-05-18T04:39:30Z","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":"This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured. The condition is formulated in terms of degree-1 and degree-2 variable nodes and of low-weight codewords of the underlying code, and it generalizies results known for turbo codes [8] and LDPC codes. Then, we present a new ensemble of low-rate codes, which itself is a subclass of TLDPC codes [4], [5], and which is designed under this necessary condition. The a","authors_text":"Iryna Andriyanova, Jean-Pierre Tillich","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T11:35:45Z","title":"On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1911","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:c057ecacc990a1457a12f2160411e0dd46650ef9017b4d4f75c53819b933323c","target":"record","created_at":"2026-05-18T04:39:30Z","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":"cdedc40407dc391b8cf1923036689fcd57cf1482cf66aa66ea16a3276d9c2326","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T11:35:45Z","title_canon_sha256":"8101d4accb55d336cd5b88d145328ae8595561906253402ed39ad7780b5a91c8"},"schema_version":"1.0","source":{"id":"1010.1911","kind":"arxiv","version":1}},"canonical_sha256":"f14ab2fcb6ebbd4fb7cd42e539d2a83880d5ba0a7dbb4859ee402835a87d6ea2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f14ab2fcb6ebbd4fb7cd42e539d2a83880d5ba0a7dbb4859ee402835a87d6ea2","first_computed_at":"2026-05-18T04:39:30.065362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:30.065362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qHcLDr3xdu+e8jsr79OsrpzvvIOjGuxTuGzyCTGrfoqU4X4kV+M8FSHtzEdayjR1+IFCLutxcEL1EH8YCDEmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:30.065853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c057ecacc990a1457a12f2160411e0dd46650ef9017b4d4f75c53819b933323c","sha256:dfe373203ea4370831475aa04b44444e82b848aa9e3789a4f0486513280ca7e5"],"state_sha256":"0dac13a2159a906d29b16f22a0e5ef21131310ae3681d144b88d7e0ee6a9dbbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5N2Sx01sNrtGqeVR8DTKI1A13hYqaTLBmGeQ/BSIbdKST0OUyz/AeYUhEhBoNNaeLw+auCcrm+LC5NkZLEHDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T03:58:00.467484Z","bundle_sha256":"895437259f7eb1089a2b0d67365979f3fd2f7fca9d6d8f3d5f45e1aab0323375"}}