Publish first public edition white paper package

.gitattributes

@@ -58,3 +58,5 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 # Video files - compressed
 *.mp4 filter=lfs diff=lfs merge=lfs -text
 *.webm filter=lfs diff=lfs merge=lfs -text
+white_paper.docx filter=lfs diff=lfs merge=lfs -text
+white_paper.pdf filter=lfs diff=lfs merge=lfs -text

MANIFEST.json

@@ -0,0 +1,30 @@
+{
+  "claims_of_completion_or_guaranteed_accuracy": false,
+  "created_by": "Ouroboros",
+  "edition": "1.0",
+  "files": {
+    "README.md": {
+      "bytes": 2233,
+      "sha256": "2baf51735750090993ccf977f998db262d001241b40332e55f52f2e022789b0f"
+    },
+    "WHITE_PAPER.md": {
+      "bytes": 31273,
+      "sha256": "1ff1172eea50d5b1622afcaceb147cad078724a62d1cb1b6860f04d96c45d738"
+    },
+    "white_paper.docx": {
+      "bytes": 123276,
+      "sha256": "77d5642bc6ade8b90aa0cdfbb28c71928ab3d11e539eae5cefb63cb16145d2ba"
+    },
+    "white_paper.pdf": {
+      "bytes": 466757,
+      "sha256": "e6f9f25cf39bee07d4ce2d59c435c80133ec2d5e6180c4cbffc9e06634f6166a"
+    }
+  },
+  "operations_agent": "OpenAI Codex",
+  "project_state": "bounded_proof_of_concept_unfinished",
+  "publication_date": "2026-08-31",
+  "repository": "cjc0013/verifiable-public-statement-corpus-compiler",
+  "schema_version": "ouroboros_publication_manifest_v1",
+  "title": "Toward a Verifiable Public-Statement Corpus Compiler",
+  "underlying_dataset_included": false
+}

README.md

@@ -0,0 +1,41 @@
+---
+pretty_name: Toward a Verifiable Public-Statement Corpus Compiler
+tags:
+  - automatic-speech-recognition
+  - speaker-recognition
+  - data-provenance
+  - deduplication
+  - public-media
+  - research
+---
+
+<!-- ouroboros-whitepaper-repository:v1 -->
+
+# Toward a Verifiable Public-Statement Corpus Compiler
+
+This repository publishes the first public edition of a process white paper about an attempted general-purpose system for compiling attributable public statements from public audiovisual media.
+
+The project is attempting to preserve source identity, timestamps, transcript evidence, speaker-attribution evidence, attrition reasons, duplicate relationships, and occurrence history while failing closed when evidence is inadequate. The current work is a bounded proof of concept. It is not presented as finished, exhaustive, human-certified, or guaranteed correct.
+
+## Autonomous execution
+
+The bounded technical work described in the paper was executed autonomously by **Ouroboros**, an AI research and verification system. OpenAI Codex served as its coding and operations agent. A human supplied the objective and operating constraints and retained authority over scope and publication.
+
+## Included files
+
+- `WHITE_PAPER.md` — canonical machine-readable paper text.
+- `white_paper.pdf` — public reading edition.
+- `white_paper.docx` — editable document edition.
+- `MANIFEST.json` — publication metadata and SHA-256 file hashes.
+
+## Explicit non-claims
+
+- This publication does not claim comprehensive source coverage.
+- It does not establish population-level speaker-attribution or transcription accuracy.
+- It does not claim that lexical deduplication solves semantic or claim-level duplication.
+- It does not treat machine-gated candidates as verified facts or publication-ready quotations.
+- The underlying statement corpus, source media, speaker references, and biometric material are not included or released here.
+
+## Intended use
+
+The paper is offered as an inspectable engineering description and research agenda. Any later dataset release would require stronger held-out evaluation, transparent attrition accounting, independent review, source-term and privacy analysis, and a separate publication decision.

WHITE_PAPER.md

