{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RFE53LES6IG4WY4RAOUJAWHKLE","short_pith_number":"pith:RFE53LES","schema_version":"1.0","canonical_sha256":"8949ddac92f20dcb639103a89058ea590bb0c923c14aabdfda0142e7008c8b43","source":{"kind":"arxiv","id":"1307.6642","version":1},"attestation_state":"computed","paper":{"title":"Non-monochromatic non-rainbow colourings of $\\sigma$-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josef Lauri, Yair Caro","submitted_at":"2013-07-25T07:03:40Z","abstract_excerpt":"One of the most interesting new developments in hypergraph colourings in these last few years has been Voloshin's notion of colourings of mixed hypergraphs. In this paper we shall study a specific instance of Voloshin's idea: a non-monochromatic non-rainbow (NMNR) colouring of a hypergraph is a colouring of its vertices such that every edge has at least two vertices coloured with different colours (non-monochromatic) and no edge has all of its vertices coloured with distinct colours (non-rainbow). Perhaps the most intriguing phenomenon of such colourings is that a hypergraph can have gaps in i"},"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":"1307.6642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-25T07:03:40Z","cross_cats_sorted":[],"title_canon_sha256":"f2980a36481cb2366a70052d0101fb093893cb3f232d157ac91cdeea58f12eaf","abstract_canon_sha256":"ff41a81c6158429ad7807e9c16352abdf032a381f9136af38c7f8fcad76407ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:35.746205Z","signature_b64":"R3b7MoAuV59FjoeE2I9x5hk5MdNs2x6SOjOOgK5KhvvxApPelFcaWywoHvf0Y4xZcwz3XYOhgpO/6WQ3o1NBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8949ddac92f20dcb639103a89058ea590bb0c923c14aabdfda0142e7008c8b43","last_reissued_at":"2026-05-18T03:17:35.745723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:35.745723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-monochromatic non-rainbow colourings of $\\sigma$-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josef Lauri, Yair Caro","submitted_at":"2013-07-25T07:03:40Z","abstract_excerpt":"One of the most interesting new developments in hypergraph colourings in these last few years has been Voloshin's notion of colourings of mixed hypergraphs. In this paper we shall study a specific instance of Voloshin's idea: a non-monochromatic non-rainbow (NMNR) colouring of a hypergraph is a colouring of its vertices such that every edge has at least two vertices coloured with different colours (non-monochromatic) and no edge has all of its vertices coloured with distinct colours (non-rainbow). Perhaps the most intriguing phenomenon of such colourings is that a hypergraph can have gaps in i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6642","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":"1307.6642","created_at":"2026-05-18T03:17:35.745798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6642v1","created_at":"2026-05-18T03:17:35.745798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6642","created_at":"2026-05-18T03:17:35.745798+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFE53LES6IG4","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFE53LES6IG4WY4R","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFE53LES","created_at":"2026-05-18T12:27:57.521954+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/RFE53LES6IG4WY4RAOUJAWHKLE","json":"https://pith.science/pith/RFE53LES6IG4WY4RAOUJAWHKLE.json","graph_json":"https://pith.science/api/pith-number/RFE53LES6IG4WY4RAOUJAWHKLE/graph.json","events_json":"https://pith.science/api/pith-number/RFE53LES6IG4WY4RAOUJAWHKLE/events.json","paper":"https://pith.science/paper/RFE53LES"},"agent_actions":{"view_html":"https://pith.science/pith/RFE53LES6IG4WY4RAOUJAWHKLE","download_json":"https://pith.science/pith/RFE53LES6IG4WY4RAOUJAWHKLE.json","view_paper":"https://pith.science/paper/RFE53LES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6642&json=true","fetch_graph":"https://pith.science/api/pith-number/RFE53LES6IG4WY4RAOUJAWHKLE/graph.json","fetch_events":"https://pith.science/api/pith-number/RFE53LES6IG4WY4RAOUJAWHKLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFE53LES6IG4WY4RAOUJAWHKLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFE53LES6IG4WY4RAOUJAWHKLE/action/storage_attestation","attest_author":"https://pith.science/pith/RFE53LES6IG4WY4RAOUJAWHKLE/action/author_attestation","sign_citation":"https://pith.science/pith/RFE53LES6IG4WY4RAOUJAWHKLE/action/citation_signature","submit_replication":"https://pith.science/pith/RFE53LES6IG4WY4RAOUJAWHKLE/action/replication_record"}},"created_at":"2026-05-18T03:17:35.745798+00:00","updated_at":"2026-05-18T03:17:35.745798+00:00"}