{"as_of":"2026-08-14T22:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bceb53747aeb9477558b5eeb4a64d293c84e851d160195feaf735821828743f4","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:34:02.521218Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T10:57:00.386600Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-18T11:01:17.148108Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"cited_work":{"arxiv_id":"1908.11034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.11034","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Jakes-Schauer, D","venue":null,"work_id":"bfe4dd07-c339-4ac7-af20-19bc707bd185","year":2019},"citing_paper":{"arxiv_id":"2510.02725","last_updated":"2026-05-12T04:11:06Z","snapshot_observed_at":"2026-08-13T14:47:45.705797Z","submitted_at":"2025-10-03T04:58:40Z","title":"Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-18T10:57:00.386600Z"},"links":{"cited_paper":"/paper/1908.11034","citing_paper":"/paper/2510.02725"},"observation_digest":"sha256:e32297fdd73b7a0e36f1b1a1beed3d50ed25d246bdde02a435fa145b138afc4b","observation_id":"58e4d69c-aac9-4fbd-8348-3c4268c6d9b0","resolution":{"observed_at":"2026-05-18T11:01:17.149899Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.11034/citation-record","integrity":"/paper/1908.11034/integrity","json":"/paper/1908.11034/citation-record.json","paper":"/paper/1908.11034"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0611156","last_updated":"2007-03-26T00:18:13Z","snapshot_observed_at":"2026-08-12T11:05:02.998595Z","submitted_at":"2006-11-14T18:31:23Z","title":"The quantum FFT can be classically simulated","version":2},"cited_work":{"arxiv_id":"quant-ph/0611156","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0611156","snapshot_observed_at":"2026-08-14T10:34:03.036092Z","title":"The quantum FFT can be classically simulated","venue":"quant-ph","work_id":"fa5b4447-f6ea-4d07-85a7-1897cca8fdde","year":2006},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.363532Z"},"links":{"cited_paper":"/paper/quant-ph/0611156","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:c4eb3527f52ce5c39e720dc4c7a352eee5e05785b4c6ef4604e8ca49bd279112","observation_id":"31dcb98b-9d06-4f25-864e-d3260850250c","resolution":{"observed_at":"2026-08-14T10:34:03.043251Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:03.241877Z","title":"Complexity of finding embeddings in a k-tree","venue":null,"work_id":"f511f528-f618-4870-b7eb-58cbd5639461","year":1987},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.371152Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:74a85c348437561818284051dce40ac18fe3da2edf16020ebe0c3430ffedca02","observation_id":"24642d3d-b9ae-41fb-b244-273afb32380f","resolution":{"observed_at":"2026-08-14T10:34:03.247350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-77120-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:34:02.626828Z","title":"Weighted Treewidth: Algorithmic Techniques and Results","venue":null,"work_id":"53d68952-ae30-452f-860c-401d142fdf5c","year":2007},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.379141Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:05252416de99c26d620fef5734b9b4313cac4bdceeb576765ca48064b60cf992","observation_id":"bf288563-95d2-4e67-beb3-ba7c372148ef","resolution":{"observed_at":"2026-08-14T10:34:02.633012Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.00006","last_updated":"2017-07-31T18:00:02Z","snapshot_observed_at":"2026-08-14T20:44:08.551444Z","submitted_at":"2017-07-31T18:00:02Z","title":"Tensor Networks in a Nutshell","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.00006","snapshot_observed_at":"2026-08-14T10:34:02.385728Z","title":"Tensor Networks in a Nutshell","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.385728Z"},"links":{"cited_paper":"/paper/1708.00006","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:e6174a46a0376aa6f87d4a4588505a96179f1603c431e6ec10b46b4b608db7db","observation_id":"b648995b-7a7b-4073-bdcb-8cd1fc43b82e","resolution":{"observed_at":"2026-08-14T10:34:02.385728Z","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-14T10:34:03.222950Z","title":"Practical algorithms for branch-decompositions of planar graphs","venue":null,"work_id":"89c918b6-704b-4bda-8685-b1d886dfa230","year":2016},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.391703Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:a25aa388e486fe8a7701847601ca0724a3f19bcc0428dfc04a18df3576652870","observation_id":"de632763-4298-43f3-8eb6-48e1e4d97079","resolution":{"observed_at":"2026-08-14T10:34:03.228799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:03.204188Z","title":"Hand-waving and interpretive dance: an intro- ductory course on tensor networks","venue":null,"work_id":"72fc7418-56bc-44a9-9894-888c3c60bca4","year":2017},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.397429Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:02cf29a5234b1e532322ac35b848917c5d2a3da4f87a8b5260aba4749eef5eb0","observation_id":"f85f262f-233e-4a18-9b04-1e1bb709479a","resolution":{"observed_at":"2026-08-14T10:34:03.210960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1404.5565","last_updated":"2016-02-07T21:47:30Z","snapshot_observed_at":"2026-07-06T03:41:47.372934Z","submitted_at":"2014-04-22T17:31:56Z","title":"On the Satisfiability of Quantum Circuits of Small Treewidth","version":2},"cited_work":{"arxiv_id":"1404.5565","doi":null,"metadata_source":"pith","pith_arxiv_id":"1404.5565","snapshot_observed_at":"2026-08-14T10:34:02.984961Z","title":"On the Satisfiability of Quantum Circuits of Small Treewidth","venue":"cs.CC","work_id":"6d177e88-865f-4020-8391-e26a3abb32fb","year":2014},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.402958Z"},"links":{"cited_paper":"/paper/1404.5565","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:14f1420e9be8610d31ba947a748bd865e35938fea5e0d6061c17db95e67eead9","observation_id":"f77f0806-468d-4c12-8c34-94c98b9dfe25","resolution":{"observed_at":"2026-08-14T10:34:02.991323Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.disc.2005","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:34:02.606158Z","title":"Tree-decompositions with Bags of Small Diameter","venue":null,"work_id":"ddfe9144-8485-40d3-bd8f-428854e0ab29","year":2007},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.408354Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:f98f4c018322f8e0dd1aa988fe8b57fedb7818a0307feed6074f4c24b1f5810f","observation_id":"9916af6c-4ff3-4c69-a8c1-7f92abc5929e","resolution":{"observed_at":"2026-08-14T10:34:02.614652Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.04599","last_updated":"2018-07-12T13:32:55Z","snapshot_observed_at":"2026-08-14T18:52:44.854748Z","submitted_at":"2018-07-12T13:32:55Z","title":"Benchmarking treewidth as a practical component of tensor-network--based quantum simulation","version":1},"cited_work":{"arxiv_id":"1807.04599","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.04599","snapshot_observed_at":"2026-08-14T10:34:02.953607Z","title":"Benchmarking treewidth as a practical component of tensor-network--based quantum simulation","venue":"cs.DS","work_id":"587b1afb-758c-4eac-877c-5455ab9b6468","year":2018},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.414117Z"},"links":{"cited_paper":"/paper/1807.04599","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:ae910cc145050fa42e7cfaa98c1bfc7eb59b970e6e153f1a3662588179ad98f4","observation_id":"236abcad-6d0c-4979-8f89-9b134119f4b9","resolution":{"observed_at":"2026-08-14T10:34:02.963791Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:03.184857Z","title":"url: https : / / aws","venue":null,"work_id":"07421c40-60f3-4602-8cbc-bb7ae9c0e377","year":2018},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.419369Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:7daa804f9a21511638be8d5d514b20ca65c63a67b0f170a2b6fefece5b891b1b","observation_id":"a30a0098-2e54-4207-872d-36e47d14208c","resolution":{"observed_at":"2026-08-14T10:34:03.190735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:03.167104Z","title":"Planar branch decompositions I: The ratcatcher","venue":null,"work_id":"87e04cfd-0098-4c7c-9242-7d394ef55d86","year":2005},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.424368Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:03471c664f627fe176c09caac56c8f24310429394cf7bdaac02dfbcde3ea9d8b","observation_id":"c58327d0-cc62-41fa-970d-ad26454da32b","resolution":{"observed_at":"2026-08-14T10:34:03.172616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:03.148605Z","title":"Planar branch decompositions II: The cycle method","venue":null,"work_id":"0ad8bbcb-82b8-47fb-a9e9-6cb57898a3c1","year":2005},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.429431Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:fb3105216a299ec7c980acdfb35eda26b4578fbde43b0821d088cb2c12cbd66d","observation_id":"5317b8fb-a18a-4df5-bc8e-c2d488d1dce4","resolution":{"observed_at":"2026-08-14T10:34:03.154229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"cs.ds/0205077","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:34:02.921206Z","title":"Designing Multi-Commodity Flow Trees","venue":null,"work_id":"72fe0420-1c7a-4a3f-bc2e-4c1c522265f9","year":2002},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.434176Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:948213cd2e9eb3f04103e2fe86bfbdcf348d19555338aff6ddcafc0fe32c270c","observation_id":"46889f1c-964b-4df2-b111-92a91f720ed7","resolution":{"observed_at":"2026-08-14T10:34:02.932029Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:03.128308Z","title":"On Optimizing A Class Of Multi-Dimensional Loops With Reductions For Parallel Execution","venue":null,"work_id":"d88f6aef-ab49-4088-af26-7f12c85f9045","year":1997},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.438831Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:1da21584674b373494268fa6e2b8c8d3ecf8589652ce57bb1166bce31f5c41cb","observation_id":"8f6a849b-5ab7-4809-9b4d-999c83813a0c","resolution":{"observed_at":"2026-08-14T10:34:03.135706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:03.110728Z","title":"Memory-Optimal Evaluation of Expression Trees Involving Large Objects","venue":null,"work_id":"76575821-e103-4a7d-b5cc-122e051e271d","year":1999},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.443309Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:e142e94f1fb87e1a007fdc2232be619ba5d5e0d3a659c4c4b59a75f5825cc209","observation_id":"60aeed1f-3c30-4fa9-b3d1-a4963d4e65dc","resolution":{"observed_at":"2026-08-14T10:34:03.116283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:02.448311Z","title":"Simulating Quantum Computation by Contracting Tensor Net- works","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.448311Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:73c5133fb4279ec87c947ff1c9ded697636922cc637c89ad3efa9b679cbc91e5","observation_id":"74bf0753-ce17-481b-85a0-30791288c2c4","resolution":{"observed_at":"2026-08-14T10:34:02.448311Z","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.1007/s00224-016-9727-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:34:02.573048Z","title":"On the Satisfiability of Quantum Circuits of Small Treewidth","venue":null,"work_id":"efd98389-2667-4bdf-b880-846532fb225e","year":2017},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.453677Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:22d873b6cab19b3a371ecc25253103dd5338dfa35aead61696d5518e78ff9761","observation_id":"2a31c189-ff0d-4241-a2c6-dbe0fd064d42","resolution":{"observed_at":"2026-08-14T10:34:02.582056Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1306.2164","last_updated":"2014-06-10T15:40:24Z","snapshot_observed_at":"2026-08-03T14:37:47.087094Z","submitted_at":"2013-06-10T11:14:51Z","title":"A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1306.2164","snapshot_observed_at":"2026-08-14T10:34:02.459033Z","title":"A practical introduction to tensor networks: Matrix product states and projected en- tangled pair states","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.459033Z"},"links":{"cited_paper":"/paper/1306.2164","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:38287880c39f1bcf7c5b2abb03052e1707f249ef0c21614dccc6615f9c6baa97","observation_id":"c8dfde84-4eca-4358-93ff-685171da138f","resolution":{"observed_at":"2026-08-14T10:34:02.459033Z","resolver_source":null,"status":"malformed_identifier"},"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-14T20:23:16.771323Z","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-14T10:34:02.465115Z","title":"Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.465115Z"},"links":{"cited_paper":"/paper/1710.05867","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:da9638a608ce93daf4b74bc299d334c14a3ab91c5a28af787d5753e8671ca0b1","observation_id":"de7b9a20-97c1-4b11-b184-2ccf72c73ca8","resolution":{"observed_at":"2026-08-14T10:34:02.465115Z","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-14T05:16:44.860882Z","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-14T10:34:02.470960Z","title":"Matrix Product State Representations","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.470960Z"},"links":{"cited_paper":"/paper/quant-ph/0608197","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:4ecde417ecc53a46ead696855a72d680602e24b8f150ba53907553f45ed14bbc","observation_id":"0a53ae08-a6cd-4ac3-ad5f-bc55d641bbe3","resolution":{"observed_at":"2026-08-14T10:34:02.470960Z","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-14T10:34:03.091522Z","title":"Faster identification of optimal con- traction sequences for tensor networks","venue":null,"work_id":"692ddd6f-1dbc-4c22-8413-340e74eddf56","year":2014},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.476083Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:535ffa22827567d2d176ed6f5911e5c0825cea9b734d886d65cba90a215c6061","observation_id":"1f5930d7-e10c-489f-8793-151a8e8198f7","resolution":{"observed_at":"2026-08-14T10:34:03.097717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.0391","last_updated":"2015-03-28T02:34:17Z","snapshot_observed_at":"2026-08-13T20:29:04.233012Z","submitted_at":"2014-11-03T08:35:02Z","title":"Fast convergence of imaginary time evolution tensor network algorithms by recycling the environment","version":2},"cited_work":{"arxiv_id":"1411.0391","doi":null,"metadata_source":"pith","pith_arxiv_id":"1411.0391","snapshot_observed_at":"2026-08-14T10:34:02.767524Z","title":"Fast convergence of imaginary time evolution tensor network algorithms by recycling the environment","venue":"quant-ph","work_id":"99778c28-12c7-4f93-9a74-2689b3fd2ac8","year":2014},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.481118Z"},"links":{"cited_paper":"/paper/1411.0391","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:4f878c8f5c06086a2faf96bdbb816b681371da3860841f6e385b0b666fa7861b","observation_id":"aa6bf032-d7d5-4fb4-a802-eed9c16c5694","resolution":{"observed_at":"2026-08-14T10:34:02.774094Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.09213","last_updated":"2019-07-27T08:57:56Z","snapshot_observed_at":"2026-08-14T20:37:47.632479Z","submitted_at":"2017-08-30T11:07:18Z","title":"Lecture Notes of Tensor Network Contractions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.09213","snapshot_observed_at":"2026-08-14T10:34:02.486464Z","title":"Review of Tensor Network Contraction Approaches","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.486464Z"},"links":{"cited_paper":"/paper/1708.09213","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:6044aed92e3e2adab3d73a72415de1540a4fa8be86ac30b8083099664f1246da","observation_id":"c1cd942b-96fe-42a0-a498-4425e86182ae","resolution":{"observed_at":"2026-08-14T10:34:02.486464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08553","last_updated":"2021-01-13T15:32:38Z","snapshot_observed_at":"2026-08-14T11:34:07.752060Z","submitted_at":"2019-08-22T18:14:18Z","title":"Simulation of Quantum Many-Body Systems on Amazon Cloud","version":2},"cited_work":{"arxiv_id":"1908.08553","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.08553","snapshot_observed_at":"2026-08-14T10:34:02.707402Z","title":"Simulation of Quantum Many-Body Systems on Amazon Cloud","venue":"cs.DC","work_id":"0590bb27-9d0a-4dde-b744-ea6fb72be79f","year":2019},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.491481Z"},"links":{"cited_paper":"/paper/1908.08553","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:588ba225a18611b80117655e5742dd6833c91fff0deb598cd9b08aedff55b58d","observation_id":"b57650a2-bcfd-46ac-9e59-9dd3f7ef271b","resolution":{"observed_at":"2026-08-14T10:34:02.714226Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:02.497191Z","title":"Call routing and the ratcatcher","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.497191Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:2a48fc00748ce2d6fe0e8f724935848041754225b06828c5f0a74a854c2e87ab","observation_id":"2ff92b12-967f-4108-ab73-95c9c6a3a984","resolution":{"observed_at":"2026-08-14T10:34:02.497191Z","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-14T10:34:03.073534Z","title":null,"venue":null,"work_id":"2cbfcb92-e7c2-4743-b6b8-8d9166f02f06","year":2018},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.502228Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:3e2f16d0ec7226ecd67b9930ac9d987038c40a3ed281a15f04a75d03631829be","observation_id":"b4db56a5-0f10-41ec-ab75-8bded49e4522","resolution":{"observed_at":"2026-08-14T10:34:03.078992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T10:34:03.055832Z","title":"A massively parallel tensor contraction framework for coupled-cluster computations","venue":null,"work_id":"a976614f-5ae0-42e4-b023-8d80ef60bb72","year":2014},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.509609Z"},"links":{"citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:51307792a1d7d45a57c31bf3bc125d04ad09c25b3a55fcacf180e9f8d1b0de99","observation_id":"2cf36a89-def4-47c8-9b1d-6947259ee550","resolution":{"observed_at":"2026-08-14T10:34:03.061520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0811.0898","last_updated":"2009-10-14T13:40:02Z","snapshot_observed_at":"2026-07-06T01:45:43.777767Z","submitted_at":"2008-11-06T09:12:13Z","title":"Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0811.0898","snapshot_observed_at":"2026-08-14T10:34:02.515435Z","title":"Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.515435Z"},"links":{"cited_paper":"/paper/0811.0898","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:0c06a52609be0f794eb89849655bbc23bcc717c678df9a2b579d517dca998174","observation_id":"ef7460db-7100-4ecf-b889-ed0d2c4ecab5","resolution":{"observed_at":"2026-08-14T10:34:02.515435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"cond-mat/0407066","last_updated":"2004-07-02T13:09:17Z","snapshot_observed_at":"2026-07-07T02:10:07.168634Z","submitted_at":"2004-07-02T13:09:17Z","title":"Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cond-mat/0407066","snapshot_observed_at":"2026-08-14T10:34:02.521218Z","title":"Renormalization algorithms for quantum-many body systems in two and higher dimensions","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T10:34:02.521218Z"},"links":{"cited_paper":"/paper/cond-mat/0407066","citing_paper":"/paper/1908.11034"},"observation_digest":"sha256:ffd2149285d4e4bf3ecc588b7140751bd7220bc53aacdd2bdfe07c25e750f49b","observation_id":"948ddbfd-1621-47e3-b016-c5150accddc4","resolution":{"observed_at":"2026-08-14T10:34:02.521218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.11034","last_updated":"2019-08-29T03:32:48Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-14T17:27:35.758770Z","submitted_at":"2019-08-29T03:32:48Z","title":"Carving-width and contraction trees for tensor networks"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":8,"verified_fuzzy":10},"total_outbound_references":29},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:1908.11034."}