{"as_of":"2026-08-16T10:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ec99dc74767a6fe499254f3415350d706c0242109bc89595e26cdcf42bb9b4f","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:54:09.133161Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"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.04673/citation-record","integrity":"/paper/1908.04673/integrity","json":"/paper/1908.04673/citation-record.json","paper":"/paper/1908.04673"},"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-14T13:54:09.212588Z","title":"Testing for forbidden order patterns in an array","venue":null,"work_id":"07805333-1871-4f2f-9945-22f8bd9e8199","year":2017},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.124824Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:d9710538a9869c764907fa75c94bc9d65fa857e91431316b983c63d221bfd4e3","observation_id":"df3227ee-a8f3-427e-912f-e3b152a47971","resolution":{"observed_at":"2026-08-14T13:54:09.216829Z","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":{"arxiv_id":"cs/0011047","last_updated":"2000-11-15T00:00:00Z","snapshot_observed_at":"2026-07-07T03:03:56.439741Z","submitted_at":"2000-11-15T00:00:00Z","title":"Dancing links","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0011047","snapshot_observed_at":"2026-08-14T13:54:09.116353Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":1975,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.116353Z"},"links":{"cited_paper":"/paper/cs/0011047","citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:9ad4a480fe72d1bba9941670d64c0087be39ee9b9374b1505497bdb793d28938","observation_id":"fb093f7b-9f87-4626-9074-a67e0f9414b4","resolution":{"observed_at":"2026-08-14T13:54:09.116353Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:54:09.197257Z","title":"A new method for solving constraint satisfaction problems","venue":null,"work_id":"3cc5e54e-d1f6-46e0-8a6c-eb0c271d48f6","year":1981},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":1984,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.129258Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:cf3fe7c11114d484dad956318f2cb91c9070af42e44efe930d011ed5d97cc3e2","observation_id":"be1f51a5-461a-45ed-aa41-88ac95cbbf0b","resolution":{"observed_at":"2026-08-14T13:54:09.203770Z","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-14T13:54:09.267631Z","title":"Finding small patterns in permutations in linear time","venue":null,"work_id":"e57e86af-c765-4f54-8513-ce98d66873e9","year":2014},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.103571Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:71735ce42312001c26094863621b45cf544c6f2494328148db7c8b23850d8521","observation_id":"bd26c9dc-d3f4-40db-acd5-656dea74dca3","resolution":{"observed_at":"2026-08-14T13:54:09.272695Z","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-14T13:54:09.249567Z","title":"Hardness of permutation pattern matching","venue":null,"work_id":"19bbb04d-36cc-4833-a385-3c52540fa4a2","year":2017},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.108269Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:0bf0f4199666190d4187a4f6ef8b7281f897791deb12d9b4f18138d29cefb42e","observation_id":"ad42a3ac-0d01-4315-8193-3d2001a39aec","resolution":{"observed_at":"2026-08-14T13:54:09.253985Z","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-14T13:54:09.305775Z","title":null,"venue":null,"work_id":"8e485201-0725-4456-833c-31f834bb11b8","year":2016},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.084791Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:1d0f2fb0bdf7037c370d0c02ca26ed6c5324769d81728a9313bbc4fb766148c5","observation_id":"34066b73-ff5c-4ae4-a8d3-38da9333e3c6","resolution":{"observed_at":"2026-08-14T13:54:09.310176Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:54:09.329579Z","title":"Fast sorting and pattern-avoiding permutations","venue":null,"work_id":"d03af878-69a8-4ede-9d2d-3d84bba90027","year":2007},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.075402Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:42e62793dee369a2d8348c784ca617c1f19726535c279d72fde8208e94d05310","observation_id":"507a9ef9-7a1f-4ea8-b932-de100872dc67","resolution":{"observed_at":"2026-08-14T13:54:09.333573Z","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":{"arxiv_id":"1310.8378","last_updated":"2013-10-31T04:25:37Z","snapshot_observed_at":"2026-08-14T23:56:59.480930Z","submitted_at":"2013-10-31T04:25:37Z","title":"Stanley-Wilf limits are typically exponential","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.8378","snapshot_observed_at":"2026-08-14T13:54:09.098639Z","title":"Stanley-wilf limits are typically exponential.CoRR, abs/1310.8378,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.098639Z"},"links":{"cited_paper":"/paper/1310.8378","citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:d4503687124c5bb89e72db2dbfcdb0ec9cf17ff13c5efdf4be14dff801356af9","observation_id":"2015733c-5be8-4576-99f6-0ca8842fdd2c","resolution":{"observed_at":"2026-08-14T13:54:09.098639Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:54:09.318373Z","title":null,"venue":null,"work_id":"858bdac6-e1ed-4b07-a3cd-cc3f60646ca0","year":2018},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.080543Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:75776c8ba033e1fa697f6ee094acd0522e8d3f040f893bcf71cf15b35580a567","observation_id":"f4fba6e4-3af7-41d8-ab48-372271b87a6c","resolution":{"observed_at":"2026-08-14T13:54:09.322241Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:54:09.281668Z","title":"Improving TSP tours using dynamic programming over tree decompositions","venue":null,"work_id":"dab07840-4326-4b07-b7c3-87b1b9a22d29","year":2017},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.094145Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:a0118647285fb93cef4a225f4e66338f815037d05e8029e060e222fa00a20569","observation_id":"bf3c7805-b187-44f0-ba84-52b768cf7ef7","resolution":{"observed_at":"2026-08-14T13:54:09.285706Z","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-14T13:54:09.224938Z","title":"Permutation Pattern matching in (213, 231)-avoiding permutations.Discrete Mathematics & Theoretical Computer Science, Vol","venue":null,"work_id":"2f0706ef-7367-483e-ac1f-e73c215e78d7","year":2015},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.120719Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:af6f08a726d15f35cc508e910fb32a331ae027b20c40b2e6cea8688c542febde","observation_id":"10909f5e-0c9f-4bba-a852-ec4069944a9e","resolution":{"observed_at":"2026-08-14T13:54:09.229215Z","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":{"arxiv_id":"1409.5159","last_updated":"2015-01-04T21:04:19Z","snapshot_observed_at":"2026-08-14T23:19:04.218872Z","submitted_at":"2014-09-17T22:10:54Z","title":"Permutation classes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.5159","snapshot_observed_at":"2026-08-14T13:54:09.133161Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.133161Z"},"links":{"cited_paper":"/paper/1409.5159","citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:0dcde38e265fbe22908188475b703e50301a49bc35d34b04ffa666ac7729ad3c","observation_id":"dc9bfdb0-9fb0-4bcc-80e3-44aae78905ef","resolution":{"observed_at":"2026-08-14T13:54:09.133161Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:54:09.237438Z","title":"Keogh, Stefano Lonardi, and Bill Yuan-chi Chiu","venue":null,"work_id":"c1c6ff38-f104-41e5-8f72-9ac0a26b2d3f","year":2002},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.112127Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:e8eff4875dbb6abb91dcf10931f4a3cc21e01c45f0c930ef966477ca9dd838ba","observation_id":"c5d90fd0-fc53-4e97-9d79-b569c11c291e","resolution":{"observed_at":"2026-08-14T13:54:09.241599Z","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-14T13:54:09.293488Z","title":"20 Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, and Thatchaphol Saranurak","venue":null,"work_id":"0d3259cf-2198-4ad1-9cf0-f4d978b15ac7","year":2015},"citing_paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T13:54:09.089479Z"},"links":{"citing_paper":"/paper/1908.04673"},"observation_digest":"sha256:417c5e3c46193f04297775990e4627fee78d2d858b46a45900a4292da653b2d9","observation_id":"b00bb4e9-8361-45c0-9212-a8cee8dd840f","resolution":{"observed_at":"2026-08-14T13:54:09.297568Z","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"}}],"paper":{"arxiv_id":"1908.04673","last_updated":"2019-08-13T14:46:25Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T13:33:09.105231Z","submitted_at":"2019-08-13T14:46:25Z","title":"Finding and counting permutations via CSPs"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":14},"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 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:1908.04673."}