{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QH5GLIKW7VFWIAULN2Q5SJUMDX","short_pith_number":"pith:QH5GLIKW","schema_version":"1.0","canonical_sha256":"81fa65a156fd4b64028b6ea1d9268c1df0e8d2589058f8af75efafa8caea70a1","source":{"kind":"arxiv","id":"1809.09158","version":2},"attestation_state":"computed","paper":{"title":"Stack-sorting for Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin Defant, Noah Kravitz","submitted_at":"2018-09-24T18:40:41Z","abstract_excerpt":"We introduce operators $\\mathsf{hare}$ and $\\mathsf{tortoise}$, which act on words as natural generalizations of West's stack-sorting map. We show that the heuristically slower algorithm $\\mathsf{tortoise}$ can sort words arbitrarily faster than its counterpart $\\mathsf{hare}$. We then generalize the combinatorial objects known as valid hook configurations in order to find a method for computing the number of preimages of any word under these two operators. We relate the question of determining which words are sortable by $\\mathsf{hare}$ and $\\mathsf{tortoise}$ to more classical problems in pa"},"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":"1809.09158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-24T18:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"617528dea0960f0fef21576bfb9e9bd10d0f9cc4d2c19e04edc0fa06bc103e75","abstract_canon_sha256":"3e4efd6c4371626fbf71090e9b2a3d551a3d56b7fcfc6810edaaa7743e08c8f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:47.505767Z","signature_b64":"wBn1c8uCZIBYM44XpUgeUCkKp7hWz+KfZV4yCstAC1IKCEvafqcDZEfBfzae5/GcwcCfX4RqdnjK9mxXgBWsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81fa65a156fd4b64028b6ea1d9268c1df0e8d2589058f8af75efafa8caea70a1","last_reissued_at":"2026-05-17T23:58:47.505380Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:47.505380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stack-sorting for Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin Defant, Noah Kravitz","submitted_at":"2018-09-24T18:40:41Z","abstract_excerpt":"We introduce operators $\\mathsf{hare}$ and $\\mathsf{tortoise}$, which act on words as natural generalizations of West's stack-sorting map. We show that the heuristically slower algorithm $\\mathsf{tortoise}$ can sort words arbitrarily faster than its counterpart $\\mathsf{hare}$. We then generalize the combinatorial objects known as valid hook configurations in order to find a method for computing the number of preimages of any word under these two operators. We relate the question of determining which words are sortable by $\\mathsf{hare}$ and $\\mathsf{tortoise}$ to more classical problems in pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09158","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":"1809.09158","created_at":"2026-05-17T23:58:47.505444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09158v2","created_at":"2026-05-17T23:58:47.505444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09158","created_at":"2026-05-17T23:58:47.505444+00:00"},{"alias_kind":"pith_short_12","alias_value":"QH5GLIKW7VFW","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QH5GLIKW7VFWIAUL","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QH5GLIKW","created_at":"2026-05-18T12:32:46.962924+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/QH5GLIKW7VFWIAULN2Q5SJUMDX","json":"https://pith.science/pith/QH5GLIKW7VFWIAULN2Q5SJUMDX.json","graph_json":"https://pith.science/api/pith-number/QH5GLIKW7VFWIAULN2Q5SJUMDX/graph.json","events_json":"https://pith.science/api/pith-number/QH5GLIKW7VFWIAULN2Q5SJUMDX/events.json","paper":"https://pith.science/paper/QH5GLIKW"},"agent_actions":{"view_html":"https://pith.science/pith/QH5GLIKW7VFWIAULN2Q5SJUMDX","download_json":"https://pith.science/pith/QH5GLIKW7VFWIAULN2Q5SJUMDX.json","view_paper":"https://pith.science/paper/QH5GLIKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09158&json=true","fetch_graph":"https://pith.science/api/pith-number/QH5GLIKW7VFWIAULN2Q5SJUMDX/graph.json","fetch_events":"https://pith.science/api/pith-number/QH5GLIKW7VFWIAULN2Q5SJUMDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QH5GLIKW7VFWIAULN2Q5SJUMDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QH5GLIKW7VFWIAULN2Q5SJUMDX/action/storage_attestation","attest_author":"https://pith.science/pith/QH5GLIKW7VFWIAULN2Q5SJUMDX/action/author_attestation","sign_citation":"https://pith.science/pith/QH5GLIKW7VFWIAULN2Q5SJUMDX/action/citation_signature","submit_replication":"https://pith.science/pith/QH5GLIKW7VFWIAULN2Q5SJUMDX/action/replication_record"}},"created_at":"2026-05-17T23:58:47.505444+00:00","updated_at":"2026-05-17T23:58:47.505444+00:00"}