{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W2N5KZFZ7NA2SX35ERR3FT52DA","short_pith_number":"pith:W2N5KZFZ","schema_version":"1.0","canonical_sha256":"b69bd564b9fb41a95f7d2463b2cfba1801a93a05aefc9bd904c0614fca344f7e","source":{"kind":"arxiv","id":"1303.4376","version":1},"attestation_state":"computed","paper":{"title":"2-stack pushall sortable permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Adeline Pierrot (LIAFA), Dominique Rossin (LIX)","submitted_at":"2013-03-18T19:44:45Z","abstract_excerpt":"In the 60's, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out of the work of Knuth: how to decide efficiently if a given permutation is sortable with 2 stacks in series? Whether this problem is polynomial or NP-complete is still unanswered yet. In this article we introduce 2-stack pushall permutations which form a subclass of 2-stack sortable permutations and show that these two classes are closely related. Moreover, we give an optimal O(n^2) algorithm to decide if a given permutation of size n is 2-stack pushall sortable and d"},"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":"1303.4376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-18T19:44:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"80863b4bee07074b3de69347bf828aa5f6e3cc1a554e33c83853e20a4efcfa18","abstract_canon_sha256":"327711e3874c95193cd0fdc6896f807784728539670f441db4f1e50395fdd46e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:27.356221Z","signature_b64":"+3j0B9C+TVW6CfgdAO2eTLs0Dw0fzkKTZeJXTG61Mms2UbUAjykCmHX2bxrVoVgv9LbfSAiZzIos8ru3pezWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b69bd564b9fb41a95f7d2463b2cfba1801a93a05aefc9bd904c0614fca344f7e","last_reissued_at":"2026-05-18T03:30:27.355526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:27.355526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-stack pushall sortable permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Adeline Pierrot (LIAFA), Dominique Rossin (LIX)","submitted_at":"2013-03-18T19:44:45Z","abstract_excerpt":"In the 60's, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out of the work of Knuth: how to decide efficiently if a given permutation is sortable with 2 stacks in series? Whether this problem is polynomial or NP-complete is still unanswered yet. In this article we introduce 2-stack pushall permutations which form a subclass of 2-stack sortable permutations and show that these two classes are closely related. Moreover, we give an optimal O(n^2) algorithm to decide if a given permutation of size n is 2-stack pushall sortable and d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4376","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.4376","created_at":"2026-05-18T03:30:27.355659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4376v1","created_at":"2026-05-18T03:30:27.355659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4376","created_at":"2026-05-18T03:30:27.355659+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2N5KZFZ7NA2","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2N5KZFZ7NA2SX35","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2N5KZFZ","created_at":"2026-05-18T12:28:04.890932+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/W2N5KZFZ7NA2SX35ERR3FT52DA","json":"https://pith.science/pith/W2N5KZFZ7NA2SX35ERR3FT52DA.json","graph_json":"https://pith.science/api/pith-number/W2N5KZFZ7NA2SX35ERR3FT52DA/graph.json","events_json":"https://pith.science/api/pith-number/W2N5KZFZ7NA2SX35ERR3FT52DA/events.json","paper":"https://pith.science/paper/W2N5KZFZ"},"agent_actions":{"view_html":"https://pith.science/pith/W2N5KZFZ7NA2SX35ERR3FT52DA","download_json":"https://pith.science/pith/W2N5KZFZ7NA2SX35ERR3FT52DA.json","view_paper":"https://pith.science/paper/W2N5KZFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4376&json=true","fetch_graph":"https://pith.science/api/pith-number/W2N5KZFZ7NA2SX35ERR3FT52DA/graph.json","fetch_events":"https://pith.science/api/pith-number/W2N5KZFZ7NA2SX35ERR3FT52DA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2N5KZFZ7NA2SX35ERR3FT52DA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2N5KZFZ7NA2SX35ERR3FT52DA/action/storage_attestation","attest_author":"https://pith.science/pith/W2N5KZFZ7NA2SX35ERR3FT52DA/action/author_attestation","sign_citation":"https://pith.science/pith/W2N5KZFZ7NA2SX35ERR3FT52DA/action/citation_signature","submit_replication":"https://pith.science/pith/W2N5KZFZ7NA2SX35ERR3FT52DA/action/replication_record"}},"created_at":"2026-05-18T03:30:27.355659+00:00","updated_at":"2026-05-18T03:30:27.355659+00:00"}