III.08 / INTELLIGENCE
Open-source intelligence and provenance
Which accounts of an event reach it independently, and which repeat the same original dispatch?
Start with the question.
Open-source investigation depends on provenance as much as on access. The Berkeley Protocol organizes the identification, collection, preservation, verification, and analysis of digital material. This topic makes those operations concrete: a public image or statement becomes useful evidence when its location, acquisition time, version, and relationship to other records can be inspected and challenged.
Verify a public image without overreading it.
Choose a museum or agency image with a stable public page. Record the original URL, caption, publication date, and any supplied metadata. Compare visible landmarks or labels with an independent institutional record. Keep the conclusion narrow enough to match the evidence, such as identifying a location or an edition rather than inferring an unseen event.
What would you inspect?
- Original publication context, later reposts, and the date each version was captured.
- Independent checks supporting time, location, authorship, or content.
Take the next step.
Build a provenance record for one public artifact, including the verification steps that succeeded and the specific question that remains unresolved.
Put part of the question to work.
These models isolate a mechanism you can vary. Their assumptions define the part of this topic they can illuminate.
Try connectivity and removal.
Change one parameter, compare the numerical output, and export the result. The experiment loads when you open it.
Watch the quantities change.
Connectivity and removal
Compare local connections with the paths that hold a network together.
Read the explanation and method
Forty-eight points are drawn from one fixed random seed. A link joins two points whenever their distance is within the displayed radius.
The radius grows from 0.05 to 0.4 of the unit square. Existing links remain while new links merge previously separate connected groups.
Orange marks the largest connected group. Connectivity here describes paths through this constructed graph; it does not measure information quality, influence, or causality.
Method. Two nodes share an undirected edge when their Euclidean distance is at most the connection radius. After removal, a depth-first traversal assigns every active node to a connected component. Groups are ranked by size; ties use their lowest node identifier.
Read the supporting material.
- Berkeley Protocol on Digital Open Source Investigations
UC Berkeley Human Rights Center and OHCHR · Identification, collection, preservation, verification, and analysis of digital open sources.
