Skip to published state

claim graph / erdos

advice only

Erdős formalization fidelity: graph

A bounded view of structural relationships in the accepted claim graph. It suggests where inspection may unlock context; it is not the producer work queue.

Structural opportunity map

2,764 nodes · 1,282 typed edges
Bounded structural opportunity graphSix ranked finding candidates on the left connect to up to twelve evidence findings on the right.RANKED OPPORTUNITIESLINKED EVIDENCEvf_73e8fef7e37f606bvf_aa10a5dd02f63d45vf_5a475702b7835f06vf_17e18c6c9c5b0b54vf_1fc3ba66cbeb8b60vf_4f7a42a6bbc0306evf_4913c40cb64bc34dvf_79d5a326ede50b5cvf_5196780ab86d5ae6vf_b1b2c2b6ab738577vf_36c4bcb6aea7d0d5vf_8637359cb1e160ebvf_9e6a8b5448a4cd41vf_0542e8eda4288bafvf_aa10a5dd02f63d45vf_67bde89cada7501evf_8836c10a5cda9519vf_02cd7bd718c7a080

Gold circles are ranked inspection candidates. Blue squares are linked evidence. The view is capped at six candidates.

18 contested relations retained

Why these relations surface

deterministic structural rank; not authority and not work assignment
  1. 01
    vf_73e8fef7e37f606b

    Hosted Lean proof: plby proof of 694 (state conditional)

    2 premise(s), 0 supporter(s), 2 mediating result(s); 0 established

    vf_4913c40cb64bc34dvf_79d5a326ede50b5c
    score
    1.428
    premises
    0/2
  2. 02
    vf_aa10a5dd02f63d45

    Hosted Lean proof: plby proof of 1080 (state complete)

    2 premise(s), 0 supporter(s), 2 mediating result(s); 0 established

    vf_5196780ab86d5ae6vf_b1b2c2b6ab738577
    score
    1.428
    premises
    0/2
  3. 03
    vf_5a475702b7835f06unlocks 1

    Erdős Problem #154: declared status 'proved'. Formalized: no. Prize: no. Tags: sidon sets.

    0 premise(s), 3 supporter(s), 3 mediating result(s); 0 established

    vf_36c4bcb6aea7d0d5vf_8637359cb1e160ebvf_9e6a8b5448a4cd41
    score
    1.109
    premises
    0/0
  4. 04
    vf_17e18c6c9c5b0b54unlocks 1

    Erdős Problem #1080: declared status 'disproved'. Formalized: yes. Prize: no. Tags: graph theory.

    0 premise(s), 2 supporter(s), 4 mediating result(s); 0 established

    vf_0542e8eda4288bafvf_aa10a5dd02f63d45
    score
    1.061
    premises
    0/0
  5. 05
    vf_1fc3ba66cbeb8b60unlocks 1

    Erdős Problem #1121: declared status 'proved'. Formalized: no. Prize: no. Tags: geometry.

    0 premise(s), 2 supporter(s), 3 mediating result(s); 0 established

    vf_67bde89cada7501evf_8836c10a5cda9519
    score
    0.994
    premises
    0/0
  6. 06
    vf_4f7a42a6bbc0306eunlocks 1

    Erdős Problem #281: declared status 'proved'. Formalized: no. Let $n_1<n_2<\cdots$ be an infinite sequence such that, fo

    0 premise(s), 2 supporter(s), 3 mediating result(s); 0 established

    vf_02cd7bd718c7a080vf_8b1884a2366583bd
    score
    0.994
    premises
    0/0
  7. 07
    vf_6936b5f82108920funlocks 1

    Erdős Problem #433: declared status 'proved'. Formalized: no. Prize: no. Tags: number theory.

    0 premise(s), 2 supporter(s), 3 mediating result(s); 0 established

    vf_58313986abc7e8cfvf_adc9d3ad3f5c72c9
    score
    0.994
    premises
    0/0
  8. 08
    vf_87642e7028562620unlocks 1

    Erdős Problem #350: declared status 'proved'. Formalized: yes. Prize: no. Tags: additive combinatorics, number theory.

    0 premise(s), 2 supporter(s), 3 mediating result(s); 0 established

    vf_8843c8b38fff25e4vf_d8275d1a37a34233
    score
    0.994
    premises
    0/0
  9. 09
    vf_c38809da532a84b1unlocks 1

    Erdős Problem #224: declared status 'proved'. Formalized: no. Prize: no. Tags: geometry.

    0 premise(s), 2 supporter(s), 3 mediating result(s); 0 established

    vf_ba240419e6ae62c6vf_d260d4079d47bf50
    score
    0.994
    premises
    0/0
  10. 10
    vf_cebb836078e6ff66unlocks 1

    Erdős Problem #434: declared status 'proved'. Formalized: yes. Prize: no. Tags: number theory.

    0 premise(s), 2 supporter(s), 3 mediating result(s); 0 established

    vf_7fa6599545ae34f0vf_bc9a738964f26520
    score
    0.994
    premises
    0/0
  11. 11
    vf_01fa9f824c61ccd8unlocks 1

    Erdős Problem #333: declared status 'disproved'. Formalized: no. Prize: no. Tags: additive basis, number theory.

    0 premise(s), 2 supporter(s), 2 mediating result(s); 0 established

    vf_5b02a24f1211ab6avf_616928a528e8c42a
    score
    0.908
    premises
    0/0
  12. 12
    vf_0371af0efe3b4966unlocks 1

    Erdős Problem #38: declared status 'proved'. Formalized: yes. Does there exist $B\subset\mathbb{N}$ which is not an addi

    0 premise(s), 2 supporter(s), 2 mediating result(s); 0 established

    vf_14e47c206be72fdbvf_6b2ea4cb7d5e6354
    score
    0.908
    premises
    0/0

Boundary

This projection is derived from accepted findings and typed links. Ranking changes neither accepted state nor the canonical producer order. Use vela next . --json for claimable work.

Open producer work
Graph bytes
sha256:0c8edba0fd22a2db0b53ccf9328cfc9d8cb874e6f5574107e48c6942a5525974
Source snapshot
sha256:1faedc24f040a60a22177b456c74b969a61ce8836082297b1835797a57b4fa56