{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:54MHNZ4L7MOLP6OJFTXIZZMHRI","short_pith_number":"pith:54MHNZ4L","schema_version":"1.0","canonical_sha256":"ef1876e78bfb1cb7f9c92cee8ce5878a123dd2cae7e41f13129cb449c700baea","source":{"kind":"arxiv","id":"0804.0996","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0804.0996","created_at":"2026-05-18T00:59:11.858795+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.0996v2","created_at":"2026-05-18T00:59:11.858795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0996","created_at":"2026-05-18T00:59:11.858795+00:00"},{"alias_kind":"pith_short_12","alias_value":"54MHNZ4L7MOL","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"54MHNZ4L7MOLP6OJ","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"54MHNZ4L","created_at":"2026-05-18T12:25:56.245647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI","json":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI.json","graph_json":"https://pith.science/api/pith-number/54MHNZ4L7MOLP6OJFTXIZZMHRI/graph.json","events_json":"https://pith.science/api/pith-number/54MHNZ4L7MOLP6OJFTXIZZMHRI/events.json","paper":"https://pith.science/paper/54MHNZ4L"},"agent_actions":{"view_html":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI","download_json":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI.json","view_paper":"https://pith.science/paper/54MHNZ4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.0996&json=true","fetch_graph":"https://pith.science/api/pith-number/54MHNZ4L7MOLP6OJFTXIZZMHRI/graph.json","fetch_events":"https://pith.science/api/pith-number/54MHNZ4L7MOLP6OJFTXIZZMHRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/action/storage_attestation","attest_author":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/action/author_attestation","sign_citation":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/action/citation_signature","submit_replication":"https://pith.science/pith/54MHNZ4L7MOLP6OJFTXIZZMHRI/action/replication_record"}},"created_at":"2026-05-18T00:59:11.858795+00:00","updated_at":"2026-05-18T00:59:11.858795+00:00"}