{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3FR5MHRLERQO2PWUSKHU2KUKMC","short_pith_number":"pith:3FR5MHRL","canonical_record":{"source":{"id":"1304.2860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T07:20:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"03fa7fd9de99d75b24d836cfe82c22c5f6678bd2475fa993a78909fa2760a6df","abstract_canon_sha256":"7df834b038cf950f17cb9713d3e13180f27722705b30190e0d6aa1a436dbce72"},"schema_version":"1.0"},"canonical_sha256":"d963d61e2b2460ed3ed4928f4d2a8a60b2fc431f1d38a130fbf95c3d6189e395","source":{"kind":"arxiv","id":"1304.2860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2860","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2860v1","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2860","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"3FR5MHRLERQO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3FR5MHRLERQO2PWU","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3FR5MHRL","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3FR5MHRLERQO2PWUSKHU2KUKMC","target":"record","payload":{"canonical_record":{"source":{"id":"1304.2860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T07:20:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"03fa7fd9de99d75b24d836cfe82c22c5f6678bd2475fa993a78909fa2760a6df","abstract_canon_sha256":"7df834b038cf950f17cb9713d3e13180f27722705b30190e0d6aa1a436dbce72"},"schema_version":"1.0"},"canonical_sha256":"d963d61e2b2460ed3ed4928f4d2a8a60b2fc431f1d38a130fbf95c3d6189e395","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:28.097939Z","signature_b64":"vqPo+Y5hR1sgJSlu7kJWefD+9ueRMao8eBXzUIuStcedRc1uj50GHsvvMBtXm2rX6P2q4o8e8+DMwNe862F0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d963d61e2b2460ed3ed4928f4d2a8a60b2fc431f1d38a130fbf95c3d6189e395","last_reissued_at":"2026-05-18T03:28:28.097290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:28.097290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.2860","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-18T03:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94SqZGzUlbbXHmHTfBUWm8BfR6jWjiDPiCO3Ogoyi2mm4GThaEPG58xDM5YORiGlJKNgnpdqw4gd0NOqqeJSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:32:49.145453Z"},"content_sha256":"5074f9c65472d61febc6df121b2df990f2183ca54db3431f60cb742577d0ea32","schema_version":"1.0","event_id":"sha256:5074f9c65472d61febc6df121b2df990f2183ca54db3431f60cb742577d0ea32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3FR5MHRLERQO2PWUSKHU2KUKMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"2-Stack Sorting is polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adeline Pierrot (LIAFA), Dominique Rossin (LIX)","submitted_at":"2013-04-10T07:20:16Z","abstract_excerpt":"In this article, we give a polynomial algorithm to decide whether a given permutation $\\sigma$ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth. He introduced the stack sorting problem as well as permutation patterns which arises naturally when characterizing permutations that can be sorted with one stack. When several stacks in series are considered, few results are known. There are two main different problems. The first one is the complexity of deciding if a permutation is sortable or not, the second one being the character"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2860","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-18T03:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulgMAmgCSqFw/OOY0US9fb5K5lgv7TGzdW7hzEha55ZuhBq1lO3vyCReipRYMy1q2N09WgDIyQq4aHxk9VjvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:32:49.145807Z"},"content_sha256":"48b10de6771ee19eafe663cb55e997cc65f6a4e247972cc73b6ff464c26b71fd","schema_version":"1.0","event_id":"sha256:48b10de6771ee19eafe663cb55e997cc65f6a4e247972cc73b6ff464c26b71fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FR5MHRLERQO2PWUSKHU2KUKMC/bundle.json","state_url":"https://pith.science/pith/3FR5MHRLERQO2PWUSKHU2KUKMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FR5MHRLERQO2PWUSKHU2KUKMC/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-23T16:32:49Z","links":{"resolver":"https://pith.science/pith/3FR5MHRLERQO2PWUSKHU2KUKMC","bundle":"https://pith.science/pith/3FR5MHRLERQO2PWUSKHU2KUKMC/bundle.json","state":"https://pith.science/pith/3FR5MHRLERQO2PWUSKHU2KUKMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FR5MHRLERQO2PWUSKHU2KUKMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3FR5MHRLERQO2PWUSKHU2KUKMC","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":"7df834b038cf950f17cb9713d3e13180f27722705b30190e0d6aa1a436dbce72","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T07:20:16Z","title_canon_sha256":"03fa7fd9de99d75b24d836cfe82c22c5f6678bd2475fa993a78909fa2760a6df"},"schema_version":"1.0","source":{"id":"1304.2860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2860","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2860v1","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2860","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"3FR5MHRLERQO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3FR5MHRLERQO2PWU","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3FR5MHRL","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:48b10de6771ee19eafe663cb55e997cc65f6a4e247972cc73b6ff464c26b71fd","target":"graph","created_at":"2026-05-18T03:28:28Z","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 this article, we give a polynomial algorithm to decide whether a given permutation $\\sigma$ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth. He introduced the stack sorting problem as well as permutation patterns which arises naturally when characterizing permutations that can be sorted with one stack. When several stacks in series are considered, few results are known. There are two main different problems. The first one is the complexity of deciding if a permutation is sortable or not, the second one being the character","authors_text":"Adeline Pierrot (LIAFA), Dominique Rossin (LIX)","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T07:20:16Z","title":"2-Stack Sorting is polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2860","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:5074f9c65472d61febc6df121b2df990f2183ca54db3431f60cb742577d0ea32","target":"record","created_at":"2026-05-18T03:28:28Z","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":"7df834b038cf950f17cb9713d3e13180f27722705b30190e0d6aa1a436dbce72","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T07:20:16Z","title_canon_sha256":"03fa7fd9de99d75b24d836cfe82c22c5f6678bd2475fa993a78909fa2760a6df"},"schema_version":"1.0","source":{"id":"1304.2860","kind":"arxiv","version":1}},"canonical_sha256":"d963d61e2b2460ed3ed4928f4d2a8a60b2fc431f1d38a130fbf95c3d6189e395","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d963d61e2b2460ed3ed4928f4d2a8a60b2fc431f1d38a130fbf95c3d6189e395","first_computed_at":"2026-05-18T03:28:28.097290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:28.097290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vqPo+Y5hR1sgJSlu7kJWefD+9ueRMao8eBXzUIuStcedRc1uj50GHsvvMBtXm2rX6P2q4o8e8+DMwNe862F0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:28.097939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5074f9c65472d61febc6df121b2df990f2183ca54db3431f60cb742577d0ea32","sha256:48b10de6771ee19eafe663cb55e997cc65f6a4e247972cc73b6ff464c26b71fd"],"state_sha256":"e5db3d6d3d43ba33200e63627ea364aec306c8a2182b0d5ba836209f2705cc71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqPpOhUOabi0L4S4rIAurRC+X1RzVVjJm1fPSkpaH6JZps8CqX7kyyeWIr6H4bMGp0OB/d8x36fY8MSlXZM+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:32:49.147779Z","bundle_sha256":"0bc2184d8a4c3fb80b266db6fbef2de72238cd00774bea1a7e8b48fbd42754d0"}}