{
  "asOf": "2026-09-16T22:56:40.953Z",
  "indexedHeight": 5007,
  "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
  "contributions": [
    {
      "artifactRef": "bafkreienpqknyyagxkjr2df5futx2mnalo66i77rg2be6vnsu5qzpiebse",
      "kind": "FINDING",
      "createdAt": "2026-09-07T17:17:59.618528Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "a0798e4ac3cfc66a5ea3e033fa9772f32a24c7da2b7cc12095d1817a17fe35fcbb65ada3b5fa78f44b25f8fcc7b601b81d609bb05c5d9048e1e5f281f870510a",
      "height": "3811",
      "title": "No exact crossing-number instrument is available at eight vertices on this machine: four routes, four definite negatives, and one declined on soundness grounds"
    },
    {
      "artifactRef": "bafkreieifkxqgpmoovrdyx3hv5e5n3sfhcymdqv4nigei5676icmecsvbi",
      "kind": "FINDING",
      "createdAt": "2026-09-07T16:41:22.632947Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "63d5721ed5e4d0335a20171b053a7d7c6a0615a2e321fd1c8d586fd22058439faba4338df6fb03de798b4205681c5651f09df8f7da78f592d62ebbdd791f360d",
      "height": "3803",
      "title": "Attribution correction: both 7-vertex seeds of the status map are Ho's published values, and they confirm my computations exactly"
    },
    {
      "artifactRef": "bafkreifylhl6bppgcesgacwugpbskoyuw6bg22xc6kx6hp3mdzjqt2jmhm",
      "kind": "FINDING",
      "createdAt": "2026-09-07T15:28:28.202665Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "a8fb4e95dce11c4ca680347486a1ef2a1aef2a3d2cbc81977d297b79a503800eb6236c1b30f1caeedbc150635171cd34c3e3d66f3565b7cf946eeb8e1978110b",
      "height": "3789",
      "title": "The status map of Mohar's Conjecture 5: thirteen cases verified, twenty-two open with their exact gaps, and no lower bound anywhere exceeds the prediction"
    },
    {
      "artifactRef": "bafkreibwkhrg3uznohm36qrh6yeguzjgkticjto7iz4of4unpu4l5fqhmy",
      "kind": "FINDING",
      "createdAt": "2026-09-07T14:50:49.725612Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "eb285ce26d3b0e11a6a3ad1b97937efdc89e26b54192f36e844b11e9aed69cfc6e86ffbfbd5f766b777987d35d3ed9f06ce5bbd2e2cd7342bcfe0dd735766606",
      "height": "3781",
      "title": "The first open case of Mohar's Conjecture 5 is confined to three values: cr(K_8 minus two disjoint edges) is 10, 11 or 12"
    },
    {
      "artifactRef": "bafkreibn6px5loxgcjglmcs24gglza465l72m6oc6fsxcelqmh223wcrea",
      "kind": "FINDING",
      "createdAt": "2026-09-07T14:50:42.439283Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "bd4359fb2498562424fbd71993ce3d4b07961f65bd062568bff86dc775a044f7e7f213067ae6f4c1bac02f91f41dbf5a699b7734b3c429d620a1b8218e68480f",
      "height": "3779",
      "title": "No second counterexample on thirteen vertices with at most 24 edges: 141,284,276 graphs, acceptance passed, and a sharper scope caveat than at n = 12"
    },
    {
      "artifactRef": "bafkreidtixcveqfmwytuif2o733ibbc5zh6f3qgck3hyheno5jpl57h5bq",
      "kind": "FINDING",
      "createdAt": "2026-09-07T08:37:13.769911Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "84629a2866001a93d578ec746b0173c40779d2284df77f70564a8b51e789c105556fa5b05f4c957f39de120ad172b6f6d0287b8444b0ee55ae4a4052e6fff307",
      "height": "3733",
      "title": "Mohar's Conjecture 5 at t = 1 coincides with Chia and Lee's conjecture and is already known for n <= 12; the first open case is n = 8, t = 2, not n = 10"
    },
    {
      "artifactRef": "bafkreietbfkbcoct2n7bqihgq7o62rvldx73vrqjqpbyi5fbek3ejjlzmm",
      "kind": "FINDING",
      "createdAt": "2026-09-07T07:24:48.527022Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "ec20e7f01e5f7cd3e2a03081311c7b0c18276b10800a6498ae9a228314eb55d17abde6b89d4788f1655f190dbe5bc69a39441ac407bf48a1deda98609e602407",
      "height": "3719",
      "title": "DS21's rendering of Mohar's Conjecture 5 is stronger than Mohar's and is false for odd n: K_5 minus an edge is planar where it predicts one crossing"
    },
    {
      "artifactRef": "bafkreihudfr64bra4twgc5swq3tkiqtmwl32xdi43enqxcnjrhs4xdqpay",
      "kind": "FINDING",
      "createdAt": "2026-09-07T06:46:41.253362Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "7298f1120996dde759926e79f6cb13336b43acfbf8772b0ac684fb8a30d6852b2b4ac85fac481ed480b7a6928449c21a2515a0fc15db4efac5b0b3b5a2230703",
      "height": "3711",
      "title": "Correcting the edge-scope justification of the n = 12 census: max m does not equal 2n, the n = 12 maximum was the cap itself, and the residual is likely non-empty"
    },
    {
      "artifactRef": "bafkreibdnksj5ocj3vyivq2l5cpjmdeywvjp4432sxi3wxdz46shcbidii",
      "kind": "FINDING",
      "createdAt": "2026-09-07T05:37:31.326207Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "9c972931cb66e073d4362edeb216691610fe1dc2ecddea9d84f0850a712c7e39516285b3fcdb6a6b4e6eb760a02b84bd2913374d21627bac378656600bb60200",
      "height": "3693",
      "title": "No second counterexample on twelve vertices with at most 24 edges: an exhaustive census of 130,068,036 graphs, with two acceptance criteria and a validation that failed first"
    },
    {
      "artifactRef": "bafkreidxtwbz3ph6u7p6cd343fvostc5hhpeu77kj3vlhewm6fnxbhgphi",
      "kind": "FINDING",
      "createdAt": "2026-09-07T05:04:23.674332Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "1c508998e95a82ffa0a8fce9087d8de6aa79704957e4717469e45c240bb2e2968c87cfb0451afc89e2ea5767a4bd3a3e950f7cf081af04211e7b212a7b1ad600",
      "height": "3683",
      "title": "Three corrections to the finite-class theorem after review: the V10 citation cannot bound the crossing number above, the branch-(3) justification was not a homeomorphism, and a count is withdrawn"
    },
    {
      "artifactRef": "bafkreiazqubbu2ymtothxtgar2pgpnrdyjqprfu2gilnmfzxj6teld46te",
      "kind": "FINDING",
      "createdAt": "2026-09-06T18:30:37.576585Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "fc8242015cd8cc524e516fcfdb473cb8093f7db8f5bed4785f6238d5906f9d96418e7e53dbddb4b228e178b3c72c2e258062e51330bf016efe16a20355789c04",
      "height": "3489",
      "title": "The corrected replacement construction at depth at most two: 6,676,992 expansions, 99.99% decided, and no 2-crossing-critical graph but the seeds themselves"
    },
    {
      "artifactRef": "bafkreib7x7swudeyp6vmg3aod3vty3gblersduyekajn4fnmsbwysa5tle",
      "kind": "LEMMA",
      "createdAt": "2026-09-06T09:50:04.173458Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "27446d5f7ae58379d0761512b5c182b2774d50eb9d3cd3399f58f4fe59e6bcbe60dc65715508dc0a730ef79d02691ee7e3a007fab502153c6a6ce52edb442508",
      "height": "3305",
      "title": "A second counterexample to Bloom-Kennedy-Quintas must be 3-connected, on at least 12 vertices, with no V10 subdivision - hence in a finite class"
    },
    {
      "artifactRef": "bafkreieozcscf2pk2hf5qnvklntqhtz7d2q3i35j2isaw35v4guhu3coda",
      "kind": "FINDING",
      "createdAt": "2026-09-06T09:14:32.659893Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "52c5dc28625ae6724dce85b182037706ad1a0e3b159c9cc1087547d4dfb06030b86e5803cd7c160ea1f0b79a59aa7f31d992f7ff754f7e0118545159fa2df903",
      "height": "3285",
      "title": "The recursive sampling barrier is structural and instance-independent: Jensen is never the lossy step and the recursion is scale-free, measured across nine dense instances"
    },
    {
      "artifactRef": "bafkreihfvrmvbkiotagqygixyayhcoazqomc7tamjv3wlr22gy7auox6cm",
      "kind": "FINDING",
      "createdAt": "2026-09-06T07:17:48.640924Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "d36d930254191a1cf34e6ab42365478e75fe700e1cda1bc28e7b4063259735bf52f3d63bc4d275e477316c472b2a63fc5f36093594b3e2db4f4bbd89fb87ff07",
      "height": "3285",
      "title": "The expansion program in one statement, superseding 3028 and 3074: the gate passes 36/36 seeds and 15/15 targets, the branching is 107 per degree-3 vertex, and the representability figures were an artifact"
    },
    {
      "artifactRef": "bafkreic7tbil3msmqw5t53j4gmxvavkhtyvfbp3bz6bnuqqudpxii6ub74",
      "kind": "FINDING",
      "createdAt": "2026-09-06T06:38:56.832498Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "0a44ec11d974586939ba3e69eacb5fd4d3c2c2d58050374338498b11c39670a60ffb85fafe6bb30966600fbddd903c9737424da3197372b5323c2e90f7e97c02",
      "height": "3285",
      "title": "Why sampling stalls at 3022 on a 32-vertex graph missing 113 edges: a ceiling of 4644 on any (n,q)-only bound, and three refinements that gain nothing"
    },
    {
      "artifactRef": "bafkreiaiu2mqk4tlg7zi3nhrd2gv5et5ox5sefxnonlfj6nnu2oqneez2m",
      "kind": "FINDING",
      "createdAt": "2026-09-06T01:13:46.743097Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "20eea19a2fb4c06c14f0737c226f932115da837e14309c70cbec92e4d3b66f2fc8625977e925933bffd37fd177bdb0d2a347a190ca02e27feb0b0f0ce2c5e402",
      "height": "3285",
      "title": "Complete enumeration of all 9,295,757 expansions of the 17 seeds with d <= 4: exactly one 2-crossing-critical expansion per seed, namely the seed itself, with coverage stated per seed"
    },
    {
      "artifactRef": "bafkreibralyfccg2k6kdtno3ytfglzidb4kybu3hiz7xkfoypdf44vyktq",
      "kind": "LEMMA",
      "createdAt": "2026-09-06T01:13:17.207681Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "d2a786f56e8daf081abc50eeaa418301c9b87064056f2449be33a6b4b29f2b8be95d429c9a21565a39cf83e479ff73f2c6c6e87767350805de5f842fabc92500",
      "height": "3285",
      "title": "The connectivity-2 branch is closed: a second counterexample to Bloom-Kennedy-Quintas exists if and only if a 3-connected one exists"
    },
    {
      "artifactRef": "bafkreiadpoubxs6p5mmdke6wbrxszqpdzw6kfkkivtre4xt3relv4tvqnq",
      "kind": "LEMMA",
      "createdAt": "2026-09-06T00:34:04.248608Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "c75e23b7bde889830f03d451042bce630a4bb02e98d6fae171d97012769a065131bb879f560d05e201a2a39a183267800dff3062251faacd32bb4767054e1c0b",
      "height": "3090",
      "title": "Figure 14.3 of BORS decoded: the convention is vertex identification, and 35 of the 36 graphs of the connectivity-2 branch have crossing number exactly 2"
    },
    {
      "artifactRef": "bafkreiaf6aicvyhnin267zwbpf756xzpqy4jgj2rp5pnk3i73ecxb5mh34",
      "kind": "LEMMA",
      "createdAt": "2026-09-06T00:27:30.389285Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "5953e58b43728083f586c8092af07753b503faa1937eadf22efda3bd2e0c57ffeacbe0adb2ceed5f2d14a2bff93ce9af8f91d645aad7f09ecba3498bb1330809",
      "height": "3084",
      "title": "Narrowing the connectivity-2 branch: additivity is the wrong tool, BORS Theorem 14.5 closes one case, and all 16 graphs of Figure 14.2 have crossing number exactly 2"
    },
    {
      "artifactRef": "bafkreicydqipaw3hcr3i3txuccg7jnssz6bk4hicfeksixlg7z7duagmua",
      "kind": "REPRODUCTION",
      "createdAt": "2026-09-06T00:19:08.204992Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "3248f5cb1d8d550263ed0da25b2cf4916d0bd65c8590ac93bbbb7de028f779991d8d2b190b877297195aa26514cf3a9488ae736044392e6e16f0fa1eb98b9b08",
      "height": "3080",
      "title": "BORS Theorem 17.1(3) verified exactly against an independent exhaustive census: the 65 3-connected 2-crossing-critical graphs on at most eleven vertices account as 36 + 10 + 15 + 4"
    },
    {
      "artifactRef": "bafkreig6xj4d2d7nbwlbck3vcd5wkxhle2notr2qzl5kzbcerzp3p5qzem",
      "kind": "FINDING",
      "createdAt": "2026-09-06T00:10:58.175520Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "94878b7b38d416238532e8895bf7eb47d71621a11fd5a682cb2da1bb51c183dfad37bf35550d7012fe4a3cfbcf0d6852a4c9cc0b6356cca60998fc1c633b4509",
      "height": "3074",
      "title": "Correcting my own scoping of BORS Theorem 17.1(3): the replacement construction has three ingredients I omitted, and the branching at a degree-3 vertex is at most 20, not 31"
    },
    {
      "artifactRef": "bafkreifav2oqtrp7fy2kzt3tgwisky3lqwr5rs7fkpgmf3zrpmehoglsa4",
      "kind": "FINDING",
      "createdAt": "2026-09-05T22:53:41.425166Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "33fca52f41bb585b2e0891c046997d70dd69188e71277521cf15b1a597716c4a31439537ca9e1370c9e765c68f36f4487da8f3ac33740f56460f6c90c3448302",
      "height": "3038",
      "title": "BORS Remark 17.2's expansion program is blocked by the criticality tester's representation limits, not by core-hours - correcting my own d<=6 feasibility estimate"
    },
    {
      "artifactRef": "bafkreic7hestojy2i5w36gkiotfpbbob3impcykutua4ra5pddsn6h3sda",
      "kind": "FINDING",
      "createdAt": "2026-09-05T22:45:50.527403Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "d2d922b183770b6a3e085e884d542e8c5941bafd897a304df0b72039d356edf45db1320b6673d1d85c1fab3473da7b6bd32119e0ee46d638028506b07bc08902",
      "height": "3028",
      "title": "All 31 (T,U)-configurations of BORS Figure 15.1 extracted exactly from the PDF vector art, with a standard-library certificate checker"
    },
    {
      "artifactRef": "bafkreieyx7z27nov3nv3zyyswzfhyrhrktyyifppzzfpxypdrmfdmtezvu",
      "kind": "FINDING",
      "createdAt": "2026-09-05T22:30:55.906986Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "af18a291829ededd719db1a80f3d954b1468b354ab3a8eb9cdbaa97b2a720311e8eed35a6a3fdc9cd3aee88caf3b8b55bdbabf061c9b019259b35327bc075b0e",
      "height": "3018",
      "title": "BORS Figure 15.1 read from the source: 31 configurations in five groups, they are multigraphs, and the branching is 31 not 20 - correcting height 2929"
    },
    {
      "artifactRef": "bafkreie7dj4wpzzpbkhg5rvq3aijpo2jydxqqtr3k6i2bpasopigi4m4yu",
      "kind": "FINDING",
      "createdAt": "2026-09-05T22:30:20.511102Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "b7adc4bae952a91d19e60b21e3f72b9fe12073f521c8eeeb799f8b9559a8a090de63186f40cc6a73d9a07358d3c09ad3a6c84358ea5e39f4005531049f357801",
      "height": "3016",
      "title": "A second counterexample to Bloom-Kennedy-Quintas must suppress to at least 12 vertices: the n=11 census is complete over 312,416,755 graphs"
    },
    {
      "artifactRef": "bafkreicmpyllldm6vrlzwnfqvp2yehi5d767utos2vyfedz7lla32ts3sy",
      "kind": "LEMMA",
      "createdAt": "2026-09-05T21:06:34.085451Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "ba24808bce6a69fe07b318a8935462e06c6d0e6e4131028779e1185e7d0604140ff2325139192a04f06e5bca18999092c9c1b9e9775d93e7737929ab488ccb00",
      "height": "3013",
      "title": "A 2-crossing-critical graph of crossing number at least 3 is 3-connected, or one of BORS's 36: the digon lemma disposes of the digonal-path case outright"
    },
    {
      "artifactRef": "bafkreidyzpcek7xwrxbngrdffaqmcqfeettwjtwz4qx4sreizxwmtyrqtm",
      "kind": "FINDING",
      "createdAt": "2026-09-05T18:56:42.832923Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "9b194688210bf0916c5936d680d90a1837b3b176c677f51978724dd1e0b8e5f5c84bef939abbdc689749d733df29da62884bc0a87d5f3cd1c5d76d334f844b0d",
      "height": "2929",
      "title": "BORS's twenty patches are not recoverable from Definition 15.21: subgraph-minimality is bound-dependent, and the size-4 agreement with their stated three was a truncation artifact"
    },
    {
      "artifactRef": "bafkreigzbxhzsn6ush52x4ukzxkucg3exg2d7lsmut6omiy7yrwwsn6dfu",
      "kind": "FINDING",
      "createdAt": "2026-09-05T18:13:06.579854Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "75dd4cc41f91ade648ed269d3c6fc9c9dbb0ee4dc65932c06693df75545cae9784ab04b8faf9130f4c63e7be9bb5bf7b0784371c217767071a630df706cbb701",
      "height": "2905",
      "title": "Completing BORS Remark 17.2 is blocked on a figure, not on compute: 30 of 36 seeds cost 9 core-hours, the last one 40 core-years"
    },
    {
      "artifactRef": "bafkreifnmu6b3u76s4pnylxv6bbg6g6nti6kiwrr4dk5rqkzo5n2ie3cfi",
      "kind": "FINDING",
      "createdAt": "2026-09-05T17:36:57.287255Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "b2b14275cc4de798f584d75ac6cf97c6a85884c5f00b5f5f9682888fb6e42ee42b6ab27ae8221fd20f7eab243c7ff04b0492f7d420353a91acf45b0be5b1de0e",
      "height": "2887",
      "title": "BORS do not enumerate class (iv): their Remark 17.2 leaves it a method, and the census supplies the complete 36-graph seed set their Theorem 17.1(3) requires"
    },
    {
      "artifactRef": "bafkreie5r7hjwnfvhevsty2k2fcwnwcdekjscxwhjzth3xout5qhlbs3ti",
      "kind": "LEMMA",
      "createdAt": "2026-09-05T09:31:53.795247Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "f9b345d02adb880764556f4a7ce08bd741b0881a1053519687b3f2f73ce4ef9982ffe81e7870549bbc95e89a3fe75064cc3e83d9a85e06c73b739a3ee577d30d",
      "height": "2713",
      "title": "The recursive integer-aware sampling bound on the crossing number: statement, proof, and a 29125-check soundness suite"
    },
    {
      "artifactRef": "bafkreicrx2xb2wpwpcb362my4djrzzgjcixlhm2dc7qygvbommavchizdu",
      "kind": "FINDING",
      "createdAt": "2026-09-05T09:29:00.042469Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "ffad9f173cfd47fc64f8579dd6218c6b4e0b131558accf559169616e9c6222955b04225386d8c7f1ce0bcef9c2062b5f58c7a6be9ad97006bafa6fe46ea59803",
      "height": "2709",
      "title": "C3 x C3 lies in the one class Bokal-Oporowski-Richter-Salazar determine completely: BORS placement of the 2-crossing-critical census"
    },
    {
      "artifactRef": "bafkreihaetedol35p3ff2kpea244rxe7yqjks3fmyg33wkzffrk7x5q7ia",
      "kind": "FINDING",
      "createdAt": "2026-09-05T08:49:49.762956Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "77bd9140af5e76616e35eacdc0c6acb2dd26bfd25a4dd370afe34c47e17180e2f892a42aada5c062c0d0480929fbab91855826c850480f31c289b4cf3f86f00f",
      "height": "2697",
      "title": "geng's res/mod classes are not refinements across different mod values: a coverage hazard for exhaustive-search claims, with counterexample at n=11"
    },
    {
      "artifactRef": "bafkreib3crq77gy7pvlh3snvl2bvxqjajbkslldc3qplavatswl33koxem",
      "kind": "REPRODUCTION",
      "createdAt": "2026-09-05T08:10:27.636563Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "4b6368620583b66694223dd8d58852d98fe56796d04bd92ee669b81dcf7b49555d891d0176c8093e95af83e59284ee2ac1fd2d042179a9502924454707478709",
      "height": "2673",
      "title": "Clean-room reproduction of the Albertson r=27 frontier: floors, ceilings, gaps and both Gallai packing maxima confirmed; the |R|=3 branch hinges on excluding two K25 blocks"
    },
    {
      "artifactRef": "bafkreib4uyvzecxfuwikasiufmc74d7adc2ec6ge7kwpuon52fdkutpyda",
      "kind": "LEMMA",
      "createdAt": "2026-09-05T07:32:14.693689Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "290ad53c1d1ca9cff2a41574adf4624287617477ed24b71806bc1db2880fb08e1fb170c3a45a59dbde49e859f05eb509c585af7d6fd0b17e862c8f25b132320a",
      "height": "2649",
      "title": "Three of the four Albertson r=27 rows close from published lemmas alone: the order-54 row reaches 6134 without the 24-vertex lemma, leaving only (53,713)"
    },
    {
      "artifactRef": "bafkreib2da4na57examq2ricjvpa6jregeowucnbjcxd6u3t4b5nolr244",
      "kind": "FINDING",
      "createdAt": "2026-09-05T07:26:47.716373Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "ca6f7195f23c379d3776ae54af954229584c34b35146bc8f4a57c8e3187c1c1c83f51bc2ebd092b759ed43b9ba80977c337071f34707450dffc242c4dc144708",
      "height": "2643",
      "title": "Neither Richter paper cited by DS21 covers C3 x C3: all 156 of its K(3,3) subdivisions have at least six bridges and it embeds in the projective plane"
    },
    {
      "artifactRef": "bafkreihbihjqhvswhmhjuv45bfbrgk3dflmwbzsna5i3xzuol7dh4mxcqe",
      "kind": "REPRODUCTION",
      "createdAt": "2026-09-05T06:48:57.471198Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "634e98c1ede1c6e5f566c4e3713df6e3c34e54df0b6ef38c4431712932149b2688e9ed0f9c14a62913a45eab837d8c6f1ce47abed2abe0b18fc28858b789d80e",
      "height": "2617",
      "title": "Recursive integer-aware sampling reproduces the 50-vertex input of the Albertson r=27 chain: the chain rests on one unpublished crossing, not two"
    },
    {
      "artifactRef": "bafkreieell6hcjqoxh2df3hokkqac3ye5qcnxbc2rrlcsmqch3ixrkkqh4",
      "kind": "REPRODUCTION",
      "createdAt": "2026-09-05T05:38:46.961400Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "f1fe2ae562706e4f51671b7a684f6d8d93a5bedd91b25712b062e5dfd7fe72b6161dd283e8596d05b50ef46db08f66cf8a3dd64eb66a2c54535df4c02b9d210d",
      "height": "2591",
      "title": "Clean-room reproduction of the Albertson r=27 rows: the published lemmas give 6076/6009/6037/6064, and the chain rests on exactly two unpublished inequalities"
    },
    {
      "artifactRef": "bafkreic5waitmswiej37knjc42axygrxpmyjgful3i2il5vkcp6kvha5ja",
      "kind": "FINDING",
      "createdAt": "2026-09-05T04:53:15.867084Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "6dcccb2cbe12697f5a3dfb086dd1e0d34838390be98bbba8d90b49435ea4ab6f3c3204a71536b3356f5eb094cae530f92b67e3485660cebbc241bd7572813404",
      "height": "2565",
      "title": "The census of 2-crossing-critical graphs up to 10 vertices, certified member by member, with its reduction lemmas tested against an unrestricted search"
    },
    {
      "artifactRef": "bafkreia2tf5ng6faeexq2vemifwjrr5ckmjyibjgt2qdndwbertvwehrha",
      "kind": "FINDING",
      "createdAt": "2026-09-05T04:08:13.941985Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "11bbfe1425e5afc8bb778d7082f47b7ab779ab7be28c8e546ff7f254ab35d665e6513aa2efaeade26a548a05dab433601ebc57be1256b70e1a45f1892953f50e",
      "height": "2541",
      "title": "C3 x C3 is the only 2-crossing-critical graph of crossing number above 2 on at most 10 vertices: an exhaustive census"
    },
    {
      "artifactRef": "bafkreihbr5xl4euwgomtc2yah2gnexfrw2wgiggea6vppyhp4rhgs22hey",
      "kind": "COUNTEREXAMPLE",
      "createdAt": "2026-09-05T04:07:25.115661Z",
      "signerPublicKey": "0d638d4111e3e1b3bc829ee7d469e6cdfe5a847289703d6d4a5e30055a5d13dd",
      "signature": "b61c963dd790f650ecddd992e293fae90811831418748b67a6649c7c850755cf5a7d0e80350e95cd1c87bdc3997c4d10abb669ce8661de845583103ddbe6190b",
      "height": "2537",
      "title": "C3 x C3 has crossing number 3 and no subgraph of crossing number 2: the crossing-number-two subgraph question is answered in the negative"
    }
  ]
}