Harvard Course Explorer vs GPT Researcher

This capability allows users to search Harvard's course catalog using specific course codes or titles. It employs a structured query mechanism that parses user input and matches it against a pre-indexed dataset of course offerings. The implementation leverages a lightweight search algorithm optimized for quick lookups, ensuring that users receive relevant results in real-time.

Unique: Utilizes a pre-indexed dataset for fast lookups, enabling real-time search results without heavy backend queries.

vs alternatives: More efficient than traditional database queries due to its pre-indexing approach, resulting in quicker response times.

This capability randomly selects courses from the catalog to provide users with inspiration for new subjects. It uses a randomization algorithm that ensures a diverse selection of courses, pulling from various departments and disciplines. The implementation is designed to encourage exploration and discovery, making it easy for users to stumble upon interesting classes they might not have considered otherwise.

Unique: Incorporates a randomization algorithm that ensures a varied selection, enhancing the discovery experience.

vs alternatives: Offers a more engaging and diverse set of suggestions compared to static recommendation systems.

This capability retrieves comprehensive details about specific courses, including prerequisites, syllabus, and instructor information. It utilizes a structured data model that organizes course attributes, allowing users to query specific fields. The implementation ensures that all relevant data is fetched efficiently, providing a holistic view of each course to aid in decision-making.

Unique: Employs a structured data model for efficient retrieval of detailed course attributes, enhancing user experience.

vs alternatives: More comprehensive than basic course listings by providing in-depth information that aids in informed decision-making.

This capability visualizes insights from the course catalog, such as popular courses, enrollment statistics, and departmental offerings. It uses data visualization libraries to create interactive charts and graphs, allowing users to easily interpret trends and patterns in course availability. The implementation focuses on user-friendly visual representations that make complex data accessible.

Unique: Integrates advanced data visualization techniques to present insights in an engaging and informative manner.

vs alternatives: Provides a more interactive and visually appealing analysis compared to traditional static reports.

This capability generates course recommendations tailored to user preferences, such as interests, major, and past courses taken. It employs a recommendation algorithm that analyzes user input and matches it against course attributes, ensuring personalized suggestions. The implementation focuses on enhancing user engagement by aligning course offerings with individual academic goals.

Unique: Utilizes a tailored recommendation algorithm that considers user preferences for more relevant course suggestions.

vs alternatives: Offers a more personalized experience compared to generic course listings or recommendations.

Orchestrates parallel web searches across multiple sources (Google, Bing, DuckDuckGo, Tavily API) by using an LLM to decompose research topics into targeted sub-queries, then aggregates and deduplicates results. Implements a query expansion loop where the LLM analyzes initial results to identify information gaps and generates follow-up searches, creating a depth-first research graph rather than simple keyword matching.

Unique: Uses LLM-driven query decomposition and iterative gap-filling rather than static keyword expansion; implements a research graph where each LLM turn generates new search vectors based on prior results, enabling discovery of unexpected subtopics and relationships

vs alternatives: More thorough than simple search aggregators (Perplexity, SearchGPT) because it explicitly models research gaps and re-queries; faster than manual research because parallelizes searches and eliminates human query crafting overhead

Aggregates raw search results into a structured research report by using an LLM to synthesize information across sources, organize findings by topic hierarchy, and maintain inline citations linking each claim to its source URL. Implements a two-pass approach: first pass clusters results by semantic similarity, second pass generates report sections with citation metadata embedded in the output structure.

Unique: Maintains explicit source-to-claim mapping throughout synthesis rather than stripping citations; uses semantic clustering of results before synthesis to ensure diverse perspectives are represented in final report

vs alternatives: More trustworthy than ChatGPT web search because every claim is traceable to a source URL; more readable than raw search result lists because it reorganizes by topic rather than search engine ranking

Provides a unified interface to multiple LLM providers (OpenAI, Anthropic, Ollama, local models, Azure OpenAI) with automatic provider selection based on cost, latency, or capability requirements. Implements a provider registry pattern where each provider exposes a standardized interface, and the orchestrator selects the optimal provider for each task (e.g., cheap model for query generation, expensive model for synthesis).

Unique: Implements provider-agnostic task routing where different research phases use different models based on cost/capability tradeoffs (e.g., GPT-3.5 for query generation, Claude for synthesis); not just a simple wrapper around multiple APIs

vs alternatives: More flexible than LiteLLM because it includes research-specific task routing logic; cheaper than single-provider solutions because it optimizes model selection per task rather than using one model for everything

Breaks down a research request into subtasks (query generation, search execution, result aggregation, synthesis) and executes them in dependency order using an async task graph. Each task is a node with input/output contracts, and the executor resolves dependencies and parallelizes independent tasks. Implements a DAG (directed acyclic graph) pattern where task outputs feed into downstream tasks, enabling efficient resource utilization and resumable execution.

Unique: Models research as an explicit task graph with dependency resolution rather than a linear script; enables parallel search execution and clear separation of concerns between query generation, search, and synthesis phases

vs alternatives: More structured than simple sequential scripts because it enables parallelization and explicit task boundaries; more transparent than monolithic LLM calls because each step is independently observable and debuggable

Allows users to specify research parameters (number of search iterations, result limit per query, report length, focus areas) that control the breadth and depth of investigation. Implements a configuration object that propagates through the task graph, affecting query generation (how many follow-up queries), search execution (how many results to fetch), and synthesis (report length and detail level).

Unique: Treats research depth as a first-class parameter that affects all downstream tasks (query generation, search, synthesis) rather than a post-hoc constraint on output length

vs alternatives: More flexible than fixed-depth research tools because users can trade off quality vs cost; more transparent than black-box research agents because parameters are explicit and tunable

Fetches full HTML content from search result URLs and extracts relevant text using HTML parsing and optional LLM-based content filtering. Implements a scraper that handles common web page structures (articles, blog posts, documentation) and filters out boilerplate (navigation, ads, comments) to extract the core content. Uses BeautifulSoup or similar for parsing, with optional LLM post-processing to identify relevant sections.

Unique: Combines heuristic-based HTML parsing with optional LLM filtering to handle diverse website layouts; not just regex-based extraction or simple DOM traversal

vs alternatives: More robust than simple HTML parsing because LLM can identify relevant sections even in unusual layouts; faster than full browser automation (Selenium) because it uses lightweight HTTP requests for most sites

Caches research results and intermediate outputs (search results, synthesis) to avoid redundant API calls and LLM invocations when the same topic is researched multiple times. Implements a simple file-based or database cache keyed by research topic hash, with optional TTL (time-to-live) to refresh stale results. Enables resumable research where a failed job can pick up from the last completed task.

Unique: Caches at the task level (search results, synthesis output) not just final reports, enabling resumable workflows where individual tasks can be skipped if cached

vs alternatives: More granular than simple report caching because it caches intermediate results; enables faster re-research of similar topics by reusing search results

Generates research reports in multiple formats (markdown, JSON, HTML, plain text) using template-based rendering. Implements a template system where each format has a corresponding template that defines structure, styling, and citation formatting. Supports custom templates for domain-specific report structures (e.g., competitive analysis, market research, technical documentation).

Unique: Separates report content generation from formatting, allowing the same research results to be rendered in multiple formats without re-running research

vs alternatives: More flexible than fixed-format output because users can define custom templates; more maintainable than hardcoded format logic because templates are declarative