{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RBAOGSYYEBDN7JTNU3JI724TOU","short_pith_number":"pith:RBAOGSYY","schema_version":"1.0","canonical_sha256":"8840e34b182046dfa66da6d28feb93750b74fd68a7818c4f67b3b5644e0a4e5b","source":{"kind":"arxiv","id":"2509.01029","version":1},"attestation_state":"computed","paper":{"title":"There may be an $n$-entangled set but no $n+1$-entangled sets","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.LO","authors_text":"Jorge Antonio Cruz Chapital","submitted_at":"2025-08-31T23:39:55Z","abstract_excerpt":"In this paper we show that for every $2\\leq n\\in \\mathbb{N}$, the statement \"there is an $n$-entangled set, but there are no $n+1$-entangled sets\" is consistent. We also prove some theorems which improve our understanding of entangled sets in relation to construction schemes: (1) The axiom FCA$^\\Delta$ introduced in \\cite{finitizationclubch} implies the existence of $n$-entangled sets which are not $n+1$-entangled. (2) $\\mathfrak{m}_\\mathcal{F}>\\omega_1$ implies the non-existence of entangled sets. Thus, $2$-capturing schemes alone are not sufficient to build these kinds of linear orders. (3) "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.01029","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.LO","submitted_at":"2025-08-31T23:39:55Z","cross_cats_sorted":["math.GN"],"title_canon_sha256":"4ca4bbcaf7d1266ca2badfe01912843e8e9211f5c9018a107a9110a107c2f1fa","abstract_canon_sha256":"d80abfbf6ac0c971f7ba2023ab82ab1dc0b86369bcf2d30711c2f669410cb984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:52.487042Z","signature_b64":"XkpgcR3wF8yLlkXaAyvDfH4Uhw3JT95EZDh+tAb2rPcUOO7zdqzDv7BW3vcd2XTV01WvOfmNnUvgrV6jTJ5XAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8840e34b182046dfa66da6d28feb93750b74fd68a7818c4f67b3b5644e0a4e5b","last_reissued_at":"2026-07-05T12:02:52.486585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:52.486585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"There may be an $n$-entangled set but no $n+1$-entangled sets","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.LO","authors_text":"Jorge Antonio Cruz Chapital","submitted_at":"2025-08-31T23:39:55Z","abstract_excerpt":"In this paper we show that for every $2\\leq n\\in \\mathbb{N}$, the statement \"there is an $n$-entangled set, but there are no $n+1$-entangled sets\" is consistent. We also prove some theorems which improve our understanding of entangled sets in relation to construction schemes: (1) The axiom FCA$^\\Delta$ introduced in \\cite{finitizationclubch} implies the existence of $n$-entangled sets which are not $n+1$-entangled. (2) $\\mathfrak{m}_\\mathcal{F}>\\omega_1$ implies the non-existence of entangled sets. Thus, $2$-capturing schemes alone are not sufficient to build these kinds of linear orders. (3) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01029","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/2509.01029/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.01029","created_at":"2026-07-05T12:02:52.486646+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.01029v1","created_at":"2026-07-05T12:02:52.486646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01029","created_at":"2026-07-05T12:02:52.486646+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBAOGSYYEBDN","created_at":"2026-07-05T12:02:52.486646+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBAOGSYYEBDN7JTN","created_at":"2026-07-05T12:02:52.486646+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBAOGSYY","created_at":"2026-07-05T12:02:52.486646+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU","json":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU.json","graph_json":"https://pith.science/api/pith-number/RBAOGSYYEBDN7JTNU3JI724TOU/graph.json","events_json":"https://pith.science/api/pith-number/RBAOGSYYEBDN7JTNU3JI724TOU/events.json","paper":"https://pith.science/paper/RBAOGSYY"},"agent_actions":{"view_html":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU","download_json":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU.json","view_paper":"https://pith.science/paper/RBAOGSYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.01029&json=true","fetch_graph":"https://pith.science/api/pith-number/RBAOGSYYEBDN7JTNU3JI724TOU/graph.json","fetch_events":"https://pith.science/api/pith-number/RBAOGSYYEBDN7JTNU3JI724TOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU/action/storage_attestation","attest_author":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU/action/author_attestation","sign_citation":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU/action/citation_signature","submit_replication":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU/action/replication_record"}},"created_at":"2026-07-05T12:02:52.486646+00:00","updated_at":"2026-07-05T12:02:52.486646+00:00"}