{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TLYHMBFO2SD5QP6WDCN4HQJLPS","short_pith_number":"pith:TLYHMBFO","canonical_record":{"source":{"id":"2606.28844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-06-27T10:11:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"69fe1c58345c1f39d6039f85e526e127bc0678cdecb3dc6ac1d5167904a5ced0","abstract_canon_sha256":"ce71771af08c614186f99588ae3957452f09aec11746b84107f9099b8ac858af"},"schema_version":"1.0"},"canonical_sha256":"9af07604aed487d83fd6189bc3c12b7c88497a59501a710e44ec254ff4492be9","source":{"kind":"arxiv","id":"2606.28844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28844","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28844v1","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28844","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"TLYHMBFO2SD5","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"pith_short_16","alias_value":"TLYHMBFO2SD5QP6W","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"pith_short_8","alias_value":"TLYHMBFO","created_at":"2026-06-30T01:16:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TLYHMBFO2SD5QP6WDCN4HQJLPS","target":"record","payload":{"canonical_record":{"source":{"id":"2606.28844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-06-27T10:11:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"69fe1c58345c1f39d6039f85e526e127bc0678cdecb3dc6ac1d5167904a5ced0","abstract_canon_sha256":"ce71771af08c614186f99588ae3957452f09aec11746b84107f9099b8ac858af"},"schema_version":"1.0"},"canonical_sha256":"9af07604aed487d83fd6189bc3c12b7c88497a59501a710e44ec254ff4492be9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:16:54.209009Z","signature_b64":"eNIIxaPP+x9RnyGX+vlxrL6g3TAdhU1vENN4P5MuuB5k2eXh60Z+IkDrT255mzZsCwp6/3hP4IMTxxXeLfOJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9af07604aed487d83fd6189bc3c12b7c88497a59501a710e44ec254ff4492be9","last_reissued_at":"2026-06-30T01:16:54.208333Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:16:54.208333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.28844","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-30T01:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kg5TOGO1jXdjzTcfx9XylhcJPo7Yhz5iJkb+bS4OwH5PZcv50IjZSNZW2vZZ4IsQ5+aI7m/qcX5+m+UnoyNCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:15:54.690079Z"},"content_sha256":"b9ffe63c723bebac6b4a860926319759353dfbf659182fc2f2e51fa148b07ad1","schema_version":"1.0","event_id":"sha256:b9ffe63c723bebac6b4a860926319759353dfbf659182fc2f2e51fa148b07ad1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TLYHMBFO2SD5QP6WDCN4HQJLPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A solution to Ditor's problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Lorenzo Notaro","submitted_at":"2026-06-27T10:11:31Z","abstract_excerpt":"We settle the long-standing open question whether there exists a $3$-ladder of cardinality $\\aleph_2$. Given a positive integer $n$, an $n$-ladder is a lower finite lattice whose elements have at most $n$ lower covers. In 1984, Ditor proved that every $n$-ladder has cardinality at most $\\aleph_{n-1}$, and that this cardinal bound is sharp for $n = 1,2$. He then raised the question of whether the bound is attained for $n\\ge 3$ as well. An affirmative answer is known to be consistent with $\\mathsf{ZFC}$. We prove, relative to the consistency of a Mahlo cardinal, that the question is independent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28844","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.28844/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-30T01:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wtYSwC6Z4ltnJSlTDFNKssAcIP+EN/brIXMt6kNSrkKBUTkpbISxDNu+/wvtyoayGQcRO20sxHr6669/32x6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:15:54.691014Z"},"content_sha256":"76e65f936f1c3ddd2727212e8b6d29702857ad59572a7a7e0467d65af3de407e","schema_version":"1.0","event_id":"sha256:76e65f936f1c3ddd2727212e8b6d29702857ad59572a7a7e0467d65af3de407e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLYHMBFO2SD5QP6WDCN4HQJLPS/bundle.json","state_url":"https://pith.science/pith/TLYHMBFO2SD5QP6WDCN4HQJLPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLYHMBFO2SD5QP6WDCN4HQJLPS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T05:15:54Z","links":{"resolver":"https://pith.science/pith/TLYHMBFO2SD5QP6WDCN4HQJLPS","bundle":"https://pith.science/pith/TLYHMBFO2SD5QP6WDCN4HQJLPS/bundle.json","state":"https://pith.science/pith/TLYHMBFO2SD5QP6WDCN4HQJLPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLYHMBFO2SD5QP6WDCN4HQJLPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TLYHMBFO2SD5QP6WDCN4HQJLPS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ce71771af08c614186f99588ae3957452f09aec11746b84107f9099b8ac858af","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-06-27T10:11:31Z","title_canon_sha256":"69fe1c58345c1f39d6039f85e526e127bc0678cdecb3dc6ac1d5167904a5ced0"},"schema_version":"1.0","source":{"id":"2606.28844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28844","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28844v1","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28844","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"TLYHMBFO2SD5","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"pith_short_16","alias_value":"TLYHMBFO2SD5QP6W","created_at":"2026-06-30T01:16:54Z"},{"alias_kind":"pith_short_8","alias_value":"TLYHMBFO","created_at":"2026-06-30T01:16:54Z"}],"graph_snapshots":[{"event_id":"sha256:76e65f936f1c3ddd2727212e8b6d29702857ad59572a7a7e0467d65af3de407e","target":"graph","created_at":"2026-06-30T01:16:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.28844/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We settle the long-standing open question whether there exists a $3$-ladder of cardinality $\\aleph_2$. Given a positive integer $n$, an $n$-ladder is a lower finite lattice whose elements have at most $n$ lower covers. In 1984, Ditor proved that every $n$-ladder has cardinality at most $\\aleph_{n-1}$, and that this cardinal bound is sharp for $n = 1,2$. He then raised the question of whether the bound is attained for $n\\ge 3$ as well. An affirmative answer is known to be consistent with $\\mathsf{ZFC}$. We prove, relative to the consistency of a Mahlo cardinal, that the question is independent ","authors_text":"Lorenzo Notaro","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-06-27T10:11:31Z","title":"A solution to Ditor's problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28844","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b9ffe63c723bebac6b4a860926319759353dfbf659182fc2f2e51fa148b07ad1","target":"record","created_at":"2026-06-30T01:16:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ce71771af08c614186f99588ae3957452f09aec11746b84107f9099b8ac858af","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2026-06-27T10:11:31Z","title_canon_sha256":"69fe1c58345c1f39d6039f85e526e127bc0678cdecb3dc6ac1d5167904a5ced0"},"schema_version":"1.0","source":{"id":"2606.28844","kind":"arxiv","version":1}},"canonical_sha256":"9af07604aed487d83fd6189bc3c12b7c88497a59501a710e44ec254ff4492be9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9af07604aed487d83fd6189bc3c12b7c88497a59501a710e44ec254ff4492be9","first_computed_at":"2026-06-30T01:16:54.208333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:16:54.208333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eNIIxaPP+x9RnyGX+vlxrL6g3TAdhU1vENN4P5MuuB5k2eXh60Z+IkDrT255mzZsCwp6/3hP4IMTxxXeLfOJCQ==","signature_status":"signed_v1","signed_at":"2026-06-30T01:16:54.209009Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9ffe63c723bebac6b4a860926319759353dfbf659182fc2f2e51fa148b07ad1","sha256:76e65f936f1c3ddd2727212e8b6d29702857ad59572a7a7e0467d65af3de407e"],"state_sha256":"376191b2b72e5956d72246ab3894ecb5511510f72b4c94c81f3560fa14739497"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ryoZQHPodtdSJYSxYaHkfJO1k6EtftgowO4P2kKH/JxZlGPIuyFy/9CjqOvU13XI0cWuJ0+46v2FTaFKMXh+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:15:54.696226Z","bundle_sha256":"a9be77473f607c7b1cfc5b3b536228186fe868ee04f215f29b8f446b4354192e"}}