{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:P2JEUIXJRU26QBKOKYJK5W6GWK","short_pith_number":"pith:P2JEUIXJ","canonical_record":{"source":{"id":"1303.0247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-01T18:35:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c7cfdca064e159346a528fd7899c1dbd4c22daf2bc7b06ea9cd3964e30306f1","abstract_canon_sha256":"946f1c304a5217b16a9cc8a00578cbb1380d6d82971233ff6757f36e3d37b446"},"schema_version":"1.0"},"canonical_sha256":"7e924a22e98d35e8054e5612aedbc6b2a147ec00b60efa24705dcfd7e80e2248","source":{"kind":"arxiv","id":"1303.0247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0247","created_at":"2026-05-18T03:32:06Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0247v1","created_at":"2026-05-18T03:32:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0247","created_at":"2026-05-18T03:32:06Z"},{"alias_kind":"pith_short_12","alias_value":"P2JEUIXJRU26","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P2JEUIXJRU26QBKO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P2JEUIXJ","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:P2JEUIXJRU26QBKOKYJK5W6GWK","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-01T18:35:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c7cfdca064e159346a528fd7899c1dbd4c22daf2bc7b06ea9cd3964e30306f1","abstract_canon_sha256":"946f1c304a5217b16a9cc8a00578cbb1380d6d82971233ff6757f36e3d37b446"},"schema_version":"1.0"},"canonical_sha256":"7e924a22e98d35e8054e5612aedbc6b2a147ec00b60efa24705dcfd7e80e2248","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:06.494769Z","signature_b64":"Tvqg3LlIQxIVzD/jyRX7NhPOmRpK0XxADYZyx0lOuXX0dJHE+hUD514fD/EBS49qfbSl0JamIPWs5joIQlV8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e924a22e98d35e8054e5612aedbc6b2a147ec00b60efa24705dcfd7e80e2248","last_reissued_at":"2026-05-18T03:32:06.494115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:06.494115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0247","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-18T03:32:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KiLYjmVeGBMq939HDW+anm6whYnatdmy2GmI/85XyNwVm8mVJM6F65BKP4AMJMYpyUOHFHxk4Fab/ofOd/O6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:30:32.998869Z"},"content_sha256":"fef3b99428a422357876c93c948179c5e25206e4355cd17d14d8f43d70a12379","schema_version":"1.0","event_id":"sha256:fef3b99428a422357876c93c948179c5e25206e4355cd17d14d8f43d70a12379"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:P2JEUIXJRU26QBKOKYJK5W6GWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Coding-Theoretic Application of Baranyai's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Liang Feng Zhang","submitted_at":"2013-03-01T18:35:01Z","abstract_excerpt":"Baranyai's theorem is a well-known theorem in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all $u$-subsets of an $n$-element set into ${n-1\\choose u-1}$ sub-families such that each sub-family form a partition of the $n$-element set, where $n$ is divisible by $u$. In this paper, we present a coding-theoretic application of Baranyai's theorem (or equivalently, the corollary). More precisely, we propose the first purely combinatorial construction of locally decodable codes. Locally decodable codes are error-correcting codes that allow the recove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0247","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-18T03:32:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMfz2BUfF9fUCcSByYI1toydoZtaBovgVi9hWLSo9JxpJhWmmPMmLErR0tPMjP5pWIPRYn6EahIDHZok3cnZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:30:32.999558Z"},"content_sha256":"99585bd3c39fefe9b92ae2bae65b6696b450c5a5eda7544aa8768d8d52c94b53","schema_version":"1.0","event_id":"sha256:99585bd3c39fefe9b92ae2bae65b6696b450c5a5eda7544aa8768d8d52c94b53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2JEUIXJRU26QBKOKYJK5W6GWK/bundle.json","state_url":"https://pith.science/pith/P2JEUIXJRU26QBKOKYJK5W6GWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2JEUIXJRU26QBKOKYJK5W6GWK/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-09T13:30:33Z","links":{"resolver":"https://pith.science/pith/P2JEUIXJRU26QBKOKYJK5W6GWK","bundle":"https://pith.science/pith/P2JEUIXJRU26QBKOKYJK5W6GWK/bundle.json","state":"https://pith.science/pith/P2JEUIXJRU26QBKOKYJK5W6GWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2JEUIXJRU26QBKOKYJK5W6GWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:P2JEUIXJRU26QBKOKYJK5W6GWK","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":"946f1c304a5217b16a9cc8a00578cbb1380d6d82971233ff6757f36e3d37b446","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-01T18:35:01Z","title_canon_sha256":"3c7cfdca064e159346a528fd7899c1dbd4c22daf2bc7b06ea9cd3964e30306f1"},"schema_version":"1.0","source":{"id":"1303.0247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0247","created_at":"2026-05-18T03:32:06Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0247v1","created_at":"2026-05-18T03:32:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0247","created_at":"2026-05-18T03:32:06Z"},{"alias_kind":"pith_short_12","alias_value":"P2JEUIXJRU26","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P2JEUIXJRU26QBKO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P2JEUIXJ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:99585bd3c39fefe9b92ae2bae65b6696b450c5a5eda7544aa8768d8d52c94b53","target":"graph","created_at":"2026-05-18T03:32:06Z","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":"Baranyai's theorem is a well-known theorem in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all $u$-subsets of an $n$-element set into ${n-1\\choose u-1}$ sub-families such that each sub-family form a partition of the $n$-element set, where $n$ is divisible by $u$. In this paper, we present a coding-theoretic application of Baranyai's theorem (or equivalently, the corollary). More precisely, we propose the first purely combinatorial construction of locally decodable codes. Locally decodable codes are error-correcting codes that allow the recove","authors_text":"Liang Feng Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-01T18:35:01Z","title":"A Coding-Theoretic Application of Baranyai's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0247","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:fef3b99428a422357876c93c948179c5e25206e4355cd17d14d8f43d70a12379","target":"record","created_at":"2026-05-18T03:32:06Z","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":"946f1c304a5217b16a9cc8a00578cbb1380d6d82971233ff6757f36e3d37b446","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-01T18:35:01Z","title_canon_sha256":"3c7cfdca064e159346a528fd7899c1dbd4c22daf2bc7b06ea9cd3964e30306f1"},"schema_version":"1.0","source":{"id":"1303.0247","kind":"arxiv","version":1}},"canonical_sha256":"7e924a22e98d35e8054e5612aedbc6b2a147ec00b60efa24705dcfd7e80e2248","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e924a22e98d35e8054e5612aedbc6b2a147ec00b60efa24705dcfd7e80e2248","first_computed_at":"2026-05-18T03:32:06.494115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:06.494115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tvqg3LlIQxIVzD/jyRX7NhPOmRpK0XxADYZyx0lOuXX0dJHE+hUD514fD/EBS49qfbSl0JamIPWs5joIQlV8BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:06.494769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fef3b99428a422357876c93c948179c5e25206e4355cd17d14d8f43d70a12379","sha256:99585bd3c39fefe9b92ae2bae65b6696b450c5a5eda7544aa8768d8d52c94b53"],"state_sha256":"9737fc1d592fbaf101a5634799d463ce3ecea480fcef48c213e398d6cea0c581"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAUy+zdIQUVFnSLMxwhduEFVP7+eqHySGHWgVFdPVeVjjYq5PIBg5+PgF1lqQ+OZ1L4VrbssjdKREu/SZOcQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:30:33.002679Z","bundle_sha256":"e5dba1f20c6899a33bc68627f2e1e658de4b1f316fd4f7048c55138b6c1e118e"}}