{"as_of":"2026-08-09T08:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb5e994a33647150ffb8bf5ae749bfc1d7bab28c0b6075e8141909e3e3ff0ea9","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:29:43.256693Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.05518/citation-record","integrity":"/paper/2506.05518/integrity","json":"/paper/2506.05518/citation-record.json","paper":"/paper/2506.05518"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.936590Z","title":null,"venue":null,"work_id":"70da46e8-bfca-4b60-a7be-29399285250c","year":null},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:10.370413Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:adc52ec2a032780e11d7c591181b287cb2760b65813b72782a423af41a0a66b1","observation_id":"48dc107e-680b-4a01-a36a-07bc81b177ab","resolution":{"observed_at":"2026-08-07T10:29:43.941745Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.922778Z","title":"chain disqualified","venue":null,"work_id":"bd1e5ada-735e-4b4e-8b2c-3554916ccbd7","year":null},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:10.475409Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:17c4654af19a1bc753a87aeb44f08ae8ec4fda08a69b021fcf68e8c75db75f43","observation_id":"4c958027-02c7-41bf-a3fa-3b53e20a0404","resolution":{"observed_at":"2026-08-07T10:29:43.927101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.951083Z","title":"virtual piles","venue":null,"work_id":"bdd05a21-3406-4caf-88b8-8b5df48f9a8f","year":null},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:10.293743Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:bfdac4a96202cfec9ee056e0ca209dcb5efa2f2fd5b8c417c3695860d4f4a92a","observation_id":"811e009d-e9f7-4c8a-a1bf-25ba3e346362","resolution":{"observed_at":"2026-08-07T10:29:43.955393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.909104Z","title":null,"venue":null,"work_id":"333409e0-510c-4a29-abcc-00fba322a753","year":null},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:10.546454Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:f0bfbc809b42495f18649cf546e853dd1ce24bdddbe5d1f5050efbd51390b7e4","observation_id":"da77ff1f-7f01-4e81-9c50-dd6c5ae29261","resolution":{"observed_at":"2026-08-07T10:29:43.913568Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.893646Z","title":"Proof.We start with the first case","venue":null,"work_id":"15c8fe57-54d9-4500-b6b1-9a20d84a639f","year":null},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:10.619695Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:55708828714a8b4eeeab61b43810bcb12acdbc2e0bc5363ae711097c149f0871","observation_id":"91dffe74-4f1b-4b82-aadc-ce9fc6ebb62b","resolution":{"observed_at":"2026-08-07T10:29:43.899599Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.880787Z","title":null,"venue":null,"work_id":"c90a1d1a-7a7f-42f5-88f5-206550017dfc","year":null},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:10.690209Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:790ccc4a08488f5f4a9fb4e363ec18490dbd74e4cc44f3cadde9445b7d5bb78f","observation_id":"6a7b8b3e-d10a-47a7-bb18-d84396e3a399","resolution":{"observed_at":"2026-08-07T10:29:43.884943Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.857944Z","title":"penalize","venue":null,"work_id":"e82a9011-1f6d-4a3c-bdd6-56a8c5123b40","year":null},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:10.781596Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:b10a26d7e65d001d095c6f932fda93219c12a86cb6ee0307ed94eca06d672691","observation_id":"8a312ea0-62ae-4555-9202-83e5cd21804c","resolution":{"observed_at":"2026-08-07T10:29:43.869012Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.830817Z","title":"Analysis of casino shelf shuffling machines.The Annals of Applied Probability, 23(4):1692 – 1720, 2013","venue":null,"work_id":"acb1cbd7-396b-4ae2-932f-888822e0cbd5","year":2013},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:10.881785Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:848056bb9bd3e31d74aad18cf9597cd33a518fbfb999dbab11ad3ca5e30cc623","observation_id":"e4bb33e3-e54c-44cf-a470-38dc61d861d6","resolution":{"observed_at":"2026-08-07T10:29:43.838533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.807528Z","title":"Kyle Petersen","venue":null,"work_id":"4b54f37f-d066-4456-b7d7-6115c818656e","year":2021},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:10.944999Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:0ed9695ffd9baeaff38d05203159af7a1172a0dd06132b6bc8cc3033db780c7f","observation_id":"fe8fed5f-ad16-4c5c-89a7-5cc235b434b2","resolution":{"observed_at":"2026-08-07T10:29:43.820888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.784991Z","title":"Treleaven","venue":null,"work_id":"8b70f5f1-3b24-4504-9e11-d6a826e5b8a1","year":2025},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:11.023624Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:4b019ca67a68117753976195dd0c390ab8ef521dc1a98c29f3edf34c268e82a8","observation_id":"63f1623c-b0d4-4491-a45e-71622fa4efae","resolution":{"observed_at":"2026-08-07T10:29:43.793619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.760014Z","title":"Knuth.The art of computer programming, volume 3: (2nd ed.) sorting and searching","venue":null,"work_id":"f23e51ee-4938-4f3b-b879-09ea7ac6df66","year":1998},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:11.085348Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:25d425fa3b3f4db90e7f6df209a5a0e6da27ba62fe23998f6353907687ee6424","observation_id":"3da8aac1-7977-46ca-a9e9-dfd321f5a75d","resolution":{"observed_at":"2026-08-07T10:29:43.771945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.729883Z","title":"Patience is a virtue: Revisiting merge and sort on modern processors","venue":null,"work_id":"a4b0d41d-a7a4-4018-86d0-f159869ae470","year":2014},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.455385Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:17d603ac9e96dcf5e655e46dc10b6e54c3e420feaee22dafbb5e2279a88bdab8","observation_id":"e71f13bd-41ab-4d87-83bb-f7758a35440a","resolution":{"observed_at":"2026-08-07T10:29:43.743502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.705240Z","title":"Combinatorics of patience sorting piles","venue":null,"work_id":"8a97826a-ca16-4ab6-bf58-bbffc4f9d15f","year":2006},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.469029Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:8f64fecb6f2e1ea89b1916a5920307735ce24320951030f6b4beb0fd0e801868","observation_id":"86a27a6a-e8ba-4fef-b4c4-2697ad3a927c","resolution":{"observed_at":"2026-08-07T10:29:43.715309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.682998Z","title":"A survey of stack-sorting disciplines.The Electronic Journal of Combi- natorics, pages A1–A1, 2002","venue":null,"work_id":"f55b220b-a625-4074-9faa-ddd8b131229d","year":2002},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.512450Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:d4e08b7ae11aedbe7f0abf2504fa3fb6da582cb7e2a72064b55a4bd625a38733","observation_id":"f218a445-ebdb-41c4-9018-729813946af3","resolution":{"observed_at":"2026-08-07T10:29:43.690298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.660427Z","title":"Sorting using networks of queues and stacks.Journal of the ACM (JACM), 19(2):341–346, April 1972","venue":null,"work_id":"19bd8b8e-e50c-4732-9cd9-141025d3eac9","year":1972},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.561306Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:8e2dd0ce2e4ec37a9587d01553c3e5b492334177aa56bfc4a62a69102fe4886c","observation_id":"a25287ed-26a4-484f-9269-afa15b97266d","resolution":{"observed_at":"2026-08-07T10:29:43.668576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.634087Z","title":"The complexity of sorting with networks of stacks and queues","venue":null,"work_id":"bf8e2551-9142-4193-82f3-f1597927e549","year":2008},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.638732Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:0ebd51abc69b68fba1ae786d236f9bcc4f84b1016c5b013e56f28b6af653356a","observation_id":"ed089a73-ad14-41bc-b8c0-4cad60d1f570","resolution":{"observed_at":"2026-08-07T10:29:43.646394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.611990Z","title":"Sorting Permutations Via Shuffles.SSRN Electronic Journal, 2023","venue":null,"work_id":"1249856e-5498-423b-b6c0-bf8d3b2347a5","year":2023},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.738292Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:93e3221bf8475982c23f10fba4887294224c63c2336386b4ad40370e76b5a598","observation_id":"a56e5f33-af2c-4522-9f90-ccd241710ed0","resolution":{"observed_at":"2026-08-07T10:29:43.621253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.04332","last_updated":"2022-07-01T23:56:28Z","snapshot_observed_at":"2026-07-06T10:47:35.687539Z","submitted_at":"2021-03-07T11:54:40Z","title":"Sorting by shuffling methods and a queue","version":4},"cited_work":{"arxiv_id":"2103.04332","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.04332","snapshot_observed_at":"2026-08-07T10:29:43.341606Z","title":"Sorting by shuffling methods and a queue","venue":"math.CO","work_id":"5b5a80d0-bf32-4370-aa0f-734e7514d007","year":2021},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.792905Z"},"links":{"cited_paper":"/paper/2103.04332","citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:26b2d9da16bf8f92a85d3ff66f4cf2471f5eec0bee0e478cd96c66701929d9e6","observation_id":"a0a1e34c-fa5b-4cd0-951b-798027583217","resolution":{"observed_at":"2026-08-07T10:29:43.398019Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.589775Z","title":"Gates and Christos H","venue":null,"work_id":"72f73148-c137-4da3-a9ab-6edd79d58c07","year":1979},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.846069Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:81f4267206713877a2946949132fe7aee59a418ba520741aeda68f423f25c432","observation_id":"8a081681-9259-476d-8a97-34e1f8477229","resolution":{"observed_at":"2026-08-07T10:29:43.598150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.565845Z","title":"Gargano, U","venue":null,"work_id":"0afe4f2c-f2de-4984-9ce9-f581d8a7e343","year":1993},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.916378Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:1c2db241701a3cc63ad1d2eda5a1d0b8e06b119ca39995042485394f5ee42197","observation_id":"a7b5b55c-9194-4eff-931b-c964836cc70a","resolution":{"observed_at":"2026-08-07T10:29:43.575708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.536435Z","title":"Disjoint paths routing in pancake graphs","venue":null,"work_id":"21b6071f-3f72-4fe7-be4f-bc783f5c51d1","year":2006},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:42.990575Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:469c7c0a4bb7050c7d76c28f081d2371bd0fb1a4ddf5f7ebfa03f5798522a7f1","observation_id":"b04db477-e864-4fa7-80e6-58ff4376aaa3","resolution":{"observed_at":"2026-08-07T10:29:43.547178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.508520Z","title":"Pancake flipping is hard.Journal of Computer and System Sciences, 81(8):1556–1574, 2015","venue":null,"work_id":"72a7e65d-add0-47de-9a00-23a0b17f3641","year":2015},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:43.059430Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:1639b367a0c369637aae0612b0d2b26bfab54c26795d01717ef747e78160632d","observation_id":"f6dee970-5ae8-4da7-82c1-2941756a193c","resolution":{"observed_at":"2026-08-07T10:29:43.520196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.482780Z","title":"Chapman and Hall/CRC, Boca Raton, Fla., 1st edition edition, June 2004","venue":null,"work_id":"e460d529-e685-43d2-8ee8-70d0f53d6862","year":2004},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:43.097235Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:6d6dee4fef151ba225d20434175042a86ddc303abc7686998808fa5beee650dc","observation_id":"01bcb4e1-e583-4806-a1f6-c2aecfb8b68f","resolution":{"observed_at":"2026-08-07T10:29:43.494470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.449966Z","title":"Stirling-euler-mahonian triples of permutation statistics.arXiv e- prints, pages arXiv–2305, 2023","venue":null,"work_id":"a7ddf61d-eb0c-4496-abf9-2c7c4f7c44b2","year":2023},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:43.133063Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:2fd436e59816ecb7b7a5f998625f7ba2bb41b90f793936d3c7fc31ebb6903f04","observation_id":"21c059d2-6082-4628-b052-1ed08862e630","resolution":{"observed_at":"2026-08-07T10:29:43.466425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:29:43.414603Z","title":"easiest” classes of problems that is considered “hard","venue":null,"work_id":"cb640ee9-e949-4925-aeb1-7c87501a08b8","year":2012},"citing_paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:43.256693Z"},"links":{"citing_paper":"/paper/2506.05518"},"observation_digest":"sha256:3abff146c69a6ada1fff68dbaf6dda95712c9d251e84c70ff5573758d17f4e7f","observation_id":"e22b5551-3c83-4d82-b8f0-758ed18d59ed","resolution":{"observed_at":"2026-08-07T10:29:43.428986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05518","last_updated":"2025-06-05T19:01:31Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T10:17:38.332587Z","submitted_at":"2025-06-05T19:01:31Z","title":"Sorting by pile shuffles on queue-like and stack-like piles can be hard"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":19},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2506.05518."}