{"as_of":"2026-08-10T07:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f13a2e55fe2426e81d5ba57cbe45b3d51f922a4b9ee05f3f42d2c379dc994e3","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-10T06:31:04.303077+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-10T00:43:34.545897Z","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:1ed7b5ab33e89edbcbbefcfe36becb0a60a5975f8cdea69f446240ebc514cdaa","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:75888c72556587183209ea6f0ee3be7ac3fed5f63db12e150fb85f28c7a97877","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-10T00:43:34.545897Z","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:87c0199aa0e3477d00a872d320ad7a746e809b5ce211c3acfa03b991a5c314da","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-10T00:43:34.545897Z","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:430ac8cb889e2681ccbc52cbcd5ca3a02b6e74fbdb7bdb6121e7871f27047f09","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-10T00:43:34.545897Z","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:22a1e9e9935cf74233aaafcf4defe75dd039428ef02dfdbb14e74c43c53230e9","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-10T00:43:34.545897Z","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:17598146d2502a16bed76c94551a71d58fdadc00c3c5d39c9e8df0a6b64bfe91","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-08-09T13:46:33.498292Z","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-10T05:30:23.456663Z","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-10T00:43:34.545897Z","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:8a82361b7583a78a0168f80c1ea1f7aabbc91d4de876b38a68bb715bfab033e1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:eab97a4b237bc8edc57477267d8fc9bff6026157291c4cbd57bfbbc4c6703f99","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:b39fd49570d59ea28760dcf808c95d0161478a246f89d7e8dc384d0d75c4f374","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-10T00:43:34.545897Z","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:1d2e2917344763fdf9f4d5b8c69b6f6c7cd8e468fcffe1f5d01b22bbe7d70560","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-10T00:43:34.545897Z","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:8ce8d275214950340ad8e95e25318f504974ae3002ed2c122d2b46778d23cff9","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-10T00:43:34.545897Z","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:9bbe24b48d2effb81efecd3cea8a2ed1850e0a8ab38846af3a6dc4a85eabb8b5","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-10T00:43:34.545897Z","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:474d8c5066a5ea7e288ca0c3300c501a75b0ec03a7a5631330a8c2c4a187783c","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-10T00:43:34.545897Z","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:438ced2f8bdd9b6df18bb74a3a31a77da35ab5f69256e21c60c804a9e6b632a1","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-10T00:43:34.545897Z","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:e98b9fab4e9e67a2560d235896071e2a62b6f9313f217609b46113cab2ac0671","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:0a93836524f71e1b20c83b3b4e236331a937bf73ec1b630a5c6a6917f5ec8642","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-10T00:43:34.545897Z","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:a5c87562ac466a3351a4fb2c0c9367646c94bd9a27012c37ae75fb42c844ed03","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-10T00:43:34.545897Z","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:01bdee5caa6ab0276fda4f53ce715b896e4ee8febde916a3aaa6d27d28ed1343","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-10T00:43:34.545897Z","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:16cd4d7483b32bc023912ad0f67b1f590ea1d928792228b34e3fe1fd16330617","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:58c58abf1bceecfbd6e61e839b3b8b259c0dcc72abe9660e0494418e89ec0be2","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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Mascagni, E","venue":"Mathematics of Computation","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-10T00:43:34.545897Z","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:944b7242b8547d5c4d2cf56436eb61f33a3fc1ddb5ae938acf65693e1ae357ba","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:5d6bc4d0d9a24f7ae0d829830fd0430d964fc1b6ef9cb16af1ef382b3e69a0f7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T05:30:23.456663Z","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-10T00:43:34.545897Z","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:29e2bce3bf47231b8231f6d513952a6eba3c98b809b05251dbce5d3dffeed565","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:f2c3ec04ebe6dea091b226be7fad1dcdb1e4a75b244062482f89fa352a645f17","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:7187498b56a5bd5eb2df3f4b068113e6bb4bff40843413e3cc98f0990b16592a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:d6fbfcaa703b7abb7981706c1d0712d6672a6bc292dab34544600be4bec4c3fc","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-10T00:43:34.545897Z","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:5950a9c00f60b5a8fdb5dbad1eeca0dbb23918f8502724ae59e1dc4c1592e342","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-10T00:43:34.545897Z","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:12004e03b33a6fcfe745072356c1d8b8475959c1eccef70d7b1aa3cb0bd20fe3","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-10T00:43:34.545897Z","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:543e820356b995053f22b6d248791e9441aaad0273709cf46505dc7b20b3540d","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-10T00:43:34.545897Z","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:f7946814f9096475891511629ced616657f1c5a51adc8c5d12f85e6980bcfc50","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-10T00:43:34.545897Z","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:926da081dd5324ed5eb1849e85af85e4b7dacb8281b4be5ef9ce4483562d7ae6","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-10T00:43:34.545897Z","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:c48c50001ad2004fb6a28d9eee99cf1fdf8d3cf8aa8a9d9b12d20468cc39e527","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-10T00:43:34.545897Z","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:d63b3bd237f8c5e8e05b14cd51960ebe66dc0c174694a7e6648d74de329e81b2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:8f28a467cadd3f58c03bf76f0d7d1815bfae3c63aeb800edfa37290cc4b541c2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:1e41c38fa1ac91d6f44195654817aa0024421c8574fb47304b47cc7e7899d80d","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-10T00:43:34.545897Z","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:4d4c22d704288771d91098aca541fe426d297b3ac353e602489fc4b815869f8f","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-10T00:43:34.545897Z","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:7db6b493efd44b3ca9f47c358641b1ccf59a67d5de2da93063a139af7344519d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physrevb.104.115142","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"V an Damme, R","venue":"Physical review. B./Physical review. B","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-10T00:43:34.545897Z","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:0f9ecc29e65b3df17b330e39bcba589be7a006dd0cec143d62adef8183e135e0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:4a7289ed45be85b8256b98bddca2827262d9d01c1ecdddf6c1505c592462b184","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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Vincent, L","venue":"Quantum","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-10T00:43:34.545897Z","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:e52a9634dcd112a8f1de5596984cc9f32d75b6a027de7a4e4af7220202a3ba46","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T00:43:34.545897Z","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:1448be81b3a858258b0a2239328649f056300bd172c818e5ca260fb9d543bc14","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-10T00:43:34.545897Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2507.20667."}