{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZJABDWEUZRHZBXITAIGBLBBMK4","short_pith_number":"pith:ZJABDWEU","schema_version":"1.0","canonical_sha256":"ca4011d894cc4f90dd13020c15842c572ce034c608b2ac2f4ae8b87b27933a03","source":{"kind":"arxiv","id":"1411.7376","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.7376","created_at":"2026-05-18T01:34:45.456332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7376v2","created_at":"2026-05-18T01:34:45.456332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7376","created_at":"2026-05-18T01:34:45.456332+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJABDWEUZRHZ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJABDWEUZRHZBXIT","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJABDWEU","created_at":"2026-05-18T12:28:59.999130+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/ZJABDWEUZRHZBXITAIGBLBBMK4","json":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4.json","graph_json":"https://pith.science/api/pith-number/ZJABDWEUZRHZBXITAIGBLBBMK4/graph.json","events_json":"https://pith.science/api/pith-number/ZJABDWEUZRHZBXITAIGBLBBMK4/events.json","paper":"https://pith.science/paper/ZJABDWEU"},"agent_actions":{"view_html":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4","download_json":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4.json","view_paper":"https://pith.science/paper/ZJABDWEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7376&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJABDWEUZRHZBXITAIGBLBBMK4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJABDWEUZRHZBXITAIGBLBBMK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/action/storage_attestation","attest_author":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/action/author_attestation","sign_citation":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/action/citation_signature","submit_replication":"https://pith.science/pith/ZJABDWEUZRHZBXITAIGBLBBMK4/action/replication_record"}},"created_at":"2026-05-18T01:34:45.456332+00:00","updated_at":"2026-05-18T01:34:45.456332+00:00"}