{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:46O6TP7NUIVAGHRIZJXZZVTBIU","short_pith_number":"pith:46O6TP7N","schema_version":"1.0","canonical_sha256":"e79de9bfeda22a031e28ca6f9cd661452327caece8a0e7bce5429847aeb57041","source":{"kind":"arxiv","id":"1704.04288","version":3},"attestation_state":"computed","paper":{"title":"Passing through a stack $k$ times","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":"2017-04-13T22:15:34Z","abstract_excerpt":"We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation $\\pi$ to be $k$-pass sortable if $\\pi$ is sortable using $k$ passes through the stack. Permutations that are $1$-pass sortable are simply the stack sortable permutations as defined by Knuth. We define the permutation class of $2$-pass sortable permutations in terms of their basis. We also show all $k$-pass sortable classes have finite bases by giving bounds on the length of a basis el"},"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":"1704.04288","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-13T22:15:34Z","cross_cats_sorted":[],"title_canon_sha256":"adb728bd7b4b34fb51cc036a78511c2c276b7905a74739d971e1b1253fcbfdc0","abstract_canon_sha256":"7b806830b459a4a8db30da4c71d5da3fa328ef3107a49b3d8a29f2e2ebe0bf22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:00.529421Z","signature_b64":"89vmeMDNP+BnJveCu8w2uRj/4pM8DTOXZZ7Q5dnIPNuxg889Pe/l8vtEqU4VmzkfmvuI1dC3aQZz3Mwf65s0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e79de9bfeda22a031e28ca6f9cd661452327caece8a0e7bce5429847aeb57041","last_reissued_at":"2026-05-18T00:12:00.528863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:00.528863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Passing through a stack $k$ times","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":"2017-04-13T22:15:34Z","abstract_excerpt":"We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation $\\pi$ to be $k$-pass sortable if $\\pi$ is sortable using $k$ passes through the stack. Permutations that are $1$-pass sortable are simply the stack sortable permutations as defined by Knuth. We define the permutation class of $2$-pass sortable permutations in terms of their basis. We also show all $k$-pass sortable classes have finite bases by giving bounds on the length of a basis el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04288","kind":"arxiv","version":3},"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":"1704.04288","created_at":"2026-05-18T00:12:00.528936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04288v3","created_at":"2026-05-18T00:12:00.528936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04288","created_at":"2026-05-18T00:12:00.528936+00:00"},{"alias_kind":"pith_short_12","alias_value":"46O6TP7NUIVA","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"46O6TP7NUIVAGHRI","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"46O6TP7N","created_at":"2026-05-18T12:30:58.224056+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/46O6TP7NUIVAGHRIZJXZZVTBIU","json":"https://pith.science/pith/46O6TP7NUIVAGHRIZJXZZVTBIU.json","graph_json":"https://pith.science/api/pith-number/46O6TP7NUIVAGHRIZJXZZVTBIU/graph.json","events_json":"https://pith.science/api/pith-number/46O6TP7NUIVAGHRIZJXZZVTBIU/events.json","paper":"https://pith.science/paper/46O6TP7N"},"agent_actions":{"view_html":"https://pith.science/pith/46O6TP7NUIVAGHRIZJXZZVTBIU","download_json":"https://pith.science/pith/46O6TP7NUIVAGHRIZJXZZVTBIU.json","view_paper":"https://pith.science/paper/46O6TP7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04288&json=true","fetch_graph":"https://pith.science/api/pith-number/46O6TP7NUIVAGHRIZJXZZVTBIU/graph.json","fetch_events":"https://pith.science/api/pith-number/46O6TP7NUIVAGHRIZJXZZVTBIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46O6TP7NUIVAGHRIZJXZZVTBIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46O6TP7NUIVAGHRIZJXZZVTBIU/action/storage_attestation","attest_author":"https://pith.science/pith/46O6TP7NUIVAGHRIZJXZZVTBIU/action/author_attestation","sign_citation":"https://pith.science/pith/46O6TP7NUIVAGHRIZJXZZVTBIU/action/citation_signature","submit_replication":"https://pith.science/pith/46O6TP7NUIVAGHRIZJXZZVTBIU/action/replication_record"}},"created_at":"2026-05-18T00:12:00.528936+00:00","updated_at":"2026-05-18T00:12:00.528936+00:00"}