{"as_of":"2026-08-11T21:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b81df46caeb7c242159326805c88409cef3415c24207c90d858b78dd3b156df7","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:55:34.914750Z","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-10T22:11:15.335188Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.15959","last_updated":"2024-06-22T23:25:54Z","snapshot_observed_at":"2026-08-05T16:04:12.442921Z","submitted_at":"2024-06-22T23:25:54Z","title":"A Nonoverlapping Domain Decomposition Method for Extreme Learning Machines: Elliptic Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15959","snapshot_observed_at":"2026-08-11T00:55:34.914750Z","title":"A nonoverlapping domain decomposition method for extreme learning machines: Elliptic problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19235","last_updated":"2024-12-26T14:30:54Z","snapshot_observed_at":"2026-08-11T17:47:06.315224Z","submitted_at":"2024-12-26T14:30:54Z","title":"Are Two Hidden Layers Still Enough for the Physics-Informed Neural Networks?","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:34.914750Z"},"links":{"cited_paper":"/paper/2406.15959","citing_paper":"/paper/2412.19235"},"observation_digest":"sha256:bb0e024d6f914d0851244223770646ebe5d1d25cb4aa46fc22416ef212320374","observation_id":"e9c5dbc4-f4e5-414b-a27b-e9f9673d0912","resolution":{"observed_at":"2026-08-11T00:55:34.914750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15959","last_updated":"2024-06-22T23:25:54Z","snapshot_observed_at":"2026-08-05T16:04:12.442921Z","submitted_at":"2024-06-22T23:25:54Z","title":"A Nonoverlapping Domain Decomposition Method for Extreme Learning Machines: Elliptic Problems","version":1},"cited_work":{"arxiv_id":"2406.15959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.15959","snapshot_observed_at":"2026-08-10T22:11:15.335188Z","title":"A Nonoverlapping Domain Decomposition Method for Extreme Learning Machines: Elliptic Problems","venue":"math.NA","work_id":"d630e096-fb88-4e57-8d59-fe3cf20df113","year":2024},"citing_paper":{"arxiv_id":"2501.02791","last_updated":"2025-01-06T06:18:38Z","snapshot_observed_at":"2026-08-11T16:13:12.765042Z","submitted_at":"2025-01-06T06:18:38Z","title":"Orthogonal greedy algorithm for linear operator learning with shallow neural network","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:11:14.708055Z"},"links":{"cited_paper":"/paper/2406.15959","citing_paper":"/paper/2501.02791"},"observation_digest":"sha256:6101224b4a62d9e57876f150c774467d49d86684bbf64b5d2311d9bd11671092","observation_id":"0ba103a0-3bf0-44da-9e67-561b67c215c0","resolution":{"observed_at":"2026-08-10T22:11:15.339943Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.15959/citation-record","integrity":"/paper/2406.15959/integrity","json":"/paper/2406.15959/citation-record.json","paper":"/paper/2406.15959"},"outbound":[],"paper":{"arxiv_id":"2406.15959","last_updated":"2024-06-22T23:25:54Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-05T16:04:12.442921Z","submitted_at":"2024-06-22T23:25:54Z","title":"A Nonoverlapping Domain Decomposition Method for Extreme Learning Machines: Elliptic Problems"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.15959."}