{"schema":"vela.math-source-registry-read.v1","release_root":"sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a","source_registry":{"schema":"vela.math-source-registry-release.v1","declaration_root":"sha256:2d479eb38f6986e93ac05b63237d22557b215e7a98c4a92aa45cc73a6e6987e7","observation_bundle_root":"sha256:9d736ba222fb8bcf3aeb3d4401afd52b2c6d54ff13c8153ebd4cafe19f1da14f","source_adapter_artifact":{"schema":"vela.projection-source-adapter-artifact-reference.v2","set_root":"sha256:4d8c54025ff0e35db2e71d8b331760846722ce9f4d74ab1fd05f62478041111e","artifact_root":"sha256:f2bb64e99199f250c5a50c2655d45e7ecbbe5ec80d213cb40ae1f9aebe64d778","retrieval":{"type":"github_release_asset","repository":"vela-science/vela-web","release_tag":"source-adapter-set-4d8c54025ff0e35db2e71d8b331760846722ce9f4d74ab1fd05f62478041111e","filename":"vela-projection-source-adapters-4d8c54025ff0e35db2e71d8b331760846722ce9f4d74ab1fd05f62478041111e.json","authentication":"required"}},"source_count":15,"observation_count":15,"native_record_count":6598,"release_source_count":15,"repository_binding_count":4},"sources":[{"declaration":{"source_id":"source:palomar-registry","native_namespace":"palomar-registry","publisher_or_maintainer":"Palomar Registry","locators":[{"locator_id":"homepage","kind":"homepage","url":"https://palomar-registry.org/"},{"locator_id":"recent-feed","kind":"api","url":"https://data.palomar-registry.org/recent.json"},{"locator_id":"entry","kind":"artifact","url":"https://data.palomar-registry.org/entries/PALOMAR-2026-08-19-000002-v1.json"},{"locator_id":"review-policy","kind":"git","url":"https://github.com/PalomarRegistry/PalomarPolicy"},{"locator_id":"rights","kind":"documentation","url":"https://palomar-registry.org/about"}],"attributed_claims":[{"role":"publisher","name":"Palomar Registry","basis_locator_id":"homepage"}],"source_kind":"formal_library","rights":{"status":"declared","license_expression":"CC0-1.0","access":"public","redistribution":"full_under_license","basis":"Registry metadata is published under CC0, stated on the registry's about page; each record additionally carries the source project's own license identity and license-file digest, which this declaration attributes and does not assert."},"snapshot_policy":{"mode":"retained_exact_bytes","retention":"immutable_artifact","reason":"Palomar publishes no digest or signature over the entry JSON and may re-render older entries to the current schema, so the adapter pins its own consumer-computed root over the exact fetched entry bytes and re-verifies both evidence reports against the digests inside the entry."},"adapter":{"adapter_id":"problems-data/palomar-registry","version":"1.0.0","mode":"networked_acquisition","acquisition_contract":"vela.source-adapter-bundle.v2","observation_contract":"vela.math-source-observation.v1","adapter_root":"sha256:753f8e0579c8df2b00b3252be6e7903828e452f958f62a68c8efc96edfc4cdcb"},"coverage":{"repository_slugs":["math"],"included":["The one registered entry PALOMAR-2026-08-19-000002 v1 (elliotglazer/erdos501, an independence resolution of Erdős problem #501), as exact retained entry bytes","Exact record identity, source commit, formalization surface, verification-run identity, review policy pin and digests, bounded review warnings, preservation locators, and Palomar-local status as the entry declares them"],"omissions":[{"code":"palomar_status_is_external_standing","description":"Palomar's registered status and trust level are Palomar-local external standing; they create no Vela Standing, Verification, acceptance, or admission."},{"code":"palomar_nonclaims_are_registry_level","description":"Palomar claims no novelty, no quality assessment, no peer review, no publication status, and no informal-proof verification; these attributed nonclaims are registry-level prose, not per-record data."},{"code":"palomar_mechanical_pass_is_one_scoped_check","description":"Comparator, Lean-kernel, and NanoDa results are folded into Palomar's single mechanical pass and retained as one scoped external check (palomar-mechanical); Vela re-derives none of them and none is a Vela Verification."},{"code":"palomar_review_is_llm_under_policy","description":"The semantic review is an LLM review under a pinned policy commit; its outcome and bounded findings are attributed observations, never adjudication."},{"code":"palomar_consent_is_asserted_relationship","description":"The submitter relationship is an asserted field; Palomar publishes no signed consent artifact."},{"code":"palomar_admission_process_unobservable","description":"Only the admission outcome — status registered with its timestamps — is observable; the registry's admission decision process is internal."},{"code":"palomar_version_relation_reconstructed","description":"Version relations are reconstructed from the shared registry ID and integer versions; Palomar publishes no supersedes or corrects field, and the reason for a new version is unobservable."},{"code":"palomar_entry_bytes_not_provider_signed","description":"Palomar publishes no digest or signature over the entry JSON; authenticity rests on TLS retrieval plus the consumer-computed retained-bytes root, and version-URL immutability is Palomar's assertion."},{"code":"palomar_challenge_render_not_archived","description":"The challenge render is retained as a locator and provider tree digest only; its bytes are not archived."},{"code":"palomar_evidence_tree_not_archived","description":"Beyond the two digest-verified reports, the evidence tree — comparator log tail, resource usage, Mathlib cache and the rest — is pinned by evidence_tree_sha256 and not archived."}]},"declaration_root":"sha256:0b156480f46fc1e84218fce8f7e96f34a3660111c8c12bedf1c0da8b5ce67963"},"declaration_row_root":"sha256:0b156480f46fc1e84218fce8f7e96f34a3660111c8c12bedf1c0da8b5ce67963","observation":{"schema":"vela.math-source-observation.v1","source_id":"source:palomar-registry","observation_id":"observation:palomar-registry:d5994e671a0ec7cc","declaration_root":"sha256:0b156480f46fc1e84218fce8f7e96f34a3660111c8c12bedf1c0da8b5ce67963","acquisition_root":"sha256:d5994e671a0ec7cc9bf676e7188f01eaf7034d9995bbda3f7367c51120c3a6c0","observed_at":"2026-08-19T14:43:50-04:00","native_revision":{"kind":"observation","value":"sha256:306220a43c9696396c9f0cbb87ddb3d3352941a4b411988269386911c2492688","content_root":"sha256:306220a43c9696396c9f0cbb87ddb3d3352941a4b411988269386911c2492688","tree":null},"snapshot_root":"sha256:306220a43c9696396c9f0cbb87ddb3d3352941a4b411988269386911c2492688","snapshot_state":"retained_exact_bytes","projected_record_count":1,"projected_records_root":"sha256:d0f87c766291e0ee2876a13e784d5837b144c193c26a796bd4b1bff73591bf7f","coverage":{"status":"complete","included":["The one exact Palomar registry entry served at the declared versioned entry URL, with its two evidence reports re-verified against the digests inside the entry."],"native_record_count":1,"projected_record_count":1},"omissions":[{"code":"palomar_challenge_render_not_archived","description":"The challenge render is retained as a locator and provider tree digest only; its bytes are not archived."},{"code":"palomar_evidence_tree_not_archived","description":"Beyond the two digest-verified reports, the evidence tree — comparator log tail, resource usage, Mathlib cache and the rest — is pinned by evidence_tree_sha256 and not archived."},{"code":"palomar_mechanical_pass_is_one_scoped_check","description":"Comparator, Lean-kernel, and NanoDa results are folded into Palomar's single mechanical pass and retained as one scoped external check (palomar-mechanical); Vela re-derives none of them and none is a Vela Verification."},{"code":"palomar_status_is_external_standing","description":"Palomar's registered status and trust level are Palomar-local external standing; they create no Vela Standing, Verification, acceptance, or admission."},{"code":"palomar_nonclaims_are_registry_level","description":"Palomar claims no novelty, no quality assessment, no peer review, no publication status, and no informal-proof verification; these attributed nonclaims are registry-level prose, not per-record data."},{"code":"palomar_review_is_llm_under_policy","description":"The semantic review is an LLM review under a pinned policy commit; its outcome and bounded findings are attributed observations, never adjudication."},{"code":"palomar_consent_is_asserted_relationship","description":"The submitter relationship is an asserted field; Palomar publishes no signed consent artifact."},{"code":"palomar_admission_process_unobservable","description":"Only the admission outcome — status registered with its timestamps — is observable; the registry's admission decision process is internal."},{"code":"palomar_version_relation_reconstructed","description":"Version relations are reconstructed from the shared registry ID and integer versions; Palomar publishes no supersedes or corrects field, and the reason for a new version is unobservable."},{"code":"palomar_entry_bytes_not_provider_signed","description":"Palomar publishes no digest or signature over the entry JSON; authenticity rests on TLS retrieval plus the consumer-computed retained-bytes root, and version-URL immutability is Palomar's assertion."}],"observation_root":"sha256:a3c53cc7646897e1355ce64ebd16dbdc5eec63e624ae19de3dbf0403ba77c588"},"native_record_count":1,"repository_binding_count":0}],"native_records":[{"schema":"vela.math-native-record.v1","source_id":"source:palomar-registry","observation_root":"sha256:a3c53cc7646897e1355ce64ebd16dbdc5eec63e624ae19de3dbf0403ba77c588","native_id":"palomar:PALOMAR-2026-08-19-000002-v1","native_kind":"registry-entry","native_revision":"sha256:306220a43c9696396c9f0cbb87ddb3d3352941a4b411988269386911c2492688","title":"PALOMAR-2026-08-19-000002 v1 · elliotglazer/erdos501","summary":"Erdős problem #501 (Erdős 1961; Erdős–Hajnal 1971, Problem 38): for every real x let A_x be a bounded set of reals of Lebesgue outer measure < 1; must there be an infinite independent set, i.e. an infinite X ⊆ ℝ with x ∉ A_y for all distinct x, y ∈ X?  And if the sets A_x are closed of measure < 1, must there be an independent set of size 3?  This repository formalizes both answers.  Second question: yes — closed sets of measure < 1 admit an infinite independent set (Newelski–Pawlikowski–Seredyński 1987; no boundedness is needed), hence one of size 3.  First question: independent of ZFC.  Under CH (as ℵ₁ = 𝔠) Hechler's 1972 construction gives a family of bounded null sets with no infinite independent set — a Mathlib-level theorem — and the negation of the first question holds in the Boolean-valued model of the collapse algebra Col(ω₁, 𝒫(ω)); after adding 𝔠⁺ random reals (Glazer and Sol 2026, adapting the paper's ω₂ random reals over a CH ground) the first question has a positive answer, so it holds in the Boolean-valued model of the random algebra with 𝔠⁺ coordinates.  Both Boolean-valued models are built in a Lean 4 port of Han–van Doorn's Flypitch (the framework of their independence-of-CH proof), and Flypitch's completeness theorem turns them into two-valued models.  The comparator challenge states the results in Mathlib alone: the language of set theory, the theory ZFC (Flypitch's axiomatization: extensionality, empty set, ordered pairs, union, power set, infinity, regularity, Zorn's lemma, strong collection) and the sentence Erdos501 (\"every complete ordered field has the Erdős property\") are defined in Mathlib's ModelTheory, and independence is stated semantically as ¬ (ZFC ⊨ᵇ Erdos501) ∧ ¬ (ZFC ⊨ᵇ ∼Erdos501); a faithfulness theorem shows that in Mathlib's ZFSet the sentence is equivalent to the Mathlib statement of the first question, verbatim the proposition of google-deepmind/formal-conjectures.  All targets are proved from propext, Classical.choice and Quot.sound only.  As far as we know this is the first Erdős problem whose resolution is a formally verified independence result.","locators":[{"locator_id":"native-1","kind":"artifact","url":"https://data.palomar-registry.org/entries/PALOMAR-2026-08-19-000002-v1.json"},{"locator_id":"native-2","kind":"artifact","url":"https://github.com/elliotglazer/erdos501/tree/f406eaebc79537487955a484ba9cdc8abeaf1c9a"},{"locator_id":"native-3","kind":"artifact","url":"https://github.com/PalomarRegistry/PalomarSubmission/actions/runs/32248810098"}],"metadata":{"id":"PALOMAR-2026-08-19-000002","title":"elliotglazer/erdos501","authors":"[\"Elliot Glazer\",\"Sol\"]","version":1,"abstract":"Erdős problem #501 (Erdős 1961; Erdős–Hajnal 1971, Problem 38): for every real x let A_x be a bounded set of reals of Lebesgue outer measure < 1; must there be an infinite independent set, i.e. an infinite X ⊆ ℝ with x ∉ A_y for all distinct x, y ∈ X?  And if the sets A_x are closed of measure < 1, must there be an independent set of size 3?  This repository formalizes both answers.  Second question: yes — closed sets of measure < 1 admit an infinite independent set (Newelski–Pawlikowski–Seredyński 1987; no boundedness is needed), hence one of size 3.  First question: independent of ZFC.  Under CH (as ℵ₁ = 𝔠) Hechler's 1972 construction gives a family of bounded null sets with no infinite independent set — a Mathlib-level theorem — and the negation of the first question holds in the Boolean-valued model of the collapse algebra Col(ω₁, 𝒫(ω)); after adding 𝔠⁺ random reals (Glazer and Sol 2026, adapting the paper's ω₂ random reals over a CH ground) the first question has a positive answer, so it holds in the Boolean-valued model of the random algebra with 𝔠⁺ coordinates.  Both Boolean-valued models are built in a Lean 4 port of Han–van Doorn's Flypitch (the framework of their independence-of-CH proof), and Flypitch's completeness theorem turns them into two-valued models.  The comparator challenge states the results in Mathlib alone: the language of set theory, the theory ZFC (Flypitch's axiomatization: extensionality, empty set, ordered pairs, union, power set, infinity, regularity, Zorn's lemma, strong collection) and the sentence Erdos501 (\"every complete ordered field has the Erdős property\") are defined in Mathlib's ModelTheory, and independence is stated semantically as ¬ (ZFC ⊨ᵇ Erdos501) ∧ ¬ (ZFC ⊨ᵇ ∼Erdos501); a faithfulness theorem shows that in Mathlib's ZFSet the sentence is equivalent to the Mathlib statement of the first question, verbatim the proposition of google-deepmind/formal-conjectures.  All targets are proved from propext, Classical.choice and Quot.sound only.  As far as we know this is the first Erdős problem whose resolution is a formally verified independence result.","trust_level":"high","lakefile_path":"lakefile.toml","registered_at":"2026-08-19T12:02:38Z","solution_path":"Solution.lean","source_commit":"f406eaebc79537487955a484ba9cdc8abeaf1c9a","submission_id":"htgsebjchqg5","theorem_names":"[\"erdos501_closed_infinite\",\"erdos501_closed_size3\",\"erdos501_hechler_of_CH\",\"erdos501_not_refutable\",\"erdos501_not_provable\",\"erdos501_independent\",\"erdos501_sentence_faithful\"]","trust_reasons":"[\"Challenge exceeds the preferred audit surface\"]","challenge_path":"Challenge.lean","lean_toolchain":"leanprover/lean4:v4.34.0-rc1","review_outcome":"neutral","schema_version":3,"review_warnings":"[\"The declaration-specific prose advertises the materially stronger conclusion that Hechler's family consists of countable null sets, but the compared theorem does not state countability or zero outer measure. Thus Comparator does not verify that strengthening. Either add those properties to the Lean conclusion or revise the prose to identify them as an unselected result proved elsewhere.\"]","source_tree_url":"https://github.com/elliotglazer/erdos501/tree/f406eaebc79537487955a484ba9cdc8abeaf1c9a","definition_names":"[]","permitted_axioms":"[\"propext\",\"Quot.sound\",\"Classical.choice\"]","source_repository":"elliotglazer/erdos501","review_reviewed_at":"2026-08-19T11:54:52Z","first_registered_on":"2026-08-19","source_license_path":"LICENSE","verification_run_id":32248810098,"classification_arxiv":"[\"math.LO\",\"math.CO\"]","project_dependencies":"[\"mathlib=leanprover-community/mathlib4@355bc1e0ed1d36e49525121e1a280ca13a058a92\",\"plausible=leanprover-community/plausible@38e9c3ce15cbb63c92e90bb9a92e4eb82131f669\",\"LeanSearchClient=leanprover-community/LeanSearchClient@2bc7cf064315b26bc38dac2e9612fb581be9b75f\",\"importGraph=leanprover-community/import-graph@978b7ec9fbbf9a535114f1de8fe5b3778b358870\",\"proofwidgets=leanprover-community/ProofWidgets4@99e8adeea3c3cd86b6b79ba01a1383bf2d31d055\",\"aesop=leanprover-community/aesop@c1c4362a130f12e632d252180a6c2a31d8fd4726\",\"Qq=leanprover-community/quote4@3b55e9d00c6b0018e5d984eb011b6f93c09bd163\",\"batteries=leanprover-community/batteries@36cc05ca2d0e469bfbeea9437f460e19238e885e\",\"Cli=leanprover/lean4-cli@af8bc067a4cc6c6df472a68909a3f40b1c76c43e\"]","review_policy_commit":"24494b2ffd60c3cd22d72fae0afaf1c6b2d0d679","review_report_sha256":"9f77c4ffdf25ccaa8f7de7350262f38b6c56848e11288ec8a4fdf9c23d3616b4","source_declared_state":"registered","source_license_sha256":"c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4","source_repository_url":"https://github.com/elliotglazer/erdos501","trust_challenge_bytes":31824,"trust_challenge_lines":619,"classification_msc2020":"[\"03E35\",\"03E75\",\"03E40\",\"03E50\",\"05D10\",\"28A05\"]","comparator_config_path":"comparator.json","review_reviewer_models":"[\"codex:gpt-5.6-sol\"]","challenge_render_format":"verso-html","source_license_declared":"Apache-2.0","source_license_detected":"Apache-2.0","submission_relationship":"maintainer","trust_challenge_imports":"[\"Mathlib.Data.Set.Card\",\"Mathlib.MeasureTheory.Measure.Lebesgue.Basic\",\"Mathlib.ModelTheory.Satisfiability\",\"Mathlib.SetTheory.Cardinal.Aleph\",\"Mathlib.SetTheory.Cardinal.Continuum\",\"Mathlib.SetTheory.ZFC.Basic\"]","verification_repository":"PalomarRegistry/PalomarSubmission","preservation_archived_at":"2026-08-19T12:03:06Z","provenance_result_origin":"source-based","verification_verified_at":"2026-08-19T11:49:51Z","preservation_repositories":"[\"elliotglazer/erdos501@f406eaebc79537487955a484ba9cdc8abeaf1c9a PalomarArchive/elliotglazer--erdos501--a846048a857c refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/f406eaebc79537487955a484ba9cdc8abeaf1c9a\",\"leanprover-community/aesop@c1c4362a130f12e632d252180a6c2a31d8fd4726 PalomarArchive/leanprover-community--aesop--01b46b609077 refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/c1c4362a130f12e632d252180a6c2a31d8fd4726\",\"leanprover-community/batteries@36cc05ca2d0e469bfbeea9437f460e19238e885e PalomarArchive/leanprover-community--batteries--1b4c776305c9 refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/36cc05ca2d0e469bfbeea9437f460e19238e885e\",\"leanprover-community/import-graph@978b7ec9fbbf9a535114f1de8fe5b3778b358870 PalomarArchive/leanprover-community--import-graph--e0a79261b05a refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/978b7ec9fbbf9a535114f1de8fe5b3778b358870\",\"leanprover-community/LeanSearchClient@2bc7cf064315b26bc38dac2e9612fb581be9b75f PalomarArchive/leanprover-community--LeanSearchClient--9de355ab5f53 refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/2bc7cf064315b26bc38dac2e9612fb581be9b75f\",\"leanprover-community/mathlib4@355bc1e0ed1d36e49525121e1a280ca13a058a92 PalomarArchive/leanprover-community--mathlib4--67b3d817d8a2 refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/355bc1e0ed1d36e49525121e1a280ca13a058a92\",\"leanprover-community/plausible@38e9c3ce15cbb63c92e90bb9a92e4eb82131f669 PalomarArchive/leanprover-community--plausible--fb632f6f7bf4 refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/38e9c3ce15cbb63c92e90bb9a92e4eb82131f669\",\"leanprover-community/ProofWidgets4@99e8adeea3c3cd86b6b79ba01a1383bf2d31d055 PalomarArchive/leanprover-community--ProofWidgets4--26014acbbaff refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/99e8adeea3c3cd86b6b79ba01a1383bf2d31d055\",\"leanprover-community/quote4@3b55e9d00c6b0018e5d984eb011b6f93c09bd163 PalomarArchive/leanprover-community--quote4--90d31d153685 refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/3b55e9d00c6b0018e5d984eb011b6f93c09bd163\",\"leanprover/lean4-cli@af8bc067a4cc6c6df472a68909a3f40b1c76c43e PalomarArchive/leanprover--lean4-cli--df175a7fc790 refs/tags/palomar/PALOMAR-2026-08-19-000002-v1/af8bc067a4cc6c6df472a68909a3f40b1c76c43e\"]","verification_workflow_url":"https://github.com/PalomarRegistry/PalomarSubmission/actions/runs/32248810098","preservation_archive_owner":"PalomarArchive","provenance_repository_role":"substantive-development","verification_evidence_path":"evidence/PALOMAR-2026-08-19-000002-v1/cf915ecffa3735337d60ca120b71be92dbd7b57fbf83b20bd29d49b05a19e6c3/","verification_nanoda_commit":"68d5ca9db226849b41a6fff59d796ff19d0a8840","verification_workflow_path":".github/workflows/submission.yml","challenge_render_entrypoint":"Challenge/index.html","formalization_metadata_path":"formalization.yaml","preservation_receipt_sha256":"9336c7606eac42dc003b258b9b9d820b0fdaa4b7ab59a4393bc27f919c255c3e","verification_landrun_commit":"811cfff51ceaf3d9843708aa6d22e9b84ccac8b4","challenge_render_rendered_at":"2026-08-19T12:09:09Z","trust_challenge_dependencies":"[\"leanprover-community/mathlib4 (allowlisted)\"]","verification_solution_sha256":"3b58690107dc547b78066178873c9902814a43ca4c6202dc3f2972785fcc58cd","verification_workflow_commit":"a3fabf899f557cd03e81916d85887b2d8046206e","challenge_render_verso_commit":"74fc8d1b7bb781c3623a06ec6484f34d35eb5fba","verification_challenge_sha256":"e92334abb7482da34acc0800bcd3b8e74234efab3ff29032417c10aea8b1b96b","challenge_render_artifact_path":"renders/PALOMAR-2026-08-19-000002-v1/d0be23c13e46a028ca977ac0994df9a30eba49b59ef737dfb122d5c89aab15bc/","verification_comparator_commit":"68a064109f01c08f47c8edc9f51d6a2bbffaa188","verification_mechanical_status":"pass","challenge_render_landrun_commit":"811cfff51ceaf3d9843708aa6d22e9b84ccac8b4","provenance_mathematical_sources":"[\"background: Some unsolved problems (Problem II.9) (Magyar Tud. Akad. Mat. Kutató Int. Közl. 6 (1961), 221–254)\",\"background: Unsolved problems in set theory (Problem 38) (Proc. Sympos. Pure Math. XIII, Part I (Axiomatic Set Theory), AMS 1971, 17–48)\",\"background: Erdős problem #501 (erdosproblems.com) (https://www.erdosproblems.com/501)\",\"background: Erdős problem #501 — forum discussion (erdosproblems.com) (https://www.erdosproblems.com/forum/thread/501)\",\"background: Elliot Glazer — proof claims for #501 (erdosproblems.com) (https://www.erdosproblems.com/forum/user/ElliotGlazer/proof-claims)\",\"formalizes: Infinite free set for small measure set mappings (Proc. Amer. Math. Soc. 100 (1987), 335–339)\",\"formalizes: Directed graphs over topological spaces: some set theoretical aspects (Israel J. Math. 11 (1972), 231–248)\",\"adapts: Erdős Problem 501 after adding ω₂ random reals (draft, revision 10) (docs/paper/erdos501_random_profiles_rev10.pdf (unpublished draft, 2026-08-16))\",\"background: Some remarks on set theory VIII (Michigan Math. J. 7 (1960), 187–191)\"]","verification_lean4export_commit":"b18d673bd29b476466a51a3be1012df2ed322b10","challenge_render_renderer_commit":"a3fabf899f557cd03e81916d85887b2d8046206e","provenance_related_formalizations":"[\"builds-on: https://github.com/flypitch/flypitch\",\"builds-on: https://github.com/ianklatzco/flypitch\",\"other: https://github.com/google-deepmind/formal-conjectures\",\"builds-on: https://github.com/leanprover-community/mathlib4\"]","verification_evidence_tree_sha256":"cf915ecffa3735337d60ca120b71be92dbd7b57fbf83b20bd29d49b05a19e6c3","verification_workflow_run_attempt":1,"provenance_responsible_maintainers":"[\"Elliot Glazer\"]","challenge_render_artifact_tree_sha256":"d0be23c13e46a028ca977ac0994df9a30eba49b59ef737dfb122d5c89aab15bc","verification_mechanical_report_sha256":"549c786ac04b11c963045b34bfd721720af99fb5b78693a1e5c2f5746b2044da"},"metadata_root":"sha256:17ef2bb78ed2184e4f65afe3ba1b3bfa35aca303fe7eeead826c513de0011e0c","content_root":"sha256:acbfc933c1327b867459b6a060d188289d53b5dce4b764ece34d7561748b7ed2","availability":"reference_only","row_root":"sha256:ae5edc8828ed1f2d511a5f806d116093da74d2381652a42709407aaaf3c0e66e"}],"repository_bindings":[],"next_cursor":null,"next_binding_cursor":null}