Pith. sign in

Paper Citation Record · LEDGER

A Robust Class of Linear Recurrence Sequences

As of 16 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:1908.03890.

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

pith.paper-citation-record.v1
1908.03890 v1

Coverage vector

measured 19 of 19 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T14:10:53.516880Z

measured 19 of 19 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

19 of 19 outbound references displayed

  • verified exact8
  • verified fuzzy2
  • unresolved9
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6326e5af-33ec-4805-a41b-2b241711409b · outbound

This paper cites Akshay, Nikhil Balaji, and Nikhil Vyas.

A Robust Class of Linear Recurrence Sequences Akshay, Nikhil Balaji, and Nikhil Vyas

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-14T14:10:53.331886Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-14T14:10:53.331886Z digest=sha256:3ab682c8088c32a26ffaaf5008efdb0eb5a181c7a0763eb8e3cef009a49445a8

Observation e5abe14a-b3b0-4e4d-8af1-88a804e16201 · outbound

This paper cites P \' e rez.

A Robust Class of Linear Recurrence Sequences P \' e rez

Reference 2

Resolution
verified exact
doi, observed 2026-08-14T14:10:53.928247Z

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=arxiv_source observed=2026-08-14T14:10:53.340695Z digest=sha256:ad85d8be02e54760f01397788520e9a441c0367e1fe773e0f29aef7d7932a843

Observation ce8e30bc-8161-4f28-88d0-3acb22432efb · outbound

This paper cites Deshmukh, Mukund Raghothaman, and Yifei Yuan.

A Robust Class of Linear Recurrence Sequences Deshmukh, Mukund Raghothaman, and Yifei Yuan

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-14T14:10:53.351735Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-14T14:10:53.351735Z digest=sha256:61c5f6fba7cefe0b39efd55a40dccebcda5a7595a5073879cfbfd8db1193572f

Observation ab3b1db9-8f0b-411c-86c4-fc7ab1d4ff6c · outbound

This paper cites Algebraic generating functions in enumerative combinatorics and context-free languages.

A Robust Class of Linear Recurrence Sequences Algebraic generating functions in enumerative combinatorics and context-free languages

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-14T14:10:53.360858Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-14T14:10:53.360858Z digest=sha256:de8a3856ae0f400caeaec80e67cc9fb36e1c9e349dd1c0268d1536c7f52aa635

Observation 59fe67a4-058d-4f36-8c13-a5036f5dfe13 · outbound

This paper cites Weighted automata and weighted logics.

A Robust Class of Linear Recurrence Sequences Weighted automata and weighted logics

Reference 5

Resolution
verified exact
doi, observed 2026-08-14T14:10:53.840596Z

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=arxiv_source observed=2026-08-14T14:10:53.376413Z digest=sha256:e43dbb13382704ec459c60c5b0604a47055554e56d0c27cab73a91aa2ee26b94

Observation 2d33b142-c0a6-4269-8bae-29b63c957847 · outbound

This paper cites Handbook of Weighted Automata.

A Robust Class of Linear Recurrence Sequences Handbook of Weighted Automata

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-14T14:10:53.387352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-14T14:10:53.387352Z digest=sha256:f8bf04640f951f607089801da6fdfd43eb957d18ceb78f77b3afd40e0861c6ed

Observation d8172005-8cb4-4ccd-83dc-a9f9b36dfd99 · outbound

This paper cites Probabilistic automata of bounded ambiguity.

A Robust Class of Linear Recurrence Sequences Probabilistic automata of bounded ambiguity

Reference 7

Resolution
verified exact
doi, observed 2026-08-14T14:10:53.809672Z

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=arxiv_source observed=2026-08-14T14:10:53.400011Z digest=sha256:f80e97a79f5f33e42b91f7380b9e4f6ac6f933bd44552f0446a0996919068686

Observation 29715458-1666-48ef-b2e9-a1b9cf8472a1 · outbound

This paper cites Graham, Donald E.

A Robust Class of Linear Recurrence Sequences Graham, Donald E

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:10:54.367318Z

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=arxiv_source observed=2026-08-14T14:10:53.410065Z digest=sha256:4cf7f74e5e9e40e14fc1395b8f6ad7c044bf7cc37fa9b87edc9ea2ecd89edae9

Observation 3a08aeb5-0985-466a-a6c0-d3d5b21e1e8b · outbound

This paper cites Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata.

A Robust Class of Linear Recurrence Sequences Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-14T14:10:53.417076Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-14T14:10:53.417076Z digest=sha256:15a12bd17ec2f0525249bbdae17df5e445f73d061e27dd146ed7daffbf15218d

Observation f0e95cab-61b8-422e-929a-e1265e4f09cc · outbound

This paper cites Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton.

