{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7QMEQADMMBFQZ2YXYJGIRWX5Q4","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":"f40428b7412dad391b0b678d2fa9bea433ac1fe25fb332e4a502bb848dd95ba6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-10T05:46:49Z","title_canon_sha256":"a583ef23bda971c62ef8a5159189321ba278b0e412eef929dd37cecaafec70f8"},"schema_version":"1.0","source":{"id":"1206.1996","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1996","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1996v4","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1996","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"7QMEQADMMBFQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7QMEQADMMBFQZ2YX","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7QMEQADM","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:630c1cb753f2ceac501b1609432608a050f38d84ac25ef24660acd42b9423c35","target":"graph","created_at":"2026-05-18T03:44:04Z","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":"Let $n, r, k$ be positive integers such that $3\\leq k < n$ and $2\\leq r \\leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges, span at least $i$ vertices for all $1 \\leq i \\leq k$. We are interested in the asymptotic nature of $m(n, r, k)$ for fixed $r$ and $k$ as $n \\rightarrow \\infty$. This problem is related to the forbidden hypergraph problem introduced by Brown, Erd\\H{o}s, and S\\'os and very recently discussed in the context of combinatorial batch codes. In this short paper we ","authors_text":"Niranjan Balachandran, Srimanta Bhattacharya","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-10T05:46:49Z","title":"On an Extremal Hypergraph Problem Related to Combinatorial Batch Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1996","kind":"arxiv","version":4},"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:e1767094cdde66f1528628510c27fad151effd7e5a36a2fc2697ed713cb59c00","target":"record","created_at":"2026-05-18T03:44:04Z","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":"f40428b7412dad391b0b678d2fa9bea433ac1fe25fb332e4a502bb848dd95ba6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-10T05:46:49Z","title_canon_sha256":"a583ef23bda971c62ef8a5159189321ba278b0e412eef929dd37cecaafec70f8"},"schema_version":"1.0","source":{"id":"1206.1996","kind":"arxiv","version":4}},"canonical_sha256":"fc1848006c604b0ceb17c24c88dafd870c95e2e312b8d6315c80be21061b8f75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc1848006c604b0ceb17c24c88dafd870c95e2e312b8d6315c80be21061b8f75","first_computed_at":"2026-05-18T03:44:04.406005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:04.406005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"091yn2D4HsR0Vav3WfAmikRXQGaAOHcC5MItRdKYZzC3w4nCeoFeuqdfqHdWyeKZd+Dt4qbq8oYXBOyUYfzRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:04.406966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1996","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1767094cdde66f1528628510c27fad151effd7e5a36a2fc2697ed713cb59c00","sha256:630c1cb753f2ceac501b1609432608a050f38d84ac25ef24660acd42b9423c35"],"state_sha256":"28bff75651838635745b0e6a8ad046a020fad0cdf9e9dbc41a178dea28fe3ae6"}