{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TTEMSF66GHJTTGBMDUL3UGGNHJ","short_pith_number":"pith:TTEMSF66","canonical_record":{"source":{"id":"2604.23825","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-26T18:10:20Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ffd83718309c62683f894410ed8e9d02d54b80a078af6aa3fad17b6b47365d2e","abstract_canon_sha256":"18ca066f143444a1273a6ba7d1dc7bd67c81dde0c7b9c0fec8d2c3d43a33ae94"},"schema_version":"1.0"},"canonical_sha256":"9cc8c917de31d339982c1d17ba18cd3a6698416b03cdc38f789a27cb5017d791","source":{"kind":"arxiv","id":"2604.23825","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.23825","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"2604.23825v2","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.23825","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"TTEMSF66GHJT","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_16","alias_value":"TTEMSF66GHJTTGBM","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_8","alias_value":"TTEMSF66","created_at":"2026-05-27T01:05:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TTEMSF66GHJTTGBMDUL3UGGNHJ","target":"record","payload":{"canonical_record":{"source":{"id":"2604.23825","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-26T18:10:20Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ffd83718309c62683f894410ed8e9d02d54b80a078af6aa3fad17b6b47365d2e","abstract_canon_sha256":"18ca066f143444a1273a6ba7d1dc7bd67c81dde0c7b9c0fec8d2c3d43a33ae94"},"schema_version":"1.0"},"canonical_sha256":"9cc8c917de31d339982c1d17ba18cd3a6698416b03cdc38f789a27cb5017d791","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:54.947264Z","signature_b64":"0PUoEm3bP/9s2WW0ChP99+rPbQaS94S8WgZM/9hJBljKF6paK8P3zj+c/WjVWNUtsRIFGihMgIV7mMzSCuehBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cc8c917de31d339982c1d17ba18cd3a6698416b03cdc38f789a27cb5017d791","last_reissued_at":"2026-05-27T01:05:54.946499Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:54.946499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.23825","source_version":2,"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-05-27T01:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eY5Cv8McshBfRFqHxVXdXoutFIAUsLhOAQ4Z1bKyQIonImg6sTcq+Id0FrBsYNrcgM40v/tYvmYfRk/T7tczCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:05:47.279404Z"},"content_sha256":"a7023f84d63e93bb69e01f8e3b831f045fd7bc60cc825ed4da7ba8e0c1f9b1fb","schema_version":"1.0","event_id":"sha256:a7023f84d63e93bb69e01f8e3b831f045fd7bc60cc825ed4da7ba8e0c1f9b1fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TTEMSF66GHJTTGBMDUL3UGGNHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Record Filtering and Longest Decreasing Subsequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The number of passes in recursive record filtering on a sequence equals the length of its longest decreasing subsequence.","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Jackson Zariski, Kaitlin Kratter","submitted_at":"2026-04-26T18:10:20Z","abstract_excerpt":"We consider a recursive record-filtering procedure, which we informally call Disappear-Sort. Let $D_n$ denote the random variable giving the required number of passes in Disappear-Sort to eliminate a sequence of length $n$ sampled as i.i.d. copies of a continuous random variable $X$, where each pass retains the left-to-right records and discards all remaining entries. We show that this procedure admits two natural probabilistic interpretations. For the resampling variant we prove that $d_n=\\mathbb{E}[D_n]$ satisfies an exact recurrence involving the unsigned Stirling numbers of the first kind."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We deduce that the total number of passes equals L(p_n), where L(p_n) is the length of the longest decreasing subsequence of p_n. We then show that for a uniform random permutation of size n, the expectation E[D_n] of this second variant coincides with the expected first-column length of a Plancherel-random Young diagram. [...] E[D_n]∼2√n, with fluctuations on the n^{1/6} scale governed by the Tracy–Widom law derived by Baik, Deift and Johansson.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The recursive Disappear-Sort layers form an antichain decomposition of the poset associated to the permutation p_n, allowing the number of passes to equal the length of the longest decreasing subsequence.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The number of recursive record-filtering passes on a random permutation equals its longest decreasing subsequence length, whose expectation is asymptotically 2 sqrt(n) with Tracy-Widom fluctuations via Plancherel measure.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The number of passes in recursive record filtering on a sequence equals the length of its longest decreasing subsequence.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1f6deca369b9663995caf8bab8c305077db025b3f11716c5d295e7821caada13"},"source":{"id":"2604.23825","kind":"arxiv","version":2},"verdict":{"id":"a56b1f03-343e-4a5a-b3f7-55c9ce47dc62","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T05:42:09.225991Z","strongest_claim":"We deduce that the total number of passes equals L(p_n), where L(p_n) is the length of the longest decreasing subsequence of p_n. We then show that for a uniform random permutation of size n, the expectation E[D_n] of this second variant coincides with the expected first-column length of a Plancherel-random Young diagram. [...] E[D_n]∼2√n, with fluctuations on the n^{1/6} scale governed by the Tracy–Widom law derived by Baik, Deift and Johansson.","one_line_summary":"The number of recursive record-filtering passes on a random permutation equals its longest decreasing subsequence length, whose expectation is asymptotically 2 sqrt(n) with Tracy-Widom fluctuations via Plancherel measure.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The recursive Disappear-Sort layers form an antichain decomposition of the poset associated to the permutation p_n, allowing the number of passes to equal the length of the longest decreasing subsequence.","pith_extraction_headline":"The number of passes in recursive record filtering on a sequence equals the length of its longest decreasing subsequence."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.23825/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T08:34:04.790493Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:43:19.372817Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"b2d2e4c56f9d40efd1b022a0f632a44872aea60d83b6b56bc4f51e2006724146"},"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":"a56b1f03-343e-4a5a-b3f7-55c9ce47dc62"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/JGhTFTM7YSmKyrdfSRZ8VPca00zVItCJqibrtOIHOBisPIa5f3AlAsIBcvu3zDkDpPH9WYrinScPaXWFVlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:05:47.280037Z"},"content_sha256":"2d0f5bfd627853b3f5958aaff0bd00659bd079a0c0302c033c8bc9701edae230","schema_version":"1.0","event_id":"sha256:2d0f5bfd627853b3f5958aaff0bd00659bd079a0c0302c033c8bc9701edae230"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTEMSF66GHJTTGBMDUL3UGGNHJ/bundle.json","state_url":"https://pith.science/pith/TTEMSF66GHJTTGBMDUL3UGGNHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTEMSF66GHJTTGBMDUL3UGGNHJ/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-06-02T22:05:47Z","links":{"resolver":"https://pith.science/pith/TTEMSF66GHJTTGBMDUL3UGGNHJ","bundle":"https://pith.science/pith/TTEMSF66GHJTTGBMDUL3UGGNHJ/bundle.json","state":"https://pith.science/pith/TTEMSF66GHJTTGBMDUL3UGGNHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTEMSF66GHJTTGBMDUL3UGGNHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TTEMSF66GHJTTGBMDUL3UGGNHJ","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":"18ca066f143444a1273a6ba7d1dc7bd67c81dde0c7b9c0fec8d2c3d43a33ae94","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-26T18:10:20Z","title_canon_sha256":"ffd83718309c62683f894410ed8e9d02d54b80a078af6aa3fad17b6b47365d2e"},"schema_version":"1.0","source":{"id":"2604.23825","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.23825","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"2604.23825v2","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.23825","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"TTEMSF66GHJT","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_16","alias_value":"TTEMSF66GHJTTGBM","created_at":"2026-05-27T01:05:54Z"},{"alias_kind":"pith_short_8","alias_value":"TTEMSF66","created_at":"2026-05-27T01:05:54Z"}],"graph_snapshots":[{"event_id":"sha256:2d0f5bfd627853b3f5958aaff0bd00659bd079a0c0302c033c8bc9701edae230","target":"graph","created_at":"2026-05-27T01:05:54Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We deduce that the total number of passes equals L(p_n), where L(p_n) is the length of the longest decreasing subsequence of p_n. We then show that for a uniform random permutation of size n, the expectation E[D_n] of this second variant coincides with the expected first-column length of a Plancherel-random Young diagram. [...] E[D_n]∼2√n, with fluctuations on the n^{1/6} scale governed by the Tracy–Widom law derived by Baik, Deift and Johansson."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The recursive Disappear-Sort layers form an antichain decomposition of the poset associated to the permutation p_n, allowing the number of passes to equal the length of the longest decreasing subsequence."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The number of recursive record-filtering passes on a random permutation equals its longest decreasing subsequence length, whose expectation is asymptotically 2 sqrt(n) with Tracy-Widom fluctuations via Plancherel measure."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The number of passes in recursive record filtering on a sequence equals the length of its longest decreasing subsequence."}],"snapshot_sha256":"1f6deca369b9663995caf8bab8c305077db025b3f11716c5d295e7821caada13"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T08:34:04.790493Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:43:19.372817Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.23825/integrity.json","findings":[],"snapshot_sha256":"b2d2e4c56f9d40efd1b022a0f632a44872aea60d83b6b56bc4f51e2006724146","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a recursive record-filtering procedure, which we informally call Disappear-Sort. Let $D_n$ denote the random variable giving the required number of passes in Disappear-Sort to eliminate a sequence of length $n$ sampled as i.i.d. copies of a continuous random variable $X$, where each pass retains the left-to-right records and discards all remaining entries. We show that this procedure admits two natural probabilistic interpretations. For the resampling variant we prove that $d_n=\\mathbb{E}[D_n]$ satisfies an exact recurrence involving the unsigned Stirling numbers of the first kind.","authors_text":"Jackson Zariski, Kaitlin Kratter","cross_cats":["math.PR"],"headline":"The number of passes in recursive record filtering on a sequence equals the length of its longest decreasing subsequence.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-26T18:10:20Z","title":"Recursive Record Filtering and Longest Decreasing Subsequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.23825","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T05:42:09.225991Z","id":"a56b1f03-343e-4a5a-b3f7-55c9ce47dc62","model_set":{"reader":"grok-4.3"},"one_line_summary":"The number of recursive record-filtering passes on a random permutation equals its longest decreasing subsequence length, whose expectation is asymptotically 2 sqrt(n) with Tracy-Widom fluctuations via Plancherel measure.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The number of passes in recursive record filtering on a sequence equals the length of its longest decreasing subsequence.","strongest_claim":"We deduce that the total number of passes equals L(p_n), where L(p_n) is the length of the longest decreasing subsequence of p_n. We then show that for a uniform random permutation of size n, the expectation E[D_n] of this second variant coincides with the expected first-column length of a Plancherel-random Young diagram. [...] E[D_n]∼2√n, with fluctuations on the n^{1/6} scale governed by the Tracy–Widom law derived by Baik, Deift and Johansson.","weakest_assumption":"The recursive Disappear-Sort layers form an antichain decomposition of the poset associated to the permutation p_n, allowing the number of passes to equal the length of the longest decreasing subsequence."}},"verdict_id":"a56b1f03-343e-4a5a-b3f7-55c9ce47dc62"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a7023f84d63e93bb69e01f8e3b831f045fd7bc60cc825ed4da7ba8e0c1f9b1fb","target":"record","created_at":"2026-05-27T01:05:54Z","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":"18ca066f143444a1273a6ba7d1dc7bd67c81dde0c7b9c0fec8d2c3d43a33ae94","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-26T18:10:20Z","title_canon_sha256":"ffd83718309c62683f894410ed8e9d02d54b80a078af6aa3fad17b6b47365d2e"},"schema_version":"1.0","source":{"id":"2604.23825","kind":"arxiv","version":2}},"canonical_sha256":"9cc8c917de31d339982c1d17ba18cd3a6698416b03cdc38f789a27cb5017d791","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cc8c917de31d339982c1d17ba18cd3a6698416b03cdc38f789a27cb5017d791","first_computed_at":"2026-05-27T01:05:54.946499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:54.946499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0PUoEm3bP/9s2WW0ChP99+rPbQaS94S8WgZM/9hJBljKF6paK8P3zj+c/WjVWNUtsRIFGihMgIV7mMzSCuehBw==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:54.947264Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.23825","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7023f84d63e93bb69e01f8e3b831f045fd7bc60cc825ed4da7ba8e0c1f9b1fb","sha256:2d0f5bfd627853b3f5958aaff0bd00659bd079a0c0302c033c8bc9701edae230"],"state_sha256":"5f29715c38ffe286b7ae4d18493e85c5ede5d3e3bdaa52e612aa830265a3e0ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBTHV3934JPInNeLsZfYlqyDqZ39KRUj2nHNt24wZjOD+S5QGhWTnDeJoXWYkO4zsXpvd1NRYJW1ArKLEPMBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:05:47.282710Z","bundle_sha256":"288b6aa73edc82478dd30b373b4473ec6170525a1061c6265426b6cb668d67fc"}}