u/Designer_Regret5165

I tested TAT on the MedSec-25 network-flow dataset.

The dataset had 554,534 flow records labelled as benign, reconnaissance, initial access, lateral movement, and exfiltration.

Instead of only scoring single rows, I ran it in two layers:

1. Dataset-wide drift detection

TAT compressed the full dataset into 118 five-minute review windows and ranked where the whole system shifted into a coherent incident state.

The strongest repeated incident window was:

17 Apr 2025, 15:38–15:54 — Initial Access

It also surfaced broader staged activity:

15 Apr — Reconnaissance

17 Apr — Initial Access

24 Apr — Lateral Movement

2. Endpoint chain detection

Inside the strongest drift windows, TAT ranked the IP-to-IP paths most worth reviewing.

The top endpoint chain was:

192.168.1.101 → 192.168.1.108

17 Apr 15:38 — Initial Access

1,849 rows | 1,617 destination ports

The same endpoint pair appeared again at 15:40, with 1,176 rows and 1,061 destination ports.

TAT scoring combines:

threat possibility, forensic usability, chain coherence − noise penalty

The score is converted into a Priority Index, where 100 = strongest review target in the run.

What I found useful is that TAT connected:

when the dataset shifted

what incident stage dominated

which IP pairs were active inside that window

Would this kind of time-window + endpoint-chain ranking be useful as a DFIR / network-forensics triage layer?

I’ve been testing a small model I built around a simple idea:

Born probability may describe the distribution of possible outcomes, but maybe that is not the same as saying every possibility becomes an actual measured event.

So I tested this with Monte Carlo CHSH/Bell simulations.

The setup compared:

1. Classical local all-counted model

2. Standard quantum/Born-rule all-counted model

3. TAT threshold-actualisation model

The TAT model uses the Born-style possibility weight as the base layer, then adds an actualisation condition:

possibility × gate × support noise must cross a threshold before an event is counted as actualised.

The important result:

When I forced TAT to obey strict valid quantum rules:

- real quantum state

- valid measurement operators

- Born-rule probabilities

- all valid trials counted

- no post-selection

- no detector communication

- no sample changes

it stayed at the normal quantum CHSH result:

TAT inside valid QM:

S ≈ 2.83

Standard quantum:

S ≈ 2.83

So it did NOT beat quantum mechanics from inside standard all-counted QM.

But when I allowed TAT to act as an event-actualisation layer meaning not every possible event becomes a counted event the model could exceed Tsirelson’s bound and reach:

S = 4.0

That is the mathematical CHSH maximum.

The reason is clear: the threshold layer selects which events actualise. High-coherence events pass. Low-readiness/noisy events drop out.

So the result is not “I proved quantum mechanics wrong.”

The better claim is:

TAT can generate super-quantum CHSH correlations when measurement is treated as thresholded actualisation rather than passive all-event sampling.

I then tried to falsify it with a harder loophole-style test.

The result:

- TAT does not survive as a loophole-free replacement for QM in simulation.

- The super-quantum result depends on selected/dropped events.

- That means the next real test would need event-by-event detector data.

The falsifiable prediction is not just “higher CHSH.”

The real prediction is:

If TAT is physically meaningful, detector data should show threshold-dependent fingerprints:

- fire / no-fire patterns

- lost events

- timing clusters

- efficiency shifts

- marginal fingerprints

- detector-readiness effects

better predicted by the threshold model than by Born only/noise modelling.

So my current conclusion is:

Born governs possibility.

TAT may govern actualisation.

Inside strict all-counted Born rule QM, TAT reduces to the quantum bound.

Outside all-counted sampling, TAT can become super-quantum because it changes which possible events become measured events.

I’m not claiming this proves quantum mechanics wrong. I’m sharing it because the distinction between probability and actualisation seems testable.

The next step is real event-by-event Bell or photon detector data.

I’m looking for criticism, especially from people familiar with Bell tests, detection loopholes, post-selection, and event-ready detector experiments.

