{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZJABDWEUZRHZBXITAIGBLBBMK4","short_pith_number":"pith:ZJABDWEU","canonical_record":{"source":{"id":"1411.7376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5bbdfc03a9d2c3ec97ab355cad1e16222ea4ee2777a7e29bb0a3a8df4edf5e83","abstract_canon_sha256":"a1066bd154042aff3945de6cc71c1efbd84a5a8e1703563c8a258e0661b04954"},"schema_version":"1.0"},"canonical_sha256":"ca4011d894cc4f90dd13020c15842c572ce034c608b2ac2f4ae8b87b27933a03","source":{"kind":"arxiv","id":"1411.7376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7376","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7376v2","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7376","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZJABDWEUZRHZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJABDWEUZRHZBXIT","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJABDWEU","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZJABDWEUZRHZBXITAIGBLBBMK4","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5bbdfc03a9d2c3ec97ab355cad1e16222ea4ee2777a7e29bb0a3a8df4edf5e83","abstract_canon_sha256":"a1066bd154042aff3945de6cc71c1efbd84a5a8e1703563c8a258e0661b04954"},"schema_version":"1.0"},"canonical_sha256":"ca4011d894cc4f90dd13020c15842c572ce034c608b2ac2f4ae8b87b27933a03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:45.456807Z","signature_b64":"2Qr4SpURwbhZ4t3mrJE5at9/1n7kaWjklNMcnYj2V67a5aomoCdqbavD5OVv4xgCPDyQOkroJ0km71X+l+0NDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca4011d894cc4f90dd13020c15842c572ce034c608b2ac2f4ae8b87b27933a03","last_reissued_at":"2026-05-18T01:34:45.456226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:45.456226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7376","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-05-18T01:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pa24NoP79IhUACh4qOWnPOuMCpDvkd0LEK7nJX0QHzEhg0BoIZvBpC6jJWxvTi4ViTxl7iD9sUkp4Qjy1bIrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:47:16.232575Z"},"content_sha256":"075aa74d9c7d7eff4c77a0e94ce951d160e6565492a3eefb82936c7f46fc4ec4","schema_version":"1.0","event_id":"sha256:075aa74d9c7d7eff4c77a0e94ce951d160e6565492a3eefb82936c7f46fc4ec4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZJABDWEUZRHZBXITAIGBLBBMK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analogous to cliques for (m,n)-colored mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Christopher Duffy, Julien Bensmail, Sagnik Sen","submitted_at":"2014-11-26T11:43:24Z","abstract_excerpt":"Vertex coloring of a graph $G$ with $n$-colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of $G$ to the complete graph $K_n$ of order $n$. So, in that sense, the chromatic number $\\chi(G)$ of $G$ will be the order of the smallest complete graph to which $G$ admits a homomorphism to. As every graph, which is not a complete graph, admits a homomorphism to a smaller complete graph, we can redefine the chromatic number $\\chi(G)$ of $G$ to be the order of the smallest graph to which $G$ admits a homomorphism to. Of course, such a smallest graph must be a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7376","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":""},"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-05-18T01:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3VtDz+M8reIqrmQn+nOpkystJmuRJafzwKTeQNuQ0MGud0REzTusT5S6U5uUOVgMmYD7/iTfAwMlyEkgDNMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:47:16.233289Z"},"content_sha256":"9405d6aa61a6813f495de25075dca489324b169af79aff96796573dcdbe2c707","schema_version":"1.0","event_id":"sha256:9405d6aa61a6813f495de25075dca489324b169af79aff96796573dcdbe2c707"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/bundle.json","state_url":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/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-05-27T14:47:16Z","links":{"resolver":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4","bundle":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/bundle.json","state":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZJABDWEUZRHZBXITAIGBLBBMK4","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":"a1066bd154042aff3945de6cc71c1efbd84a5a8e1703563c8a258e0661b04954","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:24Z","title_canon_sha256":"5bbdfc03a9d2c3ec97ab355cad1e16222ea4ee2777a7e29bb0a3a8df4edf5e83"},"schema_version":"1.0","source":{"id":"1411.7376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7376","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7376v2","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7376","created_at":"2026-05-18T01:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZJABDWEUZRHZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJABDWEUZRHZBXIT","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJABDWEU","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:9405d6aa61a6813f495de25075dca489324b169af79aff96796573dcdbe2c707","target":"graph","created_at":"2026-05-18T01:34:45Z","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"},"paper":{"abstract_excerpt":"Vertex coloring of a graph $G$ with $n$-colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of $G$ to the complete graph $K_n$ of order $n$. So, in that sense, the chromatic number $\\chi(G)$ of $G$ will be the order of the smallest complete graph to which $G$ admits a homomorphism to. As every graph, which is not a complete graph, admits a homomorphism to a smaller complete graph, we can redefine the chromatic number $\\chi(G)$ of $G$ to be the order of the smallest graph to which $G$ admits a homomorphism to. Of course, such a smallest graph must be a","authors_text":"Christopher Duffy, Julien Bensmail, Sagnik Sen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:24Z","title":"Analogous to cliques for (m,n)-colored mixed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7376","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:075aa74d9c7d7eff4c77a0e94ce951d160e6565492a3eefb82936c7f46fc4ec4","target":"record","created_at":"2026-05-18T01:34:45Z","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":"a1066bd154042aff3945de6cc71c1efbd84a5a8e1703563c8a258e0661b04954","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-26T11:43:24Z","title_canon_sha256":"5bbdfc03a9d2c3ec97ab355cad1e16222ea4ee2777a7e29bb0a3a8df4edf5e83"},"schema_version":"1.0","source":{"id":"1411.7376","kind":"arxiv","version":2}},"canonical_sha256":"ca4011d894cc4f90dd13020c15842c572ce034c608b2ac2f4ae8b87b27933a03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca4011d894cc4f90dd13020c15842c572ce034c608b2ac2f4ae8b87b27933a03","first_computed_at":"2026-05-18T01:34:45.456226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:45.456226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Qr4SpURwbhZ4t3mrJE5at9/1n7kaWjklNMcnYj2V67a5aomoCdqbavD5OVv4xgCPDyQOkroJ0km71X+l+0NDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:45.456807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:075aa74d9c7d7eff4c77a0e94ce951d160e6565492a3eefb82936c7f46fc4ec4","sha256:9405d6aa61a6813f495de25075dca489324b169af79aff96796573dcdbe2c707"],"state_sha256":"cdc5689f64fe30d423f2476d67bad6938b9d28721d6316fc31294b7968875dec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6hBNTXVHSujAdfK7IVx5jhtjfhWJGVv3/if76AUKnzDcgIaLUY3EQB/sfIL4DSwqrR4CmD1cmZnjpAHxzQ+4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:47:16.236831Z","bundle_sha256":"dd8362ecf797b6b75c0c07ae454c2e16220976bbe2ff43064529e2b23ab9e8f7"}}