{"as_of":"2026-08-12T05:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b0cad98c04c47801a0a3bbbd80bd583e04783ea15cdfc87e0e10fb2be0a6f9c","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T07:25:32.117561Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2604.18626/citation-record","integrity":"/paper/2604.18626/integrity","json":"/paper/2604.18626/citation-record.json","paper":"/paper/2604.18626"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Art of Computer Programming, Volume 1: Fundamental Algorithms","venue":null,"work_id":"b0b6168f-f5c5-439d-bc5b-a811888840b7","year":1973},"citing_paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T07:25:32.117561Z"},"links":{"citing_paper":"/paper/2604.18626"},"observation_digest":"sha256:3811f4699a836c79ee1e0da04842488cbb5a992bec47588ceb75dfca1a87e4e3","observation_id":"d48bab3a-8b16-4035-ae08-8669b9f3c3d6","resolution":{"observed_at":"2026-05-21T13:40:13.174986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Permutations with restricted subsequences and stack-sortable permutations","venue":null,"work_id":"1fefdf56-b0bc-4cbc-9203-df2fc0786d49","year":1990},"citing_paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T07:25:32.117561Z"},"links":{"citing_paper":"/paper/2604.18626"},"observation_digest":"sha256:6886f129fd2ac588430a4d64b87e8a64425bc8cec51e1cbfc24fa584e9a16016","observation_id":"d4fa46c8-e1e7-49d9-b7a5-c79b16f1756d","resolution":{"observed_at":"2026-05-21T13:40:13.171225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.105230","doi":"10.1016/j.jcta.2020.105230","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Stack Sorting with Restricted Stacks","venue":"Journal of Combinatorial Theory Series A","work_id":"be4ff99b-8435-4fb5-b87f-cd009d5955cf","year":2020},"citing_paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T07:25:32.117561Z"},"links":{"citing_paper":"/paper/2604.18626"},"observation_digest":"sha256:09862ade15faea42d6818415d79e120176dc11c0f0db6786c84db617cbc31f4d","observation_id":"d8e216a4-fd88-43f9-96d4-3a0a152da782","resolution":{"observed_at":"2026-05-10T07:26:59.047155Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.102192","doi":"10.1016/j.aam.2021.102192","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Stack-Sorting with Consecutive-Pattern- Avoiding Stacks","venue":"Advances in Applied Mathematics","work_id":"22478177-e63b-4d6f-9ee5-77ad401420f1","year":2021},"citing_paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T07:25:32.117561Z"},"links":{"citing_paper":"/paper/2604.18626"},"observation_digest":"sha256:d751927d04f4b7fd43ad4e90f442066395570d5ed8cd66d661e5efda60c35a2e","observation_id":"52c5a7f9-4264-446b-b6c5-0755bd2d729a","resolution":{"observed_at":"2026-05-10T07:26:59.049895Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.05868","last_updated":"2023-08-10T22:42:55Z","snapshot_observed_at":"2026-08-07T01:24:37.905138Z","submitted_at":"2023-08-10T22:42:55Z","title":"Periodic Points of Consecutive-Pattern-Avoiding Stack-Sorting Maps","version":1},"cited_work":{"arxiv_id":"2308.05868","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.05868","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Periodic Points of Consecutive-Pattern-Avoiding Stack-Sorting Maps","venue":null,"work_id":"9198bca6-b886-4110-b9e7-e827a8b8ca36","year":2023},"citing_paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T07:25:32.117561Z"},"links":{"cited_paper":"/paper/2308.05868","citing_paper":"/paper/2604.18626"},"observation_digest":"sha256:4c12efe2eed3ddd9b8cebb89e547196a3aa3b965c02534fb2e1cd2d1dde8eef5","observation_id":"863e84d7-1e0b-40f4-b139-3d57bc023505","resolution":{"observed_at":"2026-05-10T07:26:59.472416Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.17057","last_updated":"2024-10-19T05:19:54Z","snapshot_observed_at":"2026-08-06T10:38:08.276459Z","submitted_at":"2024-10-19T05:19:54Z","title":"Stack-sorting with Stacks Avoiding Vincular Patterns","version":1},"cited_work":{"arxiv_id":"2410.17057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.17057","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stack-Sorting with Stacks Avoiding Vincular Patterns","venue":null,"work_id":"aa06271a-c577-48e3-a78a-14f0e233308f","year":2024},"citing_paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T07:25:32.117561Z"},"links":{"cited_paper":"/paper/2410.17057","citing_paper":"/paper/2604.18626"},"observation_digest":"sha256:228b02a255c043f518313340ce92a1cd68102d3ab6a02c81a3d0f9a34e8a3ab2","observation_id":"6559695a-3976-4220-bfc7-3884ce30ee57","resolution":{"observed_at":"2026-05-10T07:26:59.474799Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05378","last_updated":"2024-09-15T19:59:56Z","snapshot_observed_at":"2026-07-06T18:59:05.329809Z","submitted_at":"2024-08-09T23:14:30Z","title":"Fertility Numbers of Consecutive $S_3$ Pattern-Avoiding Stack-Sorting maps","version":2},"cited_work":{"arxiv_id":"2408.05378","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.05378","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fertility Numbers of Consecutive S3 Pattern-Avoiding Stack-Sorting Maps","venue":null,"work_id":"a03ac526-22d1-4acf-b8aa-c92365e2966c","year":2024},"citing_paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T07:25:32.117561Z"},"links":{"cited_paper":"/paper/2408.05378","citing_paper":"/paper/2604.18626"},"observation_digest":"sha256:68e063beacd815b4e3ef697317d11d2b9ab43071183ab6fb24a4a2791c9ac408","observation_id":"36d23a3e-9cb1-4ed8-a82e-753d9b359db3","resolution":{"observed_at":"2026-05-10T07:26:59.477395Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Shuffle a given Array Using Fisher–Yates Shuffle Algorithm","venue":null,"work_id":"0e8b9f0d-1520-4f6f-aae9-814639fdaefc","year":2012},"citing_paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T07:25:32.117561Z"},"links":{"citing_paper":"/paper/2604.18626"},"observation_digest":"sha256:b0d3ca3ac41458bb73bcfe92cbf1cd2e57d8a8438e598d107aafa6351a162477","observation_id":"0aefd302-f19b-4311-9cdf-de548368163c","resolution":{"observed_at":"2026-05-21T13:40:13.169014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Sc231 Stats v2","venue":null,"work_id":"bf5b6ebf-8eb5-48ef-b407-16dc26f30d03","year":2026},"citing_paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T07:25:32.117561Z"},"links":{"citing_paper":"/paper/2604.18626"},"observation_digest":"sha256:670d65c9d777858318a8dfd92f314ae67271aa33ec83a6e74f8fc0bba793280e","observation_id":"d4dbdd7d-3a80-445d-8635-7baa7e5baa36","resolution":{"observed_at":"2026-05-21T13:40:13.173032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.18626","last_updated":"2026-04-18T05:08:53Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-09T19:56:07.825533Z","submitted_at":"2026-04-18T05:08:53Z","title":"Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":5,"verified_fuzzy":4},"total_outbound_references":9},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2604.18626."}