An Authority Score is a graph-derived metric that quantifies a legal decision's influence within a citation network. Unlike raw citation counts, it applies recursive algorithms—often variants of PageRank or HITS—to weight each citation by the score of the citing authority. A citation from a highly influential, frequently cited case contributes more to the score than a citation from an obscure or overruled decision, providing a nuanced measure of jurisprudential impact.
Glossary
Authority Score

What is Authority Score?
An Authority Score is a quantitative metric computed over a citation graph that estimates the precedential weight or influence of a legal case based on its centrality, citation frequency, and the authority of citing sources.
The computation relies on authority propagation across a directed graph where nodes represent cases and edges represent citations. The algorithm iteratively distributes influence until convergence, ensuring that a case's score reflects its structural position—such as high betweenness centrality or in-degree centrality—within the precedent network. This metric is foundational for case outcome prediction, citation recommendation, and seminal case detection, enabling legal AI systems to prioritize the most legally significant authorities during retrieval and reasoning tasks.
Key Characteristics of Authority Score
Authority Score is a quantitative metric computed over a citation graph that estimates the precedential weight or influence of a legal case. It moves beyond simple citation counting by incorporating graph topology, the authority of citing sources, and temporal dynamics.
Graph-Based Centrality Computation
Authority Score is fundamentally a graph centrality metric, not a raw frequency count. It applies algorithms like PageRank variants or Eigenvector Centrality to the citation network. A case's score increases when it is cited by other high-authority cases, creating a recursive definition of influence. This distinguishes a landmark Supreme Court decision from a frequently cited but routinely distinguished lower-court outlier. Betweenness Centrality identifies cases that act as critical bridges between distinct doctrinal clusters, while closeness centrality measures how quickly a precedent's influence propagates through the entire legal network.
Treatment-Weighted Edge Propagation
Not all citations are equal. Authority Score algorithms incorporate treatment type classification to weight citation edges. A citation labeled 'Followed' or 'Applied' transmits positive authority, strengthening the cited case's score. Conversely, a 'Negative Treatment' edge—such as 'Overruled', 'Criticized', or 'Questioned'—can diminish or even invert the authority flow. Distinguishing creates a neutral or weakly negative edge. This sentiment-aware propagation ensures the score reflects jurisprudential validity, not just visibility. A case that is frequently cited only to be criticized will have a lower score than one consistently relied upon.
Temporal Dynamics and Precedent Aging
Legal authority is not static. Authority Score models incorporate temporal citation analysis to account for precedent aging and influence velocity. A time-decay function can be applied to reduce the weight of older citations, reflecting that a case's current relevance may diminish if it is no longer actively engaged. Conversely, a citation cascade—a rapid, sustained increase in citations following a landmark decision—can be detected and used to boost the score. The model tracks citation velocity to distinguish a historically important but dormant case from a recently influential one that is actively shaping current litigation.
Jurisdictional Filtering and Binding Constraints
A raw global Authority Score is often legally meaningless. The computation must be constrained by jurisdictional filtering to reflect the hierarchical nature of precedent. A binding precedent from a higher court within the same jurisdiction receives a mandatory boost in the propagation algorithm, while a persuasive authority from an outside jurisdiction is weighted lower. The graph traversal is scoped to specific court hierarchies, ensuring that a case's score represents its influence within a particular sovereign legal system. This allows for the generation of jurisdiction-specific scores from the same underlying citation graph.
Composite Precedent Influence Score
The final output is often a Precedent Influence Score, a composite metric that aggregates multiple signals. This includes the recursive graph centrality score, treatment-weighted sentiment, and temporal relevance. It may also factor in the seminal case detection signal, which identifies doctrinal origin points. The composite score provides a single, robust quantification of a case's total jurisprudential impact. This metric is used downstream for graph-based reranking in legal search, prioritizing not just semantically relevant documents, but those with high legal authority.
Graph Neural Network Embeddings
Advanced implementations use Graph Neural Networks (GNNs) to learn Authority Score as a node embedding. Instead of a manually designed algorithm, a GNN learns to generate a dense vector representation for each case that captures both its intrinsic features and its complex citation neighborhood structure. This approach can model non-linear authority relationships and incorporate heterogeneous node types, such as courts and judges, into a single heterogeneous graph. The resulting embeddings serve as a learned, high-dimensional Authority Score that can be fine-tuned for specific downstream tasks like case outcome prediction or link prediction.
Frequently Asked Questions
Explore the computational mechanics behind measuring legal influence. These answers dissect the graph algorithms and metrics used to quantify a case's precedential weight.
An Authority Score is a quantitative metric computed over a Citation Graph that estimates the precedential weight or jurisprudential influence of a legal case. It is not merely a raw count of citations; rather, it is a recursive centrality measure. The score is typically computed using iterative graph algorithms, most notably variants of PageRank or HITS (Hyperlink-Induced Topic Search). In these models, a node's (case's) score is a function of the quantity and quality of its inbound citations. A citation from a high-authority case contributes significantly more to the score than a citation from an obscure or low-authority case. The computation propagates influence through the network until convergence, ensuring that the final score reflects the global structure of the Precedent Chain rather than just local popularity. Additional weighting factors often include Citation Sentiment (positive vs. negative treatment) and temporal decay to prioritize recent influence.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
Core concepts for understanding how computational systems model, measure, and traverse legal authority networks.
Citation Graph
A directed network structure where nodes represent legal cases or statutes and edges represent citation relationships. This forms the foundational data structure for all computational precedent analysis. Edge direction typically flows from the citing authority to the cited authority, creating a temporal DAG that can be traversed using graph algorithms to map doctrinal lineage.
Authority Propagation
A graph algorithm that iteratively distributes precedential influence scores across a citation network, often using PageRank variants like Eigenfactor or weighted PageRank. Unlike simple citation counting, propagation accounts for the quality of citing sources—a citation from a highly authoritative case carries more weight. This is the computational backbone of the Authority Score metric.
Precedential Weight
A measure of a legal decision's binding or persuasive force determined by:
- Court hierarchy level (Supreme Court > Appellate > Trial)
- Jurisdictional relevance (binding vs. persuasive authority)
- Subsequent judicial treatment (followed, distinguished, overruled)
Computational systems encode these factors as edge weights and node attributes in the citation graph.
Treatment Type Classification
An NLP task that automatically categorizes how a citing case legally treats a cited authority. Labels include overruled, distinguished, followed, criticized, and questioned. These classifications serve as edge attributes in the citation graph, enabling authority scores to be adjusted downward for negative treatment and upward for positive affirmation.
Betweenness Centrality
A graph metric measuring how often a node lies on the shortest path between other nodes. In citation networks, high betweenness centrality identifies cases that serve as critical doctrinal bridges connecting distinct legal clusters. A case with high betweenness but low citation count may still be structurally essential to the coherence of the authority graph.
Temporal Citation Analysis
The study of citation patterns over time to model how legal authority evolves, ages, or gains influence. Incorporates timestamps as edge attributes to detect phenomena like precedent aging, citation velocity spikes after landmark decisions, and the half-life of doctrinal influence. Essential for distinguishing historically important cases from currently active authorities.

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us