{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FELPYSNWI4FECKROR6ZXMJHJVR","short_pith_number":"pith:FELPYSNW","canonical_record":{"source":{"id":"1808.04199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T13:30:10Z","cross_cats_sorted":[],"title_canon_sha256":"37668bf857f7f6e432ba9066264ab9ff18005b054bbccab6ee01e3858532b030","abstract_canon_sha256":"9aec6706e641ecd1eb5de58f84f69147313341e3bc9f78e9ad56e0f1d346a9aa"},"schema_version":"1.0"},"canonical_sha256":"2916fc49b6470a412a2e8fb37624e9ac7493e8753d83621bfb75789884f817de","source":{"kind":"arxiv","id":"1808.04199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04199","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04199v1","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04199","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"FELPYSNWI4FE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FELPYSNWI4FECKRO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FELPYSNW","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FELPYSNWI4FECKROR6ZXMJHJVR","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T13:30:10Z","cross_cats_sorted":[],"title_canon_sha256":"37668bf857f7f6e432ba9066264ab9ff18005b054bbccab6ee01e3858532b030","abstract_canon_sha256":"9aec6706e641ecd1eb5de58f84f69147313341e3bc9f78e9ad56e0f1d346a9aa"},"schema_version":"1.0"},"canonical_sha256":"2916fc49b6470a412a2e8fb37624e9ac7493e8753d83621bfb75789884f817de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:18.621052Z","signature_b64":"5WeLNqIVrKLH0je+ba/Mjr7FDDDJWNoc2prEi45AyT8lFF2xZ9XfpGa5d2fouWnuhQSzBZeAsGqXTpXT+qbaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2916fc49b6470a412a2e8fb37624e9ac7493e8753d83621bfb75789884f817de","last_reissued_at":"2026-05-18T00:08:18.620601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:18.620601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04199","source_version":1,"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-18T00:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37IZe/C8eU3uLnjNIatl5dai7Wl3kxVBZ99KGTJi3N9mzgSQEEoyAAUIyTblioAz2IJY4iRiyj2NCQGmKgeOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:21:50.460786Z"},"content_sha256":"ec5de187ee776a9a5998249adb8b08ae8297212957152670a6c4c652f1c39879","schema_version":"1.0","event_id":"sha256:ec5de187ee776a9a5998249adb8b08ae8297212957152670a6c4c652f1c39879"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FELPYSNWI4FECKROR6ZXMJHJVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Passing through a stack $k$ times with reversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Howard Skogman, Rebecca Smith, Toufik Mansour","submitted_at":"2018-08-13T13:30:10Z","abstract_excerpt":"We consider a stack sorting algorithm where only the appropriate output values are popped from the stack and then any remaining entries in the stack are run through the stack in reverse order. We identify the basis for the $2$-reverse pass sortable permutations and give computational results for some classes with larger maximal rev-tier. We also show all classes of $(t+1)$-reverse pass sortable permutations are finitely based. Additionally, a new Entringer family consisting of maximal rev-tier permutations of length $n$ was discovered along with a bijection between this family and the collecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04199","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3QYR7BVXZald7F5XwmEbOJCr7vq5/nOjSQfEMXzlAC9kByHYrCIxe+wDELcg2SCv5QWMtpQdcTbc+uk+ZMzfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:21:50.461516Z"},"content_sha256":"e76eedf45b4b4c1a384bce303d5f044c71831a27ddb2e89741b45e5e2309136a","schema_version":"1.0","event_id":"sha256:e76eedf45b4b4c1a384bce303d5f044c71831a27ddb2e89741b45e5e2309136a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FELPYSNWI4FECKROR6ZXMJHJVR/bundle.json","state_url":"https://pith.science/pith/FELPYSNWI4FECKROR6ZXMJHJVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FELPYSNWI4FECKROR6ZXMJHJVR/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-05-31T14:21:50Z","links":{"resolver":"https://pith.science/pith/FELPYSNWI4FECKROR6ZXMJHJVR","bundle":"https://pith.science/pith/FELPYSNWI4FECKROR6ZXMJHJVR/bundle.json","state":"https://pith.science/pith/FELPYSNWI4FECKROR6ZXMJHJVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FELPYSNWI4FECKROR6ZXMJHJVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FELPYSNWI4FECKROR6ZXMJHJVR","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":"9aec6706e641ecd1eb5de58f84f69147313341e3bc9f78e9ad56e0f1d346a9aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T13:30:10Z","title_canon_sha256":"37668bf857f7f6e432ba9066264ab9ff18005b054bbccab6ee01e3858532b030"},"schema_version":"1.0","source":{"id":"1808.04199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04199","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04199v1","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04199","created_at":"2026-05-18T00:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"FELPYSNWI4FE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FELPYSNWI4FECKRO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FELPYSNW","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:e76eedf45b4b4c1a384bce303d5f044c71831a27ddb2e89741b45e5e2309136a","target":"graph","created_at":"2026-05-18T00:08:18Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a stack sorting algorithm where only the appropriate output values are popped from the stack and then any remaining entries in the stack are run through the stack in reverse order. We identify the basis for the $2$-reverse pass sortable permutations and give computational results for some classes with larger maximal rev-tier. We also show all classes of $(t+1)$-reverse pass sortable permutations are finitely based. Additionally, a new Entringer family consisting of maximal rev-tier permutations of length $n$ was discovered along with a bijection between this family and the collecti","authors_text":"Howard Skogman, Rebecca Smith, Toufik Mansour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T13:30:10Z","title":"Passing through a stack $k$ times with reversals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04199","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ec5de187ee776a9a5998249adb8b08ae8297212957152670a6c4c652f1c39879","target":"record","created_at":"2026-05-18T00:08:18Z","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":"9aec6706e641ecd1eb5de58f84f69147313341e3bc9f78e9ad56e0f1d346a9aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T13:30:10Z","title_canon_sha256":"37668bf857f7f6e432ba9066264ab9ff18005b054bbccab6ee01e3858532b030"},"schema_version":"1.0","source":{"id":"1808.04199","kind":"arxiv","version":1}},"canonical_sha256":"2916fc49b6470a412a2e8fb37624e9ac7493e8753d83621bfb75789884f817de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2916fc49b6470a412a2e8fb37624e9ac7493e8753d83621bfb75789884f817de","first_computed_at":"2026-05-18T00:08:18.620601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:18.620601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5WeLNqIVrKLH0je+ba/Mjr7FDDDJWNoc2prEi45AyT8lFF2xZ9XfpGa5d2fouWnuhQSzBZeAsGqXTpXT+qbaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:18.621052Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec5de187ee776a9a5998249adb8b08ae8297212957152670a6c4c652f1c39879","sha256:e76eedf45b4b4c1a384bce303d5f044c71831a27ddb2e89741b45e5e2309136a"],"state_sha256":"7556a2972878d4758333d62042b4addf51692a38bea0f33dbec3cdc4a989d3c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQCXxCPbkFLonWgOV4ULWJTiCxgStPFhpNxq3MyaYeAtTDVQHhAObCvSyN8QyuPhBbPwq739roq1cAkRY5bEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:21:50.465848Z","bundle_sha256":"ca377ef0509fb4e025a3ff849209b3d810e264148ac1996b46e7796cbffc7618"}}