{"as_of":"2026-08-16T09:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:231c714110dac26de92e2f0f1b77a65fa3cbd890310b51102e50434d79aed758","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:10:53.516880Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"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.03890/citation-record","integrity":"/paper/1908.03890/integrity","json":"/paper/1908.03890/citation-record.json","paper":"/paper/1908.03890"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.331886Z","title":"Akshay, Nikhil Balaji, and Nikhil Vyas","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.331886Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:3ab682c8088c32a26ffaaf5008efdb0eb5a181c7a0763eb8e3cef009a49445a8","observation_id":"6326e5af-33ec-4805-a41b-2b241711409b","resolution":{"observed_at":"2026-08-14T14:10:53.331886Z","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.1007/978-3-319-98654-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.915061Z","title":"P \\' e rez","venue":null,"work_id":"bc9b2636-da9a-4458-af7b-51ebb589c413","year":2018},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.340695Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:ad85d8be02e54760f01397788520e9a441c0367e1fe773e0f29aef7d7932a843","observation_id":"e5abe14a-b3b0-4e4d-8af1-88a804e16201","resolution":{"observed_at":"2026-08-14T14:10:53.928247Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.351735Z","title":"Deshmukh, Mukund Raghothaman, and Yifei Yuan","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.351735Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:61c5f6fba7cefe0b39efd55a40dccebcda5a7595a5073879cfbfd8db1193572f","observation_id":"ce8e30bc-8161-4f28-88d0-3acb22432efb","resolution":{"observed_at":"2026-08-14T14:10:53.351735Z","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-08-14T14:10:53.360858Z","title":"Algebraic generating functions in enumerative combinatorics and context-free languages","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.360858Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:de8a3856ae0f400caeaec80e67cc9fb36e1c9e349dd1c0268d1536c7f52aa635","observation_id":"ab3b1db9-8f0b-411c-86c4-fc7ab1d4ff6c","resolution":{"observed_at":"2026-08-14T14:10:53.360858Z","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/j.tcs.2007.02.055","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.830263Z","title":"Weighted automata and weighted logics","venue":null,"work_id":"5126981f-a33d-4143-b7e5-ad05e6566b76","year":2007},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.376413Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:e43dbb13382704ec459c60c5b0604a47055554e56d0c27cab73a91aa2ee26b94","observation_id":"59fe67a4-058d-4f36-8c13-a5036f5dfe13","resolution":{"observed_at":"2026-08-14T14:10:53.840596Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.387352Z","title":"Handbook of Weighted Automata","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.387352Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:f8bf04640f951f607089801da6fdfd43eb957d18ceb78f77b3afd40e0861c6ed","observation_id":"2d33b142-c0a6-4269-8bae-29b63c957847","resolution":{"observed_at":"2026-08-14T14:10:53.387352Z","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.4230/lipics.concur.2017.19","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.795528Z","title":"Probabilistic automata of bounded ambiguity","venue":null,"work_id":"07895864-7db6-418b-b6d9-25625487ef8d","year":2017},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.400011Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:f80e97a79f5f33e42b91f7380b9e4f6ac6f933bd44552f0446a0996919068686","observation_id":"d8172005-8cb4-4ccd-83dc-a9f9b36dfd99","resolution":{"observed_at":"2026-08-14T14:10:53.809672Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:10:54.359228Z","title":"Graham, Donald E","venue":null,"work_id":"2e5d3453-28ef-43cc-ae80-b3af2c6cdb8a","year":1994},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.410065Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:4cf7f74e5e9e40e14fc1395b8f6ad7c044bf7cc37fa9b87edc9ea2ecd89edae9","observation_id":"29715458-1666-48ef-b2e9-a1b9cf8472a1","resolution":{"observed_at":"2026-08-14T14:10:54.367318Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.417076Z","title":"Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.417076Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:15a12bd17ec2f0525249bbdae17df5e445f73d061e27dd146ed7daffbf15218d","observation_id":"3a08aeb5-0985-466a-a6c0-d3d5b21e1e8b","resolution":{"observed_at":"2026-08-14T14:10:53.417076Z","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-08-14T14:10:53.426124Z","title":"Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.426124Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:882bb693b41a573643ac8a9037b83190efcbc5fb9a3fde29fa18db07cbb77a43","observation_id":"f0e95cab-61b8-422e-929a-e1265e4f09cc","resolution":{"observed_at":"2026-08-14T14:10:53.426124Z","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.1109/lics.2013.16","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.739763Z","title":"Quantitative monadic second-order logic","venue":null,"work_id":"6087204b-9a98-4882-96f6-0e5286e593f6","year":2013},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.437520Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:d12e7077fff1e119720bc8612efd461a58d69b0afda0e471de5acb049165f804","observation_id":"8947b2f8-28b3-45d7-bd66-ab20c82ef62b","resolution":{"observed_at":"2026-08-14T14:10:53.748058Z","resolver_source":"doi","status":"verified_exact"},"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":"10.4230/lipics.csl.2015.144","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.709648Z","title":"Maximal partition logic: Towards a logical characterization of copyless cost register automata","venue":null,"work_id":"04a9778b-6bac-44c0-9fa3-bc212d7bd3cb","year":2015},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.447478Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:d1278225ef2505e296bc71ca9714ea04adc8b229b9d9c60ce3c8ebf8621f2fe5","observation_id":"e2870dd3-e289-4b15-90b3-f4df28df5694","resolution":{"observed_at":"2026-08-14T14:10:53.719603Z","resolver_source":"doi","status":"verified_exact"},"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":"10.4230/lipics.stacs.2018.50","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.671812Z","title":"Pumping lemmas for weighted automata","venue":null,"work_id":"9fb1bfce-b132-4d40-9602-5945015232f7","year":2018},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.461851Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:ae4d51e13d87be62713da99ee5703980f05959f449fac0cb2b8e5579be5fd739","observation_id":"9517b8e7-4ce4-4e96-a85e-a24960f95e9f","resolution":{"observed_at":"2026-08-14T14:10:53.680922Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/j.jcss.2018.07.002","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.640032Z","title":"Copyless cost-register automata: Structure, expressiveness, and closure properties","venue":null,"work_id":"9a0a4a97-a222-4e15-91f1-8f06e22e508c","year":2019},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.470712Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:b6ed2281444c62d4cf605469d35bbd71763df5a1ccb15f23f0a3251b5774f522","observation_id":"8a349d8e-38da-4700-8add-b26e1c954e13","resolution":{"observed_at":"2026-08-14T14:10:53.653154Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.485477Z","title":"Ultimate positivity is decidable for simple linear recurrence sequences","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.485477Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:3558160f41ce9579fd58a6c022a3b353b35e941feee68218da8f08da4b3b32ed","observation_id":"a5a433e4-8245-4977-b15b-dd96f6d21566","resolution":{"observed_at":"2026-08-14T14:10:53.485477Z","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-08-14T14:10:53.491371Z","title":"On linear recurrence sequences and loop termination","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.491371Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:9f5535cb0139c4918f2e1e21df69be6c05f48b9303592b89ffb9a71b9688721b","observation_id":"9eb43723-4345-4492-8f70-85d0aea10e70","resolution":{"observed_at":"2026-08-14T14:10:53.491371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.4230","last_updated":"2014-09-18T06:27:03Z","snapshot_observed_at":"2026-08-16T05:52:47.122296Z","submitted_at":"2014-09-15T12:41:26Z","title":"On the Termination of Linear and Affine Programs over the Integers","version":2},"cited_work":{"arxiv_id":"1409.4230","doi":null,"metadata_source":"pith","pith_arxiv_id":"1409.4230","snapshot_observed_at":"2026-08-14T14:10:53.983570Z","title":"On the Termination of Linear and Affine Programs over the Integers","venue":"cs.DM","work_id":"dc5cde2e-3733-4a98-8b1a-8d5c54318e79","year":2014},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.501046Z"},"links":{"cited_paper":"/paper/1409.4230","citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:0aad022c79aacbd240defa7ca72e0da036696808a2fe3d5c499eb68d6d3ed9d9","observation_id":"dfd37ae6-eb11-45a4-adf3-72ea2073f654","resolution":{"observed_at":"2026-08-14T14:10:54.020360Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:53.507803Z","title":"On the definition of a family of automata","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.507803Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:ce1a7eef443c65fe99c3bbfb761ba54876d0756a78d7431eceadbe7061e1c8b9","observation_id":"b86c89a0-8c47-403c-9a4d-af2f4a829acb","resolution":{"observed_at":"2026-08-14T14:10:53.507803Z","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-14T14:10:54.317526Z","title":"Structure and randomness: pages from year one of a mathematical blog","venue":null,"work_id":"e582522b-4dea-44f5-ac60-67fc8f44c24f","year":2008},"citing_paper":{"arxiv_id":"1908.03890","last_updated":"2019-08-11T12:02:36Z","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:10:53.516880Z"},"links":{"citing_paper":"/paper/1908.03890"},"observation_digest":"sha256:5299e1db43e99bfb5dcca2f65deab0e603e046ecd66f24392f90f7a572cedee8","observation_id":"ddb6f290-1a5f-4cca-8349-b13200290070","resolution":{"observed_at":"2026-08-14T14:10:54.327829Z","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.03890","last_updated":"2019-08-11T12:02:36Z","latest_version":1,"primary_category":"cs.FL","snapshot_observed_at":"2026-08-14T13:56:40.306713Z","submitted_at":"2019-08-11T12:02:36Z","title":"A Robust Class of Linear Recurrence Sequences"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":8,"verified_fuzzy":2},"total_outbound_references":19},"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 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:1908.03890."}