{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VINPGWOX7W7LXPBIDCJH6757VA","short_pith_number":"pith:VINPGWOX","schema_version":"1.0","canonical_sha256":"aa1af359d7fdbebbbc2818927f7fbfa83963f227167b4501e63cb5da813facbd","source":{"kind":"arxiv","id":"1710.04978","version":2},"attestation_state":"computed","paper":{"title":"Enumerating permutations sortable by $k$ passes through a pop-stack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson, Bjarki \\'Ag\\'ust Gu{\\dh}mundsson","submitted_at":"2017-10-13T15:57:48Z","abstract_excerpt":"In an exercise in the first volume of his famous series of books, Knuth considered sorting permutations by passing them through a stack. Many variations of this exercise have since been considered, including allowing multiple passes through the stack and using different data structures. We are concerned with a variation using pop-stacks that was introduced by Avis and Newborn in 1981. Let $P_k(x)$ be the generating function for the permutations sortable by $k$ passes through a pop-stack. The generating function $P_2(x)$ was recently given by Pudwell and Smith (the case $k=1$ being trivial). We"},"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":"1710.04978","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-13T15:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"4cee75ccc0829349790b0c18a9f383155e3cb73fb957b4250d5f50cdf849818f","abstract_canon_sha256":"e2acf94bcc33cf6237307248d8f1d30af4d660b407fc01938e3a42ecf5455093"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:33.821076Z","signature_b64":"jg01LFcSdNYMW5WKRHlpwxbuU5GDzpT21bb9orKz3vg/VaQMenAfXfv9tcyj8cjDIXC50HGxb45I6QYW+/D6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa1af359d7fdbebbbc2818927f7fbfa83963f227167b4501e63cb5da813facbd","last_reissued_at":"2026-05-17T23:49:33.820578Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:33.820578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumerating permutations sortable by $k$ passes through a pop-stack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson, Bjarki \\'Ag\\'ust Gu{\\dh}mundsson","submitted_at":"2017-10-13T15:57:48Z","abstract_excerpt":"In an exercise in the first volume of his famous series of books, Knuth considered sorting permutations by passing them through a stack. Many variations of this exercise have since been considered, including allowing multiple passes through the stack and using different data structures. We are concerned with a variation using pop-stacks that was introduced by Avis and Newborn in 1981. Let $P_k(x)$ be the generating function for the permutations sortable by $k$ passes through a pop-stack. The generating function $P_2(x)$ was recently given by Pudwell and Smith (the case $k=1$ being trivial). We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04978","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":"1710.04978","created_at":"2026-05-17T23:49:33.820650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04978v2","created_at":"2026-05-17T23:49:33.820650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04978","created_at":"2026-05-17T23:49:33.820650+00:00"},{"alias_kind":"pith_short_12","alias_value":"VINPGWOX7W7L","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VINPGWOX7W7LXPBI","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VINPGWOX","created_at":"2026-05-18T12:31:49.984773+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/VINPGWOX7W7LXPBIDCJH6757VA","json":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA.json","graph_json":"https://pith.science/api/pith-number/VINPGWOX7W7LXPBIDCJH6757VA/graph.json","events_json":"https://pith.science/api/pith-number/VINPGWOX7W7LXPBIDCJH6757VA/events.json","paper":"https://pith.science/paper/VINPGWOX"},"agent_actions":{"view_html":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA","download_json":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA.json","view_paper":"https://pith.science/paper/VINPGWOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04978&json=true","fetch_graph":"https://pith.science/api/pith-number/VINPGWOX7W7LXPBIDCJH6757VA/graph.json","fetch_events":"https://pith.science/api/pith-number/VINPGWOX7W7LXPBIDCJH6757VA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA/action/storage_attestation","attest_author":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA/action/author_attestation","sign_citation":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA/action/citation_signature","submit_replication":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA/action/replication_record"}},"created_at":"2026-05-17T23:49:33.820650+00:00","updated_at":"2026-05-17T23:49:33.820650+00:00"}