Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T10:29:43.256693Z
Paper Citation Record · LEDGER
Sorting by pile shuffles on queue-like and stack-like piles can be hard
As of 8 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2506.05518.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
25 of 25 outbound references displayed
- verified exact1
- verified fuzzy19
- unresolved3
- parse uncertain0
- malformed identifier2
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 48dc107e-680b-4a01-a36a-07bc81b177ab · outbound
This paper cites an unresolved cited work.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Unresolved cited work
Reference 1
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T10:29:43.941745Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4c958027-02c7-41bf-a3fa-3b53e20a0404 · outbound
This paper cites chain disqualified.
Sorting by pile shuffles on queue-like and stack-like piles can be hard chain disqualified
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.927101Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 811e009d-e9f7-4c8a-a1bf-25ba3e346362 · outbound
This paper cites virtual piles.
Sorting by pile shuffles on queue-like and stack-like piles can be hard virtual piles
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.955393Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation da77ff1f-7f01-4e81-9c50-dd6c5ae29261 · outbound
This paper cites an unresolved cited work.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Unresolved cited work
Reference 4
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T10:29:43.913568Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 91dffe74-4f1b-4b82-aadc-ce9fc6ebb62b · outbound
This paper cites Proof.We start with the first case.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Proof.We start with the first case
Reference 5
- Resolution
- malformed identifier
- raw_fallback, observed 2026-08-07T10:29:43.899599Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6a7b8b3e-d10a-47a7-bb18-d84396e3a399 · outbound
This paper cites an unresolved cited work.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Unresolved cited work
Reference 6
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T10:29:43.884943Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8a312ea0-62ae-4555-9202-83e5cd21804c · outbound
This paper cites penalize.
Sorting by pile shuffles on queue-like and stack-like piles can be hard penalize
Reference 7
- Resolution
- malformed identifier
- raw_fallback, observed 2026-08-07T10:29:43.869012Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e4bb33e3-e54c-44cf-a470-38dc61d861d6 · outbound
This paper cites Analysis of casino shelf shuffling machines.The Annals of Applied Probability, 23(4):1692 – 1720, 2013.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Analysis of casino shelf shuffling machines.The Annals of Applied Probability, 23(4):1692 – 1720, 2013
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.838533Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation fe8fed5f-ad16-4c5c-89a7-5cc235b434b2 · outbound
This paper cites Kyle Petersen.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Kyle Petersen
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.820888Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 63f1623c-b0d4-4491-a45e-71622fa4efae · outbound
This paper cites Treleaven.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Treleaven
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.793619Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 3da8aac1-7977-46ca-a9e9-dfd321f5a75d · outbound
This paper cites Knuth.The art of computer programming, volume 3: (2nd ed.) sorting and searching.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Knuth.The art of computer programming, volume 3: (2nd ed.) sorting and searching
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.771945Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e71f13bd-41ab-4d87-83bb-f7758a35440a · outbound
This paper cites Patience is a virtue: Revisiting merge and sort on modern processors.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Patience is a virtue: Revisiting merge and sort on modern processors
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.743502Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 86a27a6a-e8ba-4fef-b4c4-2697ad3a927c · outbound
This paper cites Combinatorics of patience sorting piles.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Combinatorics of patience sorting piles
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.715309Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f218a445-ebdb-41c4-9018-729813946af3 · outbound
This paper cites A survey of stack-sorting disciplines.The Electronic Journal of Combi- natorics, pages A1–A1, 2002.
Sorting by pile shuffles on queue-like and stack-like piles can be hard A survey of stack-sorting disciplines.The Electronic Journal of Combi- natorics, pages A1–A1, 2002
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.690298Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a25287ed-26a4-484f-9269-afa15b97266d · outbound
This paper cites Sorting using networks of queues and stacks.Journal of the ACM (JACM), 19(2):341–346, April 1972.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Sorting using networks of queues and stacks.Journal of the ACM (JACM), 19(2):341–346, April 1972
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.668576Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ed089a73-ad14-41bc-b8c0-4cad60d1f570 · outbound
This paper cites The complexity of sorting with networks of stacks and queues.
Sorting by pile shuffles on queue-like and stack-like piles can be hard The complexity of sorting with networks of stacks and queues
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.646394Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a56e5f33-af2c-4522-9f90-ccd241710ed0 · outbound
This paper cites Sorting Permutations Via Shuffles.SSRN Electronic Journal, 2023.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Sorting Permutations Via Shuffles.SSRN Electronic Journal, 2023
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.621253Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a0a1e34c-fa5b-4cd0-951b-798027583217 · outbound
This paper cites Sorting by shuffling methods and a queue.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Sorting by shuffling methods and a queue
Reference 18
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T10:29:43.398019Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8a081681-9259-476d-8a97-34e1f8477229 · outbound
This paper cites Gates and Christos H.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Gates and Christos H
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.598150Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a7b5b55c-9194-4eff-931b-c964836cc70a · outbound
This paper cites Gargano, U.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Gargano, U
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.575708Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b04db477-e864-4fa7-80e6-58ff4376aaa3 · outbound
This paper cites Disjoint paths routing in pancake graphs.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Disjoint paths routing in pancake graphs
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.547178Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f6dee970-5ae8-4da7-82c1-2941756a193c · outbound
This paper cites Pancake flipping is hard.Journal of Computer and System Sciences, 81(8):1556–1574, 2015.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Pancake flipping is hard.Journal of Computer and System Sciences, 81(8):1556–1574, 2015
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.520196Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 01bcb4e1-e583-4806-a1f6-c2aecfb8b68f · outbound
This paper cites Chapman and Hall/CRC, Boca Raton, Fla., 1st edition edition, June 2004.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Chapman and Hall/CRC, Boca Raton, Fla., 1st edition edition, June 2004
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.494470Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 21c059d2-6082-4628-b052-1ed08862e630 · outbound
This paper cites Stirling-euler-mahonian triples of permutation statistics.arXiv e- prints, pages arXiv–2305, 2023.
Sorting by pile shuffles on queue-like and stack-like piles can be hard Stirling-euler-mahonian triples of permutation statistics.arXiv e- prints, pages arXiv–2305, 2023
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.466425Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e22b5551-3c83-4d82-b8f0-758ed18d59ed · outbound
This paper cites easiest” classes of problems that is considered “hard.
Sorting by pile shuffles on queue-like and stack-like piles can be hard easiest” classes of problems that is considered “hard
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T10:29:43.428986Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Pith citing papers
No inbound Pith citation observations are available.