{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:PKT3VDTG7FWQFQQIQJP62O5MKC","short_pith_number":"pith:PKT3VDTG","schema_version":"1.0","canonical_sha256":"7aa7ba8e66f96d02c208825fed3bac50b01603a19937701ef5f6a3aec68ee18e","source":{"kind":"arxiv","id":"math/0504607","version":2},"attestation_state":"computed","paper":{"title":"On generalized Kneser hypergraph colorings","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carsten Lange, Guenter M. Ziegler","submitted_at":"2005-04-29T19:51:43Z","abstract_excerpt":"In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs $\\KG{r}{\\pmb s}{\\calS}$, \"generalized $r$-uniform Kneser hypergraphs with intersection multiplicities $\\pmb s$.\" It generalized previous lower bounds by Kriz (1992/2000) for the case ${\\pmb s}=(1,...,1)$ without intersection multiplicities, and by Sarkaria (1990) for $\\calS=\\tbinom{[n]}k$. Here we discuss subtleties and difficulties that arise for intersection multiplicities $s_i>1$:\n  1. In the presence of intersection multiplicities, there are two different versions of a \"Kneser hypergraph,\""},"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":"math/0504607","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-04-29T19:51:43Z","cross_cats_sorted":[],"title_canon_sha256":"7af60f13fd874bd35a92ef32e9cd914bdb81d16968b6a3d96b7ac4ebdaa1703d","abstract_canon_sha256":"8e0890293ae7e140068a857bc82722121758fcfa50fd80e6822dafd6a8210296"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:25.583664Z","signature_b64":"6/Tze4CDQFGUJc9fYBB4wwyiMWWE2he7z1kr7Fylb99+9eqQwaYFtKdVLcIy9QAL3SYGK/KOPaoAleYHmnndCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aa7ba8e66f96d02c208825fed3bac50b01603a19937701ef5f6a3aec68ee18e","last_reissued_at":"2026-05-18T03:57:25.582925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:25.582925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On generalized Kneser hypergraph colorings","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carsten Lange, Guenter M. Ziegler","submitted_at":"2005-04-29T19:51:43Z","abstract_excerpt":"In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs $\\KG{r}{\\pmb s}{\\calS}$, \"generalized $r$-uniform Kneser hypergraphs with intersection multiplicities $\\pmb s$.\" It generalized previous lower bounds by Kriz (1992/2000) for the case ${\\pmb s}=(1,...,1)$ without intersection multiplicities, and by Sarkaria (1990) for $\\calS=\\tbinom{[n]}k$. Here we discuss subtleties and difficulties that arise for intersection multiplicities $s_i>1$:\n  1. In the presence of intersection multiplicities, there are two different versions of a \"Kneser hypergraph,\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0504607","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0504607","created_at":"2026-05-18T03:57:25.583042+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0504607v2","created_at":"2026-05-18T03:57:25.583042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0504607","created_at":"2026-05-18T03:57:25.583042+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKT3VDTG7FWQ","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKT3VDTG7FWQFQQI","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKT3VDTG","created_at":"2026-05-18T12:25:53.335082+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/PKT3VDTG7FWQFQQIQJP62O5MKC","json":"https://pith.science/pith/PKT3VDTG7FWQFQQIQJP62O5MKC.json","graph_json":"https://pith.science/api/pith-number/PKT3VDTG7FWQFQQIQJP62O5MKC/graph.json","events_json":"https://pith.science/api/pith-number/PKT3VDTG7FWQFQQIQJP62O5MKC/events.json","paper":"https://pith.science/paper/PKT3VDTG"},"agent_actions":{"view_html":"https://pith.science/pith/PKT3VDTG7FWQFQQIQJP62O5MKC","download_json":"https://pith.science/pith/PKT3VDTG7FWQFQQIQJP62O5MKC.json","view_paper":"https://pith.science/paper/PKT3VDTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0504607&json=true","fetch_graph":"https://pith.science/api/pith-number/PKT3VDTG7FWQFQQIQJP62O5MKC/graph.json","fetch_events":"https://pith.science/api/pith-number/PKT3VDTG7FWQFQQIQJP62O5MKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKT3VDTG7FWQFQQIQJP62O5MKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKT3VDTG7FWQFQQIQJP62O5MKC/action/storage_attestation","attest_author":"https://pith.science/pith/PKT3VDTG7FWQFQQIQJP62O5MKC/action/author_attestation","sign_citation":"https://pith.science/pith/PKT3VDTG7FWQFQQIQJP62O5MKC/action/citation_signature","submit_replication":"https://pith.science/pith/PKT3VDTG7FWQFQQIQJP62O5MKC/action/replication_record"}},"created_at":"2026-05-18T03:57:25.583042+00:00","updated_at":"2026-05-18T03:57:25.583042+00:00"}