{"as_of":"2026-08-16T22:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:98126b2261f32a9e02f763e41e0c5ddf8e6ed96d35b5a9e031e246fc28eb02ad","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:34:51.894179Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.08910/citation-record","integrity":"/paper/1908.08910/integrity","json":"/paper/1908.08910/citation-record.json","paper":"/paper/1908.08910"},"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-14T11:34:52.060078Z","title":"Pop-stack sorting and its image: Permutat ions with over- lapping runs","venue":null,"work_id":"603635db-aef2-4714-9ce0-aad17996e384","year":2019},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.756691Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:648f959ca04737d4c53975bf81ce12c0fd7cb565f3a0769eaa4d4086eb137676","observation_id":"e926083f-8902-4d63-bab5-eada71c8a051","resolution":{"observed_at":"2026-08-14T11:34:52.064066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:52.047379Z","title":"On pop-stacks in series","venue":null,"work_id":"11f3d73a-bf88-49b5-b332-9c6d46782227","year":1981},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.785696Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:e970d1125ce5a1fe9fb2c3d56b98ae8cdd92dc68852f30fdd43c407466eb4287","observation_id":"1ea7e452-12b7-446f-81fa-c11bc50423d6","resolution":{"observed_at":"2026-08-14T11:34:52.051397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:52.031376Z","title":"Enumerat ing permu- tations sortable by k passes through a pop-stack","venue":null,"work_id":"945959ed-e400-45e4-9abd-0e0ac897eca8","year":2019},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.814507Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:cf3749de5115cb8bccc7e3b73cd498c1cf0eb48b1158b7eb31f125c57475de4f","observation_id":"5e58c8ff-c0cb-4552-8034-6c0e53fd776f","resolution":{"observed_at":"2026-08-14T11:34:52.037525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:52.019218Z","title":"Enumerating the pop-stacked permutations","venue":null,"work_id":"c6c58e10-8785-4446-b37c-8864c0561579","year":null},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.834239Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:493087ea4d4667c6faa0fc7cea1d9825c7f714959d93ade05adba6da5535c20e","observation_id":"f0767608-4897-47e1-922f-af0ca4f9382d","resolution":{"observed_at":"2026-08-14T11:34:52.023086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:52.004371Z","title":"Asymptotic analysis of power-serie s expansions","venue":null,"work_id":"82838b35-07b3-44b9-8232-68bfe2a78845","year":1989},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.869516Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:021de120021636d89f7d2e2af486ee5759e0988174a1b136149b4bfd5dfa8633","observation_id":"fff7ca58-7181-480d-84c8-57ac8071fcb8","resolution":{"observed_at":"2026-08-14T11:34:52.009476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:51.989917Z","title":"Series analysis","venue":null,"work_id":"48046732-dc02-4e02-b200-642359975900","year":2009},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.873375Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:3561342a788ea81f23e4c749e27e64fad3cfda00068c21bfc49a0a23d941c6d6","observation_id":"90e7237a-e51f-42ad-9030-103fd921efe8","resolution":{"observed_at":"2026-08-14T11:34:51.993762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:51.977572Z","title":"Extended rate, more G FUN","venue":null,"work_id":"026f7a1a-d85d-4cd0-9c1b-77ae10606c11","year":2011},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.878055Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:6b2147a65c686bdb495741a865ff77ef86c67c62e089c6e0b18b191df61d7019","observation_id":"f307cb85-b277-4fce-8975-72154fc32ef7","resolution":{"observed_at":"2026-08-14T11:34:51.981544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:51.964327Z","title":"IHPC - Icelandic High Performance Compu ter - University of Iceland and Reykjavik University, 2019","venue":null,"work_id":"7eae2903-16e6-491b-878a-c11209ae5944","year":2019},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.882433Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:3cb8213e26305590606dfc070d360ad4a999832c9fa9fb5ff168e35bdf014d6f","observation_id":"0e1ded5a-bdd5-400a-97de-2292a5e95b6e","resolution":{"observed_at":"2026-08-14T11:34:51.968925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:51.948945Z","title":"Guess: A Mathematica package for guessin g multivariate recurrence equations","venue":null,"work_id":"944f0e73-b6ce-43b8-8e73-e8e404ed2072","year":null},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.886753Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:df282fe24fe0f8e80919368c68ffb5e3c99a6a911ee9c29f1e4541ff591b419f","observation_id":"21a417d3-38bf-4f47-8468-5645d4cc9960","resolution":{"observed_at":"2026-08-14T11:34:51.953067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:51.935225Z","title":"GFUN: A Maple package f or the manipulation of generating and holonomic functions in one v ariable","venue":null,"work_id":"6b8fd10a-210b-464d-a711-5a31b28d962e","year":1994},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.891021Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:14867840af294fd383c42152306c400428997ae7d935c88cc103a7132c2b4266","observation_id":"1bd8b9a3-2d8b-43de-840d-12fe6411f9f6","resolution":{"observed_at":"2026-08-14T11:34:51.940424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:34:51.921614Z","title":null,"venue":null,"work_id":"b8fab708-50ec-4722-bfcf-ebef2a7c925a","year":2019},"citing_paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:51.894179Z"},"links":{"citing_paper":"/paper/1908.08910"},"observation_digest":"sha256:3560cc9dd5c9258a6132a49097ff6d13fd1abc1aa3424d8a45a63549d7b11e96","observation_id":"dd57faad-37e0-4429-9e4b-0704d07e49a3","resolution":{"observed_at":"2026-08-14T11:34:51.926999Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08910","last_updated":"2019-08-23T17:34:12Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T16:06:24.182812Z","submitted_at":"2019-08-23T17:34:12Z","title":"Counting pop-stacked permutations in polynomial time"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":11},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:1908.08910."}