{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LNXIBIY5SZI3IEWS45NMIOO4TI","short_pith_number":"pith:LNXIBIY5","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"},"canonical_sha256":"5b6e80a31d9651b412d2e75ac439dc9a2593055840a6eb8f4d018db3e9df0320","source":{"kind":"arxiv","id":"1208.1532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1532","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1532v1","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1532","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"LNXIBIY5SZI3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LNXIBIY5SZI3IEWS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LNXIBIY5","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LNXIBIY5SZI3IEWS45NMIOO4TI","target":"record","payload":{"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"},"canonical_sha256":"5b6e80a31d9651b412d2e75ac439dc9a2593055840a6eb8f4d018db3e9df0320","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"},"source_kind":"arxiv","source_id":"1208.1532","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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvVZ2wpSEtrpNtBIYmGNLfgYClVOWsJO53VW8M9u6iPs0iW3g3N7TPFjkY6j0qm3UPE+dQwpdRuANaCOZJ0hDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:24:55.471540Z"},"content_sha256":"0c6eff01ac61efe201daba6f750b83af18516a3fd69e37a9f5800d3ab250b60c","schema_version":"1.0","event_id":"sha256:0c6eff01ac61efe201daba6f750b83af18516a3fd69e37a9f5800d3ab250b60c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LNXIBIY5SZI3IEWS45NMIOO4TI","target":"graph","payload":{"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"},"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:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uaD6nJcIMxfNt4PYsWWXqWGOwTUWX2x3Ntr4GtVhpIjl/De05/DUGiu5geAorN1IIPosFpN2fWs2P6A2A1sVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:24:55.472008Z"},"content_sha256":"1ac82c279bbe70c2c357b4c41f3618abb94806dc3096bf31d19225053eac2fb7","schema_version":"1.0","event_id":"sha256:1ac82c279bbe70c2c357b4c41f3618abb94806dc3096bf31d19225053eac2fb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/bundle.json","state_url":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/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-24T08:24:55Z","links":{"resolver":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI","bundle":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/bundle.json","state":"https://pith.science/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNXIBIY5SZI3IEWS45NMIOO4TI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LNXIBIY5SZI3IEWS45NMIOO4TI","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":"993080b6cb8361bf16ac5c28176f19144203d07eb5e8208dabf36a5163c48a51","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-07T21:39:37Z","title_canon_sha256":"93216491e644c889ae24554eee500fd23a9df92295bcddef843d2c6303564660"},"schema_version":"1.0","source":{"id":"1208.1532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1532","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1532v1","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1532","created_at":"2026-05-18T03:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"LNXIBIY5SZI3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LNXIBIY5SZI3IEWS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LNXIBIY5","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:1ac82c279bbe70c2c357b4c41f3618abb94806dc3096bf31d19225053eac2fb7","target":"graph","created_at":"2026-05-18T03:48:45Z","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":"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 ","authors_text":"Daniel Denton","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-07T21:39:37Z","title":"Methods of computing deque sortable permutations given complete and incomplete information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1532","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:0c6eff01ac61efe201daba6f750b83af18516a3fd69e37a9f5800d3ab250b60c","target":"record","created_at":"2026-05-18T03:48:45Z","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":"993080b6cb8361bf16ac5c28176f19144203d07eb5e8208dabf36a5163c48a51","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-07T21:39:37Z","title_canon_sha256":"93216491e644c889ae24554eee500fd23a9df92295bcddef843d2c6303564660"},"schema_version":"1.0","source":{"id":"1208.1532","kind":"arxiv","version":1}},"canonical_sha256":"5b6e80a31d9651b412d2e75ac439dc9a2593055840a6eb8f4d018db3e9df0320","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b6e80a31d9651b412d2e75ac439dc9a2593055840a6eb8f4d018db3e9df0320","first_computed_at":"2026-05-18T03:48:45.993794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:45.993794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u7ZwYga7ffWEaQYP3iiWlAqdb6v16FMeu+os5WeUn6xl4cfLT60N2zsv40phnbob1zuTxDMN2HB4Q/9aznLpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:45.994452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c6eff01ac61efe201daba6f750b83af18516a3fd69e37a9f5800d3ab250b60c","sha256:1ac82c279bbe70c2c357b4c41f3618abb94806dc3096bf31d19225053eac2fb7"],"state_sha256":"ffd067737a9dda4e52b6dcac66432522c7b55dee5ee38de343a268537be96663"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vF4sxETptCFCvTPhs+u6SfwEu3oQ4fAhwaiefKZHLJzzVCBcwVg8uWChrY3wzM5DraiOxgp0FNbwmIgiDmABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:24:55.474407Z","bundle_sha256":"17f103e002e87bbd66ba56a70b7788a1a5c30a2e90ab923e3ef75d34c7b66c00"}}