{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JL4QDBWN6JUUFG3S2KFQ2FYOAM","short_pith_number":"pith:JL4QDBWN","canonical_record":{"source":{"id":"1806.08567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-22T09:20:39Z","cross_cats_sorted":[],"title_canon_sha256":"29304505ddf8d1f46a5cbc852a5fa84caac9a2f34091e0de08ffbe1421383bc5","abstract_canon_sha256":"69053025d30de72dc5cbeb181f33aa2666e50613d35d500e43d60047430b215e"},"schema_version":"1.0"},"canonical_sha256":"4af90186cdf269429b72d28b0d170e033e0f3a4d6624fac7ae75244efc4018e1","source":{"kind":"arxiv","id":"1806.08567","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08567","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08567v2","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08567","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"JL4QDBWN6JUU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JL4QDBWN6JUUFG3S","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JL4QDBWN","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JL4QDBWN6JUUFG3S2KFQ2FYOAM","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-22T09:20:39Z","cross_cats_sorted":[],"title_canon_sha256":"29304505ddf8d1f46a5cbc852a5fa84caac9a2f34091e0de08ffbe1421383bc5","abstract_canon_sha256":"69053025d30de72dc5cbeb181f33aa2666e50613d35d500e43d60047430b215e"},"schema_version":"1.0"},"canonical_sha256":"4af90186cdf269429b72d28b0d170e033e0f3a4d6624fac7ae75244efc4018e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:56.567253Z","signature_b64":"mtiEr0otvuWF4P1TB30v2Pdt/z8ZP3PeuHGp8XbQZyMglzVvPdANGWm1j4GtNbZt9yi+6iQmvlhR3CRpA45JAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4af90186cdf269429b72d28b0d170e033e0f3a4d6624fac7ae75244efc4018e1","last_reissued_at":"2026-05-18T00:11:56.566591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:56.566591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08567","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-18T00:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/iOSssHwet2YTQ7JnMrtOIFg+GjwWjkUiXDUjSswafGHypVhAURrpBMURCEuf8Q4KBqYxcnG+HHRB1REXe/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:32:28.049040Z"},"content_sha256":"7949f71820790497b3d1dcb16ab4b3a3e6554b62984bef429da3f3109454f942","schema_version":"1.0","event_id":"sha256:7949f71820790497b3d1dcb16ab4b3a3e6554b62984bef429da3f3109454f942"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JL4QDBWN6JUUFG3S2KFQ2FYOAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring hypergraphs of low connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bjarne Toft, Michael Stiebitz, Thomas Schweser","submitted_at":"2018-06-22T09:20:39Z","abstract_excerpt":"For a hypergraph $G$, let $\\chi(G), \\Delta(G),$ and $\\lambda(G)$ denote the chromatic number, the maximum degree, and the maximum local edge connectivity of $G$, respectively. A result of Rhys Price Jones from 1975 says that every connected hypergraph $G$ satisfies $\\chi(G) \\leq \\Delta(G) + 1$ and equality holds if and only if $G$ is a complete graph, an odd cycle, or $G$ has just one (hyper-)edge. By a result of Bjarne Toft from 1970 it follows that every hypergraph $G$ satisfies $\\chi(G) \\leq \\lambda(G) + 1$. In this paper, we show that a hypergraph $G$ with $\\lambda(G) \\geq 3$ satisfies $\\c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08567","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":""},"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-18T00:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xkjy0awOdooJ8yLdAD9ny+Cgq+m+bpWt/noOAhmRrW1DL+Px/OldbYCXZ7TNed1bC75J2hOvu5UanwXq7T95CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:32:28.049740Z"},"content_sha256":"82fc6c5b05521339fc31a4a84b8fc27fcbe112777108fd8833e635b02007d1be","schema_version":"1.0","event_id":"sha256:82fc6c5b05521339fc31a4a84b8fc27fcbe112777108fd8833e635b02007d1be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JL4QDBWN6JUUFG3S2KFQ2FYOAM/bundle.json","state_url":"https://pith.science/pith/JL4QDBWN6JUUFG3S2KFQ2FYOAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JL4QDBWN6JUUFG3S2KFQ2FYOAM/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-07T18:32:28Z","links":{"resolver":"https://pith.science/pith/JL4QDBWN6JUUFG3S2KFQ2FYOAM","bundle":"https://pith.science/pith/JL4QDBWN6JUUFG3S2KFQ2FYOAM/bundle.json","state":"https://pith.science/pith/JL4QDBWN6JUUFG3S2KFQ2FYOAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JL4QDBWN6JUUFG3S2KFQ2FYOAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JL4QDBWN6JUUFG3S2KFQ2FYOAM","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":"69053025d30de72dc5cbeb181f33aa2666e50613d35d500e43d60047430b215e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-22T09:20:39Z","title_canon_sha256":"29304505ddf8d1f46a5cbc852a5fa84caac9a2f34091e0de08ffbe1421383bc5"},"schema_version":"1.0","source":{"id":"1806.08567","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08567","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08567v2","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08567","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"JL4QDBWN6JUU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JL4QDBWN6JUUFG3S","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JL4QDBWN","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:82fc6c5b05521339fc31a4a84b8fc27fcbe112777108fd8833e635b02007d1be","target":"graph","created_at":"2026-05-18T00:11:56Z","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":"For a hypergraph $G$, let $\\chi(G), \\Delta(G),$ and $\\lambda(G)$ denote the chromatic number, the maximum degree, and the maximum local edge connectivity of $G$, respectively. A result of Rhys Price Jones from 1975 says that every connected hypergraph $G$ satisfies $\\chi(G) \\leq \\Delta(G) + 1$ and equality holds if and only if $G$ is a complete graph, an odd cycle, or $G$ has just one (hyper-)edge. By a result of Bjarne Toft from 1970 it follows that every hypergraph $G$ satisfies $\\chi(G) \\leq \\lambda(G) + 1$. In this paper, we show that a hypergraph $G$ with $\\lambda(G) \\geq 3$ satisfies $\\c","authors_text":"Bjarne Toft, Michael Stiebitz, Thomas Schweser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-22T09:20:39Z","title":"Coloring hypergraphs of low connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08567","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:7949f71820790497b3d1dcb16ab4b3a3e6554b62984bef429da3f3109454f942","target":"record","created_at":"2026-05-18T00:11:56Z","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":"69053025d30de72dc5cbeb181f33aa2666e50613d35d500e43d60047430b215e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-22T09:20:39Z","title_canon_sha256":"29304505ddf8d1f46a5cbc852a5fa84caac9a2f34091e0de08ffbe1421383bc5"},"schema_version":"1.0","source":{"id":"1806.08567","kind":"arxiv","version":2}},"canonical_sha256":"4af90186cdf269429b72d28b0d170e033e0f3a4d6624fac7ae75244efc4018e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4af90186cdf269429b72d28b0d170e033e0f3a4d6624fac7ae75244efc4018e1","first_computed_at":"2026-05-18T00:11:56.566591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:56.566591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mtiEr0otvuWF4P1TB30v2Pdt/z8ZP3PeuHGp8XbQZyMglzVvPdANGWm1j4GtNbZt9yi+6iQmvlhR3CRpA45JAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:56.567253Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08567","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7949f71820790497b3d1dcb16ab4b3a3e6554b62984bef429da3f3109454f942","sha256:82fc6c5b05521339fc31a4a84b8fc27fcbe112777108fd8833e635b02007d1be"],"state_sha256":"23d8295aae7033baa912905f25c6c635f2ade97a3cc216f499c53972591fcace"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XEaygiWPBaCM/uApSmX//5AoPK4LNPWd8SbLgpV5wFPTsNkQzfbaaWWXyoxj+jU1oumvnmVD2kbPkA9J6HCCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:32:28.052324Z","bundle_sha256":"85b6baf50d1ee1d20bcede56439da193fc33328b7fcb99c3f94ca1fce88658a4"}}