@@ -0,0 +1,313 @@
+---
+title: Toward a Verifiable Public-Statement Corpus Compiler
+subtitle: A white paper on autonomous, provenance-bound extraction of attributable speech from public media
+status: PUBLIC EDITION
+version: 1.0
+date: 31 August 2026
+prepared_by: Ouroboros
+---
+
+# Abstract
+
+This project is attempting to build a general-purpose system that can take a configurable public speaker as its subject and compile a deduplicated, attributable, replayable record of statements made across public media. The intended result is not merely a transcript archive. It is an evidence compiler in which every retained statement can be traced to a source, timestamp, media artifact, transcript comparison, speaker-attribution check, occurrence history, and cryptographic manifest.
+
+The central design principle is conservative inclusion. Candidate speech is permitted to advance only when required evidence dimensions pass machine-enforced gates. Uncertain rows are preserved with rejection reasons rather than silently discarded or promoted. Repeated statements are collapsed at the canonical-record layer while each observed occurrence remains attached to the record. This structure is intended to support later research without erasing repetition, chronology, or provenance.
+
+The proof-of-concept work summarized here was executed autonomously by Ouroboros after a human supplied the objective and constraints. Ouroboros is the AI research and verification system. OpenAI Codex acted as its coding and operations agent. Human authority remained in control of scope, stopping, review, and any future publication. The underlying dataset was not uploaded or publicly released as part of the bounded pilot described here.
+
+> SCOPE AND LIMITATIONS: This paper describes an attempted system and a bounded proof of concept. It does not claim comprehensive source coverage, universal accuracy, calibrated certainty, human-certified transcripts, completed development, product readiness, scientific validity, or a finished dataset.
+
+# 1. The Problem
+
+Public speech is abundant but difficult to turn into a defensible research record. A single speaker may appear in long interviews, short clips, reposts, edited compilations, podcasts, livestreams, panels, and derivative commentary. Search results mix direct appearances with second-hand discussion. Captions can be incomplete, speaker turns can be mislabeled, alternate editions can shift timestamps, and the same underlying statement can appear in many places.
+
+A conventional transcription pipeline usually answers a recording-level question: who appears to have said which words in this file? A searchable media archive usually answers a library-level question: where does a term or speaker occur? This project is attempting a different task:
+
+> Given a declared public speaker and a bounded public-source scope, construct the strongest defensible machine-generated record of that speaker's public statements, preserve the evidence behind each row, and abstain when the evidence is insufficient.
+
+The phrase "everything public" is therefore an operational aspiration, not a completeness claim. The open internet has no reliable denominator. Sources disappear, search indexes vary, captions are not universal, some media cannot be acquired lawfully or technically, and identity can remain ambiguous. The system must report what it searched, what it acquired, what it rejected, and what remains unknown. It must never translate an incomplete inventory into a claim of exhaustive coverage.
+
+# 2. Intended System Boundary
+
+The target abstraction is a verifiable public-statement corpus compiler. Its intended input is a subject profile and a source policy. Its intended output is a queryable corpus of canonical statements plus the evidence and occurrences needed to audit each statement.
+
+The compiler is attempting to perform the following transformation:
+
+$$ configurable subject -> public-source inventory -> acquired media -> candidate speech -> independent checks -> evidence dimensions -> quarantine or retention -> cross-source deduplication -> occurrence preservation -> hash-bound corpus $$
+
+The current project is not attempting to decide whether a statement is true. It is attempting to establish, with explicitly limited confidence, whether a particular public speaker likely said a particular sequence of words in a particular public source. A later claim-analysis layer could compare statements, dates, entities, predictions, retractions, contradictions, and external evidence, but that layer must remain traceable to the underlying statement evidence.
+
+The project also does not claim that its integrated design is unprecedented. Establishing novelty would require a separate, systematic prior-art review. The immediate engineering question is whether the integrated workflow can be made reliable, generalizable, auditable, and useful.
+
+# 3. Process Architecture
+
+[[PROCESS_DIAGRAM]]
+
+The process is organized as a sequence of evidence-producing stages. Each stage is expected to emit a bounded artifact, counts, reasons for attrition, and a hash or other binding where practical. Later stages are not allowed to erase earlier uncertainty.
+
+## 3.1 Subject configuration
+
+The workflow begins with a configurable subject profile rather than an identity embedded in code. The profile can include a stable subject identifier, a display name, search aliases, and voice-enrollment evidence. A run specification binds that profile to source locations, evidence thresholds, storage policy, and output locations.
+
+The generalized implementation is designed to reject ambiguous identifiers and to keep heavy media, model caches, and generated datasets off the system drive. This is an operational safeguard rather than an accuracy claim, but it matters for resumability and long-running work.
+
+## 3.2 Public-source discovery and acquisition
+
+Discovery attempts to identify direct public appearances using configurable queries and normalized source identifiers. Invalid candidates and duplicates are quarantined. An acquisition plan records which media, captions, and metadata should be fetched and where those artifacts should be stored.
+
+The first source family is public video because it often provides media, timestamps, metadata, and caption tracks in one place. The architecture is intended to extend to podcasts, feeds, institutional archives, and other public-media sources. Cross-platform discovery is not yet demonstrated end to end.
+
+Discovery quality must be measured separately from extraction quality. A perfect transcript of four sources does not establish that a fifth source was found. The final system therefore needs inventory-level coverage receipts, query logs, source-family counts, duplicate-source detection, and explicit unresolved buckets.
+
+## 3.3 Media normalization and source binding
+
+Acquired media is normalized into formats suitable for timestamped speech processing. Source metadata, caption files, audio files, voice references, and later outputs are bound with SHA-256 hashes. The purpose is to detect drift and make later replays refer to the same inputs.
+
+Hash binding proves artifact identity, not semantic correctness. A perfectly hashed bad transcript remains a bad transcript. Provenance is one evidence dimension, not a substitute for attribution or text fidelity.
+
+## 3.4 Candidate speech segmentation
+
+Caption events are parsed into time-bounded units. Speaker markers and sentence boundaries are used where available. Adjacent units classified as target speech can be merged into statement candidates, but a detected other-speaker interval breaks the merge.
+
+This stage is vulnerable to overlapping speech, bad caption boundaries, omitted punctuation, and rapid turn-taking. The system therefore treats segmentation as a proposal to be tested, not as ground truth.
+
+## 3.5 Initial speaker isolation
+
+The proof of concept uses voice embeddings and declared target-versus-other anchors to score candidate caption intervals. An adaptive two-cluster boundary can be estimated when the source contains sufficiently separated score groups. Intervals near the decision boundary or lacking enough voiced audio are labeled uncertain.
+
+Some pilot runs used explicit anchor-selected enrollment rather than a universally automatic enrollment process. Ouroboros selected and applied the working configuration autonomously, but this does not mean the speaker-enrollment problem is solved in a fully general form. The generalized path includes readiness checks and abstention when positive and negative evidence cannot be separated.
+
+## 3.6 Independent text cross-check
+
+Candidate caption text is compared with an independently generated speech-recognition transcript from the source audio. The implemented comparison records word error rate, token overlap, sequence similarity, model word confidence, and the aligned independent text.
+
+The first attempt is a local timestamp-window alignment. If alternate editions or caption timing shifts prevent a local match, the system can search a monotonic global transcript index for a likely mapping. Ambiguous mappings are not treated as clean support. Source timestamps remain preserved even when a mapped audio interval is used for independent checks.
+
+Calling this route "independent" has a narrow meaning: it uses a different transcription path from the platform caption track. Both routes still derive from the same underlying audio, and their errors may be correlated. Agreement reduces dependence on a single transcript engine; it does not prove verbatim accuracy.
+
+## 3.7 Independent speaker verification
+
+The validator probes the beginning, middle, and end of a candidate interval with a second speaker-embedding route. It calibrates target and non-target reference embeddings, derives a decision boundary, and requires all usable probes to clear the configured margin.
+
+This check is intentionally stricter than assigning a single label to an entire recording window. It can still fail when speakers overlap, audio is degraded, voices are similar, references are weak, or the content domain differs from the enrollment material. Both speaker routes use the same source audio and should not be interpreted as statistically independent experiments.
+
+## 3.8 Dimensioned evidence gate
+
+The compiler separates evidence into four required dimensions instead of collapsing every signal into one confidence number.
+
+| Dimension | Question | Current machine indicators | Failure response |
+|---|---|---|---|
+| Attribution (A) | Is the speech likely from the declared subject? | Upstream eligibility, original margin, independent margin, probe coverage, recorded models and methods | Quarantine |
+| Text fidelity (T) | Do the retained words agree with the audio-derived cross-check? | Word error rate, token F1, sequence ratio, word probability, independent text and method | Quarantine |
+| Semantic completeness (S) | Does the row look like a complete, contiguous statement rather than a clipped fragment? | Minimum content, terminal punctuation, contiguous caption span, start and end boundary agreement | Quarantine |
+| Provenance (P) | Can the row be traced and replayed? | Subject and source identity, URL, timestamps, content hash, occurrence chain, manifest and source-evidence bindings | Quarantine |
+
+A row advances only when every required dimension passes its configured checks. These are deterministic policy verdicts, not calibrated probabilities. A status such as "machine-gated candidate" means that required checks passed under a specific versioned policy. It does not mean the row is human-certified, unquestionably correct, or ready for unrestricted publication.
+
+## 3.9 Quarantine and abstention
+
+Failure-closed behavior is central to the design. A row that fails one or more gates is preserved with dimension-level failures and detailed rejection reasons. A source can also produce no accepted statements when its speaker evidence does not separate adequately. That outcome is an abstention, not a system failure to be hidden.
+
+Quarantine prevents silent data loss and allows later repair. A future version can revisit a row with improved alignment, a better reference, a stronger boundary detector, or a human-audited transcript while retaining the original evidence trail.
+
+## 3.10 Deduplication with occurrence preservation
+
+The current deduplication layer removes repeated input identities, compares normalized statement text, detects high-similarity lexical duplicates, and handles a narrow same-source truncated-prefix case. It chooses a canonical row in stable chronological order and attaches every collapsed occurrence to that canonical record.
+
+This distinction matters. Deduplicating records should not erase evidence that a statement was repeated, reposted, or recirculated. The canonical corpus is intended for efficient search, while the occurrence chain preserves source identity, timestamp, date, transcript quality, speaker checks, and confidence provenance for each observation.
+
+The present lexical method does not reliably identify paraphrases, semantically equivalent claims, or repeated narratives with changed wording. Claim-cluster uniqueness is a future gate. Until that exists and is evaluated, lexical deduplication must not be described as complete semantic deduplication.
+
+## 3.11 Compilation, manifests, and replay
+
+The compiler partitions evidence rows into machine-gated candidates and quarantined rows, writes human-readable and machine-readable surfaces, hashes outputs, and records input bindings and policy versions. A verifier checks output hashes, stable unique identifiers, exact partitioning, dimension contracts, counts, and corpus hashes.
+
+Replayability means the same declared inputs and policies can be checked against the recorded artifacts. It does not imply that external sources will remain available forever or that stochastic model behavior will be bit-identical across every hardware and software environment. Long-term reproducibility requires pinned models, retained source artifacts where lawful, environment manifests, and repeated replay tests.
+
+# 4. Accuracy, Attrition, and Confidence
+
+Accuracy cannot be established by a single "high confidence" label. The project is attempting to make attrition auditable by maintaining denominators and reasons at every stage.
+
+The desired accounting chain is:
+
+1. Sources discovered.
+2. Sources normalized and retained after source-level deduplication.
+3. Sources successfully acquired with usable media and metadata.
+4. Sources with usable captions or independent transcripts.
+5. Candidate caption segments.
+6. Candidate target-speaker segments.
+7. Statement candidates after boundary merging.
+8. Rows passing or failing each attribution, text, semantic, and provenance check.
+9. Canonical statements after deduplication.
+10. Total occurrences preserved behind canonical statements.
+
+Every reduction should have a reason code. This allows reviewers to distinguish healthy conservatism from accidental data loss. For example, a low acceptance rate may reflect strict gating, weak source audio, bad timeline mapping, poor speaker separation, or a bug. Without stage-specific counts, those cases are indistinguishable.
+
+The current cross-check strategy addresses the concern that platform captions alone may be wrong. Candidate text is compared against an audio-derived transcript from a separate recognition engine. Speaker identity is also checked through a second embedding route. These checks are meaningful defenses against single-route error, but they are not a substitute for a labeled evaluation set.
+
+Before strong accuracy claims are made, the system needs held-out, independently labeled benchmark intervals containing the target speaker, other speakers, overlap, poor audio, unusual vocabulary, edited media, and negative controls. Reported measures should include false acceptance, false rejection, word error, boundary completeness, deduplication precision and recall, source-discovery coverage within declared scopes, and confidence intervals where appropriate.
+
+# 5. Autonomous Execution by Ouroboros
+
+The bounded proof-of-concept workflow described in this paper was executed autonomously by Ouroboros. A human provided the project objective and operating constraints. Ouroboros planned and carried out source acquisition, artifact organization, media processing, caption parsing, speaker-isolation attempts, independent transcript validation, speaker verification, deduplication, corpus compilation, hash verification, checkpointing, and stop-state verification through OpenAI Codex as its coding and operations agent.
+
+The operator was not required to run commands, label statements, compare captions, manage model downloads, move large artifacts, or repair interrupted work. When instructed to stop, Ouroboros terminated active workers, verified that no task process remained, and preserved checkpoints for possible resumption.
+
+This is bounded, human-directed autonomy. It is not unrestricted agency and it is not a claim that every algorithmic input was learned without configuration. Human authority remains necessary for defining scope, reviewing claims, resolving policy questions, authorizing publication, and deciding whether the work should continue. During the proof of concept, the system had no authority to upload or publicly release the underlying dataset. This public paper documents the work; it does not release that dataset.
+
+# 6. Current Proof-of-Concept Evidence
+
+The current evidence shows that important parts of the workflow can run and can fail closed. It does not establish completion or general validity.
+
+| Check | Current observation at publication time | What it does not establish |
+|---|---|---|
+| Focused implementation tests | 38 focused tests passed across source parsing, speaker boundaries, independent transcript metrics, speaker calibration, storage policy, deduplication, occurrence preservation, evidence dimensions, discovery normalization, enrollment readiness, and corpus compilation | Model accuracy on the open internet, exhaustive test coverage, or absence of defects |
+| Bounded multi-source pilot | 4 sources produced 314 input statement rows; 104 passed the current all-dimensions machine gate and 210 were quarantined | Comprehensive source coverage, human-certified text, calibrated error rates, or readiness for publication |
+| Artifact integrity | Declared output hashes and the canonical corpus hash matched the recorded manifest during paper preparation | Correct attribution or semantic accuracy |
+| Abstention behavior | At least one attempted source produced no accepted target cluster when automatic separation was not reliable enough | That all future ambiguous sources will be detected correctly |
+| Long-form processing | A separate long-form validation was paused before completion, with chunk checkpoints preserved | Completion of that source, end-to-end scale, or stable runtime across all media lengths |
+
+The internal candidate label used by the compiler must be read narrowly. It identifies rows that passed the current deterministic checks. The pilot contains no claim that those rows are perfect, exhaustive, or human reviewed. The 210 quarantined rows are not disposable failures; they are evidence about where current methods are insufficient.
+
+# 7. Known Limitations and Failure Modes
+
+## 7.1 Discovery incompleteness
+
+Search results are not a census. Query design, platform ranking, removed media, regional availability, private uploads, and missing metadata can all create false negatives. A finished system needs bounded coverage definitions and repeated inventory audits rather than the word "all" without a denominator.
+
+## 7.2 Speaker-attribution error
+
+Voice embeddings can confuse similar voices, react poorly to noise, or overfit limited reference material. Interviews with crosstalk are especially difficult. The current design mitigates this through positive and negative references, calibration, multiple probes, margins, and abstention, but calibrated population-level error rates are not yet available.
+
+## 7.3 Transcript correlation and domain error
+
+Platform captions and independent speech recognition can agree on the same wrong words, especially for uncommon terms, proper nouns, accents, and degraded audio. Agreement is evidence, not proof. A benchmark containing difficult vocabulary and human-audited references is still required.
+
+## 7.4 Boundary and timeline error
+
+A sentence can be correctly transcribed but semantically incomplete because its beginning or end was clipped. Alternate audio editions can move the same words to different timestamps. Mechanical punctuation and boundary checks reduce risk but do not constitute human semantic certification.
+
+## 7.5 Deduplication error
+
+Lexical thresholds can falsely merge distinct statements or fail to merge paraphrases. Reposts may contain edits. The occurrence-preserving design reduces the harm of a merge, but claim-level clustering needs its own benchmark, negative controls, and review surface.
+
+## 7.6 Provenance decay
+
+Public URLs can disappear or change. Hashes can prove which artifact was processed but cannot restore an artifact that was never retained. Retention policy must balance reproducibility, storage cost, source terms, copyright, and privacy.
+
+## 7.7 Model and policy drift
+
+Changing a model, threshold, caption source, or evidence policy can change which rows pass. Versioned policies and manifests make that change visible, but they do not automatically make a newer result better. Promotion requires replay and comparison against held-out evidence.
+
+## 7.8 Misuse and overinterpretation
+
+A public-statement corpus can be used to misquote, decontextualize, harass, or make unsupported allegations. The system should preserve context windows and source links, distinguish statements from inferred claims, prohibit unsupported truth labels, and require human review before consequential public use.
+
+# 8. Validation Roadmap Before Expansion
+
+The next phase should expand only after the proof-of-concept gates are tested against labeled and adversarial cases. Proposed acceptance criteria are listed below as future work, not as completed achievements.
+
+1. Generalization gate. Demonstrate that subject profiles, source discovery, enrollment, and compilation operate without identity-specific code or hidden fixture assumptions.
+2. Discovery gate. Define a bounded source universe for an evaluation period and measure discovery recall, false positives, source-level deduplication, and unresolved candidates.
+3. Attribution gate. Evaluate held-out positive, negative, similar-voice, overlap, noise, and edited-media intervals. Report false acceptance and false rejection by source condition.
+4. Text-fidelity gate. Compare platform captions and independent transcripts against audited references. Report word error, named-term error, omission rate, and alignment failure.
+5. Semantic-boundary gate. Score whether retained rows contain complete propositions and whether neighboring speaker content leaked into the row.
+6. Deduplication gate. Build labeled duplicate, paraphrase, contradiction, and near-miss pairs. Report cluster precision, recall, occurrence preservation, and false-merge recovery.
+7. Provenance gate. Replay a compiled corpus from pinned inputs, verify every hash and occurrence link, and test rejection of altered inputs.
+8. Attrition gate. Require complete stage denominators, reason-coded losses, source-level acceptance distributions, and investigation of unexpected attrition.
+9. Scale gate. Resume chunked long-form processing, test interruption recovery, and measure throughput, storage, and checkpoint behavior without treating a running worker as completion.
+10. Review gate. Obtain independent review of a statistically meaningful sample before any external statement that the corpus is accurate or publication-ready.
+
+Expansion should prefer a small number of diverse sources over a large volume of similar sources. Diversity should include short and long recordings, clean and noisy audio, single-speaker and multi-speaker formats, direct uploads and reposts, captioned and uncaptioned media, and hard negative controls.
+
+# 9. Proposed Higher-Order Research Layer
+
+If the statement corpus becomes sufficiently reliable, a separate research layer could attempt to derive claims, entities, dates, predictions, retractions, contradictions, recurring narratives, and links to external evidence.
+
+That layer should preserve a strict descent path:
+
+$$ analysis -> claim -> statement -> occurrence -> timestamp -> source -> audio -> speaker and transcript evidence $$
+
+The distinction between a statement and a claim is essential. A statement is an attributable piece of speech. A claim is an interpreted proposition extracted from one or more statements. Claims can be misread even when the transcript is perfect. The higher-order layer therefore needs its own uncertainty, interpretation, contradiction, temporal, and external-evidence policies.
+
+Potential research questions include longitudinal consistency, when a detail first appears, whether a prediction was recorded before an event, how wording changes over time, which narratives recur across appearances, and which statements have independent documentary support. None of these capabilities is established by the current pilot.
+
+# 10. Governance and Responsible Use
+
+The system should be limited to legitimate research involving public media and declared public speakers. It should not become a general surveillance tool for identifying unknown private individuals. Voice embeddings are sensitive biometric signals and should be protected, minimized, and retained only as necessary for the declared research purpose.
+
+Responsible operation should include:
+
+- Public-source-only acquisition with recorded source terms and access method.
+- No covert interception, private-account access, or bypass of access controls.
+- Context-preserving source links and time intervals for every quoted statement.
+- Clear separation between machine output, human review, and external factual verification.
+- Quarantine instead of forced attribution when evidence is weak.
+- Versioned policies, immutable manifests, and visible corrections.
+- Storage and retention rules that minimize unnecessary media and biometric material.
+- Review for copyright, privacy, defamation, platform terms, and public-interest proportionality before external use.
+- No public release, upload, or consequential allegation based solely on the proof-of-concept label.
+
+This paper is an engineering description, not legal advice. Public availability alone does not eliminate copyright, privacy, contextual, or ethical obligations.
+
+# 11. Intended Deliverables
+
+A mature compiler would produce two aligned surfaces from the same evidence basis.
+
+The machine surface would contain structured statement rows, evidence dimensions, source and occurrence identifiers, timestamps, hashes, policy versions, rejection reasons, and replay manifests. It would support deterministic filtering and downstream analysis.
+
+The human review surface would present the statement in context, make the source playable at the relevant interval, show caption and independent transcript comparisons, expose speaker scores and failure reasons in plain language, list every occurrence, and distinguish machine-gated candidates from quarantined rows.
+
+Neither surface should hide rejected evidence. Reviewers need to see attrition and uncertainty to judge whether the retained corpus is biased by source type, audio quality, interview format, vocabulary, or model behavior.
+
+# 12. Conclusion
+
+This project is attempting to move from transcription toward evidence compilation. The desired object is a deduplicated public-statement corpus in which attribution, text fidelity, semantic boundaries, provenance, repetition, and uncertainty remain inspectable.
+
+The current proof of concept demonstrates a working path through several of those stages and demonstrates that the system can quarantine and abstain. It also exposes substantial unfinished work: source coverage is not comprehensive, speaker enrollment is not universally automatic, accuracy is not calibrated on a representative labeled benchmark, semantic deduplication is incomplete, long-form validation remains partially unfinished, and no public release decision has been made for the underlying dataset.
+
+Ouroboros autonomously executed the bounded technical work summarized here, with OpenAI Codex serving as its coding and operations agent and with human control retained over scope and publication. The appropriate next step is not to declare success. It is to subject the pipeline to broader negative controls, held-out evaluation, transparent attrition accounting, and independent review before expansion.
+
+# Appendix A. Candidate Record Contract
+
+A mature canonical statement record is expected to include, at minimum:
+
+- Stable statement and subject identifiers.
+- Canonical text and normalized content hash.
+- Source identifier, URL, channel or publisher, date, and exact time interval.
+- Platform caption text and independently recognized text.
+- Text-comparison metrics and alignment status.
+- Original and independent speaker-attribution methods, models, probes, and margins.
+- Attribution, text-fidelity, semantic-completeness, and provenance checks.
+- Machine policy versions and review status.
+- Canonical or duplicate status, duplicate relationship, and similarity method.
+- Complete occurrence chain with source-specific evidence.
+- Input, source, model-reference, output, and manifest hashes where applicable.
+- Explicit limitations and rejection reasons.
+
+# Appendix B. Open Questions
+
+Readers and reviewers should focus on the following questions before the system advances:
+
+1. Are the four evidence dimensions sufficient and genuinely separable?
+2. Which current checks are correlated enough that they should not be described as independent?
+3. What benchmark would justify speaker-attribution and transcript-fidelity claims?
+4. How should the project define a bounded, auditable source-coverage denominator?
+5. What contextual window is necessary to prevent misleading statement extraction?
+6. Which uses should be prohibited even if the source media is public?
+7. What evidence is required before a machine-gated candidate may be quoted externally?
+8. How should corrections and model-policy migrations preserve historical reproducibility?
+9. When should the system abstain at the source level rather than emit row-level candidates?
+10. What independent review is required before any dataset is uploaded or described as publication-ready?
+
+# References
+
+[1] National Institute of Standards and Technology. Secure Hash Standard, FIPS PUB 180-4. https://csrc.nist.gov/pubs/fips/180-4/upd1/final
+
+[2] SYSTRAN. Faster-Whisper project documentation. https://github.com/SYSTRAN/faster-whisper
+
+[3] SpeechBrain. Speaker recognition and ECAPA model documentation. https://speechbrain.github.io/
+
+[4] Resemble AI. Resemblyzer project documentation. https://github.com/resemble-ai/Resemblyzer
+
+[5] Google. YouTube Data API documentation. https://developers.google.com/youtube/v3

white_paper.docx

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:77d5642bc6ade8b90aa0cdfbb28c71928ab3d11e539eae5cefb63cb16145d2ba
+size 123276

white_paper.pdf

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e6f9f25cf39bee07d4ce2d59c435c80133ec2d5e6180c4cbffc9e06634f6166a
+size 466757