{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RBAOGSYYEBDN7JTNU3JI724TOU","short_pith_number":"pith:RBAOGSYY","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"},"canonical_sha256":"8840e34b182046dfa66da6d28feb93750b74fd68a7818c4f67b3b5644e0a4e5b","source":{"kind":"arxiv","id":"2509.01029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.01029","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"arxiv_version","alias_value":"2509.01029v1","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01029","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"pith_short_12","alias_value":"RBAOGSYYEBDN","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"pith_short_16","alias_value":"RBAOGSYYEBDN7JTN","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"pith_short_8","alias_value":"RBAOGSYY","created_at":"2026-07-05T12:02:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RBAOGSYYEBDN7JTNU3JI724TOU","target":"record","payload":{"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"},"canonical_sha256":"8840e34b182046dfa66da6d28feb93750b74fd68a7818c4f67b3b5644e0a4e5b","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"},"source_kind":"arxiv","source_id":"2509.01029","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-07-05T12:02:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+pu4CXv7igoasYs7075g/JEcW5WnPDHsKqDiC89/hQjXmYk5mZlmifP3BCU2umzFndMRpLzq9VjdVcCiHfvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:05:53.201232Z"},"content_sha256":"c805c4d238ad6cd050b13ff8e2f584a5960eb72a7f428e29ac8efbba5b303ae2","schema_version":"1.0","event_id":"sha256:c805c4d238ad6cd050b13ff8e2f584a5960eb72a7f428e29ac8efbba5b303ae2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RBAOGSYYEBDN7JTNU3JI724TOU","target":"graph","payload":{"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"},"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-07-05T12:02:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vv/5JLyHNl/S2Qhn6EQtSEa/31il2B1rbsPqNAeTc46WVJdvjLKiAdlOLPwLtPr4RCzV0YCyVNaKJ0fyp3K8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:05:53.202223Z"},"content_sha256":"92a1f074f482a2245f4551ddcb2bf68a149510edef6b320f8abfc95e812c8dce","schema_version":"1.0","event_id":"sha256:92a1f074f482a2245f4551ddcb2bf68a149510edef6b320f8abfc95e812c8dce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU/bundle.json","state_url":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBAOGSYYEBDN7JTNU3JI724TOU/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-08-04T15:05:53Z","links":{"resolver":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU","bundle":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU/bundle.json","state":"https://pith.science/pith/RBAOGSYYEBDN7JTNU3JI724TOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBAOGSYYEBDN7JTNU3JI724TOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RBAOGSYYEBDN7JTNU3JI724TOU","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":"d80abfbf6ac0c971f7ba2023ab82ab1dc0b86369bcf2d30711c2f669410cb984","cross_cats_sorted":["math.GN"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.LO","submitted_at":"2025-08-31T23:39:55Z","title_canon_sha256":"4ca4bbcaf7d1266ca2badfe01912843e8e9211f5c9018a107a9110a107c2f1fa"},"schema_version":"1.0","source":{"id":"2509.01029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.01029","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"arxiv_version","alias_value":"2509.01029v1","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01029","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"pith_short_12","alias_value":"RBAOGSYYEBDN","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"pith_short_16","alias_value":"RBAOGSYYEBDN7JTN","created_at":"2026-07-05T12:02:52Z"},{"alias_kind":"pith_short_8","alias_value":"RBAOGSYY","created_at":"2026-07-05T12:02:52Z"}],"graph_snapshots":[{"event_id":"sha256:92a1f074f482a2245f4551ddcb2bf68a149510edef6b320f8abfc95e812c8dce","target":"graph","created_at":"2026-07-05T12:02:52Z","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/2509.01029/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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) ","authors_text":"Jorge Antonio Cruz Chapital","cross_cats":["math.GN"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.LO","submitted_at":"2025-08-31T23:39:55Z","title":"There may be an $n$-entangled set but no $n+1$-entangled sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01029","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:c805c4d238ad6cd050b13ff8e2f584a5960eb72a7f428e29ac8efbba5b303ae2","target":"record","created_at":"2026-07-05T12:02:52Z","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":"d80abfbf6ac0c971f7ba2023ab82ab1dc0b86369bcf2d30711c2f669410cb984","cross_cats_sorted":["math.GN"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.LO","submitted_at":"2025-08-31T23:39:55Z","title_canon_sha256":"4ca4bbcaf7d1266ca2badfe01912843e8e9211f5c9018a107a9110a107c2f1fa"},"schema_version":"1.0","source":{"id":"2509.01029","kind":"arxiv","version":1}},"canonical_sha256":"8840e34b182046dfa66da6d28feb93750b74fd68a7818c4f67b3b5644e0a4e5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8840e34b182046dfa66da6d28feb93750b74fd68a7818c4f67b3b5644e0a4e5b","first_computed_at":"2026-07-05T12:02:52.486585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:52.486585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XkpgcR3wF8yLlkXaAyvDfH4Uhw3JT95EZDh+tAb2rPcUOO7zdqzDv7BW3vcd2XTV01WvOfmNnUvgrV6jTJ5XAA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:52.487042Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.01029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c805c4d238ad6cd050b13ff8e2f584a5960eb72a7f428e29ac8efbba5b303ae2","sha256:92a1f074f482a2245f4551ddcb2bf68a149510edef6b320f8abfc95e812c8dce"],"state_sha256":"a27487c083e5d63fbeb1dcd64dd29c243b00f704a6cda5d05c3fd2229aab2fa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVcOyeURbJmLKzvbrOn08nhIg5idl1cPqpwl/6+lVcXrKnWCUbpLGt3a3r4nC9ykAKc06B9OSvaiD3dqjDl1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:05:53.210093Z","bundle_sha256":"2d088013b650e24889cbbca8bc7c496115e30174a594f66fdf527caaa76aa924"}}