{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NUMZAJPMG64ZCRBMOQULGXO3X3","short_pith_number":"pith:NUMZAJPM","schema_version":"1.0","canonical_sha256":"6d199025ec37b991442c7428b35ddbbee509f031ca768bb25cd553f0ca6c4c7f","source":{"kind":"arxiv","id":"1104.0483","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.0483","created_at":"2026-05-18T03:56:46.283605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.0483v3","created_at":"2026-05-18T03:56:46.283605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0483","created_at":"2026-05-18T03:56:46.283605+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUMZAJPMG64Z","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUMZAJPMG64ZCRBM","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUMZAJPM","created_at":"2026-05-18T12:26:37.096874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3","json":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3.json","graph_json":"https://pith.science/api/pith-number/NUMZAJPMG64ZCRBMOQULGXO3X3/graph.json","events_json":"https://pith.science/api/pith-number/NUMZAJPMG64ZCRBMOQULGXO3X3/events.json","paper":"https://pith.science/paper/NUMZAJPM"},"agent_actions":{"view_html":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3","download_json":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3.json","view_paper":"https://pith.science/paper/NUMZAJPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.0483&json=true","fetch_graph":"https://pith.science/api/pith-number/NUMZAJPMG64ZCRBMOQULGXO3X3/graph.json","fetch_events":"https://pith.science/api/pith-number/NUMZAJPMG64ZCRBMOQULGXO3X3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/action/storage_attestation","attest_author":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/action/author_attestation","sign_citation":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/action/citation_signature","submit_replication":"https://pith.science/pith/NUMZAJPMG64ZCRBMOQULGXO3X3/action/replication_record"}},"created_at":"2026-05-18T03:56:46.283605+00:00","updated_at":"2026-05-18T03:56:46.283605+00:00"}