{"as_of":"2026-08-06T18:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d42acd3535bdf0eb85890cb66661cb2ede1bfead5a9b7f9c4abefd3dd768b27a","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-06T06:34:29.942622+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-03T19:25:37.790553Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T12:05:23.224009Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1805.12498","last_updated":"2019-05-01T16:17:04Z","snapshot_observed_at":"2026-07-06T06:42:15.167440Z","submitted_at":"2018-05-31T14:44:06Z","title":"A faster hafnian formula for complex matrices and its benchmarking on a supercomputer","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.12498","snapshot_observed_at":"2026-08-03T19:25:37.790553Z","title":"Bj¨ orklund, B","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.00753","last_updated":"2026-05-28T01:49:07Z","snapshot_observed_at":"2026-08-06T18:26:46.932794Z","submitted_at":"2025-11-30T06:13:58Z","title":"Boosting Gaussian Boson Sampling using Optical Parametric Amplification Networks","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T19:25:37.790553Z"},"links":{"cited_paper":"/paper/1805.12498","citing_paper":"/paper/2512.00753"},"observation_digest":"sha256:df5e54db7c3a8be787dd7f3871a9fa210c1f382683d684fc5a78351ef871b439","observation_id":"616c9554-bc51-4a3f-beb6-21af8d0551fd","resolution":{"observed_at":"2026-08-03T19:25:37.790553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.12498","last_updated":"2019-05-01T16:17:04Z","snapshot_observed_at":"2026-07-06T06:42:15.167440Z","submitted_at":"2018-05-31T14:44:06Z","title":"A faster hafnian formula for complex matrices and its benchmarking on a supercomputer","version":3},"cited_work":{"arxiv_id":"1805.12498","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1805.12498","snapshot_observed_at":"2026-07-04T23:35:54.730478Z","title":"A faster hafnian formula for complex matrices and its benchmarking on a supercomputer","venue":null,"work_id":"421878ec-c7e5-483d-963d-c62e67074cba","year":null},"citing_paper":{"arxiv_id":"2604.18720","last_updated":"2026-04-20T18:20:13Z","snapshot_observed_at":"2026-07-06T23:05:30.879164Z","submitted_at":"2026-04-20T18:20:13Z","title":"Exponentially-improved effective descriptions of physical bosonic systems","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-10T04:41:11.710578Z"},"links":{"cited_paper":"/paper/1805.12498","citing_paper":"/paper/2604.18720"},"observation_digest":"sha256:5d17b84adbe919eb030664aa09420660b1907db4560cbca85b0d6f7b4404853c","observation_id":"d8ace257-8b2f-4f38-bcf0-a6c79d293bb5","resolution":{"observed_at":"2026-07-04T23:35:54.730478Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1805.12498/citation-record","integrity":"/paper/1805.12498/integrity","json":"/paper/1805.12498/citation-record.json","paper":"/paper/1805.12498"},"outbound":[],"paper":{"arxiv_id":"1805.12498","last_updated":"2019-05-01T16:17:04Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T06:42:15.167440Z","submitted_at":"2018-05-31T14:44:06Z","title":"A faster hafnian formula for complex matrices and its benchmarking on a supercomputer"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1805.12498."}