{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PYLGHRWZHDBZAJDUB6NVDJCLYF","short_pith_number":"pith:PYLGHRWZ","canonical_record":{"source":{"id":"1809.04675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-12T21:09:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"74cb771660dc57f3353d468e26ee67254b2458d76bca6d31da132f36d5f1982e","abstract_canon_sha256":"bdc5544ee116bfae7b26623ee01ddc37d952573ccc01210cf1d28ecfca89504a"},"schema_version":"1.0"},"canonical_sha256":"7e1663c6d938c39024740f9b51a44bc14caec34c362dcd6aa377b77b392b6836","source":{"kind":"arxiv","id":"1809.04675","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04675","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04675v2","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04675","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"pith_short_12","alias_value":"PYLGHRWZHDBZ","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"pith_short_16","alias_value":"PYLGHRWZHDBZAJDU","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"pith_short_8","alias_value":"PYLGHRWZ","created_at":"2026-07-05T00:18:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PYLGHRWZHDBZAJDUB6NVDJCLYF","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-12T21:09:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"74cb771660dc57f3353d468e26ee67254b2458d76bca6d31da132f36d5f1982e","abstract_canon_sha256":"bdc5544ee116bfae7b26623ee01ddc37d952573ccc01210cf1d28ecfca89504a"},"schema_version":"1.0"},"canonical_sha256":"7e1663c6d938c39024740f9b51a44bc14caec34c362dcd6aa377b77b392b6836","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:49.735348Z","signature_b64":"L4s/k3WkcCB/F4COVaPfSWOUrEYSNcwrsmoOjR5G+rJuHK0djNp9IMjpEjtWgjDOYVSEQQlDIoH2BnxKOM8uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e1663c6d938c39024740f9b51a44bc14caec34c362dcd6aa377b77b392b6836","last_reissued_at":"2026-07-05T00:18:49.734711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:49.734711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04675","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:18:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6OwG4oOQPKjbHvfhYjvS7xRws4ztZpzd2bbnGH1M833E+sJ98QYBs458VMDa78GGkR2y1aRYO0t0vHL19IBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:16:26.937567Z"},"content_sha256":"cb0f2bc13a23d719d584e6d8a40e720e784613233f46a9daaf1b333188607bcb","schema_version":"1.0","event_id":"sha256:cb0f2bc13a23d719d584e6d8a40e720e784613233f46a9daaf1b333188607bcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PYLGHRWZHDBZAJDUB6NVDJCLYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Simple Chromatic Number of $(m,n)$-Mixed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Christopher Duffy, Jarrod Pas","submitted_at":"2018-09-12T21:09:05Z","abstract_excerpt":"An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types and $n$ edge types. A simple colouring of such a graph is a non-trivial homomorphism to a reflexive target. We find that simple chromatic number of complete $(m,n)$-mixed graphs can be found in polynomial time. For planar graphs and $k$-trees ($k \\geq 3$) we find that allowing the target to be reflexive does not lower the chromatic number of the respective family of $(m,n)$-mixed graphs. This implies that the search for universal targets for such families may be restr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04675","kind":"arxiv","version":2},"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/1809.04675/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:18:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m2icNPSHUHUXXJGDwJSjqk6fUD0K+n3OoR2osbSIBwYWWLN5LKwyI9jzKNqXGGg8p1951N8ySRcyILLFjJNEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:16:26.937943Z"},"content_sha256":"4deac3b673345ada853c4fee8d9e81d510fc351adc3b056cc5b5ede8843b8fc0","schema_version":"1.0","event_id":"sha256:4deac3b673345ada853c4fee8d9e81d510fc351adc3b056cc5b5ede8843b8fc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYLGHRWZHDBZAJDUB6NVDJCLYF/bundle.json","state_url":"https://pith.science/pith/PYLGHRWZHDBZAJDUB6NVDJCLYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYLGHRWZHDBZAJDUB6NVDJCLYF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T14:16:26Z","links":{"resolver":"https://pith.science/pith/PYLGHRWZHDBZAJDUB6NVDJCLYF","bundle":"https://pith.science/pith/PYLGHRWZHDBZAJDUB6NVDJCLYF/bundle.json","state":"https://pith.science/pith/PYLGHRWZHDBZAJDUB6NVDJCLYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYLGHRWZHDBZAJDUB6NVDJCLYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PYLGHRWZHDBZAJDUB6NVDJCLYF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bdc5544ee116bfae7b26623ee01ddc37d952573ccc01210cf1d28ecfca89504a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-12T21:09:05Z","title_canon_sha256":"74cb771660dc57f3353d468e26ee67254b2458d76bca6d31da132f36d5f1982e"},"schema_version":"1.0","source":{"id":"1809.04675","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04675","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04675v2","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04675","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"pith_short_12","alias_value":"PYLGHRWZHDBZ","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"pith_short_16","alias_value":"PYLGHRWZHDBZAJDU","created_at":"2026-07-05T00:18:49Z"},{"alias_kind":"pith_short_8","alias_value":"PYLGHRWZ","created_at":"2026-07-05T00:18:49Z"}],"graph_snapshots":[{"event_id":"sha256:4deac3b673345ada853c4fee8d9e81d510fc351adc3b056cc5b5ede8843b8fc0","target":"graph","created_at":"2026-07-05T00:18:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1809.04675/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types and $n$ edge types. A simple colouring of such a graph is a non-trivial homomorphism to a reflexive target. We find that simple chromatic number of complete $(m,n)$-mixed graphs can be found in polynomial time. For planar graphs and $k$-trees ($k \\geq 3$) we find that allowing the target to be reflexive does not lower the chromatic number of the respective family of $(m,n)$-mixed graphs. This implies that the search for universal targets for such families may be restr","authors_text":"Christopher Duffy, Jarrod Pas","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-12T21:09:05Z","title":"The Simple Chromatic Number of $(m,n)$-Mixed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04675","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cb0f2bc13a23d719d584e6d8a40e720e784613233f46a9daaf1b333188607bcb","target":"record","created_at":"2026-07-05T00:18:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bdc5544ee116bfae7b26623ee01ddc37d952573ccc01210cf1d28ecfca89504a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-12T21:09:05Z","title_canon_sha256":"74cb771660dc57f3353d468e26ee67254b2458d76bca6d31da132f36d5f1982e"},"schema_version":"1.0","source":{"id":"1809.04675","kind":"arxiv","version":2}},"canonical_sha256":"7e1663c6d938c39024740f9b51a44bc14caec34c362dcd6aa377b77b392b6836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e1663c6d938c39024740f9b51a44bc14caec34c362dcd6aa377b77b392b6836","first_computed_at":"2026-07-05T00:18:49.734711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:18:49.734711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L4s/k3WkcCB/F4COVaPfSWOUrEYSNcwrsmoOjR5G+rJuHK0djNp9IMjpEjtWgjDOYVSEQQlDIoH2BnxKOM8uDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:18:49.735348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04675","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb0f2bc13a23d719d584e6d8a40e720e784613233f46a9daaf1b333188607bcb","sha256:4deac3b673345ada853c4fee8d9e81d510fc351adc3b056cc5b5ede8843b8fc0"],"state_sha256":"d579515d07dfde4ecfc6cd976aca566dbaf2baf9ce7c3c9ef202dfc753064829"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mmdn9yj8zxNV1MO5TC6lXWAtdqbeDhl8zjk11/09om8xzXEEZPAuWBasJKsOwJh6be6VRDC+fDYvCgWud9MGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:16:26.940217Z","bundle_sha256":"d6d00b78b86973acd57ad65ebbe20ffc971c840b5620742b612bcd8e47f0b31e"}}