{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I7OAEBQRDWYFZHC5ZUENLD5GC5","short_pith_number":"pith:I7OAEBQR","schema_version":"1.0","canonical_sha256":"47dc0206111db05c9c5dcd08d58fa6175870cce001116e434873c4e629ea5f8d","source":{"kind":"arxiv","id":"1310.7964","version":1},"attestation_state":"computed","paper":{"title":"Approximability of the upper chromatic number of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Zsolt Tuza","submitted_at":"2013-10-29T20:56:02Z","abstract_excerpt":"A C-coloring of a hypergraph ${\\cal H}=(X,{\\cal E})$ is a vertex coloring $\\varphi: X\\to {\\mathbb{N}}$ such that each edge $E\\in{\\cal E}$ has at least two vertices with a common color. The related parameter $\\overline{\\chi}({\\cal H})$, called the upper chromatic number of ${\\cal H}$, is the maximum number of colors can be used in a C-coloring of ${\\cal H}$. A hypertree is a hypergraph which has a host tree $T$ such that each edge $E\\in {\\cal E}$ induces a connected subgraph in $T$. Notations $n$ and $m$ stand for the number of vertices and edges, respectively, in a generic input hypergraph.\n  "},"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":"1310.7964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-29T20:56:02Z","cross_cats_sorted":[],"title_canon_sha256":"753beffb44e799af4f5799c646db6470b4c8f3bde665e40ec8d0827f9b24dd66","abstract_canon_sha256":"67ac62b7b07e3276eb498990cad4f9ee1ba766f939c1ac7c9437a2a47cf983db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:26.414808Z","signature_b64":"ir5YIoSJAkQy8BmT5Rj754lYRxKGlus38LgtWENdjwkFtAleesA03/PH6uL3ViXE7l7s4K4Wn2zXHmMHg0+mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47dc0206111db05c9c5dcd08d58fa6175870cce001116e434873c4e629ea5f8d","last_reissued_at":"2026-05-18T03:08:26.414105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:26.414105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximability of the upper chromatic number of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Zsolt Tuza","submitted_at":"2013-10-29T20:56:02Z","abstract_excerpt":"A C-coloring of a hypergraph ${\\cal H}=(X,{\\cal E})$ is a vertex coloring $\\varphi: X\\to {\\mathbb{N}}$ such that each edge $E\\in{\\cal E}$ has at least two vertices with a common color. The related parameter $\\overline{\\chi}({\\cal H})$, called the upper chromatic number of ${\\cal H}$, is the maximum number of colors can be used in a C-coloring of ${\\cal H}$. A hypertree is a hypergraph which has a host tree $T$ such that each edge $E\\in {\\cal E}$ induces a connected subgraph in $T$. Notations $n$ and $m$ stand for the number of vertices and edges, respectively, in a generic input hypergraph.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7964","kind":"arxiv","version":1},"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":"1310.7964","created_at":"2026-05-18T03:08:26.414198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7964v1","created_at":"2026-05-18T03:08:26.414198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7964","created_at":"2026-05-18T03:08:26.414198+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7OAEBQRDWYF","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7OAEBQRDWYFZHC5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7OAEBQR","created_at":"2026-05-18T12:27:46.883200+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/I7OAEBQRDWYFZHC5ZUENLD5GC5","json":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5.json","graph_json":"https://pith.science/api/pith-number/I7OAEBQRDWYFZHC5ZUENLD5GC5/graph.json","events_json":"https://pith.science/api/pith-number/I7OAEBQRDWYFZHC5ZUENLD5GC5/events.json","paper":"https://pith.science/paper/I7OAEBQR"},"agent_actions":{"view_html":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5","download_json":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5.json","view_paper":"https://pith.science/paper/I7OAEBQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7964&json=true","fetch_graph":"https://pith.science/api/pith-number/I7OAEBQRDWYFZHC5ZUENLD5GC5/graph.json","fetch_events":"https://pith.science/api/pith-number/I7OAEBQRDWYFZHC5ZUENLD5GC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/action/storage_attestation","attest_author":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/action/author_attestation","sign_citation":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/action/citation_signature","submit_replication":"https://pith.science/pith/I7OAEBQRDWYFZHC5ZUENLD5GC5/action/replication_record"}},"created_at":"2026-05-18T03:08:26.414198+00:00","updated_at":"2026-05-18T03:08:26.414198+00:00"}