{"as_of":"2026-08-18T06:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96ad881f9809beca68205567bf23507f492343a6b9eb5f22b36c92f8c99619b3","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T05:37:30.086220Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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-16T04:35:08.687260Z","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-07T23:38:12.173888Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.14344","snapshot_observed_at":"2026-08-08T17:16:31.542957Z","title":"de Leceta","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05981","last_updated":"2025-02-09T18:16:53Z","snapshot_observed_at":"2026-08-16T11:30:39.426955Z","submitted_at":"2025-02-09T18:16:53Z","title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T17:16:31.542957Z"},"links":{"cited_paper":"/paper/2311.14344","citing_paper":"/paper/2502.05981"},"observation_digest":"sha256:2df8a2ca63daaab0debf80eac87c1c22f3408f97f16a4b9b9fdecd5bd3959b2e","observation_id":"a5f23e14-b9e0-4550-9ae6-de94ab531da7","resolution":{"observed_at":"2026-08-08T17:16:31.542957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"cited_work":{"arxiv_id":"2311.14344","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.14344","snapshot_observed_at":"2026-08-07T23:38:12.173888Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","venue":"quant-ph","work_id":"7a182467-bef5-41cd-ba41-a14cc3d6d6ba","year":2023},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-14T04:47:15.080741Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.634884Z"},"links":{"cited_paper":"/paper/2311.14344","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:3434bef43b36e0ddd87b91766bab5ccabf7fb6e58302df0fb286fd35ac7a5bb4","observation_id":"a0efa410-dd75-4760-892c-3aa74895e30b","resolution":{"observed_at":"2026-08-07T23:38:12.179145Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.14344","snapshot_observed_at":"2026-08-16T04:35:08.687260Z","title":"M., Delgado, I","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.00891","last_updated":"2025-05-01T22:13:12Z","snapshot_observed_at":"2026-08-17T16:40:23.507453Z","submitted_at":"2025-05-01T22:13:12Z","title":"Quantum Computing in Industrial Environments: Where Do We Stand and Where Are We Headed?","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T04:35:08.687260Z"},"links":{"cited_paper":"/paper/2311.14344","citing_paper":"/paper/2505.00891"},"observation_digest":"sha256:53fc38f7d9ade6ebfd415e79cbc6d2f3df6573a5e386cab1a6992313ce08b891","observation_id":"9fa6d55f-d713-4a43-b796-602528abb6d5","resolution":{"observed_at":"2026-08-16T04:35:08.687260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2311.14344/citation-record","integrity":"/paper/2311.14344/integrity","json":"/paper/2311.14344/citation-record.json","paper":"/paper/2311.14344"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1033004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems","venue":"SIAM Review","work_id":"55c746ff-6b83-4b19-a0ed-6c10a2580f58","year":1991},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:12b40358c6d6e35090314b14ece8fa350d4351631fe4ba08829d78af8299dcba","observation_id":"992c89a6-1475-429e-87fe-e9468dc41ef9","resolution":{"observed_at":"2026-05-24T05:38:55.542325Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-16T18:51:33.249442+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-16T18:51:33.249442+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"stable/2098806","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"cb474a1a-1fd1-46aa-b2ed-fe6a137edd7f","year":1962},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:be00e065b5dbaac875fbab1e899b056a4da1609990031827c31fd891564a6d9b","observation_id":"03d39073-9860-431c-a7cb-51983ec74332","resolution":{"observed_at":"2026-05-24T05:38:55.991551Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2011.020104","doi":"10.14569/ijacsa.2011.020104","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A genetic algorithm for solving travelling salesman problem","venue":"International Journal of Advanced Computer Science and Applications","work_id":"6788a82d-b760-4983-b215-903f768242a0","year":2011},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:a3448aee450b4a2cddd3b6ba3454eb8ab3516ccdd22727db5eb89e95bf048c42","observation_id":"d829e0be-6e46-4c0b-8dcb-9936025568c2","resolution":{"observed_at":"2026-05-24T05:38:55.564733Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s43069-021-00101-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Worst-case analysis of a new heuristic for the travelling salesman problem","venue":"Operations Research Forum","work_id":"92f4157f-4ed8-4720-913d-a6c5e3400767","year":2022},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:4b317fc37b32bc0667fdd19d17a54c0ca07966658639ed9ff2b3eb30c3b15602","observation_id":"f5187712-951f-44bd-9bd7-2bd09ef5c4de","resolution":{"observed_at":"2026-05-24T05:38:55.572473Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-09T09:49:58.91884+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T09:49:58.91884+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1994.365700","doi":"10.1109/sfcs.1994.365700","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Pro- ceedings 35th Annual Symposium on Foundations of Computer Science, pp","venue":null,"work_id":"e01ea70f-eea8-469a-aec7-8460a37592f4","year":1994},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:64414dd808ade1ccbb48ae5c48ed23f60ee8668eb5fc149ad5b8a5be661aa973","observation_id":"4179f43b-185e-45c1-8792-dfbf15e568e8","resolution":{"observed_at":"2026-05-24T05:38:55.589089Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-11T17:49:53.414968+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T17:49:53.414968+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A quantum approximate opti- mization algorithm","venue":null,"work_id":"637213ed-9e78-421a-973f-27ce69aef7b2","year":2014},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:300b90101b531db7cdee8ad221a382088eef1e74fe7d474706dcf944497ffcff","observation_id":"09a64b97-52e5-43fc-92f7-4fb4bd393d6d","resolution":{"observed_at":"2026-05-24T05:38:56.252115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/ncomms5213","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T15:07:19.303452Z","title":"Nature Communications , author =","venue":"Nature Communications","work_id":"39da8f39-782e-47a1-bb98-e482b344cb2a","year":2014},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:c90bca6670f8744b696ee726a433c5f0c5e25aa95831f4556dc3fec58be41e2a","observation_id":"ff274962-f66e-40e5-be3d-98c15812ff39","resolution":{"observed_at":"2026-05-24T05:38:55.547236Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-08T08:08:14.888557+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T08:08:14.888557+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fixed-point grover adaptive search for binary optimiza- tion problems","venue":null,"work_id":"5713ec3b-c3c2-4e80-b3e8-a14ba35de1ff","year":2024},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:4fd37603f639a06e9e84d39101ec39cb9db7ad8417d5ac7cbec100e36ce0c7c4","observation_id":"176c3efd-cb92-4490-b705-9b1b0bcc6f56","resolution":{"observed_at":"2026-05-24T05:38:56.260969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Behera, and Prasanta K","venue":null,"work_id":"06f4f06e-4874-4739-9408-d6724b68a5e2","year":2018},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:4f37fa7534d1660223a7d31b66d7800bb6c3891681b270fb66b2e0ddad839aaa","observation_id":"2f44770a-8ed4-4b41-ad5e-d15332cb1cee","resolution":{"observed_at":"2026-05-24T05:38:56.258290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A realizable gas-based quantum algorithm for traveling salesman problem","venue":null,"work_id":"9efcfdde-639d-4f87-87d8-4c142f10fc79","year":2022},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:734c83bbc21e32b0a0fcf83b8d5f4655fd7721bdccfe7e90c87c1159d7ec4866","observation_id":"eb40150e-75c4-4b2a-8566-6b1b4e7114cb","resolution":{"observed_at":"2026-05-24T05:38:56.247922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611975482.107","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DOI: 10.1137/1.9781611975482.107","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"82e9c850-5164-4260-84fc-1325606a77ca","year":null},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:ecd0b87398bac56626b306fbab2bf94b18549e26d0e43ba5e4ebeacb0179f17f","observation_id":"cfcf8efc-3277-429e-ab49-aa3ff3286a4c","resolution":{"observed_at":"2026-05-24T05:38:55.555080Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tensor networks in a nutshell","venue":null,"work_id":"915c48c7-ef2b-4da7-aac6-49300e0dca39","year":2017},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:ba5b54ece2bbe84077a6e3a87ba939ca845716c59f4998232eb1419d380de160","observation_id":"3c538a1e-de73-4b7c-b704-2319938f2d36","resolution":{"observed_at":"2026-05-24T05:38:56.263983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Perez-Garcia, F","venue":null,"work_id":"7dd886b0-a6bf-44f8-97ab-52ae32b747bd","year":2007},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:7777dcb34a1cb280594f219561718ebddffd691e2d13b2c50b6829bf152bbeaa","observation_id":"2ecfc8a0-9cfb-4d48-93e2-f138b65d2553","resolution":{"observed_at":"2026-05-24T05:38:56.266766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1080/14789940801912366","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Advances in Physics , author =","venue":"Advances In Physics","work_id":"9b2ef7ea-dc94-4c90-8056-af3faec6585c","year":2008},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:7fcd8e598bd87a0ea261842b090fa2ac33034ec93331bc74eb189bb8563acf3a","observation_id":"312bda76-20cc-4854-8a46-72b975a55fb9","resolution":{"observed_at":"2026-05-24T05:38:55.551327Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-17T23:51:49.708045+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T23:51:49.708045+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Implementation of quantum imaginary-time evolution method on nisq devices by introducing nonlocal approximation","venue":null,"work_id":"1a74137e-a54a-4aac-8053-66e530ac3916","year":2021},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:1a56ebffa614f7d6ba476ffe0562d03048308f3ba0514f90fb1d1b16dc419f64","observation_id":"887bef73-0cc0-4326-8965-e5fbef625e97","resolution":{"observed_at":"2026-05-24T05:38:56.255244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41534-021-00409-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"URL https://doi.org/10.1038/ s41534-021-00409-y","venue":null,"work_id":"6dbd26f1-ecfa-4dcc-afe2-4b68c311d82c","year":null},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:d619e7d6dedb8c2fbb80e71526ebaffabc8a5542bcb904e726d1b4b1aa315fbf","observation_id":"77c96e99-d349-44f2-bbe8-21cdf2f8e745","resolution":{"observed_at":"2026-05-24T05:38:55.568577Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ttopt: A max- imum volume quantized tensor train-based optimization and its application to reinforce- ment learning","venue":null,"work_id":"3b9bc08b-1ee7-4b97-99c5-856fa310b699","year":2022},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:3bf0320a16aa232dbaa85a6b5ca621f0ccdba69376545b518ad3cb355a71c75f","observation_id":"4254e73d-89c1-43a4-b9cb-d7905b019171","resolution":{"observed_at":"2026-05-24T05:38:56.243569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41467-024-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T12:56:14.783902Z","title":"Kalayci, and Alejandro Perdomo- Ortiz","venue":null,"work_id":"5b581f4d-7887-4f85-b6ea-3633f7f85310","year":2024},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:878e6f65179422c77543dce9a7868aceb941d4d653509a0cc4a755f4d51ac9b9","observation_id":"d757c94c-9fc2-4ebf-8cf5-63476c7b96d6","resolution":{"observed_at":"2026-05-24T05:38:55.582609Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.906590","doi":"10.3389/fphy.2022.906590","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A quantum-inspired tensor network algorithm for constrained combinatorial optimization problems","venue":"Frontiers in Physics","work_id":"76105807-9351-4e65-9eeb-a7ee38849d79","year":2022},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:407c4ac38603b1493a60781bbd0c40e35403467fc4424df6d7231d86b09a1a5b","observation_id":"2fb7909a-7fc1-46bc-bc0d-d6d01de5d237","resolution":{"observed_at":"2026-05-24T05:38:55.578194Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"de Leceta","venue":null,"work_id":"20cf8ae3-7a33-48d9-bc9e-768bb8111c33","year":2024},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:208cebbc105c5afd172085319a030d7fdd82c98287dff590b528ade5eed7b0a9","observation_id":"81e7a0a7-0078-4749-8b25-f8fa54dd8e4d","resolution":{"observed_at":"2026-05-24T05:38:56.240580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7777.2023","doi":"10.1109/1tsc57777.2023.10422457","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"In: Proceedings of the 2023 IEEE 26th International Conference on Intelligent Transportation Systems (ITSC), pp","venue":null,"work_id":"c3e3372c-3a72-4033-860a-5df8815979c8","year":2023},"citing_paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T05:37:30.086220Z"},"links":{"citing_paper":"/paper/2311.14344"},"observation_digest":"sha256:90a676851a6dfe207aa702ad04a24c312865db775abe7c768cc9b377183de9a4","observation_id":"377c7445-f520-49af-9512-d6c6bc5bb988","resolution":{"observed_at":"2026-05-24T05:38:55.535014Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-05-20T09:55:45.124915+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T09:55:45.124915+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2311.14344","last_updated":"2026-05-15T16:42:52Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T23:11:02.025783Z","submitted_at":"2023-11-24T08:41:02Z","title":"Tensor-Network Formulation of the Traveling Salesman Problem and Variants"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":0,"verified_exact":8,"verified_fuzzy":9},"total_outbound_references":21},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 3 inbound Pith citation observations for arXiv:2311.14344."}