The question I’m interested in is not “can code fake CHSH = 4?” Obviously it can.

The question is whether a general threshold-actualisation model can predict real detector-level event selection better than standard modelling.

​

I built a small Python simulation to test a fatigue-aware ad-routing model.

The setup compares four routing methods across 60,000 simulated impressions:

- highest bid

- highest relevance

- bid × relevance / eCPM-style selection

- fatigue-aware selection

The idea is simple: a high-performing ad can look good early, but repeated exposure reduces click probability and creates user fatigue. So the model tries to balance immediate value with whether the user has already been over-exposed to the same asset.

In this simulation, the fatigue-aware method produced the highest long-term net value and maintained a much higher CTR than the greedy baselines.

I’m not claiming this proves production performance. It’s a toy simulation. I’m posting because I’m interested in whether people working in ad ops / ad tech see this as a real routing problem, or whether existing frequency caps and pacing logic already solve most of it.

Main question:

Where do current ad systems usually handle fatigue — frequency caps, creative rotation, bandits, decay models, or something else?

Would appreciate any technical criticism.

I ran a threshold-selection model I’ve been working on against the UCR Time Series Anomaly Archive, which has 250 labelled anomaly time-series files.

The idea was to test whether the model could identify where a possible anomaly becomes an actual detected event.

The first version was too focused on persistent/coherent structure, so it struggled with the UCR archive because many of the labelled anomalies are short, sudden breaks.

I then added a first-event pathway, so sudden changes can actualise immediately instead of waiting for slower coherence/persistence checks.

Results across 250 files:

TAT-v2 first-event: 30.0% hit rate

Derivative shock baseline: 29.6% hit rate

Raw robust deviation: 16.0% hit rate

TAT-v1 coherence: 13.2% hit rate

Resonance-only: 11.6% hit rate

So the updated version came out slightly ahead on hit rate, but derivative shock still had a slightly better mean overlap with the labelled anomaly window.

My read is that the model is now better at detecting short first-event anomalies, but still needs tighter window precision.

The useful part for me is that the benchmark exposed the weakness clearly: the original version was too cautious, and the improved version needed a direct first-event actualisation route.

I’m treating this as a benchmark result, not a final claim. Next step is improving overlap precision and testing on more machinery/process-style datasets where persistent structure matters more. I built it for modelling probability and was wondering if I can test other peoples data and cross check their results with mine to see where TAT might need improvement

I coded a double-slit style simulation with a selection layer added on top.

The first graph shows a clear interference pattern when the paths are not separated.

The second and third graphs show what happens when path information is kept or the records are left mixed together: the visible pattern smooths out.

The final graph shows the part I’m most interested in. When the records are sorted into two related groups, the hidden structure comes back as two opposite wave patterns.

The way I’m reading it is simple: probability gives the possible patterns, but selection is what decides which structure becomes visible.

I started with an existing Schrödinger style field idea, where each node carries a changing wave like state. Then I added an activation layer on top of it so the system would not just remain a continuous field, but could decide when parts of the field become visible or audible.

The system runs as a live network of moving nodes. Each node has a changing internal state influenced by its position, motion, the surrounding field, recent activity, and connections to other nodes.

Most nodes stay below the activation point. When a node crosses that point, it becomes eligible to produce sound that makes the math tangible.... Which I needed.

Instead of only watching numbers or abstract waves, the field expresses itself through motion, visual flashes, timing, notes, chords, and MIDI/audio output.

It is not a fixed loop or step sequencer. It runs continuously, and new musical events emerge as the field changes.

There is also a sound layer between raw activations and the final output. It smooths timing, limits density, and controls how many keys can overlap at once, so the result stays musical instead of every active node firing immediately.

The goal was to test whether adding an activation layer on top of a Schrödinger-style field would produce structured behaviour that could be seen and heard. The result is a live system where field changes become motion, light, and music

I just wanted to see when probability got "written" into history. Now i guess I can.