{"as_of":"2026-08-09T06:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8573ba7744e2e118fed1a86c9e1d2e64a1906e9c4bfd36d52cd7af63ccb9da5b","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T13:27:38.479235Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2507.20667/citation-record","integrity":"/paper/2507.20667/integrity","json":"/paper/2507.20667/citation-record.json","paper":"/paper/2507.20667"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5455.32054","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:40.217048Z","title":"Andre, S","venue":null,"work_id":"f17cd046-be8c-4abe-85ca-e851232e4f23","year":2018},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.229941Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:8d4e43c4672abeb1133a8f291f541bcac5a114c2c66f83cebe3657e374508e93","observation_id":"052dbeb6-1d9b-4b4e-9042-8aa7b8b54b70","resolution":{"observed_at":"2026-08-06T13:27:40.226561Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.238876Z","title":"Arute, K","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.238876Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:1d62c329d0ff6677d9cf8bb93f222dc1f8db2ee8ccbbf60adef4fab7e87b206a","observation_id":"c6e8a410-9b03-4891-b0ce-e535b195eecc","resolution":{"observed_at":"2026-08-06T13:27:38.238876Z","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-06T13:27:38.243951Z","title":"Brennan, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.243951Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:68ea2b54ae1e36b55ba28c5e0a7b1070518351dce5eb224b70fd5247186d2398","observation_id":"25a7481d-a47f-45d0-81d5-3ef995eabe7d","resolution":{"observed_at":"2026-08-06T13:27:38.243951Z","resolver_source":null,"status":"malformed_identifier"},"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-06T13:27:38.250395Z","title":"ˇCern´y, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , Journal of Optimization Theory and Applications, 45 (1985), pp","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.250395Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:5a807b60a7a1007e3a7c158b4f14347809ecd3e157bda4fa113d233c450401af","observation_id":"4bebd045-2806-45da-9fc0-3590e3615141","resolution":{"observed_at":"2026-08-06T13:27:38.250395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.01450","last_updated":"2018-05-07T17:53:50Z","snapshot_observed_at":"2026-08-05T08:24:24.678067Z","submitted_at":"2018-05-03T17:52:18Z","title":"Classical Simulation of Intermediate-Size Quantum Circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.01450","snapshot_observed_at":"2026-08-06T13:27:38.255832Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.255832Z"},"links":{"cited_paper":"/paper/1805.01450","citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:af78cbdcc84cace085e462453493938ca98281ebd8bde89eb6d248b0f4c0dcf9","observation_id":"0fd93c46-5e1f-4dc0-af30-98fdce0a3083","resolution":{"observed_at":"2026-08-06T13:27:38.255832Z","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-06T13:27:38.262312Z","title":"Chi-Chung, P","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.262312Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:aca467dabb06ac2f15bc57af44d6443f4368709a2a1391a6393a3870bf5ffcd6","observation_id":"ec371da3-708a-4211-92a7-8bba8da16487","resolution":{"observed_at":"2026-08-06T13:27:38.262312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05011","last_updated":"2024-08-09T11:46:47Z","snapshot_observed_at":"2026-07-06T18:58:48.131448Z","submitted_at":"2024-08-09T11:46:47Z","title":"Survey on Computational Applications of Tensor Network Simulations","version":1},"cited_work":{"arxiv_id":"2408.05011","doi":"10.48550/arxiv.2408.05011","metadata_source":"pith","pith_arxiv_id":"2408.05011","snapshot_observed_at":"2026-08-06T18:16:30.548575Z","title":"Survey on Computational Applications of Tensor Network Simulations","venue":"quant-ph","work_id":"e04d1d6f-871a-49a2-9ea5-0bc4c34db265","year":2024},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.268070Z"},"links":{"cited_paper":"/paper/2408.05011","citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:d6d14e0a95a7fdecd402376a7e1b7ef21f1b8d36428e76b307f8bdb40c5b2492","observation_id":"d1b2ee41-c996-4644-bf74-142d31e54955","resolution":{"observed_at":"2026-08-06T13:27:38.828471Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-06T13:27:40.354383Z","title":"Gray, cotengra","venue":null,"work_id":"9afaa9dc-6214-461a-98e3-45c2ac527076","year":2020},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.273195Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:f58f22ffcc6c81a336dfcc79d5087c767921525985dd82560edd71b5a88d0e4b","observation_id":"0cedf087-c48a-47ef-9b91-40ba3030f4b7","resolution":{"observed_at":"2026-08-06T13:27:40.361090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.279198Z","title":"Gray and G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.279198Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:bf46b12be6c14b29c3ef493d02352c262cae6a3a156ecaf97c9a85f9e235c8c4","observation_id":"14e9c026-66fb-4114-a8f1-60a705610c4f","resolution":{"observed_at":"2026-08-06T13:27:38.279198Z","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-06T13:27:38.284008Z","title":"Gray and S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.284008Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:5b7457be5c4b0149dc175f2b465c4a1f29c5e6079b53134743ab7700ccaff61e","observation_id":"96abc7c8-385c-42c9-a7f9-a21951dd0e56","resolution":{"observed_at":"2026-08-06T13:27:38.284008Z","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-06T13:27:38.290895Z","title":"Hamann and B","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.290895Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:f5ad857c0a609e2b0a689219098c313ba2e34ad8a3ed43744ffb560746c8f1ef","observation_id":"8dcd961a-a99c-4c21-929e-4377e3e34d0b","resolution":{"observed_at":"2026-08-06T13:27:38.290895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.06787","last_updated":"2020-05-14T07:57:38Z","snapshot_observed_at":"2026-08-04T20:26:41.132784Z","submitted_at":"2020-05-14T07:57:38Z","title":"Classical Simulation of Quantum Supremacy Circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.06787","snapshot_observed_at":"2026-08-06T13:27:38.299502Z","title":"Huang, F","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.299502Z"},"links":{"cited_paper":"/paper/2005.06787","citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:3e2c6d5301b20225d213ac03abc1e9d5c34eb2908b5792ed506a57c213fd364e","observation_id":"d4cb0ecd-dc06-434f-a4ce-85857476ac3d","resolution":{"observed_at":"2026-08-06T13:27:38.299502Z","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-06T13:27:38.308803Z","title":"Huang, F","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.308803Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:6e3b55f42a243e663b80813a78c904e08deee43f5dbfc259aae6a0c81ebc4332","observation_id":"29ed803e-1ecc-480f-84c3-86245cdf47a5","resolution":{"observed_at":"2026-08-06T13:27:38.308803Z","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-06T13:27:38.315652Z","title":"Ibrahim, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.315652Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:811dd2aaf6a36602c6ce6f83c97a95d99322ee60c7ac24ecc73cba66c457d713","observation_id":"c25c75af-1b7d-4558-8a5c-620cce155bb3","resolution":{"observed_at":"2026-08-06T13:27:38.315652Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:40.335741Z","title":"https://software.intel.com/en-us/intel-mkl","venue":null,"work_id":"a79ddc22-9e36-497d-936a-c4dc30b8167c","year":null},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.322709Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:f01d2bb6d13d4ab7500f6ceddce0cc7a105d647214c0c8e1d9e1d56eaef9973f","observation_id":"ed79cdb9-c2ed-448a-9187-83001243afa7","resolution":{"observed_at":"2026-08-06T13:27:40.341695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.329406Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.329406Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:c4c1e56389f148d34289dc3d92fefbc374ca6d0aac886b2de0ffd6c573712acd","observation_id":"b96ad2f8-6924-47bb-a8f4-8e6f55c1b283","resolution":{"observed_at":"2026-08-06T13:27:38.329406Z","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-06T13:27:38.335397Z","title":"Kirkpatrick, C","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.335397Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:dacf70c69aa0bd1254023b4a93569649059416659a43272bf06e06c128a69f54","observation_id":"4a7b5d94-c56f-42fe-9db1-9b39dd502035","resolution":{"observed_at":"2026-08-06T13:27:38.335397Z","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-06T13:27:38.342395Z","title":"Kjolstad, S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.342395Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:15f047910279b0029f0b6809d7fa8c7bbb719af7915bc430c43439ecfcc5f295","observation_id":"d78ba36e-c0c6-4a99-b9d3-aa7e657fcfcc","resolution":{"observed_at":"2026-08-06T13:27:38.342395Z","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":"2022.83860","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:39.148320Z","title":null,"venue":null,"work_id":"555a0144-d1b9-49b8-9e9a-44c3c1e6d091","year":2022},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.348162Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:a0f55dce9a087ac623c898941f82565dbb8138c2d44ca2b813f4271357bad7b8","observation_id":"9281edd1-e3d8-4c83-872f-ca7f2b2aa386","resolution":{"observed_at":"2026-08-06T13:27:39.157667Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.354287Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.354287Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:720c296e2144f5c1dc417952353baafba34626c3a4483b37d88f2532f37b21b7","observation_id":"5672c118-0b8d-47d6-b0b5-bd65f59b2617","resolution":{"observed_at":"2026-08-06T13:27:38.354287Z","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":"10.2307/2008816","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.707229Z","title":"Mascagni, E","venue":null,"work_id":"6c324a68-3073-4a96-a64d-fd2d45e82806","year":1990},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.362839Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:55503989f8ae055a11364742495da260f0d618bf82a86490a9fcf40cdbd15c56","observation_id":"af2b6629-50ea-40ce-9d71-a0732d09f274","resolution":{"observed_at":"2026-08-06T13:27:38.711727Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-06T13:27:40.318365Z","title":null,"venue":null,"work_id":"e3e1e01a-0c00-45f5-a3a2-69b479720446","year":2023},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.368299Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:e890995397b1ef2c6f5122a380c648c70257685d24528e57403914bfc8ba14cf","observation_id":"930911b2-6b37-40cb-9094-3793abc3925c","resolution":{"observed_at":"2026-08-06T13:27:40.323555Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05581","last_updated":"2023-05-09T16:15:07Z","snapshot_observed_at":"2026-07-06T15:25:08.896707Z","submitted_at":"2023-05-09T16:15:07Z","title":"Massively Parallel Tensor Network State Algorithms on Hybrid CPU-GPU Based Architectures","version":1},"cited_work":{"arxiv_id":"2305.05581","doi":"10.48550/arxiv.2305.05581","metadata_source":"pith","pith_arxiv_id":"2305.05581","snapshot_observed_at":"2026-08-06T18:16:30.548575Z","title":"Massively Parallel Tensor Network State Algorithms on Hybrid CPU-GPU Based Architectures","venue":"quant-ph","work_id":"b69d33df-cb05-49f3-8921-2a6d3b97809d","year":2023},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.377421Z"},"links":{"cited_paper":"/paper/2305.05581","citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:5bc46ed09b647316104bffa80f26dfd69c3fe8971710506862c9974528b62e99","observation_id":"b937e849-4858-4616-90ac-a7135a68b292","resolution":{"observed_at":"2026-08-06T13:27:38.694781Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-06T13:27:40.300728Z","title":"https://docs.nvidia.com/cuda/cuquantum/latest/cutensornet/index.html, 2024","venue":null,"work_id":"c9eff967-648e-47c3-ba32-4358dd98ab1b","year":2024},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.384147Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:04ab8c24a4bd3a1d9df3797850bf3e5a76b65b30a60858cfbfeab9b9e53f1651","observation_id":"6bcb9122-e5e0-4ed7-9318-c82b59b6ebb4","resolution":{"observed_at":"2026-08-06T13:27:40.306461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-06T13:27:40.281142Z","title":"https://developer.nvidia.com/cutensor, 2025","venue":null,"work_id":"ea32c765-601c-4821-9815-357f066dad95","year":2025},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.390958Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:e0277c21d62606997de1f738cd8de1316eb97c796ccf60f4675e192ae251edc5","observation_id":"bf6d567f-6a0b-4992-af32-289e616728b1","resolution":{"observed_at":"2026-08-06T13:27:40.287867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.396200Z","title":"O’Gorman, Parameterization of Tensor Network Contraction , in 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019), W","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.396200Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:dce5a51f7c022751dbe728c1d6aa41f7532ff26bb3a1b0f9f9bf79a30fa7504c","observation_id":"bef68fce-5454-40f2-b982-66223dd677a0","resolution":{"observed_at":"2026-08-06T13:27:38.396200Z","resolver_source":null,"status":"malformed_identifier"},"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-06T13:27:38.402689Z","title":"Or´us, Tensor networks for complex quantum systems , Nature Reviews Physics, 1 (2019), p","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.402689Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:b76645978a00dbdf52e6594299044e003d5117fade3ed1e213219986ad96634c","observation_id":"b06fa2e8-8ab2-4cc7-9fad-7fea8a4354ff","resolution":{"observed_at":"2026-08-06T13:27:38.402689Z","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-06T13:27:38.409751Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.409751Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:27b98729c925ea4049b414634c5631fdb9a8fc91518ed48bfa0c86aee650cd66","observation_id":"16d21893-32bd-4228-bca3-6f949542981f","resolution":{"observed_at":"2026-08-06T13:27:38.409751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03074","last_updated":"2021-03-04T14:55:15Z","snapshot_observed_at":"2026-08-05T00:31:20.909290Z","submitted_at":"2021-03-04T14:55:15Z","title":"Simulating the Sycamore quantum supremacy circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03074","snapshot_observed_at":"2026-08-06T13:27:38.415226Z","title":"Pan and P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.415226Z"},"links":{"cited_paper":"/paper/2103.03074","citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:320e34c0242b3c3d92ab537ddf062fc28a64b8b1b406c23887a144a19f548470","observation_id":"8694b306-c210-4484-9d89-33d043624ece","resolution":{"observed_at":"2026-08-06T13:27:38.415226Z","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-06T13:27:38.421450Z","title":"Patra, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.421450Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:610710086387ed53d09f167d173e92385e68ba0ce51e8cf12bdf310d67725313","observation_id":"a41cced9-75d8-4abe-a0b8-0ba5f36aa3d9","resolution":{"observed_at":"2026-08-06T13:27:38.421450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.05867","last_updated":"2020-08-27T14:10:49Z","snapshot_observed_at":"2026-08-05T20:53:24.704203Z","submitted_at":"2017-10-16T17:00:59Z","title":"Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.05867","snapshot_observed_at":"2026-08-06T13:27:38.426135Z","title":"Pednault, J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.426135Z"},"links":{"cited_paper":"/paper/1710.05867","citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:929d971a9d6dac20c457233533c1663e0bc6cb7783c278e70717aaae4b51c1c1","observation_id":"9686f975-026f-494d-bf29-dba36f710170","resolution":{"observed_at":"2026-08-06T13:27:38.426135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0608197","last_updated":"2007-05-14T16:05:27Z","snapshot_observed_at":"2026-08-03T20:35:51.983603Z","submitted_at":"2006-08-25T09:05:11Z","title":"Matrix Product State Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0608197","snapshot_observed_at":"2026-08-06T13:27:38.432535Z","title":"Perez-Garcia, F","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.432535Z"},"links":{"cited_paper":"/paper/quant-ph/0608197","citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:a088ace662989eeeadaeadfc900a4ea8443aea08a43390bce8fa807a8a13d3fe","observation_id":"039ee91f-208a-4090-b5f5-469bbdd78426","resolution":{"observed_at":"2026-08-06T13:27:38.432535Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:40.256456Z","title":"Quetschlich, L","venue":null,"work_id":"9a43cbc9-baed-4935-9690-0c9978fc4149","year":2023},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.438396Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:e2b0930f9fde68337081018711d97bdbb653a9258e707e694cb4db7bdcaa6a91","observation_id":"53641ca3-7432-478f-8720-f75fb1152099","resolution":{"observed_at":"2026-08-06T13:27:40.262830Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0802.3351","last_updated":"2008-08-01T15:24:46Z","snapshot_observed_at":"2026-07-06T01:34:51.091349Z","submitted_at":"2008-02-22T17:24:01Z","title":"The computational difficulty of finding MPS ground states","version":2},"cited_work":{"arxiv_id":"0802.3351","doi":null,"metadata_source":"pith","pith_arxiv_id":"0802.3351","snapshot_observed_at":"2026-08-06T13:27:39.048393Z","title":"The computational difficulty of finding MPS ground states","venue":"quant-ph","work_id":"76554847-a1ce-4348-82a6-8035334ca84e","year":2008},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.443586Z"},"links":{"cited_paper":"/paper/0802.3351","citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:310d3d92269f4879c88dcb865fea6ccc7b29619f110658f6643feef25e7d9abf","observation_id":"ec827ce6-aff9-4c11-9228-d9bde829565e","resolution":{"observed_at":"2026-08-06T13:27:39.054785Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.448766Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.448766Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:fd6b14efa8f4ea16cf9b9a518e3c2f5506b5c8c2ab5b29bfc2e76c4c2401c9c2","observation_id":"e0a8be5a-e613-4f71-9d78-385668cf55ab","resolution":{"observed_at":"2026-08-06T13:27:38.448766Z","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-06T13:27:38.453669Z","title":"Springer, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.453669Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:d8f3a294600b4350a01816d6f449556f2507d6202e1e41b9e325e9d0dc3a61c5","observation_id":"3d050082-de66-417f-91a0-006e353071a5","resolution":{"observed_at":"2026-08-06T13:27:38.453669Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:40.237544Z","title":"Stoian, An efficient implementation of polynomial-time join ordering , bachelor’s thesis, Technical University of Munich, Germany, 2021","venue":null,"work_id":"5dfbb38e-b8d9-4531-a246-5152eb2aa1b1","year":2021},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.459097Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:d67dcab4fbb4df76b3d17ab810a88df0d2481782fbb953642f4971f4add520b1","observation_id":"fa99e77e-dfaa-4a70-a5de-3381287d931b","resolution":{"observed_at":"2026-08-06T13:27:40.243206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physrevb.104.115142","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.553982Z","title":"V an Damme, R","venue":null,"work_id":"d230e4d6-67e5-42a9-a07a-9bc60da1b731","year":2021},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.464716Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:f18a2e55f2a91634c3da234d9fdbc0317167e973e1b680311ecf338ad0b1f1e6","observation_id":"2997d19e-7e78-4956-a3ed-30aeaff38fc7","resolution":{"observed_at":"2026-08-06T13:27:38.559063Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0907.2796","last_updated":"2009-07-16T09:56:38Z","snapshot_observed_at":"2026-07-06T01:55:42.626170Z","submitted_at":"2009-07-16T09:56:38Z","title":"Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0907.2796","snapshot_observed_at":"2026-08-06T13:27:38.469258Z","title":"Verstraete, J","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.469258Z"},"links":{"cited_paper":"/paper/0907.2796","citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:9269bace8fe96afba4a01566241b914cc8019b70ca79b59afc8d727e6eee1c3c","observation_id":"80bb3d63-5fc2-4b3b-b9bb-63ad156f50b3","resolution":{"observed_at":"2026-08-06T13:27:38.469258Z","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":"10.22331/q-2022-05-09-709","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.533712Z","title":"Vincent, L","venue":null,"work_id":"636ca899-476e-4360-8c17-3778a8957b98","year":2022},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.474213Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:4d48bb5a22528422e43cc524e2213a915378dff9cab9a7856cfd476ed2bd4cb0","observation_id":"424b07ef-5beb-4d4b-b49f-b5aed4e92578","resolution":{"observed_at":"2026-08-06T13:27:38.539634Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T13:27:38.479235Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T13:27:38.479235Z"},"links":{"citing_paper":"/paper/2507.20667"},"observation_digest":"sha256:a76bef9eb3bf157392ee0d96fd85e4c6e4ae7ab3fbf659b941a6c2ac03a3502d","observation_id":"bb55d824-200e-4e2d-9c19-14c8f73c6be8","resolution":{"observed_at":"2026-08-06T13:27:38.479235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.20667","last_updated":"2025-07-28T09:43:01Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T13:27:37.137091Z","submitted_at":"2025-07-28T09:43:01Z","title":"Optimizing Tensor Network Partitioning using Simulated Annealing"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":3,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":25,"verified_exact":6,"verified_fuzzy":5},"total_outbound_references":41},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2507.20667."}