{"as_of":"2026-08-09T16:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e97193eb83195cb1f3822fbad111139f16362260ca6716266d32ec871939462e","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-09T06:31:02.800959+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-09T11:38:41.817496Z","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-09T11:08:41.608935Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1705.05605","last_updated":"2017-11-30T10:37:27Z","snapshot_observed_at":"2026-08-09T14:09:22.759190Z","submitted_at":"2017-05-16T09:09:21Z","title":"Toward solving the sign problem with path optimization method","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.05605","snapshot_observed_at":"2026-08-09T11:38:41.817496Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.02670","last_updated":"2025-02-20T21:20:33Z","snapshot_observed_at":"2026-08-09T14:09:52.357796Z","submitted_at":"2025-02-04T19:18:44Z","title":"Machine-learning approaches to accelerating lattice simulations","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T11:38:41.817496Z"},"links":{"cited_paper":"/paper/1705.05605","citing_paper":"/paper/2502.02670"},"observation_digest":"sha256:65d0c2328456061d864a1e7e4da332ea18e65f44bcdcfd3ae2811fea98cbcf3c","observation_id":"af25e423-783f-4a35-872b-a6ae87ac322a","resolution":{"observed_at":"2026-08-09T11:38:41.817496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.05605","last_updated":"2017-11-30T10:37:27Z","snapshot_observed_at":"2026-08-09T14:09:22.759190Z","submitted_at":"2017-05-16T09:09:21Z","title":"Toward solving the sign problem with path optimization method","version":2},"cited_work":{"arxiv_id":"1705.05605","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.05605","snapshot_observed_at":"2026-08-09T11:08:41.608935Z","title":"Toward solving the sign problem with path optimization method","venue":"hep-lat","work_id":"ce409389-c567-4f99-8f9a-1510ae155fba","year":2017},"citing_paper":{"arxiv_id":"2502.02804","last_updated":"2025-05-10T13:34:06Z","snapshot_observed_at":"2026-08-09T14:09:04.270781Z","submitted_at":"2025-02-05T01:00:21Z","title":"Path optimization method for the sign problem caused by fermion determinant","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T11:08:38.789232Z"},"links":{"cited_paper":"/paper/1705.05605","citing_paper":"/paper/2502.02804"},"observation_digest":"sha256:2887de92d551653958d72b40b2cf7be98acfd7d073711f348ea6a81b575401ee","observation_id":"7b11b3ff-4204-4eaf-b902-b3daf447b2b9","resolution":{"observed_at":"2026-08-09T11:08:41.627791Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.05605","last_updated":"2017-11-30T10:37:27Z","snapshot_observed_at":"2026-08-09T14:09:22.759190Z","submitted_at":"2017-05-16T09:09:21Z","title":"Toward solving the sign problem with path optimization method","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.05605","snapshot_observed_at":"2026-08-01T22:29:26.386248Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.15742","last_updated":"2026-07-17T08:23:54Z","snapshot_observed_at":"2026-08-09T03:16:27.404332Z","submitted_at":"2026-07-17T08:23:54Z","title":"Path optimization method for the sign problem: Insights from random matrix models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:26.386248Z"},"links":{"cited_paper":"/paper/1705.05605","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:eb37e902e942b0d3c0f3064e8c8ea98de8783120a0ae62383ff83363c896b8e6","observation_id":"f0fa24eb-b7ea-4179-bfa1-6734aac2f56e","resolution":{"observed_at":"2026-08-01T22:29:26.386248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1705.05605/citation-record","integrity":"/paper/1705.05605/integrity","json":"/paper/1705.05605/citation-record.json","paper":"/paper/1705.05605"},"outbound":[],"paper":{"arxiv_id":"1705.05605","last_updated":"2017-11-30T10:37:27Z","latest_version":2,"primary_category":"hep-lat","snapshot_observed_at":"2026-08-09T14:09:22.759190Z","submitted_at":"2017-05-16T09:09:21Z","title":"Toward solving the sign problem with path optimization method"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1705.05605."}