{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7QMEQADMMBFQZ2YXYJGIRWX5Q4","short_pith_number":"pith:7QMEQADM","schema_version":"1.0","canonical_sha256":"fc1848006c604b0ceb17c24c88dafd870c95e2e312b8d6315c80be21061b8f75","source":{"kind":"arxiv","id":"1206.1996","version":4},"attestation_state":"computed","paper":{"title":"On an Extremal Hypergraph Problem Related to Combinatorial Batch Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Niranjan Balachandran, Srimanta Bhattacharya","submitted_at":"2012-06-10T05:46:49Z","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 "},"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":"1206.1996","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-10T05:46:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a583ef23bda971c62ef8a5159189321ba278b0e412eef929dd37cecaafec70f8","abstract_canon_sha256":"f40428b7412dad391b0b678d2fa9bea433ac1fe25fb332e4a502bb848dd95ba6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:04.406966Z","signature_b64":"091yn2D4HsR0Vav3WfAmikRXQGaAOHcC5MItRdKYZzC3w4nCeoFeuqdfqHdWyeKZd+Dt4qbq8oYXBOyUYfzRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc1848006c604b0ceb17c24c88dafd870c95e2e312b8d6315c80be21061b8f75","last_reissued_at":"2026-05-18T03:44:04.406005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:04.406005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On an Extremal Hypergraph Problem Related to Combinatorial Batch Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Niranjan Balachandran, Srimanta Bhattacharya","submitted_at":"2012-06-10T05:46:49Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1996","kind":"arxiv","version":4},"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":"1206.1996","created_at":"2026-05-18T03:44:04.406159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1996v4","created_at":"2026-05-18T03:44:04.406159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1996","created_at":"2026-05-18T03:44:04.406159+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QMEQADMMBFQ","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QMEQADMMBFQZ2YX","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QMEQADM","created_at":"2026-05-18T12:26:58.693483+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/7QMEQADMMBFQZ2YXYJGIRWX5Q4","json":"https://pith.science/pith/7QMEQADMMBFQZ2YXYJGIRWX5Q4.json","graph_json":"https://pith.science/api/pith-number/7QMEQADMMBFQZ2YXYJGIRWX5Q4/graph.json","events_json":"https://pith.science/api/pith-number/7QMEQADMMBFQZ2YXYJGIRWX5Q4/events.json","paper":"https://pith.science/paper/7QMEQADM"},"agent_actions":{"view_html":"https://pith.science/pith/7QMEQADMMBFQZ2YXYJGIRWX5Q4","download_json":"https://pith.science/pith/7QMEQADMMBFQZ2YXYJGIRWX5Q4.json","view_paper":"https://pith.science/paper/7QMEQADM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1996&json=true","fetch_graph":"https://pith.science/api/pith-number/7QMEQADMMBFQZ2YXYJGIRWX5Q4/graph.json","fetch_events":"https://pith.science/api/pith-number/7QMEQADMMBFQZ2YXYJGIRWX5Q4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QMEQADMMBFQZ2YXYJGIRWX5Q4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QMEQADMMBFQZ2YXYJGIRWX5Q4/action/storage_attestation","attest_author":"https://pith.science/pith/7QMEQADMMBFQZ2YXYJGIRWX5Q4/action/author_attestation","sign_citation":"https://pith.science/pith/7QMEQADMMBFQZ2YXYJGIRWX5Q4/action/citation_signature","submit_replication":"https://pith.science/pith/7QMEQADMMBFQZ2YXYJGIRWX5Q4/action/replication_record"}},"created_at":"2026-05-18T03:44:04.406159+00:00","updated_at":"2026-05-18T03:44:04.406159+00:00"}