{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UTW63RISMVWC4NFPBKQ5IBTMBV","short_pith_number":"pith:UTW63RIS","schema_version":"1.0","canonical_sha256":"a4ededc512656c2e34af0aa1d4066c0d69036c9b3d7929ec7314645fad4c3432","source":{"kind":"arxiv","id":"1602.02719","version":1},"attestation_state":"computed","paper":{"title":"Monotone Subsequences in High-Dimensional Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Simkin, Nathan Linial","submitted_at":"2016-02-08T20:03:15Z","abstract_excerpt":"This paper is part of the ongoing effort to study high-dimensional permutations. We prove the analogue to the Erd\\H{o}s-Szekeres theorem: For every $k\\ge1$, every order-$n$ $k$-dimensional permutation contains a monotone subsequence of length $\\Omega_{k}\\left(\\sqrt{n}\\right)$, and this is tight. On the other hand, and unlike the classical case, the longest monotone subsequence in a random $k$-dimensional permutation of order $n$ is asymptotically almost surely $\\Theta_{k}\\left(n^{\\frac{k}{k+1}}\\right)$."},"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":"1602.02719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T20:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"c60879157e354db489629f3c2e4bbd621fc71a3032dadda4adff5638e4682fb7","abstract_canon_sha256":"e731d499629deb0c5c47a4f77f4b4ef9012367b439f32d3ade50ff0d39f238be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:21.507109Z","signature_b64":"JCN7t9xdiy0XKo2SnLi0lSWCHMoix5KLHbLQjveWv+esu9EmpVeFhqSYIzxW0pefZ/Hh/NzrN653Hyv+Jb3aCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ededc512656c2e34af0aa1d4066c0d69036c9b3d7929ec7314645fad4c3432","last_reissued_at":"2026-05-18T00:32:21.506309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:21.506309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone Subsequences in High-Dimensional Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Simkin, Nathan Linial","submitted_at":"2016-02-08T20:03:15Z","abstract_excerpt":"This paper is part of the ongoing effort to study high-dimensional permutations. We prove the analogue to the Erd\\H{o}s-Szekeres theorem: For every $k\\ge1$, every order-$n$ $k$-dimensional permutation contains a monotone subsequence of length $\\Omega_{k}\\left(\\sqrt{n}\\right)$, and this is tight. On the other hand, and unlike the classical case, the longest monotone subsequence in a random $k$-dimensional permutation of order $n$ is asymptotically almost surely $\\Theta_{k}\\left(n^{\\frac{k}{k+1}}\\right)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02719","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":"1602.02719","created_at":"2026-05-18T00:32:21.506454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02719v1","created_at":"2026-05-18T00:32:21.506454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02719","created_at":"2026-05-18T00:32:21.506454+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTW63RISMVWC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTW63RISMVWC4NFP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTW63RIS","created_at":"2026-05-18T12:30:46.583412+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/UTW63RISMVWC4NFPBKQ5IBTMBV","json":"https://pith.science/pith/UTW63RISMVWC4NFPBKQ5IBTMBV.json","graph_json":"https://pith.science/api/pith-number/UTW63RISMVWC4NFPBKQ5IBTMBV/graph.json","events_json":"https://pith.science/api/pith-number/UTW63RISMVWC4NFPBKQ5IBTMBV/events.json","paper":"https://pith.science/paper/UTW63RIS"},"agent_actions":{"view_html":"https://pith.science/pith/UTW63RISMVWC4NFPBKQ5IBTMBV","download_json":"https://pith.science/pith/UTW63RISMVWC4NFPBKQ5IBTMBV.json","view_paper":"https://pith.science/paper/UTW63RIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02719&json=true","fetch_graph":"https://pith.science/api/pith-number/UTW63RISMVWC4NFPBKQ5IBTMBV/graph.json","fetch_events":"https://pith.science/api/pith-number/UTW63RISMVWC4NFPBKQ5IBTMBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTW63RISMVWC4NFPBKQ5IBTMBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTW63RISMVWC4NFPBKQ5IBTMBV/action/storage_attestation","attest_author":"https://pith.science/pith/UTW63RISMVWC4NFPBKQ5IBTMBV/action/author_attestation","sign_citation":"https://pith.science/pith/UTW63RISMVWC4NFPBKQ5IBTMBV/action/citation_signature","submit_replication":"https://pith.science/pith/UTW63RISMVWC4NFPBKQ5IBTMBV/action/replication_record"}},"created_at":"2026-05-18T00:32:21.506454+00:00","updated_at":"2026-05-18T00:32:21.506454+00:00"}