BIT-CSKC-FGR-001 — Feed Governance and Reason-Receipt Calculus (R1; Closed at F5)

Abstract

BIT-CSKC-FGR-001 develops a provider-neutral, event-bound research calculus for determining when a displayed reason for a feed or recommendation event is supportable under a declared ranking trace, policy profile, privacy boundary, user-control state, sponsorship state, and remedy structure. Its central separations are: ContentItem ≠ CandidateSetRankingDecision ≠ DisplayEventExplanationText ≠ PublicReasonReceiptPublicReasonReceipt ≠ AuditReasonReceiptReasonReceipt ≠ AppealResolution ≠ Authority The central claim boundary is that a displayed reason does not uniquely identify the actual declared ranking reason. Likewise, a reason receipt does not establish content truth, neutral ranking, legal compliance, fairness, or authority. R1 closes at F5. F0–F4 complete the source-lineage, ontology, semantics, obligation, and analytic stages. The analytic inventory contains eight assumption-bounded results: four independent analytic cores and four derived or protocol results. F5A passes a bounded synthetic ranking-trace benchmark comprising 24 traces evaluated by two evaluators with zero mismatch. F5B passes 48 policy cases and reports exhaustive evaluator agreement across exactly 354,294 states in the locked finite projection space, with zero disagreement, zero false admission, zero UNKNOWN-to-PASS transition, and zero authority emission. A selected Lean candidate source has been prepared but has not been compiled or subjected to an axiom audit. F6 has not been run. External independent review, field validity, production readiness, ranking utility, fairness, security, privacy assessment, legal applicability, and novelty remain open. FGR references AIDC and KPLR as frozen upstream typed dependencies. It does not modify either calculus, infer human competence, issue credentials, or mint authority.