{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:23274J4NDVZ46YLUYAVX24AMY7","short_pith_number":"pith:23274J4N","schema_version":"1.0","canonical_sha256":"d6f5fe278d1d73cf6174c02b7d700cc7c2c2605b971a9d963231d65fe8cd3086","source":{"kind":"arxiv","id":"1209.4879","version":2},"attestation_state":"computed","paper":{"title":"Coloring d-Embeddable k-Uniform Hypergraphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anusch Taraz, Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko","submitted_at":"2012-09-21T18:19:47Z","abstract_excerpt":"This paper extends the scenario of the Four Color Theorem in the following way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly) embedded into R^d. We investigate lower and upper bounds on the maximum (weak and strong) chromatic number of hypergraphs in H(d,k). For example, we can prove that for d>2 there are hypergraphs in H(2d-3,d) on n vertices whose weak chromatic number is Omega(log n/log log n), whereas the weak chromatic number for n-vertex hypergraphs in H(d,d) is bounded by O(n^((d-2)/(d-1))) for d>2."},"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":"1209.4879","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-09-21T18:19:47Z","cross_cats_sorted":[],"title_canon_sha256":"d22a8f1a0526dd82dbecefa1cba142c7bd7478dd4acddbf7b6b13ac6c06884b0","abstract_canon_sha256":"e1666cdd1f6ccf3fd5da5823b5078efecd6cc9c010078c036b5d61ee6b4b0b5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:39.237655Z","signature_b64":"z3fLSXvFP/+IAouOUNrLw6+0yvVp3wqzoAmXPljew5cZqxJ2RL8ZCWuayJb4eY9yumPtluA2IRV9DFj7L2SUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6f5fe278d1d73cf6174c02b7d700cc7c2c2605b971a9d963231d65fe8cd3086","last_reissued_at":"2026-05-18T02:32:39.237105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:39.237105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring d-Embeddable k-Uniform Hypergraphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anusch Taraz, Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko","submitted_at":"2012-09-21T18:19:47Z","abstract_excerpt":"This paper extends the scenario of the Four Color Theorem in the following way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly) embedded into R^d. We investigate lower and upper bounds on the maximum (weak and strong) chromatic number of hypergraphs in H(d,k). For example, we can prove that for d>2 there are hypergraphs in H(2d-3,d) on n vertices whose weak chromatic number is Omega(log n/log log n), whereas the weak chromatic number for n-vertex hypergraphs in H(d,d) is bounded by O(n^((d-2)/(d-1))) for d>2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4879","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":"1209.4879","created_at":"2026-05-18T02:32:39.237201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.4879v2","created_at":"2026-05-18T02:32:39.237201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4879","created_at":"2026-05-18T02:32:39.237201+00:00"},{"alias_kind":"pith_short_12","alias_value":"23274J4NDVZ4","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"23274J4NDVZ46YLU","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"23274J4N","created_at":"2026-05-18T12:26:50.516681+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/23274J4NDVZ46YLUYAVX24AMY7","json":"https://pith.science/pith/23274J4NDVZ46YLUYAVX24AMY7.json","graph_json":"https://pith.science/api/pith-number/23274J4NDVZ46YLUYAVX24AMY7/graph.json","events_json":"https://pith.science/api/pith-number/23274J4NDVZ46YLUYAVX24AMY7/events.json","paper":"https://pith.science/paper/23274J4N"},"agent_actions":{"view_html":"https://pith.science/pith/23274J4NDVZ46YLUYAVX24AMY7","download_json":"https://pith.science/pith/23274J4NDVZ46YLUYAVX24AMY7.json","view_paper":"https://pith.science/paper/23274J4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.4879&json=true","fetch_graph":"https://pith.science/api/pith-number/23274J4NDVZ46YLUYAVX24AMY7/graph.json","fetch_events":"https://pith.science/api/pith-number/23274J4NDVZ46YLUYAVX24AMY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23274J4NDVZ46YLUYAVX24AMY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23274J4NDVZ46YLUYAVX24AMY7/action/storage_attestation","attest_author":"https://pith.science/pith/23274J4NDVZ46YLUYAVX24AMY7/action/author_attestation","sign_citation":"https://pith.science/pith/23274J4NDVZ46YLUYAVX24AMY7/action/citation_signature","submit_replication":"https://pith.science/pith/23274J4NDVZ46YLUYAVX24AMY7/action/replication_record"}},"created_at":"2026-05-18T02:32:39.237201+00:00","updated_at":"2026-05-18T02:32:39.237201+00:00"}