{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Q3IBDYNOEBX2HL25LSHBYXYLNM","short_pith_number":"pith:Q3IBDYNO","schema_version":"1.0","canonical_sha256":"86d011e1ae206fa3af5d5c8e1c5f0b6b0ea4dfb9f1f3bfca472812da4ec52306","source":{"kind":"arxiv","id":"2409.01654","version":1},"attestation_state":"computed","paper":{"title":"Uniquely colorable hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianhen Wang, Tianming Zhu, Xizhi Liu","submitted_at":"2024-09-03T06:47:33Z","abstract_excerpt":"An $r$-uniform hypergraph is uniquely $k$-colorable if there exists exactly one partition of its vertex set into $k$ parts such that every edge contains at most one vertex from each part. For integers $k \\ge r \\ge 2$, let $\\Phi_{k,r}$ denote the minimum real number such that every $n$-vertex $k$-partite $r$-uniform hypergraph with positive codegree greater than $\\Phi_{k,r} \\cdot n$ and no isolated vertices is uniquely $k$-colorable. A classic result by of Bollob\\'{a}s\\cite{Bol78} established that $\\Phi_{k,2} = \\frac{3k-5}{3k-2}$ for every $k \\ge 2$.\n  We consider the uniquely colorable problem"},"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":"2409.01654","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T06:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"d5830b7b9aad3108349df53690ae432cc33c6693b8e16589b47325412e7a6c77","abstract_canon_sha256":"6e52609d9a46f7d30983e4d57a626ad1e8c00679311fe15bf2cc61d8e7c1b323"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:32.284061Z","signature_b64":"ibMhpLbdDj6T6dqBl+imdwKs9X36igXl4BqdzYfzj6wVjhkQXmxANPTu1XpLAIo/vYWElOGSdb79NpVnmg4mBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86d011e1ae206fa3af5d5c8e1c5f0b6b0ea4dfb9f1f3bfca472812da4ec52306","last_reissued_at":"2026-07-05T09:02:32.283533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:32.283533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniquely colorable hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianhen Wang, Tianming Zhu, Xizhi Liu","submitted_at":"2024-09-03T06:47:33Z","abstract_excerpt":"An $r$-uniform hypergraph is uniquely $k$-colorable if there exists exactly one partition of its vertex set into $k$ parts such that every edge contains at most one vertex from each part. For integers $k \\ge r \\ge 2$, let $\\Phi_{k,r}$ denote the minimum real number such that every $n$-vertex $k$-partite $r$-uniform hypergraph with positive codegree greater than $\\Phi_{k,r} \\cdot n$ and no isolated vertices is uniquely $k$-colorable. A classic result by of Bollob\\'{a}s\\cite{Bol78} established that $\\Phi_{k,2} = \\frac{3k-5}{3k-2}$ for every $k \\ge 2$.\n  We consider the uniquely colorable problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01654","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.01654/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.01654","created_at":"2026-07-05T09:02:32.283597+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.01654v1","created_at":"2026-07-05T09:02:32.283597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01654","created_at":"2026-07-05T09:02:32.283597+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3IBDYNOEBX2","created_at":"2026-07-05T09:02:32.283597+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3IBDYNOEBX2HL25","created_at":"2026-07-05T09:02:32.283597+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3IBDYNO","created_at":"2026-07-05T09:02:32.283597+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/Q3IBDYNOEBX2HL25LSHBYXYLNM","json":"https://pith.science/pith/Q3IBDYNOEBX2HL25LSHBYXYLNM.json","graph_json":"https://pith.science/api/pith-number/Q3IBDYNOEBX2HL25LSHBYXYLNM/graph.json","events_json":"https://pith.science/api/pith-number/Q3IBDYNOEBX2HL25LSHBYXYLNM/events.json","paper":"https://pith.science/paper/Q3IBDYNO"},"agent_actions":{"view_html":"https://pith.science/pith/Q3IBDYNOEBX2HL25LSHBYXYLNM","download_json":"https://pith.science/pith/Q3IBDYNOEBX2HL25LSHBYXYLNM.json","view_paper":"https://pith.science/paper/Q3IBDYNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.01654&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3IBDYNOEBX2HL25LSHBYXYLNM/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3IBDYNOEBX2HL25LSHBYXYLNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3IBDYNOEBX2HL25LSHBYXYLNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3IBDYNOEBX2HL25LSHBYXYLNM/action/storage_attestation","attest_author":"https://pith.science/pith/Q3IBDYNOEBX2HL25LSHBYXYLNM/action/author_attestation","sign_citation":"https://pith.science/pith/Q3IBDYNOEBX2HL25LSHBYXYLNM/action/citation_signature","submit_replication":"https://pith.science/pith/Q3IBDYNOEBX2HL25LSHBYXYLNM/action/replication_record"}},"created_at":"2026-07-05T09:02:32.283597+00:00","updated_at":"2026-07-05T09:02:32.283597+00:00"}