{"as_of":"2026-08-16T16:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7822c7006fd875376452e88b2b3dd580cf4e6f70c0c6f731f344e594f2da3dc8","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:34:49.587371Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"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.04731/citation-record","integrity":"/paper/1908.04731/integrity","json":"/paper/1908.04731/citation-record.json","paper":"/paper/1908.04731"},"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-14T14:34:50.122349Z","title":null,"venue":null,"work_id":"2343de62-328c-4c8e-be65-3be456b14e88","year":2003},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.422975Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:344e4fe646d67a4041b42a081e2697bd45d5c8dbb8e419ef34d85e76716b703c","observation_id":"1b38a584-bb54-4ad4-856c-cd350fb3e4a3","resolution":{"observed_at":"2026-08-14T14:34:50.126691Z","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-14T14:34:50.111512Z","title":null,"venue":null,"work_id":"9186f6ea-597b-459e-b0ba-be9413503fd6","year":1994},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.427287Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:5bb0afb259ebbe4c39399625ba5048321784834b523deb0caf24252cb928a3e5","observation_id":"504d7e71-869e-4631-a17c-9d8bb58026ef","resolution":{"observed_at":"2026-08-14T14:34:50.115118Z","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-14T14:34:50.100364Z","title":null,"venue":null,"work_id":"65198171-b0ea-4a66-8f30-65c82ae9af8f","year":1992},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.431263Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:d0e4d51640b9776fd286ea9279688227b9d3d8b4cc4fe6d108b788ef030a27a6","observation_id":"6076ad95-b121-4c02-ab93-137429499e63","resolution":{"observed_at":"2026-08-14T14:34:50.104153Z","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-14T14:34:50.088431Z","title":null,"venue":null,"work_id":"889bd20e-b0f3-476a-8628-68675eecfb81","year":1996},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.435132Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:dd0481752a3ec0a76d76a96f78a5c2e6a7df2692b58a5b0dbeac0dbb5c3bd044","observation_id":"72770db9-103d-4243-9078-f77a5fbca5f0","resolution":{"observed_at":"2026-08-14T14:34:50.092244Z","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-14T14:34:50.060275Z","title":"Lacasa, B","venue":null,"work_id":"f68a80da-3219-41d8-8a20-5d9f485ef79b","year":2008},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.438695Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:65e0121e0528f04aea9c8c1d5af40a4a021b3062776a4d453a3e12a24a170c1e","observation_id":"467ff112-56a3-42c9-abd0-fa9bcd3aea22","resolution":{"observed_at":"2026-08-14T14:34:50.069130Z","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-14T14:34:50.048601Z","title":"Marwan, J","venue":null,"work_id":"535f2e45-4f0c-4db6-ae66-066c62ed8785","year":2009},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.442879Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:3ca051c4cdcf3d224518e5d700f558f9de79c73ad86fa2058f9a5d341e574a52","observation_id":"52bb6404-c508-47fa-970e-f74d466aa153","resolution":{"observed_at":"2026-08-14T14:34:50.052419Z","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-14T14:34:50.036080Z","title":"Yang and H","venue":null,"work_id":"c0a455b6-7704-43da-ab48-c3d4986784ac","year":2008},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.447044Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:043bca6832e337b1c642bce3c015b7c96dabc412fb78fb1d04836516c5e0e510","observation_id":"3f3fc614-3a53-42c4-9e58-8c65a66860dd","resolution":{"observed_at":"2026-08-14T14:34:50.040318Z","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-14T14:34:50.023558Z","title":null,"venue":null,"work_id":"c2d6f836-423c-414f-8db3-2e7971888d44","year":2010},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.450764Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:55cb61deec02d2cb1f222ef512906b95ef7c47e9ac4805b49c704bff0a7f7bdc","observation_id":"933971a7-543d-47c3-9ae4-b7b37a510913","resolution":{"observed_at":"2026-08-14T14:34:50.028013Z","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-14T14:34:50.010488Z","title":null,"venue":null,"work_id":"5fd0cc09-08a8-48ff-9798-446b2b39dda0","year":2001},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.454723Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:bb746a05f2cd367584472d2503df6e82d516c778ca2481c98e6708f8625c6d38","observation_id":"1dbbe853-7631-43a5-bede-7fd1b883e7f9","resolution":{"observed_at":"2026-08-14T14:34:50.014533Z","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-14T14:34:49.999605Z","title":null,"venue":null,"work_id":"360ddfeb-c511-4ec4-9e6f-56a0048322ef","year":2003},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.459373Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:b714d22811de492b0f69553fe457f497fa83dce64c245fd9a0b28c2b7a1ebe11","observation_id":"2d108b81-b06e-4a18-975d-a2a728f99709","resolution":{"observed_at":"2026-08-14T14:34:50.003423Z","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-14T14:34:49.987528Z","title":"Barzel and A","venue":null,"work_id":"f0d4e108-245b-4704-8a81-33479eff647e","year":2013},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.463430Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:4d96e031377abc50b4bcf4740a373f44dcf69289cd8922d3669dc8feee5d8fae","observation_id":"4575f198-aeb0-4fd7-84a8-e980084fe10a","resolution":{"observed_at":"2026-08-14T14:34:49.991831Z","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-14T14:34:49.975293Z","title":"Pompe, Permutation entropy: A natural complexity measure for time series analysis , Phys","venue":null,"work_id":"c9ae8896-fc99-493e-8eeb-b30dc2986dea","year":2002},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.467290Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:8692b18dfae1a03c3145db17beea53408d3663e1ec09f4caac6f8248217056d9","observation_id":"f83e766a-cdc6-43c5-8905-51f2193ec126","resolution":{"observed_at":"2026-08-14T14:34:49.979011Z","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-14T14:34:49.964417Z","title":"Demetrius and T","venue":null,"work_id":"477c34d9-2756-4d66-8f09-c4db4bb736a0","year":2005},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.471141Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:4a628bc957fcbf71bd25118393b7f502bdac92ebfb5419bede513118758748c6","observation_id":"cc4dbec0-c6ef-4fce-8d47-efcd1710c387","resolution":{"observed_at":"2026-08-14T14:34:49.968137Z","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-14T14:34:49.952891Z","title":null,"venue":null,"work_id":"ad0b76de-3d1d-4017-9f20-ec7d6b554e49","year":2011},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.475781Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:5b4cc421c07338096ccf682cb85c4ee41bfa18a04d6b1d9b9e8f0256d98e1cab","observation_id":"5443ee12-a5f7-4a0a-9885-693cab9682bf","resolution":{"observed_at":"2026-08-14T14:34:49.956593Z","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-14T14:34:49.942190Z","title":"Bianconi, Entropy of network ensembles , Phys","venue":null,"work_id":"4820ed21-adb3-4874-8a99-69e8b73328fb","year":2009},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.479063Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:79aa2cb65aa28b87999ab5c84ed5148d0c9a0142766b3d91f010bd52db5787b3","observation_id":"45ee44dc-0a06-4ccc-a04e-4a46b26788d1","resolution":{"observed_at":"2026-08-14T14:34:49.945831Z","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-14T14:34:49.931625Z","title":null,"venue":null,"work_id":"cd7960ef-5238-4d40-9d05-4ad6e1b8be71","year":1987},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.486722Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:97f2009e4c3692f7008dfd5edf2b6e0661d1f6f1d936cc52a42a2ca8a9aa0655","observation_id":"70f6b428-1a8e-404e-9004-8fb9f9cfc902","resolution":{"observed_at":"2026-08-14T14:34:49.935021Z","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-14T14:34:49.920507Z","title":"Balian, From Microphysics to Macrophysics , (Springer, New York, 1991)","venue":null,"work_id":"7de05032-8854-4052-9741-504e090dae99","year":1991},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.490856Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:4ab08007a55f7eba203a54a67198bddd17976e99bc5c542044f3c0e56973577f","observation_id":"cfad7471-292a-417c-9660-2f5eb501d615","resolution":{"observed_at":"2026-08-14T14:34:49.924092Z","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-14T14:34:49.909885Z","title":null,"venue":null,"work_id":"5452b3b9-b11a-45ef-b5c1-89d132931892","year":1991},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.494556Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:970e43abb504b4c6e6bcb72556cd6030b5a2b4388143f3aaffc837697c378030","observation_id":"b9546f79-93e8-4cac-9321-f4271249a2f5","resolution":{"observed_at":"2026-08-14T14:34:49.913644Z","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-14T14:34:49.899445Z","title":"Beck and F","venue":null,"work_id":"6361db42-2546-4ba3-b6ac-40cbface5285","year":1993},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.498327Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:b9e52000123bd09fb0d5cd43a8c9db6e3cb6843bd8dfd8d44df56fec6d30a2d2","observation_id":"0ba8d119-b90d-457f-97a4-b1c102bebdca","resolution":{"observed_at":"2026-08-14T14:34:49.902689Z","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-14T14:34:49.887159Z","title":"Bonchev, Information theoretic indices for characterization of chem ical structures, (Research Studies Press, Chichester, 1983)","venue":null,"work_id":"e97f57bd-97bd-46dc-a7ba-bacfade39f11","year":1983},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.501857Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:448dcac2bee8263efb025dc129bbcf31802c6d99714338eeb884eca788ca8f0b","observation_id":"a01741a6-a7b7-4353-89c3-ffd3bb435575","resolution":{"observed_at":"2026-08-14T14:34:49.892059Z","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-14T14:34:49.874983Z","title":"Dehmer and A","venue":null,"work_id":"93de00c6-b70c-48d6-8f77-93ece7009729","year":2011},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.506431Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:f52e4039a6a0c44b109c3981948c46fa3e5676f902855032e34a6ced329bc2f7","observation_id":"dcd82e7b-84dc-4825-beab-e77a72629254","resolution":{"observed_at":"2026-08-14T14:34:49.879165Z","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-14T14:34:49.863098Z","title":"Anand and G","venue":null,"work_id":"20ff77ef-f425-4f8b-b794-9a4b248b0c7b","year":2009},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.510989Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:3066e29131bcf68c6f98a4001693590975b9112ff6e3adb9dff03563cce901cc","observation_id":"3d310164-12c8-4480-a778-f61dc61a17b7","resolution":{"observed_at":"2026-08-14T14:34:49.866977Z","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-14T14:34:49.851329Z","title":null,"venue":null,"work_id":"03658276-2dca-4a79-b203-5a0a6f9d86b0","year":2019},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.514692Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:df17b3499870023702611b0d5feb43429d7d55f22685a78ac08dde3381f79fb3","observation_id":"4f585d25-bc4e-4ae6-bc8b-bc68b38f0347","resolution":{"observed_at":"2026-08-14T14:34:49.855469Z","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-14T14:34:49.839777Z","title":"Sole and S","venue":null,"work_id":"9deded7b-adb0-4c20-bb6a-f9b036b69d97","year":2004},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.519670Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:a87db7a892510a4533608c71bc19d96018c9515d3d7bb215fc504608b0c24d36","observation_id":"f9c3b60f-2267-49c9-a4b9-ade3e60ec763","resolution":{"observed_at":"2026-08-14T14:34:49.843715Z","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-14T14:34:49.828525Z","title":null,"venue":null,"work_id":"7088a26a-f638-4944-84e8-b139a46cf5eb","year":2017},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.524247Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:db953d9d81a433385923691931003ac58191c4557a618680ff7836d41a763632","observation_id":"f327b3e0-e31a-4fc0-942a-31f6d98e4dbb","resolution":{"observed_at":"2026-08-14T14:34:49.832192Z","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-14T14:34:49.816237Z","title":"Zhang and M","venue":null,"work_id":"d664b618-ee67-4a05-9215-b2996309035e","year":2006},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.528237Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:e7ebceec7053bce6141591a7ec0fb289304e8ba67abbbb25e07e2f8f53a5702a","observation_id":"777e3d06-ca0e-423d-bc28-ab1bcea724ea","resolution":{"observed_at":"2026-08-14T14:34:49.819695Z","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-14T14:34:49.803876Z","title":null,"venue":null,"work_id":"c9ef3dda-5099-4b14-a04b-cc511b706756","year":2008},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.532606Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:b01b9d69710fbacf6918739573883833a67e8951b59a5d14cd6f8c6034135f46","observation_id":"26bceddb-b653-4fef-ad29-75f5cf0cdb10","resolution":{"observed_at":"2026-08-14T14:34:49.808383Z","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-14T14:34:49.793353Z","title":"Gao and N","venue":null,"work_id":"d008448f-8946-48d0-845d-c861073b94f5","year":2009},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.536001Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:d53e5d9ca0e0dbfffb3dfe094626de0b19a013a42fcc2f434a16f4a58164ef74","observation_id":"25bf90b2-bedd-4ba3-a1d6-b5d2578956b1","resolution":{"observed_at":"2026-08-14T14:34:49.796715Z","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-14T14:34:49.782982Z","title":null,"venue":null,"work_id":"5c736598-45ed-47d1-84e1-8a2f1c2d80d2","year":2011},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.539754Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:a707c43a35e215192152bb57678156c68921a34f32046332cbd6a92a92adb46a","observation_id":"c3447616-d937-46df-95a3-2e961152c6a4","resolution":{"observed_at":"2026-08-14T14:34:49.786212Z","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-14T14:34:49.772754Z","title":null,"venue":null,"work_id":"f360b1f4-1cde-48ba-a004-38f38551bd44","year":2011},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.542965Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:88a2ce7d464e8dadceebf7161401a25ed0f440fb28485437a1f413c8238580d2","observation_id":"ff46fc05-a6ae-407c-833f-393232005321","resolution":{"observed_at":"2026-08-14T14:34:49.776217Z","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-14T14:34:49.761631Z","title":null,"venue":null,"work_id":"ea9a69dc-fc18-4e3a-847b-ad8bbad04ee3","year":2011},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.547450Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:65c8c1bdcab551d410adc3758173d2b62e2ba7ed5450089528b6cbb0e981ceb3","observation_id":"d522d689-2fa4-40fd-8b29-09f5f36aee7a","resolution":{"observed_at":"2026-08-14T14:34:49.765309Z","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-14T14:34:49.750740Z","title":"Marwan and J","venue":null,"work_id":"2aa8d410-7399-442c-a47a-715772c905da","year":2015},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.551005Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:f9544efb1f97bff8db04356cb0b47869aa8bca88597810101eef7341cfb166b2","observation_id":"fc554eaf-b564-4fe2-910f-317062f4dc4a","resolution":{"observed_at":"2026-08-14T14:34:49.754522Z","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-14T14:34:49.740180Z","title":"Marwan, N","venue":null,"work_id":"fbc4d569-af64-4d10-9098-6a66d2174b32","year":2002},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.554669Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:6fc8cb7d4eb5e98cd12ffcd41a3efa4f49be7c77d009a30f4f8a2fd67121ef69","observation_id":"033b4282-a8dc-409f-be0c-699647737e65","resolution":{"observed_at":"2026-08-14T14:34:49.743386Z","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-14T14:34:49.728564Z","title":"Marwan, M","venue":null,"work_id":"5ef91a50-d64f-4c8e-9322-d9a06c913a29","year":2003},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.558117Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:0ef8cd0b5b8e422eefb7ee4d919eb1c929f7eea3dd3a17eb19a59ce3a9ba6076","observation_id":"8a2e1c74-6ceb-4475-979c-0e06ebd6de3a","resolution":{"observed_at":"2026-08-14T14:34:49.732404Z","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-14T14:34:49.714821Z","title":"Boers, B","venue":null,"work_id":"1d815bac-fc31-4474-a960-322ec704b449","year":2014},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.561315Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:029ae9072aa3f38d91b1458c5cb249b43c6da11c8fd88a7e799ac08087492e41","observation_id":"d90ba238-04ad-4c89-a6ec-8b93078443a5","resolution":{"observed_at":"2026-08-14T14:34:49.718940Z","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-14T14:34:49.701338Z","title":"Grassberger and I","venue":null,"work_id":"e1e49032-3a6b-4700-ba0b-d3da6e289c60","year":1983},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.564902Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:5e85b9a7cfded336a36bf4aac6a2b0f56e696b2e00b3c045bdfa5184594398da","observation_id":"e19920fc-aff2-4f0a-9b65-22eb8cb580eb","resolution":{"observed_at":"2026-08-14T14:34:49.705452Z","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-14T14:34:49.687499Z","title":null,"venue":null,"work_id":"3e3ec364-5182-4b7d-8a94-c486bafacf9b","year":2016},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.568750Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:e0cedb1fcde9001ea0ee11c718aad2ae555e449fe7030cc3917d03f72de86142","observation_id":"b7313b61-0061-497b-a4a2-16b9cfc20cb9","resolution":{"observed_at":"2026-08-14T14:34:49.692144Z","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-14T14:34:49.673009Z","title":null,"venue":null,"work_id":"09f2dc0f-07b7-4e6b-921d-d91d1a817557","year":2016},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.572245Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:24a7c358db59fce08e0f2ec9a95b2902023a414beac0a9fe8a23e3f169072982","observation_id":"fe3444b6-38b7-412d-907f-593540e16974","resolution":{"observed_at":"2026-08-14T14:34:49.676982Z","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-14T14:34:49.660291Z","title":null,"venue":null,"work_id":"4521eae4-92cd-479b-b96d-2128a1661998","year":2018},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.576101Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:a0f20e10a55c53e77b834fd51217de13e5fea0d2d12de6ace6b48f848024b3ac","observation_id":"fcd8da79-c526-485d-a561-9de58921128e","resolution":{"observed_at":"2026-08-14T14:34:49.664249Z","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-14T14:34:49.647379Z","title":null,"venue":null,"work_id":"73bd0bd2-f351-4e67-a367-ca366b73f5d8","year":2015},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.579612Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:e3f3758b4d33370ee47dd85deb20ad8320456d05e9427c8ae113daf64a43da1e","observation_id":"d128e670-245b-41ae-bbe2-47fe31aadcb6","resolution":{"observed_at":"2026-08-14T14:34:49.651412Z","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-14T14:34:49.633769Z","title":null,"venue":null,"work_id":"3ded85be-4b22-41d2-afc2-5e4e2d9e8c57","year":2017},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.583487Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:a6d2b41c303d8b0e58ccb762cec67c4462820a034781dc439585d81f2fd82716","observation_id":"06b5534a-c3b5-44d1-83fa-4c6ec22538d7","resolution":{"observed_at":"2026-08-14T14:34:49.637524Z","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-14T14:34:49.619023Z","title":"Gomez-Gardenes and V","venue":null,"work_id":"df987213-e4f3-46a3-8b86-16535f93ad6f","year":2008},"citing_paper":{"arxiv_id":"1908.04731","last_updated":"2019-08-08T08:36:09Z","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T14:34:49.587371Z"},"links":{"citing_paper":"/paper/1908.04731"},"observation_digest":"sha256:475d0f69c4ad4bb3eb2c246af9168df948f463c8abdf87984cc22219e6d97cb3","observation_id":"1754291e-bcad-437a-a5fe-beabc3a7a82f","resolution":{"observed_at":"2026-08-14T14:34:49.624448Z","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.04731","last_updated":"2019-08-08T08:36:09Z","latest_version":1,"primary_category":"physics.soc-ph","snapshot_observed_at":"2026-08-16T15:33:33.458504Z","submitted_at":"2019-08-08T08:36:09Z","title":"Quantifying information loss on chaotic attractors through recurrence networks"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":21},"total_outbound_references":42},"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 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:1908.04731."}