{"as_of":"2026-08-09T14:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5dc44dfe7c1d281745c24cd8af6097c46ad180e22fc4e9c701ce107c49cb148","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T22:29:30.815339Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.15742/citation-record","integrity":"/paper/2607.15742/integrity","json":"/paper/2607.15742/citation-record.json","paper":"/paper/2607.15742"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1005.0539","last_updated":"2010-06-01T14:39:07Z","snapshot_observed_at":"2026-08-08T14:53:38.265649Z","submitted_at":"2010-05-04T14:27:36Z","title":"Simulating QCD at finite density","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1005.0539","snapshot_observed_at":"2026-08-01T22:29:25.835977Z","title":"de Forcrand, PoS LA T2009, 010 (2009), arXiv:1005.0539 [hep-lat]","venue":null,"work_id":null,"year":2009},"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":1,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:25.835977Z"},"links":{"cited_paper":"/paper/1005.0539","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:23ab8f4409d0eaf6ddfef1597dfeac3eab7e7bf34fb7ed41ef1c4148c8b1f881","observation_id":"b428e1ea-b7cd-41d3-a552-8ca41a0a227f","resolution":{"observed_at":"2026-08-01T22:29:25.835977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.12423","last_updated":"2021-08-27T00:52:38Z","snapshot_observed_at":"2026-08-08T07:34:38.263073Z","submitted_at":"2021-08-27T00:52:38Z","title":"Finite-density lattice QCD and sign problem: current status and open problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.12423","snapshot_observed_at":"2026-08-01T22:29:25.957599Z","title":"Nagata, ￿￿￿￿￿￿ (Soryusironkenkyu) 31, 1 (2020) ; Prog","venue":null,"work_id":null,"year":2020},"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":2,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:25.957599Z"},"links":{"cited_paper":"/paper/2108.12423","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:f2e5893be47de736b3b9f0bf4a39fb3fd682ffedaae590e78af1f5d3d8871704","observation_id":"2fd27b10-966c-40c6-91df-dfca1fd2a930","resolution":{"observed_at":"2026-08-01T22:29:25.957599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1001.2933","last_updated":"2010-08-28T04:23:48Z","snapshot_observed_at":"2026-08-06T06:26:01.233312Z","submitted_at":"2010-01-18T17:02:17Z","title":"Analytic Continuation Of Chern-Simons Theory","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1001.2933","snapshot_observed_at":"2026-08-01T22:29:26.085195Z","title":"Witten, AMS/IP Stud","venue":null,"work_id":null,"year":2011},"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":3,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:26.085195Z"},"links":{"cited_paper":"/paper/1001.2933","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:3d3004ecdc7df54a11c9ddf78d17549f1b9f11fddf115fb1338bbbc2698c5bfb","observation_id":"5c393cac-64ae-434e-bd9d-39efd27af7ed","resolution":{"observed_at":"2026-08-01T22:29:26.085195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:29:26.239300Z","title":"Duane, A","venue":null,"work_id":null,"year":1987},"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":4,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:26.239300Z"},"links":{"citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:faed0dd4dc54ea7af9008f9581344d3e6b5699a04a8c24f13b21583d1365dc2e","observation_id":"27696562-c1ed-48e6-86a9-09c6ae2c50c4","resolution":{"observed_at":"2026-08-01T22:29:26.239300Z","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":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"}},{"citation":{"cited_paper":{"arxiv_id":"1709.03208","last_updated":"2017-12-26T13:28:20Z","snapshot_observed_at":"2026-08-08T04:10:49.751562Z","submitted_at":"2017-09-11T01:24:02Z","title":"Application of neural network to sign problem via path optimization method","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.03208","snapshot_observed_at":"2026-08-01T22:29:26.565930Z","title":null,"venue":null,"work_id":null,"year":2018},"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":6,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:26.565930Z"},"links":{"cited_paper":"/paper/1709.03208","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:1d42dc3d1cfd3bd7c262d68a9d0c69d9fd53c4880309fc5d1b075314fc6d86dd","observation_id":"2a02fdb9-28a3-40b8-adb2-05ea57824211","resolution":{"observed_at":"2026-08-01T22:29:26.565930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01971","last_updated":"2017-09-06T19:32:34Z","snapshot_observed_at":"2026-08-04T16:30:58.941601Z","submitted_at":"2017-09-06T19:32:34Z","title":"Deep Learning Beyond Lefschetz Thimbles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.01971","snapshot_observed_at":"2026-08-01T22:29:26.740864Z","title":"Alexandru, P","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":7,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:26.740864Z"},"links":{"cited_paper":"/paper/1709.01971","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:8b71e7bfa48751875e492751583c4866c6bab7b60520bd9e2d81838656203cab","observation_id":"ddb4abc1-24d6-4883-a5eb-57218b15772c","resolution":{"observed_at":"2026-08-01T22:29:26.740864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.05436","last_updated":"2020-07-10T15:17:07Z","snapshot_observed_at":"2026-08-03T18:40:00.303447Z","submitted_at":"2020-07-10T15:17:07Z","title":"Complex Paths Around The Sign Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.05436","snapshot_observed_at":"2026-08-01T22:29:26.896153Z","title":"Alexandru, G","venue":null,"work_id":null,"year":2022},"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":8,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:26.896153Z"},"links":{"cited_paper":"/paper/2007.05436","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:c8d83aaee8d17f30fd58a996879f8eb342df3c035c45fdd499a7e24faf076694","observation_id":"ecc97f71-deaf-4bf3-8f97-19d13e33bc7e","resolution":{"observed_at":"2026-08-01T22:29:26.896153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"hep-lat/9604003","last_updated":"1996-05-14T01:17:17Z","snapshot_observed_at":"2026-07-07T03:45:17.091043Z","submitted_at":"1996-04-04T02:52:15Z","title":"Random matrix model of QCD at finite density and the nature of the quenched limit","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"hep-lat/9604003","snapshot_observed_at":"2026-08-01T22:29:27.039056Z","title":null,"venue":null,"work_id":null,"year":1996},"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":9,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:27.039056Z"},"links":{"cited_paper":"/paper/hep-lat/9604003","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:9337b0db3bde3f9eb4d72f6abccb4679b44184d298a4007bb64c9ef4453725b1","observation_id":"e177c512-82be-4040-8aac-a25b62522c67","resolution":{"observed_at":"2026-08-01T22:29:27.039056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"hep-ph/9804290","last_updated":"1998-07-21T15:47:04Z","snapshot_observed_at":"2026-07-07T04:29:09.115226Z","submitted_at":"1998-04-15T03:51:30Z","title":"On the Phase Diagram of QCD","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"hep-ph/9804290","snapshot_observed_at":"2026-08-01T22:29:27.140666Z","title":null,"venue":null,"work_id":null,"year":1998},"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":10,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:27.140666Z"},"links":{"cited_paper":"/paper/hep-ph/9804290","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:48f993b9b83824577f196a339778f4556e94fcd743c42cb83c83cea16c841435","observation_id":"6648395d-be7f-4460-a2f1-f5952366c9d9","resolution":{"observed_at":"2026-08-01T22:29:27.140666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.07514","last_updated":"2017-12-19T10:54:54Z","snapshot_observed_at":"2026-07-06T06:15:22.497001Z","submitted_at":"2017-12-19T10:54:54Z","title":"Complex Langevin Simulation of a Random Matrix Model at Nonzero Chemical Potential","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.07514","snapshot_observed_at":"2026-08-01T22:29:27.265195Z","title":"Bloch, J","venue":null,"work_id":null,"year":2018},"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":11,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:27.265195Z"},"links":{"cited_paper":"/paper/1712.07514","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:452499f17f3397689fef91e4cde8796ef99a6defbfc6f45f01e9e713b945acd9","observation_id":"2b76bf39-8988-45f1-bf02-6619e077fdd9","resolution":{"observed_at":"2026-08-01T22:29:27.265195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.08468","last_updated":"2020-12-15T18:10:16Z","snapshot_observed_at":"2026-08-09T06:51:21.998760Z","submitted_at":"2020-12-15T18:10:16Z","title":"Worldvolume approach to the tempered Lefschetz thimble method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.08468","snapshot_observed_at":"2026-08-01T22:29:27.426975Z","title":"Fukuma and N","venue":null,"work_id":null,"year":2021},"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":12,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:27.426975Z"},"links":{"cited_paper":"/paper/2012.08468","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:96f1c17cc16972fa2926661f675b141a706f508dc05fba997c83b6fe03e50e58","observation_id":"88b5dff2-7476-42fe-a045-7adf2f59e979","resolution":{"observed_at":"2026-08-01T22:29:27.426975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.12947","last_updated":"2023-01-30T14:42:31Z","snapshot_observed_at":"2026-08-06T15:19:54.054733Z","submitted_at":"2023-01-30T14:42:31Z","title":"Fighting the sign problem in a chiral random matrix model with contour deformations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.12947","snapshot_observed_at":"2026-08-01T22:29:27.590320Z","title":"Giordano, A","venue":null,"work_id":null,"year":2023},"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":13,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:27.590320Z"},"links":{"cited_paper":"/paper/2301.12947","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:747516c2c2fada880a93d96c24b79d045856f57d411e7004272cbef9791a1110","observation_id":"c5890a68-ba8d-4a5e-a630-ae6c001ae9de","resolution":{"observed_at":"2026-08-01T22:29:27.590320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1309.4335","last_updated":"2013-09-17T14:50:27Z","snapshot_observed_at":"2026-07-06T03:23:15.098916Z","submitted_at":"2013-09-17T14:50:27Z","title":"Complex Langevin Dynamics for chiral Random Matrix Theory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1309.4335","snapshot_observed_at":"2026-08-01T22:29:27.737609Z","title":"Mollgaard and K","venue":null,"work_id":null,"year":2013},"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":14,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:27.737609Z"},"links":{"cited_paper":"/paper/1309.4335","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:5f1c5abea1d6928b120b5df921ab2802ce4ae7e100dc36d67bfd865c044fa7fb","observation_id":"af31518c-82b5-48b2-96d3-0fb13780d865","resolution":{"observed_at":"2026-08-01T22:29:27.737609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.2729","last_updated":"2014-12-08T20:34:59Z","snapshot_observed_at":"2026-08-06T14:13:07.818555Z","submitted_at":"2014-12-08T20:34:59Z","title":"Full simulation of chiral Random Matrix Theory at non-zero chemical potential by Complex Langevin","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.2729","snapshot_observed_at":"2026-08-01T22:29:27.858414Z","title":"Mollgaard and K","venue":null,"work_id":null,"year":2015},"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":15,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:27.858414Z"},"links":{"cited_paper":"/paper/1412.2729","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:e7b92a413bea256adcf3aee8fe5d81024b18cb1b84d97e3572da44cb4516e088","observation_id":"4fe398f0-8e72-48bb-bb21-4fd1be90ee18","resolution":{"observed_at":"2026-08-01T22:29:27.858414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.09554","last_updated":"2016-03-31T12:26:36Z","snapshot_observed_at":"2026-07-06T04:51:16.652993Z","submitted_at":"2016-03-31T12:26:36Z","title":"Test for a universal behavior of Dirac eigenvalues in the complex Langevin method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.09554","snapshot_observed_at":"2026-08-01T22:29:27.955301Z","title":"Ichihara, K","venue":null,"work_id":null,"year":2016},"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":16,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:27.955301Z"},"links":{"cited_paper":"/paper/1603.09554","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:e28733ee832eb1af5f2ffc81688bf306a35cb7b9dc38f5e68ea62411b5756b65","observation_id":"6696f4cb-0ed7-4727-a575-508b55ba1e1f","resolution":{"observed_at":"2026-08-01T22:29:27.955301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12328","last_updated":"2024-11-22T15:04:14Z","snapshot_observed_at":"2026-08-06T17:14:31.540168Z","submitted_at":"2024-08-22T12:12:41Z","title":"Phase diagram of a generalized Stephanov model for finite-density QCD","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12328","snapshot_observed_at":"2026-08-01T22:29:28.038855Z","title":"Baranka and M","venue":null,"work_id":null,"year":2024},"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":17,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:28.038855Z"},"links":{"cited_paper":"/paper/2408.12328","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:61bc6ea1e983f1bf90a4dd5795a3e1ea0605fd5e3392655df1eabf75f557919b","observation_id":"c1b9b05d-0438-441e-bc6b-5544206f3db3","resolution":{"observed_at":"2026-08-01T22:29:28.038855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1211.3990","last_updated":"2012-11-16T18:43:00Z","snapshot_observed_at":"2026-07-06T03:00:04.024179Z","submitted_at":"2012-11-16T18:43:00Z","title":"Subsets and the canonical partition functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1211.3990","snapshot_observed_at":"2026-08-01T22:29:28.207978Z","title":"Bloch, F","venue":null,"work_id":null,"year":2013},"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":18,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:28.207978Z"},"links":{"cited_paper":"/paper/1211.3990","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:49d93507c45659ecf3f5358f78dab9c31296b42513ed2a9ee0a0e44f1fe9b847","observation_id":"5c090443-9ec0-4250-b862-8f4d951b8c95","resolution":{"observed_at":"2026-08-01T22:29:28.207978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.00697","last_updated":"2018-04-02T19:01:05Z","snapshot_observed_at":"2026-07-06T06:31:24.571645Z","submitted_at":"2018-04-02T19:01:05Z","title":"Finite-Density Monte Carlo Calculations on Sign-Optimized Manifolds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.00697","snapshot_observed_at":"2026-08-01T22:29:28.375417Z","title":"Alexandru, P","venue":null,"work_id":null,"year":2018},"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":19,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:28.375417Z"},"links":{"cited_paper":"/paper/1804.00697","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:287fdd18e94f65165728ba7b823d1f2e60719ea94a4f01e7c04b4b863ea0cb47","observation_id":"2aeda101-09d4-4112-854d-4d1add897e36","resolution":{"observed_at":"2026-08-01T22:29:28.375417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:29:28.515536Z","title":"Szandała, in Bio-inspired neurocomputing (Springer,","venue":null,"work_id":null,"year":null},"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":20,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:28.515536Z"},"links":{"citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:4b7d57536806c70573293752f9fcf8ea5bf2d5db86b1d804fa08298c2fd8ed42","observation_id":"f54ca6d5-94a3-408f-ae0e-6124e3f88d79","resolution":{"observed_at":"2026-08-01T22:29:28.515536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:29:28.656911Z","title":null,"venue":null,"work_id":null,"year":1986},"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":21,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:28.656911Z"},"links":{"citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:b9c2a6d0b12b2f40d76adc92f30a25ba5a69ba99d0025e7816bf912c40f823d3","observation_id":"e8b6e399-ac9a-48cc-b099-a0f1b74cd4d2","resolution":{"observed_at":"2026-08-01T22:29:28.656911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05402","last_updated":"2023-02-15T06:17:12Z","snapshot_observed_at":"2026-07-06T14:03:38.013152Z","submitted_at":"2022-10-11T12:25:33Z","title":"Improving efficiency of the path optimization method for a gauge theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.05402","snapshot_observed_at":"2026-08-01T22:29:28.768309Z","title":"Namekawa, K","venue":null,"work_id":null,"year":2023},"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":22,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:28.768309Z"},"links":{"cited_paper":"/paper/2210.05402","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:d299ed0b5c9d6a8eef50dd18697f517afdbc86e1e21c13814876bd7cfc780dbb","observation_id":"15f35860-4bd5-4e0b-923e-43f9e6bc8c13","resolution":{"observed_at":"2026-08-01T22:29:28.768309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02804","snapshot_observed_at":"2026-08-01T22:29:28.914765Z","title":"Hisayoshi, K","venue":null,"work_id":null,"year":2025},"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":23,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:28.914765Z"},"links":{"cited_paper":"/paper/2502.02804","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:b62eae79684c4f7f4931ee64ed2ad53d3c2d4bf7bf78f85d375cffc0b57da5c1","observation_id":"7b15542e-6f39-47aa-94ad-3c1e2fe6e454","resolution":{"observed_at":"2026-08-01T22:29:28.914765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:29:29.053752Z","title":null,"venue":null,"work_id":null,"year":1986},"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":24,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:29.053752Z"},"links":{"citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:15d8669fe10fe086e3e3eb03885f53e65e1ff9dac41f51b2dfb7b3df4e9e9f09","observation_id":"aebef0e0-dacd-471a-a14a-5355b1e7555e","resolution":{"observed_at":"2026-08-01T22:29:29.053752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:29:29.180949Z","title":null,"venue":null,"work_id":null,"year":1991},"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":25,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:29.180949Z"},"links":{"citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:94cb55e2dc0c77b72d51a58c0e9e86942db119e1e6f616d6140d187922621c37","observation_id":"0ad95d9e-6c9e-4eb3-9eeb-e85f3bedf761","resolution":{"observed_at":"2026-08-01T22:29:29.180949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:29:29.336572Z","title":"Hukushima and K","venue":null,"work_id":null,"year":1996},"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":26,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:29.336572Z"},"links":{"citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:b38adfec06f2c5de82259e5dc641f0441caaf3d9917787d6c6f4e088e2b241db","observation_id":"3c42f858-cae3-4463-9de1-058b15954336","resolution":{"observed_at":"2026-08-01T22:29:29.336572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.04167","last_updated":"2020-09-26T05:50:16Z","snapshot_observed_at":"2026-08-03T05:47:44.533363Z","submitted_at":"2020-07-08T14:54:27Z","title":"Path optimization for $U(1)$ gauge theory with complexified parameters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.04167","snapshot_observed_at":"2026-08-01T22:29:29.492190Z","title":"Kashiwa and Y","venue":null,"work_id":null,"year":2020},"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":27,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:29.492190Z"},"links":{"cited_paper":"/paper/2007.04167","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:13ef318c39f4622cd535baf94e76adde40179937ee9a0214fdd037eee1b22770","observation_id":"98e6db1f-8bab-4d0d-b5cb-60e321c96970","resolution":{"observed_at":"2026-08-01T22:29:29.492190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:29:29.630476Z","title":"Paszke, S","venue":null,"work_id":null,"year":2019},"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":28,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:29.630476Z"},"links":{"citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:fb6e14e6cd8648b12b252772eeb28119b8400a14de78466d2da451e7e2c93399","observation_id":"fba1f28a-91b7-48f1-98b0-86113ad4c083","resolution":{"observed_at":"2026-08-01T22:29:29.630476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08681","last_updated":"2020-08-13T05:42:12Z","snapshot_observed_at":"2026-07-06T08:16:16.271286Z","submitted_at":"2019-08-23T06:22:06Z","title":"Mish: A Self Regularized Non-Monotonic Activation Function","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08681","snapshot_observed_at":"2026-08-01T22:29:29.740549Z","title":"Misra, arXiv:1908.08681 [cs.LG]","venue":null,"work_id":null,"year":1908},"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":29,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:29.740549Z"},"links":{"cited_paper":"/paper/1908.08681","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:5a0221284485fdac2d02ec1c0ce0dcb6e8f6908778b782e40d5dc887f390c3e0","observation_id":"ec98a2f6-0353-4e26-ac15-6e1eb717126f","resolution":{"observed_at":"2026-08-01T22:29:29.740549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:29:29.865573Z","title":"Glorot and Y","venue":null,"work_id":null,"year":2010},"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":30,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:29.865573Z"},"links":{"citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:f90bad100726e145df289f05eeb0cad4cf64eb3ba9fed65a8f1dd37ff14e848a","observation_id":"b1b37898-e1d8-44dc-9fff-b7da44524ad9","resolution":{"observed_at":"2026-08-01T22:29:29.865573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-01T22:29:29.985423Z","title":"Loshchilov and F","venue":null,"work_id":null,"year":2019},"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":31,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:29.985423Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:a77ea3c38d07858d493c0b400b1a8410b4a8369bf1197ffc6be3794f7d94f7ad","observation_id":"6b564e75-7dfc-423f-8885-b58a648f0e12","resolution":{"observed_at":"2026-08-01T22:29:29.985423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.07454","last_updated":"2019-11-21T11:01:34Z","snapshot_observed_at":"2026-08-08T14:05:33.854211Z","submitted_at":"2019-10-16T16:22:58Z","title":"An Exponential Learning Rate Schedule for Deep Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.07454","snapshot_observed_at":"2026-08-01T22:29:30.146859Z","title":"Li and S","venue":null,"work_id":null,"year":1910},"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":32,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:30.146859Z"},"links":{"cited_paper":"/paper/1910.07454","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:6fc2286437588c3bc1c72cf70034b7378e5bafadbbbd752040e824ad771c0d58","observation_id":"6006b382-1d48-4f9e-a0a2-85928852702d","resolution":{"observed_at":"2026-08-01T22:29:30.146859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:29:30.284048Z","title":"Bottou, Online learning in neural networks (1998)","venue":null,"work_id":null,"year":1998},"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":33,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:30.284048Z"},"links":{"citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:ae1f0435161f1e6b9cadf49665609048da763d89614c3f6ce4241506f0a3a8a3","observation_id":"87f24f94-cbf3-4143-a90e-1c7b4137c382","resolution":{"observed_at":"2026-08-01T22:29:30.284048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"hep-ph/0307089","last_updated":"2003-10-08T13:48:48Z","snapshot_observed_at":"2026-07-07T04:00:29.789829Z","submitted_at":"2003-07-07T15:13:40Z","title":"Functional integrals for QCD at nonzero chemical potential and zero density","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"hep-ph/0307089","snapshot_observed_at":"2026-08-01T22:29:30.445615Z","title":null,"venue":null,"work_id":null,"year":2003},"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":34,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:30.445615Z"},"links":{"cited_paper":"/paper/hep-ph/0307089","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:2b25cc03e0fe3def44981b86ca70bbb5aad6685fd31483e56be7f2bcca47b6c6","observation_id":"63ad1c8f-9dd6-4e26-be72-b32d0724e7c0","resolution":{"observed_at":"2026-08-01T22:29:30.445615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.05806","last_updated":"2017-11-29T01:47:30Z","snapshot_observed_at":"2026-07-06T06:00:04.065126Z","submitted_at":"2017-09-18T08:16:50Z","title":"Modifying partition functions: a way to solve the sign problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.05806","snapshot_observed_at":"2026-08-01T22:29:30.564096Z","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":35,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:30.564096Z"},"links":{"cited_paper":"/paper/1709.05806","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:ed6ce4f5f51809a9c6c14cabefa4ddfbdd2bf4e634563897bce0e9906ccadcef","observation_id":"48aabdec-5851-4d0b-a3a9-dc1b9c978aef","resolution":{"observed_at":"2026-08-01T22:29:30.564096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.00861","last_updated":"2017-07-24T12:53:38Z","snapshot_observed_at":"2026-08-08T13:56:50.005573Z","submitted_at":"2017-03-02T17:25:04Z","title":"Parallel tempering algorithm for integration over Lefschetz thimbles","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.00861","snapshot_observed_at":"2026-08-01T22:29:30.702080Z","title":"Fukuma and N","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":36,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:30.702080Z"},"links":{"cited_paper":"/paper/1703.00861","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:63e06c27919256cb0d351b74547d44cff695c543a4c8215183f6a623cee1db3c","observation_id":"c919fc1a-7826-4030-a8cd-131189b1f4b3","resolution":{"observed_at":"2026-08-01T22:29:30.702080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.14606","last_updated":"2023-07-09T05:28:00Z","snapshot_observed_at":"2026-08-06T07:05:15.714771Z","submitted_at":"2022-12-30T09:15:08Z","title":"Deep Learning of Fermion Sign Fluctuations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.14606","snapshot_observed_at":"2026-08-01T22:29:30.815339Z","title":"Lawrence and Y","venue":null,"work_id":null,"year":2023},"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":37,"source":"pdf_text","source_observed_at":"2026-08-01T22:29:30.815339Z"},"links":{"cited_paper":"/paper/2212.14606","citing_paper":"/paper/2607.15742"},"observation_digest":"sha256:fe7358895ffe1561c0c8a3ac0a3d439703e421c649ac557b43d121d159441a83","observation_id":"ad2003cc-c048-40c5-b25f-b597079bca24","resolution":{"observed_at":"2026-08-01T22:29:30.815339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.15742","last_updated":"2026-07-17T08:23:54Z","latest_version":1,"primary_category":"hep-lat","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"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":37},"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 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.15742."}