{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MZYLDVSA7JDXEQ3EVWX2EJ2P4M","short_pith_number":"pith:MZYLDVSA","schema_version":"1.0","canonical_sha256":"6670b1d640fa47724364adafa2274fe30355f2261a0c1c025220d3c07239e584","source":{"kind":"arxiv","id":"1401.1920","version":1},"attestation_state":"computed","paper":{"title":"Constrained colouring and $\\sigma$-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","submitted_at":"2014-01-09T08:09:44Z","abstract_excerpt":"A constrained colouring or, more specifically, an $(\\alpha,\\beta)$-colouring of a hypergraph $H$, is an assignment of colours to its vertices such that no edge of $H$ contains less than $\\alpha$ or more than $\\beta$ vertices with different colours. This notion, introduced by B{\\'u}jtas and Tuza, generalises both classical hypergraph colourings and the more general Voloshin colourings of hypergraphs. In fact, for $r$-uniform hypergraphs, classical colourings correspond to $(2,r)$-colourings while an important instance of Voloshin colourings of $r$-uniform hypergraphs gives $(2, r-1)$-colourings"},"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":"1401.1920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-09T08:09:44Z","cross_cats_sorted":[],"title_canon_sha256":"879d324d0c4393e5308272b9b34ce00cbcbfd4f563002039512e4eaa49ebe519","abstract_canon_sha256":"1bf0204a49b3deac2190e10044f80bac51701c14ff3cc7bb9203e9b6d3e423f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:56.223363Z","signature_b64":"vHJuuI6aWyP+rMVCO9thUf3A+D49VKy4vzwL+DJY5cyb8hl61u47sQBRGxmmwBereLZWWr7gbWe3pbsZhVwICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6670b1d640fa47724364adafa2274fe30355f2261a0c1c025220d3c07239e584","last_reissued_at":"2026-05-18T03:02:56.222882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:56.222882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained colouring and $\\sigma$-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","submitted_at":"2014-01-09T08:09:44Z","abstract_excerpt":"A constrained colouring or, more specifically, an $(\\alpha,\\beta)$-colouring of a hypergraph $H$, is an assignment of colours to its vertices such that no edge of $H$ contains less than $\\alpha$ or more than $\\beta$ vertices with different colours. This notion, introduced by B{\\'u}jtas and Tuza, generalises both classical hypergraph colourings and the more general Voloshin colourings of hypergraphs. In fact, for $r$-uniform hypergraphs, classical colourings correspond to $(2,r)$-colourings while an important instance of Voloshin colourings of $r$-uniform hypergraphs gives $(2, r-1)$-colourings"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1920","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":"1401.1920","created_at":"2026-05-18T03:02:56.222952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1920v1","created_at":"2026-05-18T03:02:56.222952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1920","created_at":"2026-05-18T03:02:56.222952+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZYLDVSA7JDX","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZYLDVSA7JDXEQ3E","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZYLDVSA","created_at":"2026-05-18T12:28:41.024544+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/MZYLDVSA7JDXEQ3EVWX2EJ2P4M","json":"https://pith.science/pith/MZYLDVSA7JDXEQ3EVWX2EJ2P4M.json","graph_json":"https://pith.science/api/pith-number/MZYLDVSA7JDXEQ3EVWX2EJ2P4M/graph.json","events_json":"https://pith.science/api/pith-number/MZYLDVSA7JDXEQ3EVWX2EJ2P4M/events.json","paper":"https://pith.science/paper/MZYLDVSA"},"agent_actions":{"view_html":"https://pith.science/pith/MZYLDVSA7JDXEQ3EVWX2EJ2P4M","download_json":"https://pith.science/pith/MZYLDVSA7JDXEQ3EVWX2EJ2P4M.json","view_paper":"https://pith.science/paper/MZYLDVSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1920&json=true","fetch_graph":"https://pith.science/api/pith-number/MZYLDVSA7JDXEQ3EVWX2EJ2P4M/graph.json","fetch_events":"https://pith.science/api/pith-number/MZYLDVSA7JDXEQ3EVWX2EJ2P4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZYLDVSA7JDXEQ3EVWX2EJ2P4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZYLDVSA7JDXEQ3EVWX2EJ2P4M/action/storage_attestation","attest_author":"https://pith.science/pith/MZYLDVSA7JDXEQ3EVWX2EJ2P4M/action/author_attestation","sign_citation":"https://pith.science/pith/MZYLDVSA7JDXEQ3EVWX2EJ2P4M/action/citation_signature","submit_replication":"https://pith.science/pith/MZYLDVSA7JDXEQ3EVWX2EJ2P4M/action/replication_record"}},"created_at":"2026-05-18T03:02:56.222952+00:00","updated_at":"2026-05-18T03:02:56.222952+00:00"}