{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LNXIBIY5SZI3IEWS45NMIOO4TI","short_pith_number":"pith:LNXIBIY5","schema_version":"1.0","canonical_sha256":"5b6e80a31d9651b412d2e75ac439dc9a2593055840a6eb8f4d018db3e9df0320","source":{"kind":"arxiv","id":"1208.1532","version":1},"attestation_state":"computed","paper":{"title":"Methods of computing deque sortable permutations given complete and incomplete information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Daniel Denton","submitted_at":"2012-08-07T21:39:37Z","abstract_excerpt":"The problem of determining which permutations can be sorted using certain switchyard networks dates back to Knuth in 1968. In this work, we are interested in permutations which are sortable on a double-ended queue (called a deque), or on two parallel stacks. In 1982, Rosenstiehl and Tarjan presented an O(n) algorithm for testing whether a given permutation was sortable on parallel stacks. In the same paper, they also presented a modification giving O(n) test for sortability on a deque. We demonstrate a slight error in the version of their algorithm for testing deque sortability, and present a "},"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":"1208.1532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-07T21:39:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"93216491e644c889ae24554eee500fd23a9df92295bcddef843d2c6303564660","abstract_canon_sha256":"993080b6cb8361bf16ac5c28176f19144203d07eb5e8208dabf36a5163c48a51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:45.994452Z","signature_b64":"u7ZwYga7ffWEaQYP3iiWlAqdb6v16FMeu+os5WeUn6xl4cfLT60N2zsv40phnbob1zuTxDMN2HB4Q/9aznLpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b6e80a31d9651b412d2e75ac439dc9a2593055840a6eb8f4d018db3e9df0320","last_reissued_at":"2026-05-18T03:48:45.993794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:45.993794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Methods of computing deque sortable permutations given complete and incomplete information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Daniel Denton","submitted_at":"2012-08-07T21:39:37Z","abstract_excerpt":"The problem of determining which permutations can be sorted using certain switchyard networks dates back to Knuth in 1968. In this work, we are interested in permutations which are sortable on a double-ended queue (called a deque), or on two parallel stacks. In 1982, Rosenstiehl and Tarjan presented an O(n) algorithm for testing whether a given permutation was sortable on parallel stacks. In the same paper, they also presented a modification giving O(n) test for sortability on a deque. We demonstrate a slight error in the version of their algorithm for testing deque sortability, and present a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1532","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":"1208.1532","created_at":"2026-05-18T03:48:45.993881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1532v1","created_at":"2026-05-18T03:48:45.993881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1532","created_at":"2026-05-18T03:48:45.993881+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNXIBIY5SZI3","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNXIBIY5SZI3IEWS","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNXIBIY5","created_at":"2026-05-18T12:27:14.488303+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/LNXIBIY5SZI3IEWS45NMIOO4TI","json":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI.json","graph_json":"https://pith.science/api/pith-number/LNXIBIY5SZI3IEWS45NMIOO4TI/graph.json","events_json":"https://pith.science/api/pith-number/LNXIBIY5SZI3IEWS45NMIOO4TI/events.json","paper":"https://pith.science/paper/LNXIBIY5"},"agent_actions":{"view_html":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI","download_json":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI.json","view_paper":"https://pith.science/paper/LNXIBIY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1532&json=true","fetch_graph":"https://pith.science/api/pith-number/LNXIBIY5SZI3IEWS45NMIOO4TI/graph.json","fetch_events":"https://pith.science/api/pith-number/LNXIBIY5SZI3IEWS45NMIOO4TI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/action/storage_attestation","attest_author":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/action/author_attestation","sign_citation":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/action/citation_signature","submit_replication":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/action/replication_record"}},"created_at":"2026-05-18T03:48:45.993881+00:00","updated_at":"2026-05-18T03:48:45.993881+00:00"}