MétaCan
Menu
Back to cohort

Computational Topology Techniques Help to Solve a Long-Lasting Forensic Dilemma: Aldo Moro’s Death

2018· preprint· en· W2901373932 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenuePreprints.org · 2018
Typepreprint
Languageen
FieldComputer Science
TopicDigital Media Forensic Detection
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsSocial connectednessTerrorismTopology (electrical circuits)Computer sciencePlanarLawArtificial intelligenceMathematicsComputer graphics (images)PsychologyPolitical scienceSocial psychologyCombinatorics

Abstract

fetched live from OpenAlex

Here we show how a recently-introduced method from algebraic topology, namely proximal planar vortex 1-cycles, might be helpful in detecting hidden features of the shapes and holes in images, therefore contributing to the solution of both cold and fresh forensic cases. In particular, we test the efficacy of this technique by assessing one of the most puzzling cases of recent history, i.e., Aldo Moro’s death. Terrorists of the Red Brigades claimed that they killed Moro when he was placed inside the trunk of a car,shooting him with a barrage of bullets. We demonstrate, based on the analysis of the photographs taken during the autoptic procedure, that the terrorist’s account does not hold true. Our results, showing different series of shots, point towards a three-step execution, with the first phasestaking place outside the car. In conclusion, the novel forensic analysis method introduced in this paper permits the evaluation of a collection of vortex cycles/nerves equipped with a connectedness proximity, which makes it possible to assess unexpected spatial clusters in photographs.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Open science, Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.321
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.009
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.003

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.110
GPT teacher head0.348
Teacher spread0.238 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it