{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:42CSYURVULH72SL6LEJMZA7AD3","short_pith_number":"pith:42CSYURV","schema_version":"1.0","canonical_sha256":"e6852c5235a2cffd497e5912cc83e01ed05e0f4155fc87f4bff862c24a2c771a","source":{"kind":"arxiv","id":"1706.10171","version":2},"attestation_state":"computed","paper":{"title":"Uncountable strongly surjective linear orders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"D\\'aniel T. Soukup","submitted_at":"2017-06-30T12:17:26Z","abstract_excerpt":"A linear order $L$ is strongly surjective if $L$ can be mapped onto any of its suborders in an order preserving way. We prove various results on the existence and non-existence of uncountable strongly surjective linear orders answering questions of Camerlo, Carroy and Marcone. In particular, $\\diamondsuit^+$ implies the existence of a lexicographically ordered Suslin-tree which is strongly surjective and minimal; every strongly surjective linear order must be an Aronszajn type under $2^{\\aleph_0}<2^{\\aleph_1}$ or in the Cohen and other canonical models (where $2^{\\aleph_0}=2^{\\aleph_1}$); fina"},"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":"1706.10171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-06-30T12:17:26Z","cross_cats_sorted":[],"title_canon_sha256":"7aa8248474d5c36cc6aca440e4400c2034b261fc7cc91dc4bc2df4a7dabf6309","abstract_canon_sha256":"07bf6c3667ebb197afda4d9ac51680f9d970d04c6e81c5f0be0a7a4dc5f40eff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:52.336071Z","signature_b64":"+SHDU7qJkfPTCCkKP3g3T/K5EDgOa91iCZ+rPEXKWt4c19pS8hC0+OktvdpwzzG42/r9+Q9bG129LVZt5lNiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6852c5235a2cffd497e5912cc83e01ed05e0f4155fc87f4bff862c24a2c771a","last_reissued_at":"2026-05-18T00:24:52.335599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:52.335599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncountable strongly surjective linear orders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"D\\'aniel T. Soukup","submitted_at":"2017-06-30T12:17:26Z","abstract_excerpt":"A linear order $L$ is strongly surjective if $L$ can be mapped onto any of its suborders in an order preserving way. We prove various results on the existence and non-existence of uncountable strongly surjective linear orders answering questions of Camerlo, Carroy and Marcone. In particular, $\\diamondsuit^+$ implies the existence of a lexicographically ordered Suslin-tree which is strongly surjective and minimal; every strongly surjective linear order must be an Aronszajn type under $2^{\\aleph_0}<2^{\\aleph_1}$ or in the Cohen and other canonical models (where $2^{\\aleph_0}=2^{\\aleph_1}$); fina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10171","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1706.10171","created_at":"2026-05-18T00:24:52.335670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.10171v2","created_at":"2026-05-18T00:24:52.335670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10171","created_at":"2026-05-18T00:24:52.335670+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/42CSYURVULH72SL6LEJMZA7AD3","json":"https://pith.science/pith/42CSYURVULH72SL6LEJMZA7AD3.json","graph_json":"https://pith.science/api/pith-number/42CSYURVULH72SL6LEJMZA7AD3/graph.json","events_json":"https://pith.science/api/pith-number/42CSYURVULH72SL6LEJMZA7AD3/events.json","paper":"https://pith.science/paper/42CSYURV"},"agent_actions":{"view_html":"https://pith.science/pith/42CSYURVULH72SL6LEJMZA7AD3","download_json":"https://pith.science/pith/42CSYURVULH72SL6LEJMZA7AD3.json","view_paper":"https://pith.science/paper/42CSYURV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.10171&json=true","fetch_graph":"https://pith.science/api/pith-number/42CSYURVULH72SL6LEJMZA7AD3/graph.json","fetch_events":"https://pith.science/api/pith-number/42CSYURVULH72SL6LEJMZA7AD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42CSYURVULH72SL6LEJMZA7AD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42CSYURVULH72SL6LEJMZA7AD3/action/storage_attestation","attest_author":"https://pith.science/pith/42CSYURVULH72SL6LEJMZA7AD3/action/author_attestation","sign_citation":"https://pith.science/pith/42CSYURVULH72SL6LEJMZA7AD3/action/citation_signature","submit_replication":"https://pith.science/pith/42CSYURVULH72SL6LEJMZA7AD3/action/replication_record"}},"created_at":"2026-05-18T00:24:52.335670+00:00","updated_at":"2026-05-18T00:24:52.335670+00:00"}