{"id":2563,"date":"2024-10-04T10:53:12","date_gmt":"2024-10-04T10:53:12","guid":{"rendered":"https:\/\/eic.cefet-rj.br\/~ebezerra\/?page_id=2563"},"modified":"2026-05-19T12:04:26","modified_gmt":"2026-05-19T12:04:26","slug":"gcc1734","status":"publish","type":"page","link":"https:\/\/eic.cefet-rj.br\/~ebezerra\/gcc1734\/","title":{"rendered":"GCC1734 &#8211; Intelig\u00eancia Artificial (2026.1)"},"content":{"rendered":"<p style=\"text-align: center;\"><a href=\"http:\/\/eic.cefet-rj.br\/~ebezerra\/wp-content\/uploads\/2017\/07\/ai_boss.jpg\"><img decoding=\"async\" class=\"alignnone size-medium wp-image-82\" src=\"http:\/\/eic.cefet-rj.br\/~ebezerra\/wp-content\/uploads\/2017\/07\/ai_boss.jpg\" alt=\"causation\" \/><\/a><\/p>\n<hr \/>\n<h3>Locais e hor\u00e1rios das aulas<\/h3>\n<ul>\n<li>3\u2060\u1d43\u02e2-feiras, das 16h30 \u00e0s 18h10, P1-204 (sala 2)<\/li>\n<li>6\u2060\u1d43\u02e2-feiras, das 14h35 \u00e0s 16h15, P1-103 (Sala 3)<\/li>\n<\/ul>\n<hr \/>\n<h3>Objetivos<\/h3>\n<p>Apresentar uma introdu\u00e7\u00e3o aos conceitos, modelos, m\u00e9todos, t\u00e9cnicas e aplica\u00e7\u00f5es da Intelig\u00eancia Artificial.<\/p>\n<hr \/>\n<h3>Ementa<\/h3>\n<p>Introdu\u00e7\u00e3o \u00e0 Intelig\u00eancia Artificial; Estrat\u00e9gias de Busca em Espa\u00e7os de Estados: busca cega; busca heur\u00edstica. Agentes Adversariais. Aprendizado por Refor\u00e7o. Aprendizado de M\u00e1quina. Agentes baseados em IA generativa.\u00a0<\/p>\n<p>Veja tamb\u00e9m o <a href=\"http:\/\/eic.cefet-rj.br\/portal\/wp-content\/uploads\/2014\/11\/INTELIG%C3%8ANCIA-ARTIFICIAL-GCC1734.pdf\">plano de ensino<\/a> da disciplina.<\/p>\n<hr \/>\n<h3><span style=\"color: inherit; font-size: 1.56em;\">Livro-texto<\/span><\/h3>\n<p><img loading=\"lazy\" decoding=\"async\" title=\"AIMA book\" src=\"https:\/\/eic.cefet-rj.br\/~ebezerra\/wp-content\/uploads\/2021\/02\/cover.jpg\" alt=\"AIMA book\" width=\"139\" height=\"180\" \/><br \/>Russell &amp; Norvig, <a href=\"http:\/\/aima.cs.berkeley.edu\/\"><strong>Artificial Intelligence: A Modern Approach<\/strong><\/a>, 4th ed.<\/p>\n<hr \/>\n<h3>Conte\u00fado<\/h3>\n<p>Veja o <a href=\"https:\/\/www.cefet-rj.br\/index.php\/calendarios\">calend\u00e1rio acad\u00eamico das gradua\u00e7\u00f5es<\/a>.<\/p>\n<table class=\"center\" style=\"width: 100%; table-layout: fixed;\"><colgroup> <col style=\"width: 15%;\" \/> <col style=\"width: 85%;\" \/> <\/colgroup>\n<tbody>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\"><b>Data<\/b><\/td>\n<td style=\"border: 1px solid #cccccc;\"><b>Assunto<\/b><\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">24\/fev<\/td>\n<td style=\"border: 1px solid #cccccc;\">Apresenta\u00e7\u00e3o do curso (<a href=\"https:\/\/github.com\/AILAB-CEFET-RJ\/gcc1734\/blob\/main\/notas_aula\/GCC1734%20(admin).pdf\" target=\"_blank\" rel=\"noopener\">notas<\/a>)<br \/>Vis\u00e3o geral da IA (<a href=\"https:\/\/www.dropbox.com\/scl\/fi\/xmzxj4ax5y0yd7x0qzgns\/IA01-Vis-o-Geral-da-IA.pptx?rlkey=58cslu502d5aa74ahrc0t6gr7&amp;dl=0\">slides<\/a>)<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">27\/fev<\/td>\n<td style=\"border: 1px solid #cccccc;\"><a href=\"https:\/\/github.com\/AILAB-CEFET-RJ\/gcc1734\/blob\/main\/notas_aula\/GCC1734-notas-aula-01.pdf\">Agentes, espa\u00e7o de estados e problemas de busca<\/a><\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">03\/mar<\/td>\n<td style=\"border: 1px solid #cccccc;\"><a href=\"https:\/\/github.com\/AILAB-CEFET-RJ\/gcc1734\/blob\/main\/notas_aula\/GCC1734-notas-aula-02.pdf\">Busca sem informa\u00e7\u00e3o<\/a> \u2014 Formula\u00e7\u00e3o de problemas de busca<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">06\/mar<\/td>\n<td style=\"border: 1px solid #cccccc;\">Busca sem informa\u00e7\u00e3o \u2014 BFS, UCS, DFS<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">10\/mar<\/td>\n<td style=\"border: 1px solid #cccccc;\">Busca sem informa\u00e7\u00e3o\u2014 Pr\u00e1tica em laborat\u00f3rio I<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">13\/mar<\/td>\n<td style=\"border: 1px solid #cccccc;\"><a href=\"https:\/\/github.com\/AILAB-CEFET-RJ\/gcc1734\/blob\/main\/notas_aula\/GCC1734-notas-aula-03.pdf\">Busca com informa\u00e7\u00e3o<\/a> \u2014 heur\u00edsticas e A*<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">17\/mar<\/td>\n<td style=\"border: 1px solid #cccccc;\">Busca com informa\u00e7\u00e3o \u2014 otimalidade do A*<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">20\/mar<\/td>\n<td style=\"border: 1px solid #cccccc;\">Discuss\u00e3o sobre o T1<br \/>Busca com informa\u00e7\u00e3o \u2014 Solu\u00e7\u00e3o de exerc\u00edcios<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">24\/mar<\/td>\n<td style=\"border: 1px solid #cccccc;\"><a href=\"https:\/\/github.com\/AILAB-CEFET-RJ\/gcc1734\/blob\/main\/notas_aula\/GCC1734-notas-aula-04.pdf\">Busca adversarial<\/a> \u2014 Introdu\u00e7\u00e3o<br \/>Busca adversarial \u2014 Minimax (<a href=\"https:\/\/github.com\/AILAB-CEFET-RJ\/gcc1734\/tree\/main\/notebooks\/minimax\">demo<\/a>)<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">27\/mar<\/td>\n<td style=\"border: 1px solid #cccccc;\">Busca adversarial \u2014 Poda alfa-beta<\/td>\n<\/tr>\n<!-- 1) Usa o TBD (31\/mar) para \u201cabsorver\u201d o conte\u00fado que cairia em 01\/mai (feriado) -->\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">31\/mar<\/td>\n<td style=\"border: 1px solid #cccccc;\">Busca adversarial \u2014 Fun\u00e7\u00f5es de avalia\u00e7\u00e3o<\/td>\n<\/tr>\n<!-- 2) 03\/abr \u00e9 feriado nacional (Paix\u00e3o de Cristo) => sem aula -->\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">03\/abr<\/td>\n<td style=\"border: 1px solid #cccccc;\"><em>(feriado nacional) Paix\u00e3o de Cristo \u2014 sem aula<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">07\/abr<\/td>\n<td style=\"border: 1px solid #cccccc;\">Busca adversarial \u2014 Busca quiescente<br \/>Busca adversarial \u2014 Pr\u00e1tica em laborat\u00f3rio II (MiniMax)<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">10\/abr<\/td>\n<td style=\"border: 1px solid #cccccc;\">Busca adversarial \u2014 MCTS (<a href=\"https:\/\/github.com\/AILAB-CEFET-RJ\/gcc1734\/tree\/main\/src\/adversarial\">demo<\/a>)<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">14\/abr<\/td>\n<td style=\"border: 1px solid #cccccc;\">Busca adversarial \u2014 Pr\u00e1tica em laborat\u00f3rio III (MCTS)<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">17\/abr<\/td>\n<td style=\"border: 1px solid #cccccc;\"><em>Aula suspensa &#8211; falta de energia<\/em><\/td>\n<\/tr>\n<!-- 3) 21\/abr \u00e9 feriado nacional (Tiradentes) => sem aula -->\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">21\/abr<\/td>\n<td style=\"border: 1px solid #cccccc;\"><em>(feriado nacional) Tiradentes \u2014 sem aula<\/em><\/td>\n<\/tr>\n<!-- 4) Usa o TBD (24\/abr) para \u201cabsorver\u201d o conte\u00fado que cairia em 21\/abr (feriado) -->\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">24\/abr<\/td>\n<td style=\"border: 1px solid #cccccc;\">Discuss\u00e3o sobre o T2<br \/><a href=\"https:\/\/github.com\/AILAB-CEFET-RJ\/gcc1734\/blob\/main\/notas_aula\/GCC1734-notas-aula-06.pdf\">Aprendizado por refor\u00e7o<\/a> \u2014 Introdu\u00e7\u00e3o (notas de aula)<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">28\/abr<\/td>\n<td style=\"border: 1px solid #cccccc;\"><strong>Teste 1 (30 minutos)<\/strong><br \/>Aprendizado por refor\u00e7o \u2014 Aprendizado TD<\/td>\n<\/tr>\n<!-- 5) 01\/mai \u00e9 feriado nacional (Dia do Trabalho) => sem aula -->\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">01\/mai<\/td>\n<td style=\"border: 1px solid #cccccc;\"><em>(feriado nacional) Dia do Trabalho \u2014 sem aula<\/em><\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">05\/mai<\/td>\n<td style=\"border: 1px solid #cccccc;\">Aprendizado por refor\u00e7o \u2014 Q-learning (tabular)<!-- 5) 01\/mai \u00e9 feriado nacional (Dia do Trabalho) => sem aula --> e SARSA<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">08\/mai<\/td>\n<td style=\"border: 1px solid #cccccc;\">Aprendizado por refor\u00e7o \u2014 T\u00e9cnicas de explora\u00e7\u00e3o<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">12\/mai<\/td>\n<td style=\"border: 1px solid #cccccc;\">Aprendizado por refor\u00e7o \u2014 Pr\u00e1tica em laborat\u00f3rio IV<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">15\/mai<\/td>\n<td style=\"border: 1px solid #cccccc;\">Aprendizado por refor\u00e7o \u2014 Q-learning com aproxima\u00e7\u00e3o linear (slides)<br \/>Aprendizado por refor\u00e7o \u2014 Tutorial Gymnasium<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">19\/mai<\/td>\n<td style=\"border: 1px solid #cccccc;\"><a href=\"https:\/\/github.com\/AILAB-CEFET-RJ\/gcc1734\/blob\/main\/notas_aula\/GCC1734-notas-aula-07.pdf\">Aprendizado de m\u00e1quina<\/a> \u2014 Motiva\u00e7\u00e3o, taxonomia e o framework de aprendizado supervisionado<br \/>Aprendizado de m\u00e1quina \u2014 Modelos lineares e gradiente descendente<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">22\/mai<\/td>\n<td style=\"border: 1px solid #cccccc;\">Aprendizado de m\u00e1quina \u2014 generaliza\u00e7\u00e3o, vi\u00e9s-vari\u00e2ncia, regulariza\u00e7\u00e3o<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">26\/mai<\/td>\n<td style=\"border: 1px solid #cccccc;\">Aprendizado de m\u00e1quina \u2014 Sele\u00e7\u00e3o e avalia\u00e7\u00e3o de modelos\u00a0<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">29\/mai<\/td>\n<td style=\"border: 1px solid #cccccc;\">Aprendizado de m\u00e1quina \u2014 \u00c1rvores de decis\u00e3o e m\u00e9todos ensemble<br \/>Aprendizado de m\u00e1quina \u2014 Redes neurais e aprendizado n\u00e3o supervisionado<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">02\/jun<\/td>\n<td style=\"border: 1px solid #cccccc;\">Aprendizado de m\u00e1quina \u2014 Representa\u00e7\u00f5es por Embeddings<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">\u00a0<\/td>\n<td style=\"border: 1px solid #cccccc;\">Aprendizado de m\u00e1quina \u2014 Transformers<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">09\/jun<\/td>\n<td style=\"border: 1px solid #cccccc;\">Agentes baseados em LLMs \u2014 parte I (<a href=\"https:\/\/doi.org\/10.5753\/sbc.17956.8.2\">minicurso<\/a>)<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">12\/jun<\/td>\n<td style=\"border: 1px solid #cccccc;\">Agentes baseados em LLMs \u2014 parte II (<a href=\"https:\/\/doi.org\/10.5753\/sbc.17956.8.2\">minicurso<\/a>)<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">16\/jun<\/td>\n<td style=\"border: 1px solid #cccccc;\">Agentes baseados em LLMs \u2014 parte III: ferramentas, function calling e RAG<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">19\/jun<\/td>\n<td style=\"border: 1px solid #cccccc;\">Agentes baseados em LLMs \u2014 parte IV: arquiteturas (ReAct, CoT) e planejamento iterativo<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">23\/jun<\/td>\n<td style=\"border: 1px solid #cccccc;\">Agentes baseados em LLMs \u2014 parte V: mem\u00f3ria, vetores\/embeddings e organiza\u00e7\u00e3o de conhecimento<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">26\/jun<\/td>\n<td style=\"border: 1px solid #cccccc;\"><strong>Teste 2 (30 minutos)<\/strong><\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">30\/jun<\/td>\n<td style=\"border: 1px solid #cccccc;\">Agentes baseados em LLMs \u2014 parte VI: avalia\u00e7\u00e3o e confiabilidade (alucina\u00e7\u00e3o, verifica\u00e7\u00e3o, guardrails e observabilidade)<br \/>Laborat\u00f3rio integrador: agente com ferramentas + RAG + mem\u00f3ria (estudo de caso) + revis\u00e3o para o exame final<\/td>\n<\/tr>\n<tr>\n<td style=\"border: 1px solid #cccccc; text-align: center;\">03\/jul<\/td>\n<td style=\"border: 1px solid #cccccc;\"><strong>Exame Final<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<hr size=\"4\" width=\"100%\" \/>\n<p>&nbsp;<\/p>\n<h3>Trabalhos pr\u00e1ticos<\/h3>\n<p>Detalhes e especifica\u00e7\u00e3o dos trabalhos pr\u00e1ticos s\u00e3o fornecidos pela plataforma MS Teams.<\/p>\n<p>Para implementar os trabalhos, voc\u00ea ir\u00e1 precisar dominar os fundamentos da linguagem Python. Para isso, recomendo dois livros, ambos gratuitamente dispon\u00edveis:<\/p>\n<ol>\n<li><a href=\"https:\/\/automatetheboringstuff.com\">Automate the Boring Stuff with Python<\/a><\/li>\n<li><a href=\"https:\/\/drive.google.com\/file\/d\/10KIvvyvY4J17PhmzoWFR0qijzd4deuFl\/view\">Introdu\u00e7\u00e3o \u00e0 Programa\u00e7\u00e3o com Python<\/a><\/li>\n<\/ol>\n<hr size=\"4\" width=\"100%\" \/>\n<h3>Recursos recomendados<\/h3>\n<ul>\n<li>Andrew Ng: <a href=\"https:\/\/hbr.org\/2016\/11\/what-artificial-intelligence-can-and-cant-do-right-now\" target=\"_blank\" rel=\"noopener\">What Artificial Intelligence Can and Can\u2019t Do Right Now<\/a><\/li>\n<li>John McCarthy: <a class=\" dimmed\" href=\"http:\/\/www-formal.stanford.edu\/jmc\/whatisai\/whatisai.html\"><span class=\"instancename\">What is Artificial Intelligence?<\/span><\/a><\/li>\n<li>V\u00eddeo: <a href=\"https:\/\/www.youtube.com\/watch?v=aUkBa1zMKv4\">Particle Filters<\/a><\/li>\n<li>V\u00eddeo: <a href=\"https:\/\/www.youtube.com\/watch?v=Gm1f6ojwuAc&quot;\">Blind Search Algorithms<\/a><\/li>\n<li>V\u00eddeo: <a href=\"https:\/\/www.youtube.com\/watch?v=jvpWtwVSvjA\">Step-by-step Example: Alpha-Beta Pruning<\/a><\/li>\n<li>V\u00eddeo: <a href=\"https:\/\/www.youtube.com\/watch?v=6ELUvkSkCts\">Minimax Algorithm<\/a><\/li>\n<li><span class=\"instancename\">V\u00eddeo:<\/span><a class=\"\" href=\"http:\/\/eic.cefet-rj.br\/moodle\/mod\/url\/view.php?id=8258\"><span class=\"instancename\"> The 8 Queen Problem &#8211; Numberphile<\/span><\/a><\/li>\n<li><a class=\"\" href=\"http:\/\/artint.info\/\"><span class=\"instancename\">Artificial Intelligence: Foundations of Computational Agents<\/span><\/a><\/li>\n<li><a class=\"\" href=\"http:\/\/www.smbc-comics.com\/index.php?db=comics&amp;id=2124\"><span class=\"instancename\">Humans vs Robots?<\/span><\/a><\/li>\n<li>Voc\u00ea pode pesquisar livros relevantes no acervo da <a href=\"http:\/\/biblioteca.cefet-rj.br\/\">Biblioteca do CEFET\/RJ<\/a>.<\/li>\n<li><a href=\"https:\/\/automatetheboringstuff.com\">Automate the Boring Stuff with Python<\/a><\/li>\n<\/ul>\n<p>Livros de interesse geral sobre Intelig\u00eancia Artificial<\/p>\n<ul>\n<li>Nick Bostrom, <a href=\"https:\/\/www.amazon.com\/Superintelligence-Dangers-Strategies-Nick-Bostrom\/dp\/0198739834\">Superintelligence: Paths, Dangers, Strategies<\/a>, 2014.<\/li>\n<li>Pedro Domingos, <a href=\"https:\/\/www.amazon.com\/Master-Algorithm-Ultimate-Learning-Machine\/dp\/0465065708\/ref=pd_bxgy_14_img_2?_encoding=UTF8&amp;psc=1&amp;refRID=8ETNCQKT3X406VVJ3JV9\">The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World<\/a>, 2015.<\/li>\n<li>Jeff Hawkins, <a href=\"http:\/\/hasler.ece.gatech.edu\/Published_papers\/Technology_overview\/JeffHawkinsOnIntelligence.pdf\">On Intelligence: How a New Understanding of the Brain Will Lead to the Creation of Truly Intelligent Machines<\/a>, 2004.<\/li>\n<\/ul>\n<hr \/>\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Locais e hor\u00e1rios das aulas 3\u2060\u1d43\u02e2-feiras, das 16h30 \u00e0s 18h10, P1-204 (sala 2) 6\u2060\u1d43\u02e2-feiras, das 14h35 \u00e0s 16h15, P1-103 (Sala 3) Objetivos Apresentar uma introdu\u00e7\u00e3o aos conceitos, modelos, m\u00e9todos, t\u00e9cnicas e aplica\u00e7\u00f5es da Intelig\u00eancia Artificial. Ementa Introdu\u00e7\u00e3o \u00e0 Intelig\u00eancia Artificial; Estrat\u00e9gias de Busca em Espa\u00e7os de Estados: busca cega; busca heur\u00edstica. Agentes Adversariais. Aprendizado por [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-2563","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/eic.cefet-rj.br\/~ebezerra\/wp-json\/wp\/v2\/pages\/2563","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/eic.cefet-rj.br\/~ebezerra\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/eic.cefet-rj.br\/~ebezerra\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/eic.cefet-rj.br\/~ebezerra\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/eic.cefet-rj.br\/~ebezerra\/wp-json\/wp\/v2\/comments?post=2563"}],"version-history":[{"count":52,"href":"https:\/\/eic.cefet-rj.br\/~ebezerra\/wp-json\/wp\/v2\/pages\/2563\/revisions"}],"predecessor-version":[{"id":2966,"href":"https:\/\/eic.cefet-rj.br\/~ebezerra\/wp-json\/wp\/v2\/pages\/2563\/revisions\/2966"}],"wp:attachment":[{"href":"https:\/\/eic.cefet-rj.br\/~ebezerra\/wp-json\/wp\/v2\/media?parent=2563"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}