{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VINPGWOX7W7LXPBIDCJH6757VA","short_pith_number":"pith:VINPGWOX","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"},"canonical_sha256":"aa1af359d7fdbebbbc2818927f7fbfa83963f227167b4501e63cb5da813facbd","source":{"kind":"arxiv","id":"1710.04978","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04978","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04978v2","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04978","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"VINPGWOX7W7L","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VINPGWOX7W7LXPBI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VINPGWOX","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VINPGWOX7W7LXPBIDCJH6757VA","target":"record","payload":{"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"},"canonical_sha256":"aa1af359d7fdbebbbc2818927f7fbfa83963f227167b4501e63cb5da813facbd","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"},"source_kind":"arxiv","source_id":"1710.04978","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-17T23:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USSNX6wjoSQROCJNfeURoS3r7dQJxNkYAdHS6/f+QPPNhCekEXTtEzJZnJG/xmH2TniWjr5gVFxw/01POWG9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:00:57.206542Z"},"content_sha256":"aba99ad786bbc2b269d619de540c5d4d91221e6a070478ec20fc2fadfdd27068","schema_version":"1.0","event_id":"sha256:aba99ad786bbc2b269d619de540c5d4d91221e6a070478ec20fc2fadfdd27068"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VINPGWOX7W7LXPBIDCJH6757VA","target":"graph","payload":{"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"},"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-17T23:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5yMjCVFO5TYQK6E876+YbVDPlGODpj9+eCdaC9nLexPdodZbaGeFEB1Ie3GQ2n1e6Rmd7MMHuhZ5Swn0H9TCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:00:57.206876Z"},"content_sha256":"fa222c6dccd27afac792da20c84001beed28e2477b46ed664ece9cba70a55201","schema_version":"1.0","event_id":"sha256:fa222c6dccd27afac792da20c84001beed28e2477b46ed664ece9cba70a55201"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA/bundle.json","state_url":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VINPGWOX7W7LXPBIDCJH6757VA/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-20T12:00:57Z","links":{"resolver":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA","bundle":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA/bundle.json","state":"https://pith.science/pith/VINPGWOX7W7LXPBIDCJH6757VA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VINPGWOX7W7LXPBIDCJH6757VA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VINPGWOX7W7LXPBIDCJH6757VA","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":"e2acf94bcc33cf6237307248d8f1d30af4d660b407fc01938e3a42ecf5455093","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-13T15:57:48Z","title_canon_sha256":"4cee75ccc0829349790b0c18a9f383155e3cb73fb957b4250d5f50cdf849818f"},"schema_version":"1.0","source":{"id":"1710.04978","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04978","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04978v2","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04978","created_at":"2026-05-17T23:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"VINPGWOX7W7L","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VINPGWOX7W7LXPBI","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VINPGWOX","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:fa222c6dccd27afac792da20c84001beed28e2477b46ed664ece9cba70a55201","target":"graph","created_at":"2026-05-17T23:49:33Z","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":"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","authors_text":"Anders Claesson, Bjarki \\'Ag\\'ust Gu{\\dh}mundsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-13T15:57:48Z","title":"Enumerating permutations sortable by $k$ passes through a pop-stack"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04978","kind":"arxiv","version":2},"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:aba99ad786bbc2b269d619de540c5d4d91221e6a070478ec20fc2fadfdd27068","target":"record","created_at":"2026-05-17T23:49:33Z","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":"e2acf94bcc33cf6237307248d8f1d30af4d660b407fc01938e3a42ecf5455093","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-13T15:57:48Z","title_canon_sha256":"4cee75ccc0829349790b0c18a9f383155e3cb73fb957b4250d5f50cdf849818f"},"schema_version":"1.0","source":{"id":"1710.04978","kind":"arxiv","version":2}},"canonical_sha256":"aa1af359d7fdbebbbc2818927f7fbfa83963f227167b4501e63cb5da813facbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa1af359d7fdbebbbc2818927f7fbfa83963f227167b4501e63cb5da813facbd","first_computed_at":"2026-05-17T23:49:33.820578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:33.820578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jg01LFcSdNYMW5WKRHlpwxbuU5GDzpT21bb9orKz3vg/VaQMenAfXfv9tcyj8cjDIXC50HGxb45I6QYW+/D6BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:33.821076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04978","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aba99ad786bbc2b269d619de540c5d4d91221e6a070478ec20fc2fadfdd27068","sha256:fa222c6dccd27afac792da20c84001beed28e2477b46ed664ece9cba70a55201"],"state_sha256":"1a2deea830c0b0963fca6042704ce893db23bc829b0ad0c42add99b0f440844c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01mt60Qyx2xMwUSsRrqRtcOs+se7MYEk5QSFQZzFG0JtIMrhcJJdknZUxY7h1WlAhDvTfZ8lnm5gdenn8kTRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T12:00:57.208745Z","bundle_sha256":"69709c1cfe51c14aed2e7e643094f375306c03f6c69f3ee64047c4df7e34f3df"}}