A Robust Class of Linear Recurrence Sequences Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-14T14:10:53.426124Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-14T14:10:53.426124Z digest=sha256:882bb693b41a573643ac8a9037b83190efcbc5fb9a3fde29fa18db07cbb77a43

Observation 8947b2f8-28b3-45d7-bd66-ab20c82ef62b · outbound

This paper cites Quantitative monadic second-order logic.

A Robust Class of Linear Recurrence Sequences Quantitative monadic second-order logic

Reference 11

Resolution
verified exact
doi, observed 2026-08-14T14:10:53.748058Z

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=arxiv_source observed=2026-08-14T14:10:53.437520Z digest=sha256:d12e7077fff1e119720bc8612efd461a58d69b0afda0e471de5acb049165f804

Observation e2870dd3-e289-4b15-90b3-f4df28df5694 · outbound

This paper cites Maximal partition logic: Towards a logical characterization of copyless cost register automata.

A Robust Class of Linear Recurrence Sequences Maximal partition logic: Towards a logical characterization of copyless cost register automata

Reference 12

Resolution
verified exact
doi, observed 2026-08-14T14:10:53.719603Z

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=arxiv_source observed=2026-08-14T14:10:53.447478Z digest=sha256:d1278225ef2505e296bc71ca9714ea04adc8b229b9d9c60ce3c8ebf8621f2fe5

Observation 9517b8e7-4ce4-4e96-a85e-a24960f95e9f · outbound

This paper cites Pumping lemmas for weighted automata.

A Robust Class of Linear Recurrence Sequences Pumping lemmas for weighted automata

Reference 13

Resolution
verified exact
doi, observed 2026-08-14T14:10:53.680922Z

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=arxiv_source observed=2026-08-14T14:10:53.461851Z digest=sha256:ae4d51e13d87be62713da99ee5703980f05959f449fac0cb2b8e5579be5fd739

Observation 8a349d8e-38da-4700-8add-b26e1c954e13 · outbound

This paper cites Copyless cost-register automata: Structure, expressiveness, and closure properties.

A Robust Class of Linear Recurrence Sequences Copyless cost-register automata: Structure, expressiveness, and closure properties

Reference 14

Resolution
verified exact
doi, observed 2026-08-14T14:10:53.653154Z

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=arxiv_source observed=2026-08-14T14:10:53.470712Z digest=sha256:b6ed2281444c62d4cf605469d35bbd71763df5a1ccb15f23f0a3251b5774f522

Observation a5a433e4-8245-4977-b15b-dd96f6d21566 · outbound

This paper cites Ultimate positivity is decidable for simple linear recurrence sequences.

A Robust Class of Linear Recurrence Sequences Ultimate positivity is decidable for simple linear recurrence sequences

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-14T14:10:53.485477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-14T14:10:53.485477Z digest=sha256:3558160f41ce9579fd58a6c022a3b353b35e941feee68218da8f08da4b3b32ed

Observation 9eb43723-4345-4492-8f70-85d0aea10e70 · outbound

This paper cites On linear recurrence sequences and loop termination.

A Robust Class of Linear Recurrence Sequences On linear recurrence sequences and loop termination

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-14T14:10:53.491371Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-14T14:10:53.491371Z digest=sha256:9f5535cb0139c4918f2e1e21df69be6c05f48b9303592b89ffb9a71b9688721b

Observation dfd37ae6-eb11-45a4-adf3-72ea2073f654 · outbound

This paper cites On the Termination of Linear and Affine Programs over the Integers.

A Robust Class of Linear Recurrence Sequences On the Termination of Linear and Affine Programs over the Integers

Reference 18

Resolution
verified exact
local_arxiv, observed 2026-08-14T14:10:54.020360Z

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=arxiv_source observed=2026-08-14T14:10:53.501046Z digest=sha256:0aad022c79aacbd240defa7ca72e0da036696808a2fe3d5c499eb68d6d3ed9d9

Observation b86c89a0-8c47-403c-9a4d-af2f4a829acb · outbound

This paper cites On the definition of a family of automata.

A Robust Class of Linear Recurrence Sequences On the definition of a family of automata

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-14T14:10:53.507803Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-14T14:10:53.507803Z digest=sha256:ce1a7eef443c65fe99c3bbfb761ba54876d0756a78d7431eceadbe7061e1c8b9

Observation ddb6f290-1a5f-4cca-8349-b13200290070 · outbound

This paper cites Structure and randomness: pages from year one of a mathematical blog.

A Robust Class of Linear Recurrence Sequences Structure and randomness: pages from year one of a mathematical blog

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-14T14:10:54.327829Z

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=arxiv_source observed=2026-08-14T14:10:53.516880Z digest=sha256:5299e1db43e99bfb5dcca2f65deab0e603e046ecd66f24392f90f7a572cedee8

Pith citing papers

No inbound Pith citation observations are available.