{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WY5NY4SCQV65EEGUIABIID2IAW","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":"e25a8d577d02a45acf935db04fabb7f886cbb6200683acad19258ffe5ee92bf0","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-20T22:09:28Z","title_canon_sha256":"ef9c3fd6752429fdb5c2aaa6335a7ef95130388982741624096d18c575321b46"},"schema_version":"1.0","source":{"id":"1901.06741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06741","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06741v1","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06741","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"WY5NY4SCQV65","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WY5NY4SCQV65EEGU","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WY5NY4SC","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:2b6ce29f01754a06c02984276e119b7070f035ec64e293f2db663e6f22897a0c","target":"graph","created_at":"2026-05-17T23:55:49Z","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":"A primitive $k$-batch code encodes a string $x$ of length $n$ into string $y$ of length $N$, such that each multiset of $k$ symbols from $x$ has $k$ mutually disjoint recovering sets from $y$. We develop new explicit and random coding constructions of linear primitive batch codes based on finite geometry. In some parameter regimes, our proposed codes have lower redundancy than previously known batch codes.","authors_text":"Ilya Vorobyev, Nikita Polyanskii","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-20T22:09:28Z","title":"Constructions of Batch Codes via Finite Geometry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06741","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:4934b0971dc41e51b80a30a2ebf906ff212f98adccebe6113859bf8c3973851c","target":"record","created_at":"2026-05-17T23:55:49Z","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":"e25a8d577d02a45acf935db04fabb7f886cbb6200683acad19258ffe5ee92bf0","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-20T22:09:28Z","title_canon_sha256":"ef9c3fd6752429fdb5c2aaa6335a7ef95130388982741624096d18c575321b46"},"schema_version":"1.0","source":{"id":"1901.06741","kind":"arxiv","version":1}},"canonical_sha256":"b63adc7242857dd210d44002840f48058dd8180ba02fdd5ebed0a2b29e56d538","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b63adc7242857dd210d44002840f48058dd8180ba02fdd5ebed0a2b29e56d538","first_computed_at":"2026-05-17T23:55:49.290756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:49.290756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vKeWPS8C90dVhg+YcduPbO00Vpg6qFvazGirMJDJzRN3QLo/2Aod6n4oL199Jc5i/pgYa71lp2RXcCjfGPOcAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:49.291364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4934b0971dc41e51b80a30a2ebf906ff212f98adccebe6113859bf8c3973851c","sha256:2b6ce29f01754a06c02984276e119b7070f035ec64e293f2db663e6f22897a0c"],"state_sha256":"a4489f2ee7891706901238ca826841528b4180127f6cba30ef0eb7cbfe001252"}