{"as_of":"2026-08-11T03:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16c739713032a55ed7ecade7a70a0c0eea2b381b2404bf818384edc1a4496726","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:19:56.153622Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T20:26:03.835954Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1603.00809","last_updated":"2016-03-02T17:52:34Z","snapshot_observed_at":"2026-07-06T04:48:05.428011Z","submitted_at":"2016-03-02T17:52:34Z","title":"The computation of disconnected bifurcation diagrams","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.00809","snapshot_observed_at":"2026-08-10T17:19:56.153622Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.12361","last_updated":"2025-05-13T13:49:42Z","snapshot_observed_at":"2026-08-10T17:11:56.700108Z","submitted_at":"2025-01-21T18:41:31Z","title":"Deflation-based certified greedy algorithm and adaptivity for bifurcating nonlinear PDEs","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T17:19:56.153622Z"},"links":{"cited_paper":"/paper/1603.00809","citing_paper":"/paper/2501.12361"},"observation_digest":"sha256:687946ccfde4fe8d62999c4169cbd0691a340fb5692fdc078e8d3fd5e0cbb3f8","observation_id":"5dfce881-3bb6-43eb-957c-35c673ca66b7","resolution":{"observed_at":"2026-08-10T17:19:56.153622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.00809","last_updated":"2016-03-02T17:52:34Z","snapshot_observed_at":"2026-07-06T04:48:05.428011Z","submitted_at":"2016-03-02T17:52:34Z","title":"The computation of disconnected bifurcation diagrams","version":1},"cited_work":{"arxiv_id":"1603.00809","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.00809","snapshot_observed_at":"2026-08-06T20:26:03.835954Z","title":"The computation of disconnected bifurcation diagrams","venue":"math.NA","work_id":"bfb0df67-4dda-41f9-bbce-df5777b018f1","year":2016},"citing_paper":{"arxiv_id":"2507.03190","last_updated":"2025-07-11T16:55:14Z","snapshot_observed_at":"2026-08-09T21:38:31.177548Z","submitted_at":"2025-07-03T21:45:17Z","title":"Discovering Algorithms with Computational Language Processing","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:26:02.521904Z"},"links":{"cited_paper":"/paper/1603.00809","citing_paper":"/paper/2507.03190"},"observation_digest":"sha256:e6aecddf772165aea4731cabd30b577721bace8b3a4c8abff974767950e36222","observation_id":"bc5688b6-d94a-44e8-be8c-ee07f46214b5","resolution":{"observed_at":"2026-08-06T20:26:03.922713Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.00809","last_updated":"2016-03-02T17:52:34Z","snapshot_observed_at":"2026-07-06T04:48:05.428011Z","submitted_at":"2016-03-02T17:52:34Z","title":"The computation of disconnected bifurcation diagrams","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.00809","snapshot_observed_at":"2026-08-03T15:52:43.880569Z","title":"Farrell, C","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.15424","last_updated":"2026-06-23T08:35:55Z","snapshot_observed_at":"2026-08-08T05:30:39.797932Z","submitted_at":"2025-12-17T13:14:55Z","title":"On bifurcations and traction forces on an obstacle in incompressible flow","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T15:52:43.880569Z"},"links":{"cited_paper":"/paper/1603.00809","citing_paper":"/paper/2512.15424"},"observation_digest":"sha256:eb784c19e79ca3cca779fbf70e825fabb3a2ab43c5c5d16a8c8235e69c3fb961","observation_id":"44002f4e-f71d-486e-a62f-72a5c035eb25","resolution":{"observed_at":"2026-08-03T15:52:43.880569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1603.00809/citation-record","integrity":"/paper/1603.00809/integrity","json":"/paper/1603.00809/citation-record.json","paper":"/paper/1603.00809"},"outbound":[],"paper":{"arxiv_id":"1603.00809","last_updated":"2016-03-02T17:52:34Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-07-06T04:48:05.428011Z","submitted_at":"2016-03-02T17:52:34Z","title":"The computation of disconnected bifurcation diagrams"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1603.00809."}