{"as_of":"2026-08-12T06:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93e6fe6ff4d4dbdcc0f268ee43b0dc2c6067a38bcc2801c28aeb390ee229e116","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T18:22:37.626930Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2606.08429/citation-record","integrity":"/paper/2606.08429/integrity","json":"/paper/2606.08429/citation-record.json","paper":"/paper/2606.08429"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T18:22:37.626930Z","title":null,"venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:b9a247fcf0729f8e2c0c8f0641fe62d10db824519537eef2bfc8d45b1ea78c93","observation_id":"9205d79f-a817-478e-a2c6-5b7045556616","resolution":{"observed_at":"2026-06-27T18:22:37.626930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T18:22:37.626930Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:f0ffa8e3b7c349abba35e470f7740173d406de49c5d2001c92d9c1906ac34fc6","observation_id":"1c36ff1d-cb04-4bbd-a154-77a7c883b23d","resolution":{"observed_at":"2026-06-27T18:22:37.626930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T18:22:37.626930Z","title":"5th ed., World Scientific, 2023, pp","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:a50e55c0519cfdcaa57e3f08642d3a7591e0887f18ee3c27f379296e1b9d1fe5","observation_id":"04ac9e0d-1367-4b80-9a44-07bbfde0e471","resolution":{"observed_at":"2026-06-27T18:22:37.626930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0012-365x(92)90351-f","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Proof of Julian West’s Conjecture That the Number of Two-Stacksortable Permutations of Length N Is 2(3n)!/((N + 1)!(2n + 1)!)","venue":"Discrete Mathematics","work_id":"8ea75ef4-020c-4020-aaca-a0ee14cec43f","year":1992},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:464e3a2159e22c6de382adad1c824e2307da273d4d00997b37c38d12c5c776e6","observation_id":"d40b304d-6ea9-468c-8e58-ad3792396520","resolution":{"observed_at":"2026-06-27T18:31:08.221273Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0012-365x(00)00146-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sorted And/or Sortable Permutations","venue":"Discrete Mathematics","work_id":"539a25a1-790f-447e-a8b0-c14f3788e087","year":2000},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:74cd998b4ed143cea2227a86f017ceee67a4d49ce1b7618450054a5495c13c08","observation_id":"6b97b8d7-779d-4fde-abcc-7093ea119b68","resolution":{"observed_at":"2026-06-27T18:31:08.219535Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/dmtcs.3066","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sorting and Preimages of Pattern Classes","venue":"Discrete Mathematics & Theoretical Computer Science","work_id":"6c8ade12-877b-4185-97cf-caa5b71e0f1e","year":2012},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:3c56e4489f4fac20bb08354457db8fd2839f883fd56b837b29c312cce7d59011","observation_id":"187ac46a-a85a-488b-ae8c-6971c110840b","resolution":{"observed_at":"2026-06-27T18:31:08.216307Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4310/joc.2020.v11.n3.a5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Descents in t-Sorted Permutations","venue":"Journal of Combinatorics","work_id":"5ab91ec4-118b-498f-a7ae-bb7c79bf25e8","year":2020},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:0134e2f03947fcb71b39a5fd3c9ef60aa3c08d55a80ce1e1e1f88685e0847f26","observation_id":"4425e626-60dc-4c20-9f34-2c2654f83735","resolution":{"observed_at":"2026-06-27T18:31:08.214669Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.54550/eca2021v1s1r6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Highly Sorted Permutations and Bell Numbers","venue":"Enumerative Combinatorics and Applications","work_id":"9e6dc022-b5d4-4ad0-9d9b-045097c3f5fc","year":2021},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:7e84edb26ed6e9b2ec20cf1d2597e0eb8c51fffaa77a9f6199db80dd8d46ae9a","observation_id":"79938114-0934-493b-9141-2f76b7b92f02","resolution":{"observed_at":"2026-06-27T18:31:08.217942Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T18:22:37.626930Z","title":"A Combinatorial Interpretation of the Eigensequence for Composition","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:a44727b3907bcb919ff5aa6a5b004c1d6256cfadaa92e9fb699806966c96576b","observation_id":"8e39d436-95d5-4841-85e3-8d5a8393bd85","resolution":{"observed_at":"2026-06-27T18:22:37.626930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T18:22:37.626930Z","title":"2022, arks.princeton.edu/ark:/88435/dsp016m311s469","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T18:22:37.626930Z"},"links":{"citing_paper":"/paper/2606.08429"},"observation_digest":"sha256:9a6c5bbdbf4535509dfd3ef6c13810c7f5eb0b370bc45b267cb1de939eb47df7","observation_id":"d372fe69-7990-404b-b16c-32a2c75e898d","resolution":{"observed_at":"2026-06-27T18:22:37.626930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.08429","last_updated":"2026-06-07T03:02:28Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-06T09:52:56.844070Z","submitted_at":"2026-06-07T03:02:28Z","title":"A Characterization of the $2m-4$ Case of Highly Sorted Permutations"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":10},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2606.08429."}