{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BWKI4XSUS4NT4UBOMTNEFG6XBN","short_pith_number":"pith:BWKI4XSU","schema_version":"1.0","canonical_sha256":"0d948e5e54971b3e502e64da429bd70b6408b0a79d8e9c6f58fcd1f7995af18a","source":{"kind":"arxiv","id":"1606.05045","version":4},"attestation_state":"computed","paper":{"title":"Some properties and applications of odd-colorable $r$-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chen Ouyang, Jiayu Shao, Liqun Qi, Xiying Yuan","submitted_at":"2016-06-16T03:59:56Z","abstract_excerpt":"Let $r\\geq2$ and $r$ be even. An $r$-hypergraph $G$ on $n$ vertices is called odd-colorable if there exists a map $\\varphi:[n]\\rightarrow\\lbrack r]$ such that for any edge $\\{j_{1},j_{2},\\cdots,j_{r}\\}$ of $G$, we have $\\varphi(j_{1})+\\varphi(j_{2})+\\cdot\\cdot\\cdot+\\varphi(j_{r})\\equiv r/2(\\operatorname{mod}r).$ In this paper, we first determine that, if $r=2^{q}(2t+1)$ and $n\\ge 2^{q}(2^{q}-1)r$, then the maximum chromatic number in the class of the odd-colorable $r$-hypergraphs on $n$ vertices is $2^q$, which answers a question raised by V. Nikiforov recently in [V. Nikiforov, Hypergraphs an"},"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":"1606.05045","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-16T03:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"51b5df7ca7ffd3e3a99b76b864d3eaafdc1e9236f01dc44790db54034980a802","abstract_canon_sha256":"c4dd7050bc79be971851863633b99cad4e6680a76affc983902af78f980a97a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:24.155768Z","signature_b64":"CX5gqpZCVaCCTnuBGdk6qXyEVE3rX5Gq1zb4WJmMyXuPFrgmjtvnkk/x1PxWjF9iRfW3ug8UyOKkzaquexlGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d948e5e54971b3e502e64da429bd70b6408b0a79d8e9c6f58fcd1f7995af18a","last_reissued_at":"2026-05-18T01:06:24.155247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:24.155247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some properties and applications of odd-colorable $r$-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chen Ouyang, Jiayu Shao, Liqun Qi, Xiying Yuan","submitted_at":"2016-06-16T03:59:56Z","abstract_excerpt":"Let $r\\geq2$ and $r$ be even. An $r$-hypergraph $G$ on $n$ vertices is called odd-colorable if there exists a map $\\varphi:[n]\\rightarrow\\lbrack r]$ such that for any edge $\\{j_{1},j_{2},\\cdots,j_{r}\\}$ of $G$, we have $\\varphi(j_{1})+\\varphi(j_{2})+\\cdot\\cdot\\cdot+\\varphi(j_{r})\\equiv r/2(\\operatorname{mod}r).$ In this paper, we first determine that, if $r=2^{q}(2t+1)$ and $n\\ge 2^{q}(2^{q}-1)r$, then the maximum chromatic number in the class of the odd-colorable $r$-hypergraphs on $n$ vertices is $2^q$, which answers a question raised by V. Nikiforov recently in [V. Nikiforov, Hypergraphs an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05045","kind":"arxiv","version":4},"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":"1606.05045","created_at":"2026-05-18T01:06:24.155330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05045v4","created_at":"2026-05-18T01:06:24.155330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05045","created_at":"2026-05-18T01:06:24.155330+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWKI4XSUS4NT","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWKI4XSUS4NT4UBO","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWKI4XSU","created_at":"2026-05-18T12:30:09.641336+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/BWKI4XSUS4NT4UBOMTNEFG6XBN","json":"https://pith.science/pith/BWKI4XSUS4NT4UBOMTNEFG6XBN.json","graph_json":"https://pith.science/api/pith-number/BWKI4XSUS4NT4UBOMTNEFG6XBN/graph.json","events_json":"https://pith.science/api/pith-number/BWKI4XSUS4NT4UBOMTNEFG6XBN/events.json","paper":"https://pith.science/paper/BWKI4XSU"},"agent_actions":{"view_html":"https://pith.science/pith/BWKI4XSUS4NT4UBOMTNEFG6XBN","download_json":"https://pith.science/pith/BWKI4XSUS4NT4UBOMTNEFG6XBN.json","view_paper":"https://pith.science/paper/BWKI4XSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05045&json=true","fetch_graph":"https://pith.science/api/pith-number/BWKI4XSUS4NT4UBOMTNEFG6XBN/graph.json","fetch_events":"https://pith.science/api/pith-number/BWKI4XSUS4NT4UBOMTNEFG6XBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWKI4XSUS4NT4UBOMTNEFG6XBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWKI4XSUS4NT4UBOMTNEFG6XBN/action/storage_attestation","attest_author":"https://pith.science/pith/BWKI4XSUS4NT4UBOMTNEFG6XBN/action/author_attestation","sign_citation":"https://pith.science/pith/BWKI4XSUS4NT4UBOMTNEFG6XBN/action/citation_signature","submit_replication":"https://pith.science/pith/BWKI4XSUS4NT4UBOMTNEFG6XBN/action/replication_record"}},"created_at":"2026-05-18T01:06:24.155330+00:00","updated_at":"2026-05-18T01:06:24.155330+00:00"}