{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NUMZAJPMG64ZCRBMOQULGXO3X3","short_pith_number":"pith:NUMZAJPM","canonical_record":{"source":{"id":"1104.0483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-04T07:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"32b2002703bf18f347b67c5ff1ca4e57dcfe7c94cb36012af890bc61e2c5f25d","abstract_canon_sha256":"5531fc4b25d8648df63ed31acce814a1debde89cf10839832dfb0892b7521d2c"},"schema_version":"1.0"},"canonical_sha256":"6d199025ec37b991442c7428b35ddbbee509f031ca768bb25cd553f0ca6c4c7f","source":{"kind":"arxiv","id":"1104.0483","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0483","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0483v3","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0483","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"NUMZAJPMG64Z","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NUMZAJPMG64ZCRBM","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NUMZAJPM","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NUMZAJPMG64ZCRBMOQULGXO3X3","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0483","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-04T07:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"32b2002703bf18f347b67c5ff1ca4e57dcfe7c94cb36012af890bc61e2c5f25d","abstract_canon_sha256":"5531fc4b25d8648df63ed31acce814a1debde89cf10839832dfb0892b7521d2c"},"schema_version":"1.0"},"canonical_sha256":"6d199025ec37b991442c7428b35ddbbee509f031ca768bb25cd553f0ca6c4c7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:46.284090Z","signature_b64":"48EP3t+AybO3+3uRktRIAYsQTiZC28BhunaFyQgKds/4KN+L+lfjUZPoe0Hq/7TLFa0+3VVusCwTYvJADry6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d199025ec37b991442c7428b35ddbbee509f031ca768bb25cd553f0ca6c4c7f","last_reissued_at":"2026-05-18T03:56:46.283496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:46.283496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0483","source_version":3,"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-18T03:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJK2gMfaE/F7Rkqvr+sqHKAaHcTKowVJBwesbfD31YiSvdm6mMk3BVQzHlSK6vkOQnkIQNMgARyfC4NqQCxoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:52:16.717370Z"},"content_sha256":"c53ca92912df7842b96d5f9eef366d32737e116bfb258c6513263b464df7374a","schema_version":"1.0","event_id":"sha256:c53ca92912df7842b96d5f9eef366d32737e116bfb258c6513263b464df7374a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NUMZAJPMG64ZCRBMOQULGXO3X3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hypergraph Coloring Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aaron Dall, Felix Breuer, Martina Kubitzke","submitted_at":"2011-04-04T07:45:43Z","abstract_excerpt":"The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most of the properties, which are known to be true for coloring complexes of graphs, break down in this more general setting, e.g., Cohen-Macaulayness and partitionabilty. Nevertheless, we are able to provide bounds for the $f$- and $h$-vectors of those complexes which yield new bounds on chromatic polynomials of hypergraphs. Moreover, it is shown that the colori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0483","kind":"arxiv","version":3},"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-18T03:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRb2sCC0UzA1cbENGhruHBFkBTun73wgUDcBWem8FqX4Ap67enCP92U2cUJJnO5O4SJgN3q6U0Ht9SeZDfgCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:52:16.717720Z"},"content_sha256":"f3a249ff40e2f338b6fb6d1314700a49fab70bf3a7e10d9935839a784f0cf0a4","schema_version":"1.0","event_id":"sha256:f3a249ff40e2f338b6fb6d1314700a49fab70bf3a7e10d9935839a784f0cf0a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/bundle.json","state_url":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/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-05T08:52:16Z","links":{"resolver":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3","bundle":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/bundle.json","state":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NUMZAJPMG64ZCRBMOQULGXO3X3","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":"5531fc4b25d8648df63ed31acce814a1debde89cf10839832dfb0892b7521d2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-04T07:45:43Z","title_canon_sha256":"32b2002703bf18f347b67c5ff1ca4e57dcfe7c94cb36012af890bc61e2c5f25d"},"schema_version":"1.0","source":{"id":"1104.0483","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0483","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0483v3","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0483","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"NUMZAJPMG64Z","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NUMZAJPMG64ZCRBM","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NUMZAJPM","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:f3a249ff40e2f338b6fb6d1314700a49fab70bf3a7e10d9935839a784f0cf0a4","target":"graph","created_at":"2026-05-18T03:56:46Z","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":"The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most of the properties, which are known to be true for coloring complexes of graphs, break down in this more general setting, e.g., Cohen-Macaulayness and partitionabilty. Nevertheless, we are able to provide bounds for the $f$- and $h$-vectors of those complexes which yield new bounds on chromatic polynomials of hypergraphs. Moreover, it is shown that the colori","authors_text":"Aaron Dall, Felix Breuer, Martina Kubitzke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-04T07:45:43Z","title":"Hypergraph Coloring Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0483","kind":"arxiv","version":3},"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:c53ca92912df7842b96d5f9eef366d32737e116bfb258c6513263b464df7374a","target":"record","created_at":"2026-05-18T03:56:46Z","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":"5531fc4b25d8648df63ed31acce814a1debde89cf10839832dfb0892b7521d2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-04T07:45:43Z","title_canon_sha256":"32b2002703bf18f347b67c5ff1ca4e57dcfe7c94cb36012af890bc61e2c5f25d"},"schema_version":"1.0","source":{"id":"1104.0483","kind":"arxiv","version":3}},"canonical_sha256":"6d199025ec37b991442c7428b35ddbbee509f031ca768bb25cd553f0ca6c4c7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d199025ec37b991442c7428b35ddbbee509f031ca768bb25cd553f0ca6c4c7f","first_computed_at":"2026-05-18T03:56:46.283496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:46.283496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"48EP3t+AybO3+3uRktRIAYsQTiZC28BhunaFyQgKds/4KN+L+lfjUZPoe0Hq/7TLFa0+3VVusCwTYvJADry6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:46.284090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0483","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c53ca92912df7842b96d5f9eef366d32737e116bfb258c6513263b464df7374a","sha256:f3a249ff40e2f338b6fb6d1314700a49fab70bf3a7e10d9935839a784f0cf0a4"],"state_sha256":"b1f2458eeb7665fe33ca54ec79ec32c3e7a2925298930e3ad1e9302c1f739626"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJDae5jnIaTcxd8SdSCd+lLfOBkSSyUZEa1u3+CJu4kCTpRTikUT8KzkgmznRfgxxitWVb5lNhBoXGzxFxYEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:52:16.719612Z","bundle_sha256":"5fc785fc21245f4e95beb3073110176923562508e070f1b2ef79be6f17735a62"}}