{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:D6NA33F2X5RDVRGOLYSGOYW2SI","short_pith_number":"pith:D6NA33F2","schema_version":"1.0","canonical_sha256":"1f9a0decbabf623ac4ce5e246762da92240dc3d2cfbd258d7ad5e357254e6f4f","source":{"kind":"arxiv","id":"2010.09091","version":3},"attestation_state":"computed","paper":{"title":"Colourings of $(m, n)$-coloured mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Feiran Yang, Gary MacGillivray, Shahla Nasserasr","submitted_at":"2020-10-18T20:18:59Z","abstract_excerpt":"A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \\geq 0$ colours, and each arc is assigned one of $n \\geq 0$ colours. Oriented graphs are $(0, 1)$-coloured mixed graphs, and 2-edge-coloured graphs are $(2, 0)$-coloured mixed graphs. We show that results of Sopena for vertex colourings of oriented graphs, and of Kostochka, Sopena and Zhu for vertex colourings oriented graphs and 2-edge-coloured graphs, are special cases of results about verte"},"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":"2010.09091","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-18T20:18:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8b791b89b469606a2e1d10644b2c8587bc056e893f4af908b32894217d21f354","abstract_canon_sha256":"3bf01dd8a58391df842a0ee0025a046c55463618cadff1c1ea555d0c9bbc7289"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:30.823509Z","signature_b64":"CjEGuKld/HNNDW7ATJ4Gd2NFG7m1/dFEqF/PuC6jpr0waMOHNhE1Ck4H5AbD0cShAqg+41Mz2xshMxh0Tr9+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f9a0decbabf623ac4ce5e246762da92240dc3d2cfbd258d7ad5e357254e6f4f","last_reissued_at":"2026-07-05T10:00:30.823026Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:30.823026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colourings of $(m, n)$-coloured mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Feiran Yang, Gary MacGillivray, Shahla Nasserasr","submitted_at":"2020-10-18T20:18:59Z","abstract_excerpt":"A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \\geq 0$ colours, and each arc is assigned one of $n \\geq 0$ colours. Oriented graphs are $(0, 1)$-coloured mixed graphs, and 2-edge-coloured graphs are $(2, 0)$-coloured mixed graphs. We show that results of Sopena for vertex colourings of oriented graphs, and of Kostochka, Sopena and Zhu for vertex colourings oriented graphs and 2-edge-coloured graphs, are special cases of results about verte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09091","kind":"arxiv","version":3},"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/2010.09091/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":"2010.09091","created_at":"2026-07-05T10:00:30.823084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.09091v3","created_at":"2026-07-05T10:00:30.823084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09091","created_at":"2026-07-05T10:00:30.823084+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6NA33F2X5RD","created_at":"2026-07-05T10:00:30.823084+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6NA33F2X5RDVRGO","created_at":"2026-07-05T10:00:30.823084+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6NA33F2","created_at":"2026-07-05T10:00:30.823084+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05282","citing_title":"Wavelet Scattering Transform for Interpretable Schizophrenia Biomarker Discovery and Classification from Resting-State EEG","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D6NA33F2X5RDVRGOLYSGOYW2SI","json":"https://pith.science/pith/D6NA33F2X5RDVRGOLYSGOYW2SI.json","graph_json":"https://pith.science/api/pith-number/D6NA33F2X5RDVRGOLYSGOYW2SI/graph.json","events_json":"https://pith.science/api/pith-number/D6NA33F2X5RDVRGOLYSGOYW2SI/events.json","paper":"https://pith.science/paper/D6NA33F2"},"agent_actions":{"view_html":"https://pith.science/pith/D6NA33F2X5RDVRGOLYSGOYW2SI","download_json":"https://pith.science/pith/D6NA33F2X5RDVRGOLYSGOYW2SI.json","view_paper":"https://pith.science/paper/D6NA33F2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.09091&json=true","fetch_graph":"https://pith.science/api/pith-number/D6NA33F2X5RDVRGOLYSGOYW2SI/graph.json","fetch_events":"https://pith.science/api/pith-number/D6NA33F2X5RDVRGOLYSGOYW2SI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6NA33F2X5RDVRGOLYSGOYW2SI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6NA33F2X5RDVRGOLYSGOYW2SI/action/storage_attestation","attest_author":"https://pith.science/pith/D6NA33F2X5RDVRGOLYSGOYW2SI/action/author_attestation","sign_citation":"https://pith.science/pith/D6NA33F2X5RDVRGOLYSGOYW2SI/action/citation_signature","submit_replication":"https://pith.science/pith/D6NA33F2X5RDVRGOLYSGOYW2SI/action/replication_record"}},"created_at":"2026-07-05T10:00:30.823084+00:00","updated_at":"2026-07-05T10:00:30.823084+00:00"}