{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4H4WWAHEJGGBWGWRDXBZNQMEKB","short_pith_number":"pith:4H4WWAHE","canonical_record":{"source":{"id":"1309.6506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T13:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"7f7d1a6ff7e417ed9aa45fde174135207cf88a026a7ea5527b6736b457fc44a9","abstract_canon_sha256":"4f8f101b2ab2aa5e019974ffa4d8f7a0910fdd50916ac2402ee5d6dfd0d35a52"},"schema_version":"1.0"},"canonical_sha256":"e1f96b00e4498c1b1ad11dc396c18450714c08f0d89666e6c0ccf9d94c163e30","source":{"kind":"arxiv","id":"1309.6506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6506","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6506v1","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6506","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"4H4WWAHEJGGB","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4H4WWAHEJGGBWGWR","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4H4WWAHE","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4H4WWAHEJGGBWGWRDXBZNQMEKB","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T13:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"7f7d1a6ff7e417ed9aa45fde174135207cf88a026a7ea5527b6736b457fc44a9","abstract_canon_sha256":"4f8f101b2ab2aa5e019974ffa4d8f7a0910fdd50916ac2402ee5d6dfd0d35a52"},"schema_version":"1.0"},"canonical_sha256":"e1f96b00e4498c1b1ad11dc396c18450714c08f0d89666e6c0ccf9d94c163e30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:20.832558Z","signature_b64":"8WQcwEmzT7PvXPJfD+2IGjTWWXmJ6leo2pN3oW++AsiUVUPMmueJ0Oz8Xd2nTdOJ4YykjAYYNc0BM3eOv49HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f96b00e4498c1b1ad11dc396c18450714c08f0d89666e6c0ccf9d94c163e30","last_reissued_at":"2026-05-18T03:12:20.831689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:20.831689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6506","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:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISLeL4FYz/lkYXq2ZQJ3JTlBQAzt7CE2VYa63Mlbvizqb7Z+lmTLeOBlrrjwPerZSZm9JQZMiaw0zTFImrM4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:03:10.857422Z"},"content_sha256":"e593cb56950a89f3dc220a47c6a383630b734c900cf27cfba96e04e1c02e0401","schema_version":"1.0","event_id":"sha256:e593cb56950a89f3dc220a47c6a383630b734c900cf27cfba96e04e1c02e0401"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4H4WWAHEJGGBWGWRDXBZNQMEKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tur\\'an numbers and batch codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Zsolt Tuza","submitted_at":"2013-09-25T13:54:01Z","abstract_excerpt":"Combinatorial batch codes provide a tool for distributed data storage, with the feature of keeping privacy during information retrieval. Recently, Balachandran and Bhattacharya observed that the problem of constructing such uniform codes in an economic way can be formulated as a Tur\\'an-type question on hypergraphs. Here we establish general lower and upper bounds for this extremal problem, and also for its generalization where the forbidden family consists of those $r$-uniform hypergraphs $H$ which satisfy the condition $k\\ge |E(H)|> |V(H)|+q$ (for $k>q+r$ and $q> -r$ fixed). We also prove th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6506","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:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwfFB5Da62T0E6EwBfG0cer3hx3uHKloOerIJw8Le4oBKbQfT9ujjMgYjrU1BNF/xR13kFoM1WwOy/PiCbZmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:03:10.857776Z"},"content_sha256":"00f6a1886a11429a200f621402189c9c826fc9fa9a628eb85bd946cf294134f3","schema_version":"1.0","event_id":"sha256:00f6a1886a11429a200f621402189c9c826fc9fa9a628eb85bd946cf294134f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4H4WWAHEJGGBWGWRDXBZNQMEKB/bundle.json","state_url":"https://pith.science/pith/4H4WWAHEJGGBWGWRDXBZNQMEKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4H4WWAHEJGGBWGWRDXBZNQMEKB/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-20T10:03:10Z","links":{"resolver":"https://pith.science/pith/4H4WWAHEJGGBWGWRDXBZNQMEKB","bundle":"https://pith.science/pith/4H4WWAHEJGGBWGWRDXBZNQMEKB/bundle.json","state":"https://pith.science/pith/4H4WWAHEJGGBWGWRDXBZNQMEKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4H4WWAHEJGGBWGWRDXBZNQMEKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4H4WWAHEJGGBWGWRDXBZNQMEKB","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":"4f8f101b2ab2aa5e019974ffa4d8f7a0910fdd50916ac2402ee5d6dfd0d35a52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T13:54:01Z","title_canon_sha256":"7f7d1a6ff7e417ed9aa45fde174135207cf88a026a7ea5527b6736b457fc44a9"},"schema_version":"1.0","source":{"id":"1309.6506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6506","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6506v1","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6506","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"4H4WWAHEJGGB","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4H4WWAHEJGGBWGWR","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4H4WWAHE","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:00f6a1886a11429a200f621402189c9c826fc9fa9a628eb85bd946cf294134f3","target":"graph","created_at":"2026-05-18T03:12:20Z","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":"Combinatorial batch codes provide a tool for distributed data storage, with the feature of keeping privacy during information retrieval. Recently, Balachandran and Bhattacharya observed that the problem of constructing such uniform codes in an economic way can be formulated as a Tur\\'an-type question on hypergraphs. Here we establish general lower and upper bounds for this extremal problem, and also for its generalization where the forbidden family consists of those $r$-uniform hypergraphs $H$ which satisfy the condition $k\\ge |E(H)|> |V(H)|+q$ (for $k>q+r$ and $q> -r$ fixed). We also prove th","authors_text":"Csilla Bujt\\'as, Zsolt Tuza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T13:54:01Z","title":"Tur\\'an numbers and batch codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6506","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:e593cb56950a89f3dc220a47c6a383630b734c900cf27cfba96e04e1c02e0401","target":"record","created_at":"2026-05-18T03:12:20Z","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":"4f8f101b2ab2aa5e019974ffa4d8f7a0910fdd50916ac2402ee5d6dfd0d35a52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-25T13:54:01Z","title_canon_sha256":"7f7d1a6ff7e417ed9aa45fde174135207cf88a026a7ea5527b6736b457fc44a9"},"schema_version":"1.0","source":{"id":"1309.6506","kind":"arxiv","version":1}},"canonical_sha256":"e1f96b00e4498c1b1ad11dc396c18450714c08f0d89666e6c0ccf9d94c163e30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1f96b00e4498c1b1ad11dc396c18450714c08f0d89666e6c0ccf9d94c163e30","first_computed_at":"2026-05-18T03:12:20.831689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:20.831689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8WQcwEmzT7PvXPJfD+2IGjTWWXmJ6leo2pN3oW++AsiUVUPMmueJ0Oz8Xd2nTdOJ4YykjAYYNc0BM3eOv49HDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:20.832558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e593cb56950a89f3dc220a47c6a383630b734c900cf27cfba96e04e1c02e0401","sha256:00f6a1886a11429a200f621402189c9c826fc9fa9a628eb85bd946cf294134f3"],"state_sha256":"248cb9459ceb39b3929b10c3fd1c7bfdc9a7d38945332282b1d17e6fffd0c9dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Z7oYmmI9JoniwBGuVcDdQrnBtH93+YRf/7by0K1PO4oQhkT9FuMmFjWXvPUKDTcyDiq5TJc6r4BY3AKLI+8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:03:10.859629Z","bundle_sha256":"5f67c85596fa4efcf1b57ec4bb7848d6ad57932741669b9e8b1a522d98701ab4"}}