{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BHM3UDZJNFN7UV3RF4JVPIIQIF","short_pith_number":"pith:BHM3UDZJ","schema_version":"1.0","canonical_sha256":"09d9ba0f29695bfa57712f1357a1104174fc4d5432e1e8617144bdcbe8b71803","source":{"kind":"arxiv","id":"1609.07872","version":1},"attestation_state":"computed","paper":{"title":"Every linear order isomorphic to its cube is isomorphic to its square","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Garrett Ervin","submitted_at":"2016-09-26T07:20:10Z","abstract_excerpt":"In 1958, Sierpinski asked whether there exists a linear order $X$ that is isomorphic to its lexicographically ordered cube but is not isomorphic to its square. The main result of this paper is that the answer is negative. More generally, if $X$ is isomorphic to any one of its finite powers $X^n$, $n>1$, it is isomorphic to all of them."},"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":"1609.07872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-09-26T07:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"8779e3be7c87529caf1e4cdb073422780677c8b42c0cce5b584ae7e00be757d1","abstract_canon_sha256":"603ce54ed53edc3d4ba367d83de9236474ed4779015ca9cb56ed7c7a6d0ed08a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:55.180346Z","signature_b64":"UI4evH93LEpVkZ40+ANRhu+iaPSycAUembIxEK+6EHUtu5JUM8QPdVH4IYKcde5ceRMdElx9Z9d+ZOOKImwNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09d9ba0f29695bfa57712f1357a1104174fc4d5432e1e8617144bdcbe8b71803","last_reissued_at":"2026-05-18T01:03:55.179711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:55.179711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every linear order isomorphic to its cube is isomorphic to its square","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Garrett Ervin","submitted_at":"2016-09-26T07:20:10Z","abstract_excerpt":"In 1958, Sierpinski asked whether there exists a linear order $X$ that is isomorphic to its lexicographically ordered cube but is not isomorphic to its square. The main result of this paper is that the answer is negative. More generally, if $X$ is isomorphic to any one of its finite powers $X^n$, $n>1$, it is isomorphic to all of them."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07872","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":""},"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":"1609.07872","created_at":"2026-05-18T01:03:55.179810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07872v1","created_at":"2026-05-18T01:03:55.179810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07872","created_at":"2026-05-18T01:03:55.179810+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHM3UDZJNFN7","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHM3UDZJNFN7UV3R","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHM3UDZJ","created_at":"2026-05-18T12:30:07.202191+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/BHM3UDZJNFN7UV3RF4JVPIIQIF","json":"https://pith.science/pith/BHM3UDZJNFN7UV3RF4JVPIIQIF.json","graph_json":"https://pith.science/api/pith-number/BHM3UDZJNFN7UV3RF4JVPIIQIF/graph.json","events_json":"https://pith.science/api/pith-number/BHM3UDZJNFN7UV3RF4JVPIIQIF/events.json","paper":"https://pith.science/paper/BHM3UDZJ"},"agent_actions":{"view_html":"https://pith.science/pith/BHM3UDZJNFN7UV3RF4JVPIIQIF","download_json":"https://pith.science/pith/BHM3UDZJNFN7UV3RF4JVPIIQIF.json","view_paper":"https://pith.science/paper/BHM3UDZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07872&json=true","fetch_graph":"https://pith.science/api/pith-number/BHM3UDZJNFN7UV3RF4JVPIIQIF/graph.json","fetch_events":"https://pith.science/api/pith-number/BHM3UDZJNFN7UV3RF4JVPIIQIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHM3UDZJNFN7UV3RF4JVPIIQIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHM3UDZJNFN7UV3RF4JVPIIQIF/action/storage_attestation","attest_author":"https://pith.science/pith/BHM3UDZJNFN7UV3RF4JVPIIQIF/action/author_attestation","sign_citation":"https://pith.science/pith/BHM3UDZJNFN7UV3RF4JVPIIQIF/action/citation_signature","submit_replication":"https://pith.science/pith/BHM3UDZJNFN7UV3RF4JVPIIQIF/action/replication_record"}},"created_at":"2026-05-18T01:03:55.179810+00:00","updated_at":"2026-05-18T01:03:55.179810+00:00"}