Pith. sign in

Paper Citation Record · LEDGER

Finding and counting permutations via CSPs

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1908.04673 v1

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T13:54:09.133161Z

measured 14 of 14 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

14 of 14 outbound references displayed

  • verified exact0
  • verified fuzzy9
  • unresolved5
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation df3227ee-a8f3-427e-912f-e3b152a47971 · outbound

This paper cites Testing for forbidden order patterns in an array.

Finding and counting permutations via CSPs Testing for forbidden order patterns in an array

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T13:54:09.216829Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.124824Z digest=sha256:d9710538a9869c764907fa75c94bc9d65fa857e91431316b983c63d221bfd4e3

Observation fb093f7b-9f87-4626-9074-a67e0f9414b4 · outbound

This paper cites Dancing links.

Finding and counting permutations via CSPs Dancing links

Reference 1975

Resolution
unresolved
no resolver link, observed 2026-08-14T13:54:09.116353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T13:54:09.116353Z digest=sha256:9ad4a480fe72d1bba9941670d64c0087be39ee9b9374b1505497bdb793d28938

Observation be1f51a5-461a-45ed-aa41-88ac95cbbf0b · outbound

This paper cites A new method for solving constraint satisfaction problems.

Finding and counting permutations via CSPs A new method for solving constraint satisfaction problems

Reference 1984

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T13:54:09.203770Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.129258Z digest=sha256:cf3fe7c11114d484dad956318f2cb91c9070af42e44efe930d011ed5d97cc3e2

Observation bd26c9dc-d3f4-40db-acd5-656dea74dca3 · outbound

This paper cites Finding small patterns in permutations in linear time.

Finding and counting permutations via CSPs Finding small patterns in permutations in linear time

Reference 1990

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T13:54:09.272695Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.103571Z digest=sha256:71735ce42312001c26094863621b45cf544c6f2494328148db7c8b23850d8521

Observation ad42a3ac-0d01-4315-8193-3d2001a39aec · outbound

This paper cites Hardness of permutation pattern matching.

Finding and counting permutations via CSPs Hardness of permutation pattern matching

Reference 1997

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T13:54:09.253985Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.108269Z digest=sha256:0bf0f4199666190d4187a4f6ef8b7281f897791deb12d9b4f18138d29cefb42e

Observation 34066b73-ff5c-4ae4-a8d3-38da9333e3c6 · outbound

This paper cites an unresolved cited work.

Finding and counting permutations via CSPs Unresolved cited work

Reference 1998

Resolution
unresolved
raw_fallback, observed 2026-08-14T13:54:09.310176Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.084791Z digest=sha256:1d0f2fb0bdf7037c370d0c02ca26ed6c5324769d81728a9313bbc4fb766148c5

Observation 507a9ef9-7a1f-4ea8-b932-de100872dc67 · outbound

This paper cites Fast sorting and pattern-avoiding permutations.

Finding and counting permutations via CSPs Fast sorting and pattern-avoiding permutations

Reference 1999

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T13:54:09.333573Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.075402Z digest=sha256:42e62793dee369a2d8348c784ca617c1f19726535c279d72fde8208e94d05310

Observation 2015733c-5be8-4576-99f6-0ca8842fdd2c · outbound

This paper cites Stanley-Wilf limits are typically exponential.

Finding and counting permutations via CSPs Stanley-Wilf limits are typically exponential

Reference 2006

Resolution
unresolved
no resolver link, observed 2026-08-14T13:54:09.098639Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T13:54:09.098639Z digest=sha256:d4503687124c5bb89e72db2dbfcdb0ec9cf17ff13c5efdf4be14dff801356af9

Observation f4fba6e4-3af7-41d8-ab48-372271b87a6c · outbound

This paper cites an unresolved cited work.

Finding and counting permutations via CSPs Unresolved cited work

Reference 2007

Resolution
unresolved
raw_fallback, observed 2026-08-14T13:54:09.322241Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.080543Z digest=sha256:75776c8ba033e1fa697f6ee094acd0522e8d3f040f893bcf71cf15b35580a567

Observation bf3c7805-b187-44f0-ba84-52b768cf7ef7 · outbound

This paper cites Improving TSP tours using dynamic programming over tree decompositions.

Finding and counting permutations via CSPs Improving TSP tours using dynamic programming over tree decompositions

Reference 2009

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T13:54:09.285706Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.094145Z digest=sha256:a0118647285fb93cef4a225f4e66338f815037d05e8029e060e222fa00a20569

Observation 10909f5e-0c9f-4bba-a852-ec4069944a9e · outbound

This paper cites Permutation Pattern matching in (213, 231)-avoiding permutations.Discrete Mathematics & Theoretical Computer Science, Vol.

Finding and counting permutations via CSPs Permutation Pattern matching in (213, 231)-avoiding permutations.Discrete Mathematics & Theoretical Computer Science, Vol

Reference 2010

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T13:54:09.229215Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.120719Z digest=sha256:af6f08a726d15f35cc508e910fb32a331ae027b20c40b2e6cea8688c542febde

Observation dc9bfdb0-9fb0-4bcc-80e3-44aae78905ef · outbound

This paper cites Permutation classes.

Finding and counting permutations via CSPs Permutation classes

Reference 2015

Resolution
unresolved
no resolver link, observed 2026-08-14T13:54:09.133161Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-14T13:54:09.133161Z digest=sha256:0dcde38e265fbe22908188475b703e50301a49bc35d34b04ffa666ac7729ad3c

Observation c5d90fd0-fc53-4e97-9d79-b569c11c291e · outbound

This paper cites Keogh, Stefano Lonardi, and Bill Yuan-chi Chiu.

Finding and counting permutations via CSPs Keogh, Stefano Lonardi, and Bill Yuan-chi Chiu

Reference 2017

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T13:54:09.241599Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.112127Z digest=sha256:e8eff4875dbb6abb91dcf10931f4a3cc21e01c45f0c930ef966477ca9dd838ba

Observation b00bb4e9-8361-45c0-9212-a8cee8dd840f · outbound

This paper cites 20 Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, and Thatchaphol Saranurak.

Finding and counting permutations via CSPs 20 Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, and Thatchaphol Saranurak

Reference 2018

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T13:54:09.297568Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

source=pdf_text observed=2026-08-14T13:54:09.089479Z digest=sha256:417c5e3c46193f04297775990e4627fee78d2d858b46a45900a4292da653b2d9

Pith citing papers

No inbound Pith citation observations are available.