{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2YAUMRXEXOI5YPQT5EOAD7HR4Q","short_pith_number":"pith:2YAUMRXE","schema_version":"1.0","canonical_sha256":"d6014646e4bb91dc3e13e91c01fcf1e42809d0f01f425753b90fda12fad4227a","source":{"kind":"arxiv","id":"2110.06181","version":2},"attestation_state":"computed","paper":{"title":"Solution to a problem of Erd\\H{o}s on the chromatic index of hypergraphs with bounded codegree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Daniela K\\\"uhn, Deryk Osthus, Dong Yeap Kang, Tom Kelly","submitted_at":"2021-10-12T17:27:54Z","abstract_excerpt":"In 1977, Erd\\H{o}s asked the following question: for any integers $t,n \\in \\mathbb{N}$, if $G_1 , \\dots , G_n$ are complete graphs such that each $G_i$ has at most $n$ vertices and every pair of them shares at most $t$ vertices, what is the largest possible chromatic number of the union $\\bigcup_{i=1}^{n} G_i$? The equivalent dual formulation of this question asks for the largest chromatic index of an $n$-vertex hypergraph with maximum degree at most $n$ and maximum codegree at most $t$. For the case $t = 1$, Erd\\H{o}s, Faber, and Lov\\'{a}sz famously conjectured that the answer is $n$, which w"},"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":"2110.06181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-12T17:27:54Z","cross_cats_sorted":[],"title_canon_sha256":"c6d0ebc8fd7c710345f2ec39d5ce7d2cf0c48f8fca77d51dd0abdf260f275e5d","abstract_canon_sha256":"c84ccefce1d79b88636d2117d0c3511fc1a46c9d7901893549770c0197be9001"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:35.621187Z","signature_b64":"AyOacnUp9IKzc8ROjIxHu4MRDQHIJ/beemVQHljt2B+SH+QSFzzdbfkF2qlBaFGqH0aMoB9+qw24jnACQPAxBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6014646e4bb91dc3e13e91c01fcf1e42809d0f01f425753b90fda12fad4227a","last_reissued_at":"2026-07-05T09:22:35.620712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:35.620712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solution to a problem of Erd\\H{o}s on the chromatic index of hypergraphs with bounded codegree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Daniela K\\\"uhn, Deryk Osthus, Dong Yeap Kang, Tom Kelly","submitted_at":"2021-10-12T17:27:54Z","abstract_excerpt":"In 1977, Erd\\H{o}s asked the following question: for any integers $t,n \\in \\mathbb{N}$, if $G_1 , \\dots , G_n$ are complete graphs such that each $G_i$ has at most $n$ vertices and every pair of them shares at most $t$ vertices, what is the largest possible chromatic number of the union $\\bigcup_{i=1}^{n} G_i$? The equivalent dual formulation of this question asks for the largest chromatic index of an $n$-vertex hypergraph with maximum degree at most $n$ and maximum codegree at most $t$. For the case $t = 1$, Erd\\H{o}s, Faber, and Lov\\'{a}sz famously conjectured that the answer is $n$, which w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.06181","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/2110.06181/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":"2110.06181","created_at":"2026-07-05T09:22:35.620773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.06181v2","created_at":"2026-07-05T09:22:35.620773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.06181","created_at":"2026-07-05T09:22:35.620773+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YAUMRXEXOI5","created_at":"2026-07-05T09:22:35.620773+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YAUMRXEXOI5YPQT","created_at":"2026-07-05T09:22:35.620773+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YAUMRXE","created_at":"2026-07-05T09:22:35.620773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24878","citing_title":"An Improved Lower Bound for the Erd\\H{o}s-Lov\\'asz Cover Number Problem","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q","json":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q.json","graph_json":"https://pith.science/api/pith-number/2YAUMRXEXOI5YPQT5EOAD7HR4Q/graph.json","events_json":"https://pith.science/api/pith-number/2YAUMRXEXOI5YPQT5EOAD7HR4Q/events.json","paper":"https://pith.science/paper/2YAUMRXE"},"agent_actions":{"view_html":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q","download_json":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q.json","view_paper":"https://pith.science/paper/2YAUMRXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.06181&json=true","fetch_graph":"https://pith.science/api/pith-number/2YAUMRXEXOI5YPQT5EOAD7HR4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/2YAUMRXEXOI5YPQT5EOAD7HR4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/action/storage_attestation","attest_author":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/action/author_attestation","sign_citation":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/action/citation_signature","submit_replication":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/action/replication_record"}},"created_at":"2026-07-05T09:22:35.620773+00:00","updated_at":"2026-07-05T09:22:35.620773+00:00"}