{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4","short_pith_number":"pith:EWPGGJ5Z","schema_version":"1.0","canonical_sha256":"259e6327b941481fc3ca44b75f6370971d3e74d864392945cbece9283a9065d1","source":{"kind":"arxiv","id":"2208.12589","version":2},"attestation_state":"computed","paper":{"title":"Improved Bounds for Multicovering Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anand Babu, Sundar Vishwanathan","submitted_at":"2022-08-26T11:30:26Z","abstract_excerpt":"The minimum number of bicliques needed to cover the edge set of the complete graph on $n$ vertices is $\\lceil \\log_2 n \\rceil$. The Graham-Pollak theorem states that at least $n-1$ bicliques are required to partition the edge set of the complete graph on $n$ vertices. In this paper, we provide improvements for the generalizations of coverings of graphs and hypergraphs for some specific multiplicities. We also study an extension of the Katona-Szemer\\'edi theorem to $r$-uniform hypergraphs."},"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":"2208.12589","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-26T11:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"b880a2dd3e38766f3f766c64bb9b3565b6283a6c3bb2905e71df633026027616","abstract_canon_sha256":"812db502128d565a273c9bf29430a6178ff03365c8cd85fe27dbafb9c0236c41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:04.681156Z","signature_b64":"p3PL03atwx9fUNm+8lzGN9eQoc6VPPRMZSLQnKw7VBNuA/sa++4Nj3pulCDfzeHJdlQXCODItWjeAzBVO/YKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"259e6327b941481fc3ca44b75f6370971d3e74d864392945cbece9283a9065d1","last_reissued_at":"2026-05-25T02:02:04.680168Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:04.680168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Bounds for Multicovering Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anand Babu, Sundar Vishwanathan","submitted_at":"2022-08-26T11:30:26Z","abstract_excerpt":"The minimum number of bicliques needed to cover the edge set of the complete graph on $n$ vertices is $\\lceil \\log_2 n \\rceil$. The Graham-Pollak theorem states that at least $n-1$ bicliques are required to partition the edge set of the complete graph on $n$ vertices. In this paper, we provide improvements for the generalizations of coverings of graphs and hypergraphs for some specific multiplicities. We also study an extension of the Katona-Szemer\\'edi theorem to $r$-uniform hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.12589","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.12589/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2208.12589","created_at":"2026-05-25T02:02:04.680325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.12589v2","created_at":"2026-05-25T02:02:04.680325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.12589","created_at":"2026-05-25T02:02:04.680325+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWPGGJ5ZIFEB","created_at":"2026-05-25T02:02:04.680325+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWPGGJ5ZIFEB7Q6K","created_at":"2026-05-25T02:02:04.680325+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWPGGJ5Z","created_at":"2026-05-25T02:02:04.680325+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.05491","citing_title":"A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4","json":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4.json","graph_json":"https://pith.science/api/pith-number/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/graph.json","events_json":"https://pith.science/api/pith-number/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/events.json","paper":"https://pith.science/paper/EWPGGJ5Z"},"agent_actions":{"view_html":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4","download_json":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4.json","view_paper":"https://pith.science/paper/EWPGGJ5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.12589&json=true","fetch_graph":"https://pith.science/api/pith-number/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/graph.json","fetch_events":"https://pith.science/api/pith-number/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/action/storage_attestation","attest_author":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/action/author_attestation","sign_citation":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/action/citation_signature","submit_replication":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/action/replication_record"}},"created_at":"2026-05-25T02:02:04.680325+00:00","updated_at":"2026-05-25T02:02:04.680325+00:00"}