{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:54MHNZ4L7MOLP6OJFTXIZZMHRI","short_pith_number":"pith:54MHNZ4L","canonical_record":{"source":{"id":"0804.0996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-07T09:56:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9886ac095ea5246d8669ff5f989a5277ce67218ef5da7eee22df342b36b6aaa9","abstract_canon_sha256":"155b129488d88e34450a8bb43869ae86eba6ba5b8cd68b81916acce0ddef25bf"},"schema_version":"1.0"},"canonical_sha256":"ef1876e78bfb1cb7f9c92cee8ce5878a123dd2cae7e41f13129cb449c700baea","source":{"kind":"arxiv","id":"0804.0996","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.0996","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0804.0996v2","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0996","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"54MHNZ4L7MOL","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"54MHNZ4L7MOLP6OJ","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"54MHNZ4L","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:54MHNZ4L7MOLP6OJFTXIZZMHRI","target":"record","payload":{"canonical_record":{"source":{"id":"0804.0996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-07T09:56:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9886ac095ea5246d8669ff5f989a5277ce67218ef5da7eee22df342b36b6aaa9","abstract_canon_sha256":"155b129488d88e34450a8bb43869ae86eba6ba5b8cd68b81916acce0ddef25bf"},"schema_version":"1.0"},"canonical_sha256":"ef1876e78bfb1cb7f9c92cee8ce5878a123dd2cae7e41f13129cb449c700baea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.859271Z","signature_b64":"h6GNvpVQ3KoP7BBUB7VGTjDfbYMku4c5qun+nvVH962y6OlyNKFnG8x3dDI1jHzGd+luAPoAWKEAP0FtJahnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef1876e78bfb1cb7f9c92cee8ce5878a123dd2cae7e41f13129cb449c700baea","last_reissued_at":"2026-05-18T00:59:11.858729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.858729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0804.0996","source_version":2,"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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KizPxU7FNkZCfEwZ9CkN1F3ybQQiwkET0zMufDfzMafD5xXwdyM+rVPTLNvaK/0iRqVE5mR7rRzB1IlOQeoXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:28:09.200696Z"},"content_sha256":"12536321437fe02782cf26f4c9712bbf286fa3c40fd35e85c1518d3e867a1215","schema_version":"1.0","event_id":"sha256:12536321437fe02782cf26f4c9712bbf286fa3c40fd35e85c1518d3e867a1215"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:54MHNZ4L7MOLP6OJFTXIZZMHRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Woven Graph Codes: Asymptotic Performances and Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boris D.Kudryashov, Irina E. Bocharova, Rolf Johannesson, Victor V. Zyablov","submitted_at":"2008-04-07T09:56:10Z","abstract_excerpt":"Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on $s$-partite, $s$-uniform hypergraphs, where $s$ depends only on the code rate, there exist codes satisfying the Varshamov-Gilbert (VG) and the Costello lower bound on the minimum distance and the free distance, respectively. A connection between regular bipartite graphs and tailbiting codes is shown. Some examples of woven graph codes are presented. Among them an example of a rate $R_{\\rm wg}=1/3$ woven graph code with $d_{\\rm fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.0996","kind":"arxiv","version":2},"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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/P33PizPvfiqPN3jBVrUksNq5ReLEHS93GM51BEHN5zIyyqn7cNdDe957AEHzV7yvAMJt+FAYJnXFXLgOCrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:28:09.201049Z"},"content_sha256":"2c35b784316464bb76ee60cc95767eb27c5068be181f5f08ccf2689baf9d4fd1","schema_version":"1.0","event_id":"sha256:2c35b784316464bb76ee60cc95767eb27c5068be181f5f08ccf2689baf9d4fd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/bundle.json","state_url":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/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-04T00:28:09Z","links":{"resolver":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI","bundle":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/bundle.json","state":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:54MHNZ4L7MOLP6OJFTXIZZMHRI","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":"155b129488d88e34450a8bb43869ae86eba6ba5b8cd68b81916acce0ddef25bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-07T09:56:10Z","title_canon_sha256":"9886ac095ea5246d8669ff5f989a5277ce67218ef5da7eee22df342b36b6aaa9"},"schema_version":"1.0","source":{"id":"0804.0996","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.0996","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0804.0996v2","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0996","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"54MHNZ4L7MOL","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"54MHNZ4L7MOLP6OJ","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"54MHNZ4L","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:2c35b784316464bb76ee60cc95767eb27c5068be181f5f08ccf2689baf9d4fd1","target":"graph","created_at":"2026-05-18T00:59:11Z","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":"Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on $s$-partite, $s$-uniform hypergraphs, where $s$ depends only on the code rate, there exist codes satisfying the Varshamov-Gilbert (VG) and the Costello lower bound on the minimum distance and the free distance, respectively. A connection between regular bipartite graphs and tailbiting codes is shown. Some examples of woven graph codes are presented. Among them an example of a rate $R_{\\rm wg}=1/3$ woven graph code with $d_{\\rm fre","authors_text":"Boris D.Kudryashov, Irina E. Bocharova, Rolf Johannesson, Victor V. Zyablov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-07T09:56:10Z","title":"Woven Graph Codes: Asymptotic Performances and Examples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.0996","kind":"arxiv","version":2},"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:12536321437fe02782cf26f4c9712bbf286fa3c40fd35e85c1518d3e867a1215","target":"record","created_at":"2026-05-18T00:59:11Z","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":"155b129488d88e34450a8bb43869ae86eba6ba5b8cd68b81916acce0ddef25bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-07T09:56:10Z","title_canon_sha256":"9886ac095ea5246d8669ff5f989a5277ce67218ef5da7eee22df342b36b6aaa9"},"schema_version":"1.0","source":{"id":"0804.0996","kind":"arxiv","version":2}},"canonical_sha256":"ef1876e78bfb1cb7f9c92cee8ce5878a123dd2cae7e41f13129cb449c700baea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef1876e78bfb1cb7f9c92cee8ce5878a123dd2cae7e41f13129cb449c700baea","first_computed_at":"2026-05-18T00:59:11.858729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.858729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h6GNvpVQ3KoP7BBUB7VGTjDfbYMku4c5qun+nvVH962y6OlyNKFnG8x3dDI1jHzGd+luAPoAWKEAP0FtJahnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.859271Z","signed_message":"canonical_sha256_bytes"},"source_id":"0804.0996","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12536321437fe02782cf26f4c9712bbf286fa3c40fd35e85c1518d3e867a1215","sha256:2c35b784316464bb76ee60cc95767eb27c5068be181f5f08ccf2689baf9d4fd1"],"state_sha256":"da1b12a09532c9b2b14934247347860a0804224a600c4259c652d458f2ed6a36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TdLc4dgHL50Il8UHqxzHgFwdO0jIaohSheZiNA39HoYsPofi1kVovUh1Ad19cvYan0T0YHfnmuDuTo0VsnqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:28:09.203176Z","bundle_sha256":"6f4d2a9bde5002481814fc5f453215cda2e7b2f41f1ef4f380e6d9aa9e4d6086"}}