{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SJNOTKRUPVGQ6DAJSJWCTQZRQZ","short_pith_number":"pith:SJNOTKRU","schema_version":"1.0","canonical_sha256":"925ae9aa347d4d0f0c09926c29c33186709f4483e8a4f95e3cd8c5cbee32dfe3","source":{"kind":"arxiv","id":"2506.05518","version":1},"attestation_state":"computed","paper":{"title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Kyle B. Treleaven","submitted_at":"2025-06-05T19:01:31Z","abstract_excerpt":"Inspired by a common technique for shuffling a deck of cards on a table without riffling, we continue the study of a prequel paper on the pile shuffle and its capabilities as a sorting device. We study two sort feasibility problems of general interest concerning pile shuffle, first introduced in the prequel. These problems are characterized by: (1) bounds on the number of sequential rounds of shuffle, and piles created in each round; (2) the use of a heterogeneous mixture of queue-like and stack-like piles, as when each round of shuffle may have a combination of face-up and face-down piles; an"},"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":"2506.05518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-06-05T19:01:31Z","cross_cats_sorted":[],"title_canon_sha256":"2407ac7bca757ee7706f0f2e8d0bbc4319089a6b48d5eb095e9f89130000509a","abstract_canon_sha256":"ef2e6fb678938a586581a062480c7090685310c45fe3f447d2358d8f5a5828c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:04.646092Z","signature_b64":"9Cw8JqrGWVMFIWV7Dp8KIdoxw8/aK+z1VJUhS4VsmcckxFl0QobqJo+E4JjRvIF9LTUzvFDW6fFnOrQebthlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"925ae9aa347d4d0f0c09926c29c33186709f4483e8a4f95e3cd8c5cbee32dfe3","last_reissued_at":"2026-07-05T11:17:04.645593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:04.645593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Kyle B. Treleaven","submitted_at":"2025-06-05T19:01:31Z","abstract_excerpt":"Inspired by a common technique for shuffling a deck of cards on a table without riffling, we continue the study of a prequel paper on the pile shuffle and its capabilities as a sorting device. We study two sort feasibility problems of general interest concerning pile shuffle, first introduced in the prequel. These problems are characterized by: (1) bounds on the number of sequential rounds of shuffle, and piles created in each round; (2) the use of a heterogeneous mixture of queue-like and stack-like piles, as when each round of shuffle may have a combination of face-up and face-down piles; an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05518","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.05518/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.05518","created_at":"2026-07-05T11:17:04.645653+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.05518v1","created_at":"2026-07-05T11:17:04.645653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05518","created_at":"2026-07-05T11:17:04.645653+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJNOTKRUPVGQ","created_at":"2026-07-05T11:17:04.645653+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJNOTKRUPVGQ6DAJ","created_at":"2026-07-05T11:17:04.645653+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJNOTKRU","created_at":"2026-07-05T11:17:04.645653+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/SJNOTKRUPVGQ6DAJSJWCTQZRQZ","json":"https://pith.science/pith/SJNOTKRUPVGQ6DAJSJWCTQZRQZ.json","graph_json":"https://pith.science/api/pith-number/SJNOTKRUPVGQ6DAJSJWCTQZRQZ/graph.json","events_json":"https://pith.science/api/pith-number/SJNOTKRUPVGQ6DAJSJWCTQZRQZ/events.json","paper":"https://pith.science/paper/SJNOTKRU"},"agent_actions":{"view_html":"https://pith.science/pith/SJNOTKRUPVGQ6DAJSJWCTQZRQZ","download_json":"https://pith.science/pith/SJNOTKRUPVGQ6DAJSJWCTQZRQZ.json","view_paper":"https://pith.science/paper/SJNOTKRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.05518&json=true","fetch_graph":"https://pith.science/api/pith-number/SJNOTKRUPVGQ6DAJSJWCTQZRQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SJNOTKRUPVGQ6DAJSJWCTQZRQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJNOTKRUPVGQ6DAJSJWCTQZRQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJNOTKRUPVGQ6DAJSJWCTQZRQZ/action/storage_attestation","attest_author":"https://pith.science/pith/SJNOTKRUPVGQ6DAJSJWCTQZRQZ/action/author_attestation","sign_citation":"https://pith.science/pith/SJNOTKRUPVGQ6DAJSJWCTQZRQZ/action/citation_signature","submit_replication":"https://pith.science/pith/SJNOTKRUPVGQ6DAJSJWCTQZRQZ/action/replication_record"}},"created_at":"2026-07-05T11:17:04.645653+00:00","updated_at":"2026-07-05T11:17:04.645653+00:00"}