{"as_of":"2026-08-14T15:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:45e7bf5caf594d72117822c427ac129f92190ae32654310dc1579f4550039e72","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-14T06:32:32.682623+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-12T19:54:02.408050Z","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-10T23:01:35.493096Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1712.03112","last_updated":"2017-12-08T15:02:29Z","snapshot_observed_at":"2026-08-13T21:28:23.658357Z","submitted_at":"2017-12-08T15:02:29Z","title":"Effective Extensible Programming: Unleashing Julia on GPUs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.03112","snapshot_observed_at":"2026-08-12T19:54:02.408050Z","title":"Besard, C","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.10266","last_updated":"2024-11-15T15:15:04Z","snapshot_observed_at":"2026-08-14T10:37:38.034932Z","submitted_at":"2024-11-15T15:15:04Z","title":"Universal non-equilibrium scaling of cumulants across a critical point","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-12T19:54:02.408050Z"},"links":{"cited_paper":"/paper/1712.03112","citing_paper":"/paper/2411.10266"},"observation_digest":"sha256:8ce72562780c31106e521137ba6a05b18ea3b8445954449904742c9eb207d39c","observation_id":"d02caa9f-b3be-4c55-8442-c031613264a6","resolution":{"observed_at":"2026-08-12T19:54:02.408050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.03112","last_updated":"2017-12-08T15:02:29Z","snapshot_observed_at":"2026-08-13T21:28:23.658357Z","submitted_at":"2017-12-08T15:02:29Z","title":"Effective Extensible Programming: Unleashing Julia on GPUs","version":1},"cited_work":{"arxiv_id":"1712.03112","doi":null,"metadata_source":"pith","pith_arxiv_id":"1712.03112","snapshot_observed_at":"2026-08-10T23:01:35.493096Z","title":"Effective Extensible Programming: Unleashing Julia on GPUs","venue":"cs.PL","work_id":"4b051c18-c46d-4e42-a116-d77426254bdc","year":2017},"citing_paper":{"arxiv_id":"2501.00227","last_updated":"2024-12-31T02:30:34Z","snapshot_observed_at":"2026-08-12T18:50:04.066832Z","submitted_at":"2024-12-31T02:30:34Z","title":"Programming guide for solving constraint satisfaction problems with tensor networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T23:01:35.076446Z"},"links":{"cited_paper":"/paper/1712.03112","citing_paper":"/paper/2501.00227"},"observation_digest":"sha256:ed59dc166059082e77d70b088e86348bc782a528729eb00650a9079d20217cd7","observation_id":"6e9d1f78-cb33-4f58-a532-742e380c5066","resolution":{"observed_at":"2026-08-10T23:01:35.499101Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.03112","last_updated":"2017-12-08T15:02:29Z","snapshot_observed_at":"2026-08-13T21:28:23.658357Z","submitted_at":"2017-12-08T15:02:29Z","title":"Effective Extensible Programming: Unleashing Julia on GPUs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.03112","snapshot_observed_at":"2026-08-04T08:42:52.330654Z","title":"Effective extensible program- ming: Unleashing Julia on GPUs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.19608","last_updated":"2026-06-07T16:47:12Z","snapshot_observed_at":"2026-08-10T03:02:09.414769Z","submitted_at":"2025-10-22T14:01:42Z","title":"Optimal Kron-based Reduction of Networks (Opti-KRON) for Three-phase Distribution Feeders","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T08:42:52.330654Z"},"links":{"cited_paper":"/paper/1712.03112","citing_paper":"/paper/2510.19608"},"observation_digest":"sha256:9633f152326e82aedd6ffb77b44ad951a79ac94672b51bed089793e2372f91af","observation_id":"a9ef496a-8596-49d9-b056-36ceda7d7fb1","resolution":{"observed_at":"2026-08-04T08:42:52.330654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1712.03112/citation-record","integrity":"/paper/1712.03112/integrity","json":"/paper/1712.03112/citation-record.json","paper":"/paper/1712.03112"},"outbound":[],"paper":{"arxiv_id":"1712.03112","last_updated":"2017-12-08T15:02:29Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-13T21:28:23.658357Z","submitted_at":"2017-12-08T15:02:29Z","title":"Effective Extensible Programming: Unleashing Julia on GPUs"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1712.03112."}