{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N32NDTNULQMBRUMDV2OWOIXCWG","short_pith_number":"pith:N32NDTNU","schema_version":"1.0","canonical_sha256":"6ef4d1cdb45c1818d183ae9d6722e2b1a7452858d85be440bd1c84e50c91066d","source":{"kind":"arxiv","id":"1810.05503","version":1},"attestation_state":"computed","paper":{"title":"On relative clique number of colored mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Debdeep Roy, Sagnik Sen, Sandip Das, Soumen Nandi","submitted_at":"2018-10-12T13:47:01Z","abstract_excerpt":"An $(m, n)$-colored mixed graph is a graph having arcs of $m$ different colors and edges of $n$ different colors. A graph homomorphism of an $(m, n$)-colored mixed graph $G$ to an $(m, n)$-colored mixed graph $H$ is a vertex mapping such that if $uv$ is an arc (edge) of color $c$ in $G$, then $f(u)f(v)$ is also an arc (edge) of color $c$. The ($m, n)$-colored mixed chromatic number of an $(m, n)$-colored mixed graph $G$, introduced by Ne\\v{s}et\\v{r}il and Raspaud [J. Combin. Theory Ser. B 2000] is the order (number of vertices) of the smallest homomorphic image of $G$. Later Bensmail, Duffy an"},"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":"1810.05503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-12T13:47:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1a6143f36a302c610bb4f41ca42536b5bf87fff030570f179bdd73a9ba2bcb16","abstract_canon_sha256":"91360c0b06ed07b9a46c195817ef2fa796497118db8b108184be1117a8af8069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:30.283690Z","signature_b64":"64+xWO92hQTgTbMgJ5ibG8oo5zdLbyJGFYsxFvVgXy52BaCzlYuEKoDddXMdCVxHwwGrUS1eMhHjy+iLIHpaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ef4d1cdb45c1818d183ae9d6722e2b1a7452858d85be440bd1c84e50c91066d","last_reissued_at":"2026-05-18T00:03:30.282968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:30.282968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On relative clique number of colored mixed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Debdeep Roy, Sagnik Sen, Sandip Das, Soumen Nandi","submitted_at":"2018-10-12T13:47:01Z","abstract_excerpt":"An $(m, n)$-colored mixed graph is a graph having arcs of $m$ different colors and edges of $n$ different colors. A graph homomorphism of an $(m, n$)-colored mixed graph $G$ to an $(m, n)$-colored mixed graph $H$ is a vertex mapping such that if $uv$ is an arc (edge) of color $c$ in $G$, then $f(u)f(v)$ is also an arc (edge) of color $c$. The ($m, n)$-colored mixed chromatic number of an $(m, n)$-colored mixed graph $G$, introduced by Ne\\v{s}et\\v{r}il and Raspaud [J. Combin. Theory Ser. B 2000] is the order (number of vertices) of the smallest homomorphic image of $G$. Later Bensmail, Duffy an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05503","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":"1810.05503","created_at":"2026-05-18T00:03:30.283095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05503v1","created_at":"2026-05-18T00:03:30.283095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05503","created_at":"2026-05-18T00:03:30.283095+00:00"},{"alias_kind":"pith_short_12","alias_value":"N32NDTNULQMB","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N32NDTNULQMBRUMD","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N32NDTNU","created_at":"2026-05-18T12:32:40.477152+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/N32NDTNULQMBRUMDV2OWOIXCWG","json":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG.json","graph_json":"https://pith.science/api/pith-number/N32NDTNULQMBRUMDV2OWOIXCWG/graph.json","events_json":"https://pith.science/api/pith-number/N32NDTNULQMBRUMDV2OWOIXCWG/events.json","paper":"https://pith.science/paper/N32NDTNU"},"agent_actions":{"view_html":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG","download_json":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG.json","view_paper":"https://pith.science/paper/N32NDTNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05503&json=true","fetch_graph":"https://pith.science/api/pith-number/N32NDTNULQMBRUMDV2OWOIXCWG/graph.json","fetch_events":"https://pith.science/api/pith-number/N32NDTNULQMBRUMDV2OWOIXCWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG/action/storage_attestation","attest_author":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG/action/author_attestation","sign_citation":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG/action/citation_signature","submit_replication":"https://pith.science/pith/N32NDTNULQMBRUMDV2OWOIXCWG/action/replication_record"}},"created_at":"2026-05-18T00:03:30.283095+00:00","updated_at":"2026-05-18T00:03:30.283095+00:00"}