{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2YAUMRXEXOI5YPQT5EOAD7HR4Q","short_pith_number":"pith:2YAUMRXE","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"},"canonical_sha256":"d6014646e4bb91dc3e13e91c01fcf1e42809d0f01f425753b90fda12fad4227a","source":{"kind":"arxiv","id":"2110.06181","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.06181","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"2110.06181v2","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.06181","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"2YAUMRXEXOI5","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"pith_short_16","alias_value":"2YAUMRXEXOI5YPQT","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"pith_short_8","alias_value":"2YAUMRXE","created_at":"2026-07-05T09:22:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2YAUMRXEXOI5YPQT5EOAD7HR4Q","target":"record","payload":{"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"},"canonical_sha256":"d6014646e4bb91dc3e13e91c01fcf1e42809d0f01f425753b90fda12fad4227a","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"},"source_kind":"arxiv","source_id":"2110.06181","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-07-05T09:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rlecXICOY/ZRrMhDdGjy+/2CGVfNM2fbrQrtTe9+khMN5G/mCKY3O2Ep1Kx14RdNXjijckoFOl9DXiQwrHmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:36:05.284893Z"},"content_sha256":"7fa6aa13563520bca55dfc73bc40c477e7c922e8764d36a2897dcc49f7796e60","schema_version":"1.0","event_id":"sha256:7fa6aa13563520bca55dfc73bc40c477e7c922e8764d36a2897dcc49f7796e60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2YAUMRXEXOI5YPQT5EOAD7HR4Q","target":"graph","payload":{"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"},"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-07-05T09:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PC8EZ39nS0HHsVu98hhxUKnEwgPdwNBGwNm62DeWi0HQlY+A4FqwNuVV3UBpSZMEWKx2pzE1NGMLRDHUU6fiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:36:05.285269Z"},"content_sha256":"0ca80ddbd22d6e8e0ec34dbf44cf3543e1b61d0495c8c045b05d77362fdd4e7c","schema_version":"1.0","event_id":"sha256:0ca80ddbd22d6e8e0ec34dbf44cf3543e1b61d0495c8c045b05d77362fdd4e7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/bundle.json","state_url":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/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-07-07T13:36:05Z","links":{"resolver":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q","bundle":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/bundle.json","state":"https://pith.science/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YAUMRXEXOI5YPQT5EOAD7HR4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2YAUMRXEXOI5YPQT5EOAD7HR4Q","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":"c84ccefce1d79b88636d2117d0c3511fc1a46c9d7901893549770c0197be9001","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-12T17:27:54Z","title_canon_sha256":"c6d0ebc8fd7c710345f2ec39d5ce7d2cf0c48f8fca77d51dd0abdf260f275e5d"},"schema_version":"1.0","source":{"id":"2110.06181","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.06181","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"2110.06181v2","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.06181","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"2YAUMRXEXOI5","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"pith_short_16","alias_value":"2YAUMRXEXOI5YPQT","created_at":"2026-07-05T09:22:35Z"},{"alias_kind":"pith_short_8","alias_value":"2YAUMRXE","created_at":"2026-07-05T09:22:35Z"}],"graph_snapshots":[{"event_id":"sha256:0ca80ddbd22d6e8e0ec34dbf44cf3543e1b61d0495c8c045b05d77362fdd4e7c","target":"graph","created_at":"2026-07-05T09:22:35Z","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/2110.06181/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Abhishek Methuku, Daniela K\\\"uhn, Deryk Osthus, Dong Yeap Kang, Tom Kelly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-12T17:27:54Z","title":"Solution to a problem of Erd\\H{o}s on the chromatic index of hypergraphs with bounded codegree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.06181","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:7fa6aa13563520bca55dfc73bc40c477e7c922e8764d36a2897dcc49f7796e60","target":"record","created_at":"2026-07-05T09:22:35Z","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":"c84ccefce1d79b88636d2117d0c3511fc1a46c9d7901893549770c0197be9001","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-12T17:27:54Z","title_canon_sha256":"c6d0ebc8fd7c710345f2ec39d5ce7d2cf0c48f8fca77d51dd0abdf260f275e5d"},"schema_version":"1.0","source":{"id":"2110.06181","kind":"arxiv","version":2}},"canonical_sha256":"d6014646e4bb91dc3e13e91c01fcf1e42809d0f01f425753b90fda12fad4227a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6014646e4bb91dc3e13e91c01fcf1e42809d0f01f425753b90fda12fad4227a","first_computed_at":"2026-07-05T09:22:35.620712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:22:35.620712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AyOacnUp9IKzc8ROjIxHu4MRDQHIJ/beemVQHljt2B+SH+QSFzzdbfkF2qlBaFGqH0aMoB9+qw24jnACQPAxBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:22:35.621187Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.06181","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fa6aa13563520bca55dfc73bc40c477e7c922e8764d36a2897dcc49f7796e60","sha256:0ca80ddbd22d6e8e0ec34dbf44cf3543e1b61d0495c8c045b05d77362fdd4e7c"],"state_sha256":"da0f4f7d0f7c06914343aa79a11a4aa4c661099dade4e581e2f0a184bb24fa1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQS+2f0HFa+cWCSxLKqi1uPforUZ1rJQp/IepRWi6CIa4NuWxsgBF2aL6+3NZsFyTRq75xfn1gRNT4idRsnjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:36:05.287284Z","bundle_sha256":"ac94582f77378523da7719577df3b39e557fd4d8a55bfecf5162b6513285a789"}}