{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4","short_pith_number":"pith:EWPGGJ5Z","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"},"canonical_sha256":"259e6327b941481fc3ca44b75f6370971d3e74d864392945cbece9283a9065d1","source":{"kind":"arxiv","id":"2208.12589","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.12589","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"2208.12589v2","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.12589","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"EWPGGJ5ZIFEB","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"pith_short_16","alias_value":"EWPGGJ5ZIFEB7Q6K","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"pith_short_8","alias_value":"EWPGGJ5Z","created_at":"2026-05-25T02:02:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4","target":"record","payload":{"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"},"canonical_sha256":"259e6327b941481fc3ca44b75f6370971d3e74d864392945cbece9283a9065d1","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"},"source_kind":"arxiv","source_id":"2208.12589","source_version":2,"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-25T02:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBlXQHJ2WM/4wmcf1PPzfmmGASOni4hl1ZvDQLwPV5NKD1pJHdccTQkj/gY4BmTLquVtuItTnEO5MiUQGEd6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:42:33.206922Z"},"content_sha256":"6f0188759da2d1820aa5e63d0ec7662ad97ad0deb3629d1ffc63eb70d052611e","schema_version":"1.0","event_id":"sha256:6f0188759da2d1820aa5e63d0ec7662ad97ad0deb3629d1ffc63eb70d052611e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4","target":"graph","payload":{"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"},"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-25T02:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Y2wvRF37L2TES4BuGLVwklhr6Fj/1vQ5UOKA0PH0TR6N05qlkTXAaaVeS+bGvxy7WH9cOldlVRiWgaeKYFeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:42:33.207297Z"},"content_sha256":"8663fae97e99dfbd73f9f0afebdda655db05b96287b9085acb2ec32b3e7f7b7a","schema_version":"1.0","event_id":"sha256:8663fae97e99dfbd73f9f0afebdda655db05b96287b9085acb2ec32b3e7f7b7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/bundle.json","state_url":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/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-11T10:42:33Z","links":{"resolver":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4","bundle":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/bundle.json","state":"https://pith.science/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EWPGGJ5ZIFEB7Q6KIS3V6Y3QS4","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":"812db502128d565a273c9bf29430a6178ff03365c8cd85fe27dbafb9c0236c41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-26T11:30:26Z","title_canon_sha256":"b880a2dd3e38766f3f766c64bb9b3565b6283a6c3bb2905e71df633026027616"},"schema_version":"1.0","source":{"id":"2208.12589","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.12589","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"2208.12589v2","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.12589","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"EWPGGJ5ZIFEB","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"pith_short_16","alias_value":"EWPGGJ5ZIFEB7Q6K","created_at":"2026-05-25T02:02:04Z"},{"alias_kind":"pith_short_8","alias_value":"EWPGGJ5Z","created_at":"2026-05-25T02:02:04Z"}],"graph_snapshots":[{"event_id":"sha256:8663fae97e99dfbd73f9f0afebdda655db05b96287b9085acb2ec32b3e7f7b7a","target":"graph","created_at":"2026-05-25T02:02: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.12589/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Anand Babu, Sundar Vishwanathan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-26T11:30:26Z","title":"Improved Bounds for Multicovering Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.12589","kind":"arxiv","version":2},"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:6f0188759da2d1820aa5e63d0ec7662ad97ad0deb3629d1ffc63eb70d052611e","target":"record","created_at":"2026-05-25T02:02: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":"812db502128d565a273c9bf29430a6178ff03365c8cd85fe27dbafb9c0236c41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-26T11:30:26Z","title_canon_sha256":"b880a2dd3e38766f3f766c64bb9b3565b6283a6c3bb2905e71df633026027616"},"schema_version":"1.0","source":{"id":"2208.12589","kind":"arxiv","version":2}},"canonical_sha256":"259e6327b941481fc3ca44b75f6370971d3e74d864392945cbece9283a9065d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"259e6327b941481fc3ca44b75f6370971d3e74d864392945cbece9283a9065d1","first_computed_at":"2026-05-25T02:02:04.680168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:04.680168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p3PL03atwx9fUNm+8lzGN9eQoc6VPPRMZSLQnKw7VBNuA/sa++4Nj3pulCDfzeHJdlQXCODItWjeAzBVO/YKCA==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:04.681156Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.12589","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f0188759da2d1820aa5e63d0ec7662ad97ad0deb3629d1ffc63eb70d052611e","sha256:8663fae97e99dfbd73f9f0afebdda655db05b96287b9085acb2ec32b3e7f7b7a"],"state_sha256":"853a58075f11c36e06643b10488eaa30771ff5b49278d74edf0e503375d65877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8p5OHkb2j9A4sJnYGWmR4xIJbiUQBxQgpKLo0TMA1nIhxx9OWxNGHUfihOBy+nLMONdu65Hx1XkAu/yOUgGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:42:33.209354Z","bundle_sha256":"ce91f90748affa166ea20972c3bc33ea1403ae1e82fd5f87be668ff39a87e430"}}