{
 "failure_mode": "reputation-system-gaming",
 "specific_names": [
  "Absent reputation layer",
  "Discontinuous reputation update",
  "Meta-reputation aristocracy",
  "Partial necessity implementation",
  "Pollyanna feedback bias",
  "Reflection dominance",
  "Reflection layer dominance",
  "Reputation gaming through selective staking",
  "Reputation monopoly",
  "Ungrounded reflection validators",
  "Value threshold breach",
  "absent citation verification layer",
  "absent decentralized reputation verification",
  "algorithm-exploitation-arms-race",
  "attribution-failure",
  "centralized reputation failure",
  "centralized-reputation-rating-flaws",
  "citation-gaming",
  "citation-paradox",
  "competition-without-attribution",
  "corruptible-social-proof",
  "corruptible-web-of-trust",
  "costless voting",
  "cryptography-insufficient-against-reputation-exploits",
  "forced opacity of centralized reputation",
  "formalism-alone-insufficient",
  "gameable-popularity-algorithms",
  "high status detection evasion",
  "honest inputs assumption",
  "identity sale transfers reputation",
  "insoluble-arbiter-reputation-corruption",
  "irreversible initial downvote",
  "maximal self-citation dominant strategy",
  "merit without deflation",
  "no incorruptible reputation engine",
  "no-compounding-attribution",
  "past behavior is not proof of future behavior",
  "platform-dilemma",
  "poorly-designed-reputation-metrics",
  "prior platform failure",
  "purchased reputation destroys signal",
  "rating-system-manipulation",
  "rationally-tolerated-parasitism",
  "reputation value corruption",
  "reputation-specific-attack-surface",
  "self funded fee mimicry",
  "sham expertise tags",
  "structural insufficiency of existing decentralized reputation systems",
  "success induced brittleness",
  "systematic attribution erosion",
  "unfair arbiter algorithm",
  "unowned reputation",
  "unreliable-centralized-reputation",
  "validator knowledge limit",
  "web of trust breaks under economic value"
 ],
 "count": 56,
 "claims": [
  {
   "id": "kaal:claim:2992962-039",
   "url": "https://wulfkaal.github.io/claims/2992962-039",
   "claim": "Because no conceivable way exists to permanently hide an arbiter's reputation from the arbiter in an open system, the corruption risk created by high reputation arbiters becoming valued counselors for disputants is an insoluble problem with the authors' own proposal.",
   "specific_name": "insoluble-arbiter-reputation-corruption",
   "conditions": [
    "open reputation systems for anonymous arbiters"
   ],
   "source": "Crypto Transaction Dispute Resolution",
   "year": "2017",
   "quote": "Because no conceivable way exists to permanently hide an arbiter's reputation from the arbiter in an open system, this is an insoluble problem with the proposal.",
   "citation": "Wulf A. Kaal, Craig Calcaterra, Crypto Transaction Dispute Resolution (2017). SSRN: https://ssrn.com/abstract=2992962"
  },
  {
   "id": "kaal:claim:3125822-002",
   "url": "https://wulfkaal.github.io/claims/3125822-002",
   "claim": "Reputation value in any decentralized reputational system can be corrupted through three channels: direct purchase of reputation, automated worthless work, and degeneration of the system into a majority of inexpert opinions.",
   "specific_name": "reputation value corruption",
   "conditions": [
    "decentralized reputation systems",
    "anonymous participants"
   ],
   "source": "Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A",
   "year": "2018",
   "quote": "In any such decentralized reputational system there is always the potential to corrupt the value of reputation by purchasing it directly, or through automated worthless work, or through the degeneration of a majority of inexpert opinions.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822"
  },
  {
   "id": "kaal:claim:3125822-003",
   "url": "https://wulfkaal.github.io/claims/3125822-003",
   "claim": "The problems of corruption, Sybil attacks, and tyranny of the majority have plagued every previous autonomous decentralized reputation platform, so they are the design constraints any new architecture must meet.",
   "specific_name": "prior platform failure",
   "conditions": [
    "prior autonomous decentralized reputation platforms"
   ],
   "source": "Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A",
   "year": "2018",
   "quote": "These are the respective problems of corruption, Sybil attacks, and tyranny of the majority that have plagued all previous autonomous, decentralized reputation platforms.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822"
  },
  {
   "id": "kaal:claim:3125822-014",
   "url": "https://wulfkaal.github.io/claims/3125822-014",
   "claim": "Reddit's upvote system imposes insignificant punishment for voting randomly, and this lack of cost compromises the informational value of an upvote, which is the failure mode a staked validation pool is designed to avoid.",
   "specific_name": "costless voting",
   "conditions": [
    "applies to unstaked voting systems"
   ],
   "source": "Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A",
   "year": "2018",
   "quote": "As a second example, Reddit's upvote system currently has insignificant punishment for voting randomly, which compromises the value of the meaning of an upvote",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822"
  },
  {
   "id": "kaal:claim:3125822-038",
   "url": "https://wulfkaal.github.io/claims/3125822-038",
   "claim": "There is no absolute certainty that using an expertise tag yields a fair resolution, because malicious experts can always choose an unfair algorithm to distribute the disputed assets.",
   "specific_name": "unfair arbiter algorithm",
   "conditions": [
    "applies to machine arbitration expertise tags"
   ],
   "source": "Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A",
   "year": "2018",
   "quote": "There is no absolute certainty using the expertise tag will result in a fair resolution. Malicious experts can always choose to use an unfair algorithm to distribute the assets.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822"
  },
  {
   "id": "kaal:claim:3125822-039",
   "url": "https://wulfkaal.github.io/claims/3125822-039",
   "claim": "The authors state plainly that in an open, decentralized and anonymous environment they provide no mechanism to stop the formation of sham expertise tags that copy a successful tag's record under a new name.",
   "specific_name": "sham expertise tags",
   "conditions": [
    "open anonymous environment",
    "expertise tags are cheap to create"
   ],
   "source": "Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A",
   "year": "2018",
   "quote": "In the open, decentralized, anonymous environment of the platoform, we provide no mechanism to stop the formation of such sham expertise tags.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822"
  },
  {
   "id": "kaal:claim:3125822-040",
   "url": "https://wulfkaal.github.io/claims/3125822-040",
   "claim": "Faking a reputable expertise tag is nearly costless: a successful tag's open record can be copied and reposted under a new name for the price of the anti denial of service fees, and the capital used to mimic fees paid into the sham tag is mostly recovered by the sham owners through the salaries they control.",
   "specific_name": "self funded fee mimicry",
   "conditions": [
    "sham owners hold the majority of the sham tag's tokens"
   ],
   "source": "Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A",
   "year": "2018",
   "quote": "easily be copied and reposted under a new tag name for the low cost of the anti-DoS fees. The capital used to mimic fees paid to the sham expertise tag is mostly recovered by the sham owners through the salaries they control.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822"
  },
  {
   "id": "kaal:claim:3125822-042",
   "url": "https://wulfkaal.github.io/claims/3125822-042",
   "claim": "Reputation on the platform is not truly non transferable: accumulated sem tokens can be sold along with the anonymous identities that hold them, and the only check on this is the continued existence of a good faith majority that votes fairly in validation pools.",
   "specific_name": "identity sale transfers reputation",
   "conditions": [
    "anonymous accounts can be transferred wholesale",
    "check depends on 51 percent of users acting in good faith"
   ],
   "source": "Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A",
   "year": "2018",
   "quote": "The inevitable accumulation of sem tokens by anonymous users is another potential source of corruption. Reputational power can be sold via the sale of anonymous identities. Such corruption is checked by the existence of 51% good-faith users, who will vote fairly in the validation pools.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822"
  },
  {
   "id": "kaal:claim:3125822-047",
   "url": "https://wulfkaal.github.io/claims/3125822-047",
   "claim": "Under the proposed weighting scheme a post that was initially downvoted can never yield its creator tokens even if expert opinion later reverses, an asymmetry the authors flag as a limitation of the core design.",
   "specific_name": "irreversible initial downvote",
   "conditions": [
    "applies to the weighted directed acyclic graph valuation scheme",
    "could be changed only by allowing negative valued tokens"
   ],
   "source": "Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A",
   "year": "2018",
   "quote": "Unfortunately a post p) which was initially downvoted can never give its creator tokens, even if opinion eventually reverses.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822"
  },
  {
   "id": "kaal:claim:3266953-007",
   "url": "https://wulfkaal.github.io/claims/3266953-007",
   "claim": "Displayed net feedback scores are a poor reputation instrument because they encourage Pollyanna assessments of reputation and are far from the best predictor of performance available in the data.",
   "specific_name": "Pollyanna feedback bias",
   "conditions": [
    "eBay feedback data from 1999"
   ],
   "source": "Reputation Protocol for the Internet of Trust - Conceptual Whitepaper",
   "year": "2018",
   "quote": "However, the net feedback scores that eBay displays encourages Pollyanna assessments of reputations, and is far from the best predictor available.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953"
  },
  {
   "id": "kaal:claim:3266953-009",
   "url": "https://wulfkaal.github.io/claims/3266953-009",
   "claim": "Users on internet based platforms earn their reputation but do not own it, so if a platform deletes an account, years of reputation data disappear and users have near zero ability to reclaim it.",
   "specific_name": "unowned reputation",
   "conditions": [
    "centralized platforms such as Facebook"
   ],
   "source": "Reputation Protocol for the Internet of Trust - Conceptual Whitepaper",
   "year": "2018",
   "quote": "Users earned their reputation but do NOT own reputation - e.g. if Facebook and other internet-based platform businesses accidentally deleted user account, years of data would be removed and users have near zero ability to reclaim the data",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953"
  },
  {
   "id": "kaal:claim:3266953-011",
   "url": "https://wulfkaal.github.io/claims/3266953-011",
   "claim": "Nobody has yet created a reputation engine that is genuinely resistant to Sybil attack and that cannot be corrupted regardless of the economics at stake, despite the many platforms that capture reputation.",
   "specific_name": "no incorruptible reputation engine",
   "conditions": [
    "as of the time of writing",
    "platforms including Facebook, Linkedin, Twitter, Uber, Airbnb and Yelp"
   ],
   "source": "Reputation Protocol for the Internet of Trust - Conceptual Whitepaper",
   "year": "2018",
   "quote": "Yet, nobody has created a truly Sybil-attack resistant reputation engine that cannot be corrupted, regardless of the economics at stake.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953"
  },
  {
   "id": "kaal:claim:3266953-031",
   "url": "https://wulfkaal.github.io/claims/3266953-031",
   "claim": "The Web of Trust is only trustworthy where the service is not valuable, such as essentially free PGP email, because only then is it not worth creating sockpuppet accounts.",
   "specific_name": "web of trust breaks under economic value",
   "conditions": [
    "services with negligible economic value at stake"
   ],
   "source": "Reputation Protocol for the Internet of Trust - Conceptual Whitepaper",
   "year": "2018",
   "quote": "So the only time WoT works is when the service is not valuable, such as PGP (email which is essentially free). Then it's not worth it to create sock puppet accounts, so in that case you can trust the WoT network.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953"
  },
  {
   "id": "kaal:claim:3266953-032",
   "url": "https://wulfkaal.github.io/claims/3266953-032",
   "claim": "In an economic network where real money is at stake, historical good behavior cannot be assumed to prove future good behavior, because sockpuppet accounts allow participants to game the system automatedly, create valuable reputation falsely, and leach value out of the system.",
   "specific_name": "past behavior is not proof of future behavior",
   "conditions": [
    "networks where trust must support real monetary value"
   ],
   "source": "Reputation Protocol for the Internet of Trust - Conceptual Whitepaper",
   "year": "2018",
   "quote": "you can't just assume their historical good behavior will prove their future behavior will also be good. Sockpuppet accounts allow us to automatedly game the system and falsely create valuable reputation, so we can leach whatever value there is out of the system.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953"
  },
  {
   "id": "kaal:claim:3441904-042",
   "url": "https://wulfkaal.github.io/claims/3441904-042",
   "claim": "Reputation based metrics were ineffective in centralized governance systems because before blockchain, reputation could not be stored autonomously, anonymously, and transparently, so it was not a reliable predictor of actors' future actions.",
   "specific_name": "unreliable-centralized-reputation",
   "conditions": [
    "pre blockchain centralized reputation systems such as the web of trust and platform ratings"
   ],
   "source": "Blockchain-Based Corporate Governance",
   "year": "2019",
   "quote": "Before the emergence of blockchain technology, reputation could not be stored autonomously, anonymously, and transparently. Accordingly, reputation was not a reliable predictor of actors' future actions in centralized governance systems.",
   "citation": "Wulf A. Kaal, Blockchain-Based Corporate Governance (2019). SSRN: https://ssrn.com/abstract=3441904"
  },
  {
   "id": "kaal:claim:3411897-007",
   "url": "https://wulfkaal.github.io/claims/3411897-007",
   "claim": "eBay's user rating system, despite being its biggest competitive advantage, is clearly flawed, and the persistence of those flaws demonstrates the unmet need for a decentralized reputation verification system, since no better technology has yet been produced.",
   "specific_name": "centralized-reputation-rating-flaws",
   "conditions": [
    "applies to centralized platform reputation systems as of 2019"
   ],
   "source": "Decentralization - Past, Present, and Future",
   "year": "2019",
   "quote": "While the user ratings eBay uses clearly have flaws (that illustrate the need for a decentralized reputation verification system – discussed in Chapter 6), so far, nobody has been able to come up with a better technology.",
   "citation": "Wulf A. Kaal, Decentralization - Past, Present, and Future (2019). SSRN: https://ssrn.com/abstract=3411897"
  },
  {
   "id": "kaal:claim:3411897-035",
   "url": "https://wulfkaal.github.io/claims/3411897-035",
   "claim": "Until blockchain technology arrived with Bitcoin in 2009, decentralized reputation systems rested on the roughly twenty five year old and corruptible concept of the Web of Trust.",
   "specific_name": "corruptible-web-of-trust",
   "conditions": [
    "pre 2009 decentralized reputation systems"
   ],
   "source": "Decentralization - Past, Present, and Future",
   "year": "2019",
   "quote": "Until blockchain technology was introduced via Bitcoin in 2009, decentralized reputation systems mostly relied on the roughly 25 year old corruptible concept of the Web of Trust.",
   "citation": "Wulf A. Kaal, Decentralization - Past, Present, and Future (2019). SSRN: https://ssrn.com/abstract=3411897"
  },
  {
   "id": "kaal:claim:3405401-028",
   "url": "https://wulfkaal.github.io/claims/3405401-028",
   "claim": "Until blockchain technology was introduced via bitcoin in 2009, decentralized reputation systems mostly relied on the old and corruptible concept of the Web of Trust.",
   "specific_name": "corruptible-web-of-trust",
   "conditions": [
    "period before 2009"
   ],
   "source": "Decentralized Commerce – A Primer on Why Decentralized Reputation Verification Systems Are Needed",
   "year": "2019",
   "quote": "Until blockchain technology was introduced via bitcoin in 2009, decentralized reputation system mostly relied on the old and corruptible concept of the Web of Trust.",
   "citation": "Wulf A. Kaal, Decentralized Commerce – A Primer on Why Decentralized Reputation Verification Systems Are Needed (2019). SSRN: https://ssrn.com/abstract=3405401"
  },
  {
   "id": "kaal:claim:3782203-018",
   "url": "https://wulfkaal.github.io/claims/3782203-018",
   "claim": "Reputation policing games explain why a business will rationally tolerate a small level of theft when policing costs more than the loss, which also explains the rationality of long-term parasitic and bullying relationships and creates a need for careful protocol design to prevent that corruption.",
   "specific_name": "rationally-tolerated-parasitism",
   "conditions": [
    "policing costs exceed the value of the losses",
    "repeated interaction with asymmetric power"
   ],
   "source": "A Technical Perspective on Decentralization",
   "year": "2021",
   "quote": "Similar game setups with reputation policing explain the situation where a busi- ness will rationally tolerate a small level of theft when policing is more expensive, such as when a grocer will ignore a street urchin who nabs an apple once per day.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, A Technical Perspective on Decentralization (2021). SSRN: https://ssrn.com/abstract=3782203"
  },
  {
   "id": "kaal:claim:3782198-003",
   "url": "https://wulfkaal.github.io/claims/3782198-003",
   "claim": "The social media coordination function remains largely flawed and corruptible because the incentive design underlying social proof is suboptimal.",
   "specific_name": "corruptible-social-proof",
   "conditions": [
    "applies to platform ratings, reviews, and social proof mechanisms under centralized ownership"
   ],
   "source": "Contemporary Decentralization",
   "year": "2021",
   "quote": "However, because the incentive design for social proof is suboptimal, the social media coordination function is still largely flawed and corruptible.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Contemporary Decentralization (2021). SSRN: https://ssrn.com/abstract=3782198"
  },
  {
   "id": "kaal:claim:3782198-004",
   "url": "https://wulfkaal.github.io/claims/3782198-004",
   "claim": "Rating systems on centralized marketplaces are actively gamed: new Amazon sellers are solicited by sock puppet operators offering to inflate their ratings and attack competitors.",
   "specific_name": "rating-system-manipulation",
   "conditions": [
    "observed on major centralized e-commerce platforms"
   ],
   "source": "Contemporary Decentralization",
   "year": "2021",
   "quote": "For example, one of the first things that will hap- pen if you open a shop on Amazon is that you will receive several messages from ma- licious sock-puppet wranglers offering to game the rating system to improve your company's ratings while attacking your major competitor.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Contemporary Decentralization (2021). SSRN: https://ssrn.com/abstract=3782198"
  },
  {
   "id": "kaal:claim:3782198-006",
   "url": "https://wulfkaal.github.io/claims/3782198-006",
   "claim": "Centralized platforms are locked into an arms race in which developers infer the rules of the ranking algorithm and exploit them, forcing the owner to keep the algorithm opaque and under constant revision.",
   "specific_name": "algorithm-exploitation-arms-race",
   "conditions": [
    "applies to centrally owned information filtering algorithms such as search ranking"
   ],
   "source": "Contemporary Decentralization",
   "year": "2021",
   "quote": "The Google search engine algorithm is constantly be- ing improved, because website developers infer the rules of the algorithm and exploit its properties to raise their site",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Contemporary Decentralization (2021). SSRN: https://ssrn.com/abstract=3782198"
  },
  {
   "id": "kaal:claim:3808852-014",
   "url": "https://wulfkaal.github.io/claims/3808852-014",
   "claim": "eBay's user rating system is visibly flawed and illustrates the need for a decentralized reputation verification system, yet no entity or individual has produced a better technology, and those decentralized ratings remained eBay's biggest competitive advantage.",
   "specific_name": "absent decentralized reputation verification",
   "conditions": [],
   "source": "Decentralization and Feedback Effects",
   "year": "2021",
   "quote": "While the user ratings eBay uses clearly have flaws (that illustrate the need for a decentralized reputation verification system), so far, no entity or individual has been able to come up with a better technology.",
   "citation": "Wulf A. Kaal, Decentralization and Feedback Effects (2021). SSRN: https://ssrn.com/abstract=3808852"
  },
  {
   "id": "kaal:claim:3808859-027",
   "url": "https://wulfkaal.github.io/claims/3808859-027",
   "claim": "Meritocratic allocation of power in open source projects is often a fallacy, because rank can reflect timing and one-off contributions, deflation is not built into the perception of merit, and free riding on past reputation is therefore possible.",
   "specific_name": "merit without deflation",
   "conditions": [
    "applies where rank is awarded on perceived merit and not periodically revisited"
   ],
   "source": "Decentralization – Why We Need Technology Infrastructure Upgrades",
   "year": "2021",
   "quote": "In other words, deflation is not built into the perception of merit and free riding is possible.",
   "citation": "Wulf A. Kaal, Decentralization – Why We Need Technology Infrastructure Upgrades (2021). SSRN: https://ssrn.com/abstract=3808859"
  },
  {
   "id": "kaal:claim:3782214-025",
   "url": "https://wulfkaal.github.io/claims/3782214-025",
   "claim": "No centralized platform such as Amazon or eBay has been able to create meaningful and secure online reputation, because central ownership and control prevent them from giving members the power and incentives needed to police their own reputation.",
   "specific_name": "centralized reputation failure",
   "conditions": [
    "centrally owned and controlled platforms"
   ],
   "source": "Decentralized Governance",
   "year": "2021",
   "quote": "No centralized platform, such as Amazon or eBay, has been able to create mean- ingful and secure online reputation. Because they are centrally owned and controlled they cannot give members the power and incentives they need to police their own reputation,",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Decentralized Governance (2021). SSRN: https://ssrn.com/abstract=3782214"
  },
  {
   "id": "kaal:claim:3782214-039",
   "url": "https://wulfkaal.github.io/claims/3782214-039",
   "claim": "Because major social media platforms are privately and centrally owned, their governance processes and reputation distribution algorithms are necessarily opaque, since their users' incentives are not aligned to police reputation against gaming.",
   "specific_name": "forced opacity of centralized reputation",
   "conditions": [
    "privately owned centralized platforms",
    "users hold no financial stake in the system"
   ],
   "source": "Decentralized Governance",
   "year": "2021",
   "quote": "Since Stack Overflow and Reddit and Facebook and Twitter and all the other successful social media sites are privately, centrally owned, their governance processes—their algorithms for distributing reputation—are necessarily opaque.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Decentralized Governance (2021). SSRN: https://ssrn.com/abstract=3782214"
  },
  {
   "id": "kaal:claim:3782205-022",
   "url": "https://wulfkaal.github.io/claims/3782205-022",
   "claim": "Without a secure and meaningful reputation system, none of the other aspects of the decentralized economy will be effective, which makes reputation a precondition for the rest.",
   "specific_name": "Absent reputation layer",
   "conditions": [],
   "source": "Eight Institutions for the Evolution of Decentralization",
   "year": "2021",
   "quote": "Without building a secure and meaningful reputational system, none of the other aspects of the decen- tralized economy will be effective.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Eight Institutions for the Evolution of Decentralization (2021). SSRN: https://ssrn.com/abstract=3782205"
  },
  {
   "id": "kaal:claim:3782201-011",
   "url": "https://wulfkaal.github.io/claims/3782201-011",
   "claim": "Centralized and opaque reputation systems such as China's Social Credit System are unstable in the long run and particularly dangerous, because their computerized bureaucracy makes them inherently rigid and their early successes make them progressively more brittle.",
   "specific_name": "success induced brittleness",
   "conditions": [
    "centralized and opaque systems administered by computerized bureaucracy"
   ],
   "source": "Future of Decentralization",
   "year": "2021",
   "quote": "Centralized and opaque systems like the SCS are unstable in the long run. They are particularly dangerous, because their computerized bureaucracy makes them in- herently rigid. Their early successes will make them more and more brittle.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, Future of Decentralization (2021). SSRN: https://ssrn.com/abstract=3782201"
  },
  {
   "id": "kaal:claim:3962614-035",
   "url": "https://wulfkaal.github.io/claims/3962614-035",
   "claim": "The hybrid smart contracting model is defective because VCs are partially incentivized to fund and stake only the best deals while staking on less optimal deals that the market mostly funds, which undermines their long term reputation accumulation.",
   "specific_name": "Reputation gaming through selective staking",
   "conditions": [
    "models where VCs can stake reputation without proportionate capital commitment"
   ],
   "source": "REPUTATION AS CAPITAL – How Decentralized Autonomous Organizations Address Shortcomings in the Ventu",
   "year": "2021",
   "quote": "The problem with this model is that VCs are incentivized partially to fund and stake only on the best deals and stake on the less optimal deals that are mostly funded by the market. This undermines their long-term reputation accumulation",
   "citation": "Wulf A. Kaal, REPUTATION AS CAPITAL – How Decentralized Autonomous Organizations Address Shortcomings in the Ventu (2021). SSRN: https://ssrn.com/abstract=3962614"
  },
  {
   "id": "kaal:claim:3782217-025",
   "url": "https://wulfkaal.github.io/claims/3782217-025",
   "claim": "Popularity based ranking cannot substitute for editorial control, because people end up relying on unconscious algorithms to determine what is authoritative and the Folk Theorems establish that such algorithms can always be gamed.",
   "specific_name": "gameable-popularity-algorithms",
   "conditions": [
    "user generated content platforms without editorial control"
   ],
   "source": "The Importance of History In Decentralization",
   "year": "2021",
   "quote": "People rely on unconscious algorithms which use popularity to determine what is authoritative content. But the lessons of the Folk Theorems again arise, to remind us that such algorithms can always be gamed.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, The Importance of History In Decentralization (2021). SSRN: https://ssrn.com/abstract=3782217"
  },
  {
   "id": "kaal:claim:3782210-011",
   "url": "https://wulfkaal.github.io/claims/3782210-011",
   "claim": "The Web of Trust works acceptably for low-value information transmission but should not be used for transactions involving larger wealth in the general economy, which is part of why the scheme it originated in is called pretty good privacy rather than good privacy.",
   "specific_name": "Value threshold breach",
   "conditions": [
    "high value economic transactions"
   ],
   "source": "The Importance of Reputation for the Evolution of Decentralization",
   "year": "2021",
   "quote": "It works well for low-value infor- mation transmission, but it should not be used for transactions involving larger wealth in the general economy.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, The Importance of Reputation for the Evolution of Decentralization (2021). SSRN: https://ssrn.com/abstract=3782210"
  },
  {
   "id": "kaal:claim:3782210-027",
   "url": "https://wulfkaal.github.io/claims/3782210-027",
   "claim": "SingularityNet's reputation system, which tracks self-reported transaction quality, transaction value, duration of satisfaction, and prior reputation weights, will have its value eroded by the sockpuppet attack once the system becomes valuable enough to merit attack, because it does not implement the other necessities.",
   "specific_name": "Partial necessity implementation",
   "conditions": [
    "systems implementing only a subset of the seven necessities",
    "once the reputation becomes valuable enough to merit attack"
   ],
   "source": "The Importance of Reputation for the Evolution of Decentralization",
   "year": "2021",
   "quote": "Without implementing the other necessities, the sockpuppet attack will eventually erode their value, once it becomes valuable enough to merit the attack.",
   "citation": "Craig Calcaterra, Wulf A. Kaal, The Importance of Reputation for the Evolution of Decentralization (2021). SSRN: https://ssrn.com/abstract=3782210"
  },
  {
   "id": "kaal:claim:5095633-031",
   "url": "https://wulfkaal.github.io/claims/5095633-031",
   "claim": "The reputation systems of SingularityNET, Fetch.ai, Ocean Protocol, Numeraire, and DcentAI are structurally insufficient for a fully decentralized Mechanical Turk model of large-scale AI dataset creation, offering only incremental innovation.",
   "specific_name": "structural insufficiency of existing decentralized reputation systems",
   "conditions": [
    "highly contextual, iterative, and ethically sensitive dataset tasks",
    "continuous compliance with evolving legal standards"
   ],
   "source": "Artificial Intelligence The Final Frontier",
   "year": "2025",
   "quote": "While these platforms offer incremental innovations in how contributors are evaluated and rewarded, they remain structurally insufficient for a fully decentralized \"Mechanical Turk\" model of large-scale AI dataset creation.",
   "citation": "Wulf A. Kaal, Artificial Intelligence The Final Frontier (2025). SSRN: https://ssrn.com/abstract=5095633"
  },
  {
   "id": "kaal:claim:5225296-027",
   "url": "https://wulfkaal.github.io/claims/5225296-027",
   "claim": "SPoS's reliance on a reputation-based system introduces vulnerabilities absent from PoW and traditional PoS, most notably Sybil attacks, collusion risks, and reputation manipulation, which could undermine its decentralized governance and consensus if not robustly addressed.",
   "specific_name": "reputation-specific-attack-surface",
   "conditions": [],
   "source": "Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse",
   "year": "2025",
   "quote": "However, its innovative reliance on a reputation-based system introduces vulnerabilities—most notably Sybil attacks, collusion risks, and reputation manipulation—that could undermine the integrity of its decentralized governance and consensus processes",
   "citation": "Wulf A. Kaal, Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse (2025). SSRN: https://ssrn.com/abstract=5225296"
  },
  {
   "id": "kaal:claim:5225296-030",
   "url": "https://wulfkaal.github.io/claims/5225296-030",
   "claim": "Cryptography alone is insufficient for a reputation-based consensus system: SPoS's cryptographic toolkit resists direct tampering, but reputation-based exploits require separate strategic countermeasures.",
   "specific_name": "cryptography-insufficient-against-reputation-exploits",
   "conditions": [],
   "source": "Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse",
   "year": "2025",
   "quote": "While SPoS's cryptographic toolkit resists direct tampering, it requires strategic countermeasures to address these reputation-based exploits",
   "citation": "Wulf A. Kaal, Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse (2025). SSRN: https://ssrn.com/abstract=5225296"
  },
  {
   "id": "kaal:claim:5225296-034",
   "url": "https://wulfkaal.github.io/claims/5225296-034",
   "claim": "Weighted voting works as a Sybil defense only under two conditions: reputation metrics must capture meaningful effort such as block production quality and depth of governance participation, and the system must maintain continuous transparency backed by community oversight and formal verification.",
   "specific_name": "poorly-designed-reputation-metrics",
   "conditions": [
    "metrics must reflect meaningful effort",
    "continuous transparency and formal verification must be maintained"
   ],
   "source": "Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse",
   "year": "2025",
   "quote": "This defense requires robust metric design—e.g., ensuring reputation reflects meaningful effort (block production quality, governance participation depth)—and continuous transparency, supported by community oversight and formal verification to prevent manipulation",
   "citation": "Wulf A. Kaal, Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse (2025). SSRN: https://ssrn.com/abstract=5225296"
  },
  {
   "id": "kaal:claim:6244278-009",
   "url": "https://wulfkaal.github.io/claims/6244278-009",
   "claim": "Non-transferability of reputation is essential because, in Akerlof's lemons terms, a transferable reputation market would let capital-rich but competence-poor actors purchase reputation and thereby destroy the signal's informational content.",
   "specific_name": "purchased reputation destroys signal",
   "conditions": [
    "requires soulbound or agent-bound credentials tied to persistent identities"
   ],
   "source": "AI's Mother's Instinct Engineered Consequence Emergent Ethics and the Institutional Trajectory Toward Agentic Alignment",
   "year": "2026",
   "quote": "In the language of Akerlof's lemons analysis, non-transferability prevents the emergence of a market in which capital-rich but competence-poor actors purchase reputation, undermining the signal's informational content.",
   "citation": "Wulf A. Kaal, AI's Mother's Instinct Engineered Consequence Emergent Ethics and the Institutional Trajectory Toward Agentic Alignment (2026). SSRN: https://ssrn.com/abstract=6244278"
  },
  {
   "id": "kaal:claim:6269518-003",
   "url": "https://wulfkaal.github.io/claims/6269518-003",
   "claim": "Citation-weighted payment mechanisms as currently formulated will systematically erode the quality of knowledge attribution in any decentralized reputation system if the incentive misalignment is left unaddressed.",
   "specific_name": "systematic attribution erosion",
   "conditions": [
    "the incentive misalignment remains unaddressed"
   ],
   "source": "Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance",
   "year": "2026",
   "quote": "This paper demonstrates, however, that citation-weighted payment mechanisms as currently formulated contain a fundamental incentive misalignment that, if left unaddressed, will systematically erode the quality of knowledge attribution in any decentralized reputation system.",
   "citation": "Wulf A. Kaal, Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance (2026). SSRN: https://ssrn.com/abstract=6269518"
  },
  {
   "id": "kaal:claim:6269518-007",
   "url": "https://wulfkaal.github.io/claims/6269518-007",
   "claim": "Under the standard citation-weighted payment formulation the dominant strategy for a self-interested agent is to cite no one and maximize self-attribution, which is the precise negation of honest knowledge attribution.",
   "specific_name": "maximal self-citation dominant strategy",
   "conditions": [
    "standard PageRank-derived payment formulation",
    "self-interested agents",
    "no verification or penalty layer"
   ],
   "source": "Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance",
   "year": "2026",
   "quote": "The rational strategy for any self-interested agent is therefore transparent: set cx = 0 for all j ≠ i (cite no one) to maximize personal payment. Under the standard formulation, the dominant strategy is maximal self-citation, which is the precise negation of honest knowledge attribution.",
   "citation": "Wulf A. Kaal, Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance (2026). SSRN: https://ssrn.com/abstract=6269518"
  },
  {
   "id": "kaal:claim:6269518-014",
   "url": "https://wulfkaal.github.io/claims/6269518-014",
   "claim": "The existing citation-weighted framework provides no mechanism for verifying citation accuracy, no separate incentive for honest attribution, and no penalty for strategic under-citation, so the gap is a structural absence in the mechanism design rather than an oversight in presentation.",
   "specific_name": "absent citation verification layer",
   "conditions": [],
   "source": "Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance",
   "year": "2026",
   "quote": "This gap is not merely an oversight in presentation. It reflects a structural absence in the mechanism design. The existing framework provides no mechanism for verifying citation accuracy, no separate incentive for honest attribution, and no penalty for strategic under-citation.",
   "citation": "Wulf A. Kaal, Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance (2026). SSRN: https://ssrn.com/abstract=6269518"
  },
  {
   "id": "kaal:claim:6269518-015",
   "url": "https://wulfkaal.github.io/claims/6269518-015",
   "claim": "A PageRank-derived value distribution is only as honest as its inputs, and those inputs are generated by agents with a direct incentive to distort them, so relying entirely on the calculation to distribute value correctly fails.",
   "specific_name": "honest inputs assumption",
   "conditions": [],
   "source": "Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance",
   "year": "2026",
   "quote": "The framework relies entirely on the PageRank calculation to \"correctly\" distribute value, but the PageRank calculation is only as honest as its inputs. And the inputs are generated by agents with a direct incentive to distort them.",
   "citation": "Wulf A. Kaal, Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance (2026). SSRN: https://ssrn.com/abstract=6269518"
  },
  {
   "id": "kaal:claim:6269518-018",
   "url": "https://wulfkaal.github.io/claims/6269518-018",
   "claim": "Validator-verified citation correction is insufficient as a standalone remedy because validators may identify obviously missing citations or inflated self-citation yet lack the domain-specific knowledge to assess fine-grained attribution weights.",
   "specific_name": "validator knowledge limit",
   "conditions": [
    "validators lack complete knowledge of the relevant citation history",
    "fine-grained attribution weights at issue"
   ],
   "source": "Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance",
   "year": "2026",
   "quote": "A validator may be able to identify obviously missing citations or obviously inflated self-citation, but may lack the domain-specific knowledge to assess fine-grained attribution weights.",
   "citation": "Wulf A. Kaal, Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance (2026). SSRN: https://ssrn.com/abstract=6269518"
  },
  {
   "id": "kaal:claim:6269518-036",
   "url": "https://wulfkaal.github.io/claims/6269518-036",
   "claim": "The power norm creates a tension in citation governance because actors with more authority or status may be able to under-cite without detection, since their established reputation shields them from scrutiny.",
   "specific_name": "high status detection evasion",
   "conditions": [
    "reputation disparities among agents"
   ],
   "source": "Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance",
   "year": "2026",
   "quote": "The power norm presents a potential tension: actors with more authority or status may have greater ability to under-cite without detection, since their established reputation may shield them from scrutiny.",
   "citation": "Wulf A. Kaal, Citation Honesty Mechanisms in Weighted Directed Acyclic Graph Governance (2026). SSRN: https://ssrn.com/abstract=6269518"
  },
  {
   "id": "kaal:claim:6192998-004",
   "url": "https://wulfkaal.github.io/claims/6192998-004",
   "claim": "Because most reputation systems treat each contribution as atomic and independent, they cannot capture the cumulative knowledge graph, and the result is systematic undervaluation of foundational work plus perverse incentives to hoard rather than share insights.",
   "specific_name": "attribution-failure",
   "conditions": [
    "knowledge work where contributions build on one another"
   ],
   "source": "Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution",
   "year": "2026",
   "quote": "Yet most reputation systems treat each contribution as atomic and independent, failing to capture this evolving knowledge graph. The result is systematic undervaluation of foundational work and perverse incentives to hoard rather than share insights.11",
   "citation": "Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998"
  },
  {
   "id": "kaal:claim:6192998-006",
   "url": "https://wulfkaal.github.io/claims/6192998-006",
   "claim": "Academic citation networks do attribute foundational contributions, but they depend on centralized institutional contexts with stable identities and long horizons, and they suffer citation gaming, prestige bias, and poor real time quality assessment.",
   "specific_name": "citation-gaming",
   "conditions": [
    "citation indices such as h-index operating in institutional settings"
   ],
   "source": "Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution",
   "year": "2026",
   "quote": "However, these systems operate in centralized institutional contexts with stable identities and long time horizons. They also suffer from citation gaming, prestige bias, and poor mechanisms for real-time quality assessment.18",
   "citation": "Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998"
  },
  {
   "id": "kaal:claim:6192998-008",
   "url": "https://wulfkaal.github.io/claims/6192998-008",
   "claim": "Current agent platforms are inadequate on both horns: centralized rating systems defeat the purpose of agent autonomy, while primitive token staking mechanisms produce binary outcomes and fail to capture knowledge graphs.",
   "specific_name": "platform-dilemma",
   "conditions": [
    "AI agent marketplaces and comparable decentralized collaboration platforms"
   ],
   "source": "Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution",
   "year": "2026",
   "quote": "Current platforms either use centralized rating systems (defeating the purpose of agent autonomy) or primitive token-staking mechanisms (producing binary outcomes and failing to capture knowledge graphs).",
   "citation": "Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998"
  },
  {
   "id": "kaal:claim:6192998-013",
   "url": "https://wulfkaal.github.io/claims/6192998-013",
   "claim": "Without a working attribution mechanism, an agent whose foundational insight another agent builds upon receives no credit when the derivative work is validated.",
   "specific_name": "citation-paradox",
   "conditions": [],
   "source": "Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution",
   "year": "2026",
   "quote": "Problem 3: No citation/attribution mechanism. If Alice creates foundational insight that Bob builds on, Alice receives no credit when Bob's work gets validated.",
   "citation": "Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998"
  },
  {
   "id": "kaal:claim:6192998-016",
   "url": "https://wulfkaal.github.io/claims/6192998-016",
   "claim": "Under binary validation with no functional citation mechanism there is no compounding effect: a foundational contribution becomes invisible after its own validation, and its author's reputation does not grow as others build on the work.",
   "specific_name": "no-compounding-attribution",
   "conditions": [
    "binary validation systems lacking citation weighting"
   ],
   "source": "Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution",
   "year": "2026",
   "quote": "There is no compounding effect. Alice's foundational contribution becomes invisible after . Her reputation does not grow as others build on her work.",
   "citation": "Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998"
  },
  {
   "id": "kaal:claim:6192998-020",
   "url": "https://wulfkaal.github.io/claims/6192998-020",
   "claim": "The real barrier to multi agent competition is not cost but the absence of an attribution mechanism: if only the best of several competing agents is paid, the others have no incentive to participate, so competition requires rewards proportional to each contributor's contribution.",
   "specific_name": "competition-without-attribution",
   "conditions": [
    "multiple agents competing on the same job"
   ],
   "source": "Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution",
   "year": "2026",
   "quote": "The real barrier is the lack of attribution mechanism. If 5 agents compete but only the best gets paid, the other 4 have no incentive to participate. We need a framework where all contributors can be rewarded proportional to their contribution.",
   "citation": "Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998"
  },
  {
   "id": "kaal:claim:6192998-031",
   "url": "https://wulfkaal.github.io/claims/6192998-031",
   "claim": "Formal mechanism design alone is insufficient for decentralized systems; the security analysis depends on honest agents also detecting citation rings, downranking colluding submissions, and applying penalties, so formal mechanisms must be combined with emergent social enforcement.",
   "specific_name": "formalism-alone-insufficient",
   "conditions": [
    "Sybil attackers controlling several competing agents per job"
   ],
   "source": "Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution",
   "year": "2026",
   "quote": "decentralized systems must combine formal mechanisms with emergent social enforcement.",
   "citation": "Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998"
  },
  {
   "id": "kaal:claim:6655138-022",
   "url": "https://wulfkaal.github.io/claims/6655138-022",
   "claim": "Reflection reputation must be bounded above as a fraction of total agent reputation, otherwise a meta-reputation aristocracy emerges in which agents specialize entirely in reflecting on others' allocations without contributing to the first-order surfaces.",
   "specific_name": "Meta-reputation aristocracy",
   "conditions": [
    "architectures that isolate cross-surface reflection on its own surface"
   ],
   "source": "Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems",
   "year": "2026",
   "quote": "Third, Σ_R reputation REP_R is bounded above as a fraction of total agent reputation by INV5, preventing the emergence of a meta-reputation aristocracy in which agents specialize entirely in reflecting on others' allocations without contributing to the prior five surfaces.",
   "citation": "Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138"
  },
  {
   "id": "kaal:claim:6655138-027",
   "url": "https://wulfkaal.github.io/claims/6655138-027",
   "claim": "Reputation update functions on each surface must be continuous in the validation pool's resolution outcome, because discontinuities in reputation update destroy continuity of best-response correspondences and preclude application of Brouwer's fixed-point theorem.",
   "specific_name": "Discontinuous reputation update",
   "conditions": [
    "architectures relying on Brouwer for equilibrium existence"
   ],
   "source": "Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems",
   "year": "2026",
   "quote": "The reputation update functions on each surface are continuous in the validation pool's resolution outcome. Discontinuities in reputation update destroy continuity of best-response correspondences and preclude application of Brouwer.",
   "citation": "Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138"
  },
  {
   "id": "kaal:claim:6655138-028",
   "url": "https://wulfkaal.github.io/claims/6655138-028",
   "claim": "The weight assigned to any single reputation scalar in selection mechanisms must be upper-bounded, otherwise reputation feedback admits reputation-monopoly fixed points in which one dominant agent absorbs all generative flow.",
   "specific_name": "Reputation monopoly",
   "conditions": [
    "selection mechanisms that weight agents by reputation"
   ],
   "source": "Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems",
   "year": "2026",
   "quote": "The weight assigned to any single reputation scalar in selection mechanisms is upper-bounded, preventing reputation-monopoly fixed points in which a single dominant agent absorbs all generative flow.",
   "citation": "Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138"
  },
  {
   "id": "kaal:claim:6655138-030",
   "url": "https://wulfkaal.github.io/claims/6655138-030",
   "claim": "Aggregate reflection reputation must be upper-bounded across the population, because without that bound the reflection-surface validator pool drifts toward agents whose own reputation is dominated by reflection rather than action, and the cross-surface counterfactual evaluations the surface depends on lose their grounding.",
   "specific_name": "Ungrounded reflection validators",
   "conditions": [
    "architectures with an isolated cross-surface reflection surface"
   ],
   "source": "Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems",
   "year": "2026",
   "quote": "Without AC5, the validator pool on Σ_R can drift toward agents whose own reputation is dominated by reflection rather than action, and the cross-surface counterfactual evaluations the surface depends on lose their grounding.",
   "citation": "Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138"
  },
  {
   "id": "kaal:claim:6655138-032",
   "url": "https://wulfkaal.github.io/claims/6655138-032",
   "claim": "Without the reflection-mass invariant, the reflection layer can grow to dominate the first-order surfaces it is meant to reflect on, and the contraction property of the composite best-response map is lost.",
   "specific_name": "Reflection layer dominance",
   "conditions": [
    "architectures with an isolated cross-surface reflection surface"
   ],
   "source": "Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems",
   "year": "2026",
   "quote": "Without INV5, the reflection layer can grow to dominate the first-order surfaces it is meant to reflect on, and the contraction property of Ψ is lost.",
   "citation": "Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138"
  },
  {
   "id": "kaal:claim:6655138-046",
   "url": "https://wulfkaal.github.io/claims/6655138-046",
   "claim": "If reflection dominates the triple ratio, a meta-reputation aristocracy forms: agents specialize in reflecting on others' allocations without contributing to the first-order surfaces, reflection validator pools drift away from cross-surface competence, and the contraction property of the composite map is lost.",
   "specific_name": "Reflection dominance",
   "conditions": [
    "violation of generation parity in the direction of cross-surface reflection"
   ],
   "source": "Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems",
   "year": "2026",
   "quote": "If reflection dominates, the system produces a meta-reputation aristocracy: agents specialize in reflecting on others' allocations without contributing to the prior five surfaces, validator pools on Σ_R drift away from cross-surface competence, and the contraction property of Ψ is lost",
   "citation": "Wulf A. Kaal, Possibility Loops An Operational Architecture for Computative Economics in Agent Coordination Systems (2026). SSRN: https://ssrn.com/abstract=6655138"
  }
 ]
}