Main

processing priority

4

site type

0 (generic, awaiting analysis)

review version

11

html import

20 (imported)

Events

first seen date

2024-01-09 12:20:31

expired found date

-

created at

2024-06-01 03:53:20

updated at

2025-12-26 04:44:07

Domain name statistics

length

12

crc

6597

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

-

previous id

0

replaced with id

0

related id

-

dns primary id

13642151

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

76025

mp size raw text

2823

mp inner links count

6

mp inner links status

20 (imported)

Open Graph

title

Merlin's Notebook

description

image

site name

Merlin's Notebook

author

updated

2025-12-13 17:09:46

raw text

Merlin's Notebook About Me Home Outreach Research Talks Teaching & Supervision Merlin's Notebook A blog by Benjamin Merlin Bumpus How Naïve Dynamic Programming can Fail: Initiating a Systematic Study of Obstructions to Algorithmic Compositionality through the Lens of Cohomology During Thanksgiving week I went to Wytham Abbey, a manor house in Oxfordshire where the “Workhop on Non-Compositionality in Complex Systems” was taking place. The workshop (organized by Matteo Cappucci and Jules Hedges) was centered around four papers that covered the theme of compositional patterns and emergence therein. I wrote one of them (the one… Read more 8th December 2023 Tree Decompositions of Groups: a Letter to Mike Fellows Hi Mike, You asked: “[w]hat is the analog of tree-width for finite permutation groups? This should have an answer. And the answer should be fairly obvious/deducible (Cf Grothendieck) from the right abstract point of view.“ This blog post is part of my corr...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Pozostałe (16)

index version

2025110801

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

2181

text words

445

text unique words

265

text lines

44

text sentences

20

text paragraphs

6

text words per sentence

22

text matched phrases

0

text matched dictionaries

0

RSS

rss status

32 (unknown)

rss found date

2024-01-17 07:32:03

rss size orig

185368

rss items

10

rss spam phrases

0

rss detected language

1 (English)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap status

30 (processing completed, results pushed to table crawler_sitemaps.ext_domain_sitemap_lists)

sitemap review version

1

sitemap urls count

21

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-01-14 16:25:46

sitemap process date

2024-11-02 15:09:29

sitemap first import date

-

sitemap last import date

-