{"as_of":"2026-08-15T04:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:475e5363fefbad122dda81d1f462b14dc46a7ae2d37dd8f6a7e84ec71d37cdaf","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:58:09.276534Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T00:04:44.921863Z","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-23T00:05:13.433613Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"cited_work":{"arxiv_id":"1908.04381","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.04381","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient Contrac- tion of Large Tensor Networks for Weighted Model Counting through Graph Decomposi- tions","venue":null,"work_id":"7692d3da-b2e1-409c-bd4e-c831631341ed","year":2020},"citing_paper":{"arxiv_id":"2503.07720","last_updated":"2026-04-14T18:00:04Z","snapshot_observed_at":"2026-08-13T03:44:22.940399Z","submitted_at":"2025-03-10T18:00:02Z","title":"Counting with the quantum alternating operator ansatz","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-23T00:04:44.921863Z"},"links":{"cited_paper":"/paper/1908.04381","citing_paper":"/paper/2503.07720"},"observation_digest":"sha256:f1a565be60677a8044a99134ba41eff2b28ef303af4444885e91540492d4fa36","observation_id":"7883d3b5-58e6-4892-9133-1b73656814c5","resolution":{"observed_at":"2026-05-23T00:05:13.436496Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"cited_work":{"arxiv_id":"1908.04381","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.04381","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient Contrac- tion of Large Tensor Networks for Weighted Model Counting through Graph Decomposi- tions","venue":null,"work_id":"7692d3da-b2e1-409c-bd4e-c831631341ed","year":2020},"citing_paper":{"arxiv_id":"2605.00106","last_updated":"2026-04-30T18:01:40Z","snapshot_observed_at":"2026-08-10T23:23:49.073805Z","submitted_at":"2026-04-30T18:01:40Z","title":"From Tensor Networks to Tractable Circuits, and back","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-09T20:30:08.694587Z"},"links":{"cited_paper":"/paper/1908.04381","citing_paper":"/paper/2605.00106"},"observation_digest":"sha256:f5e7209e546a4080e6792797e632fd6bb4b857d72adc4905e844bec320456566","observation_id":"df59a608-e278-4be4-8534-cc77fee4882c","resolution":{"observed_at":"2026-05-11T15:11:06.898693Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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.04381/citation-record","integrity":"/paper/1908.04381/integrity","json":"/paper/1908.04381/citation-record.json","paper":"/paper/1908.04381"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:58:10.157752Z","title":"Bacchus, S","venue":null,"work_id":"25e39cff-93db-4fd9-b777-4d933e1a3a3e","year":2003},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:08.993402Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:c2759ba997eb35486b6bacb7689268251f6cbf273093dd4d3c14202b576e70a5","observation_id":"efe8155e-6b53-4fd0-98ee-3ea75a11545e","resolution":{"observed_at":"2026-08-14T13:58:10.162257Z","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-14T13:58:10.142821Z","title":"Domshlak, J","venue":null,"work_id":"eeb1586f-cba6-4310-9747-fbf157815654","year":2007},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:08.998483Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:170d6b8525b7db21164eba23c7bfd233fc63600e080a2ee6d3b5ef4bb642b64d","observation_id":"6fe57db6-9dc9-49d2-9aa1-6cc1e6ac216d","resolution":{"observed_at":"2026-08-14T13:58:10.146631Z","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-14T13:58:10.129355Z","title":null,"venue":null,"work_id":"7449cecf-f9d3-4b10-8185-76cd349892da","year":2009},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.002785Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:13856eaa21d63d53c18b2de75607c1fc8ec9797773f2bdc109034e5b0b48be4a","observation_id":"43b256a6-8515-440a-a39f-42b958289322","resolution":{"observed_at":"2026-08-14T13:58:10.134343Z","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-14T13:58:10.117235Z","title":null,"venue":null,"work_id":"23c1168d-6bd0-462f-9d12-9335ebf6ba22","year":1979},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.007367Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:a3e7acade06d1a88d08010466187768f1f73f8b81556222d519cc5c3ef11b4cd","observation_id":"c9f462f6-824b-4162-bdf8-de07972306d9","resolution":{"observed_at":"2026-08-14T13:58:10.121421Z","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-14T13:58:10.105931Z","title":"Oztok, A","venue":null,"work_id":"90700d31-fcb0-458f-b05e-832f0ccb4887","year":2015},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.011393Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:d28cdf1443f3dff4c2f9d4d95d0b8aa122e29bcd017c670256cb8b93796a49b1","observation_id":"88da1256-1d07-420b-846d-658924d548b2","resolution":{"observed_at":"2026-08-14T13:58:10.109825Z","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-14T13:58:10.093879Z","title":"Thurley, SharpSAT: counting models with advanced componen t caching and implicit BCP, in: Proc","venue":null,"work_id":"cd22df09-3d8f-4352-9ae2-d7b870452c51","year":2006},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.015535Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:1d2a4f614009b9b23a77f222580cc9b8f2cbb9a8a3bca7025403accc152b5eef","observation_id":"39edffd4-95a4-46ce-a77f-f15daa1d9271","resolution":{"observed_at":"2026-08-14T13:58:10.098041Z","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-14T13:58:10.080487Z","title":null,"venue":null,"work_id":"0c8befc1-8d1d-4908-82c4-33c276a740b7","year":2015},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.020653Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:1e6723e8a4a396c3844c4bed8ba2b4db1e42e399fa9cafce87e780f09e32ecf8","observation_id":"7606b31a-7a70-4894-94e9-b807f24c0216","resolution":{"observed_at":"2026-08-14T13:58:10.085029Z","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":{"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-14T13:58:09.024610Z","title":"Biamonte, V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.024610Z"},"links":{"cited_paper":"/paper/1708.00006","citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:694f7164723d745571bced16226e7525982cacc0f9ce3d1c68ee112369bac23c","observation_id":"d9e0c081-b5cb-41ec-86d3-18ba418f4ac7","resolution":{"observed_at":"2026-08-14T13:58:09.024610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1403.2048","last_updated":"2014-08-24T11:04:32Z","snapshot_observed_at":"2026-08-14T23:41:58.458225Z","submitted_at":"2014-03-09T10:45:18Z","title":"Era of Big Data Processing: A New Approach via Tensor Networks and Tensor Decompositions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1403.2048","snapshot_observed_at":"2026-08-14T13:58:09.029331Z","title":"Cichocki, Era of big data processing: A new approach via tenso r net- works and tensor decompositions, arXiv preprint arXiv:1403.2048","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.029331Z"},"links":{"cited_paper":"/paper/1403.2048","citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:ff282b017918c49b5df44bccfb42ff289de56739b31f37b35f7e9136fd1ae982","observation_id":"c3759c8e-1ed7-428c-979f-69cff42be8a6","resolution":{"observed_at":"2026-08-14T13:58:09.029331Z","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-14T13:58:10.067939Z","title":"Or´ us, Tensor networks for complex quantum systems, Na ture Reviews Physics 1 (9) (2019) 538–550","venue":null,"work_id":"7ee8565a-7f8c-4b48-8369-d2cc6855761b","year":2019},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.033825Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:1e33e58ddcb148527e705904df1460a2df0540f7472421e286c921806563fa19","observation_id":"f1b61071-9a62-468b-8a4e-c33869290096","resolution":{"observed_at":"2026-08-14T13:58:10.072611Z","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-14T13:58:10.055343Z","title":null,"venue":null,"work_id":"644dbb0e-a2fe-4b6a-9235-4355c56b2bee","year":2001},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.037686Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:0fc4abcf3407cef3da6ef4dfbb9ba8c5c488bdc28f845fd92699f47bd06bd217","observation_id":"760bc76c-62fd-409b-9502-8cd58a93b42f","resolution":{"observed_at":"2026-08-14T13:58:10.059817Z","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-14T13:58:10.042816Z","title":null,"venue":null,"work_id":"c4eeb7ef-08b2-4ebb-b96f-0347eee6c962","year":null},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.041951Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:f3fddfa8be97c0c275522bb6001709aa747b46a09ea33732c312e552470d3f2e","observation_id":"547badcb-14fe-4609-ac51-6ec4df9d9677","resolution":{"observed_at":"2026-08-14T13:58:10.046877Z","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-14T13:58:10.030788Z","title":null,"venue":null,"work_id":"88e6fa91-fb1d-4856-b452-ab87063e0d2b","year":2003},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.046771Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:4d64d3f82c52bb1457e0546f584c4e20fa5af69df75ff97caead012dee131b09","observation_id":"09cc5706-1e2e-42c8-8af5-22cd4c96ae7f","resolution":{"observed_at":"2026-08-14T13:58:10.034658Z","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-14T13:58:10.018901Z","title":"Kjolstad, S","venue":null,"work_id":"42722617-b854-493f-b193-fb194f2ff620","year":2017},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.051464Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:d38d26de0fae51c9aa21d22e853bb9f08e45450b26d3ee120240f900d9d3eeae","observation_id":"b8e0acf6-e5f8-435e-af4a-47c7a9c9ebf3","resolution":{"observed_at":"2026-08-14T13:58:10.022709Z","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":"1802.04730","last_updated":"2018-06-29T00:16:36Z","snapshot_observed_at":"2026-08-14T19:46:17.506277Z","submitted_at":"2018-02-13T16:53:01Z","title":"Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04730","snapshot_observed_at":"2026-08-14T13:58:09.055713Z","title":"Vasilache, O","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.055713Z"},"links":{"cited_paper":"/paper/1802.04730","citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:55a7d4c46c0542d00789206edbeda0a631779e389fe73632e283e2a54a16a6a6","observation_id":"f9b4ea15-2737-484d-b4ca-446513fde50d","resolution":{"observed_at":"2026-08-14T13:58:09.055713Z","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-14T13:58:10.005705Z","title":null,"venue":null,"work_id":"2ea96498-3956-40c5-b648-510b2a3a1795","year":2019},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.060657Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:6c496dddfbd2efbb29914c251197e03cf49088e0d3dc7782bae0145c4c1c41d3","observation_id":"fc437905-bbd0-4b3a-8aeb-c0caf7257456","resolution":{"observed_at":"2026-08-14T13:58:10.010008Z","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-14T13:58:09.992421Z","title":"Nelson, A","venue":null,"work_id":"718a3209-40ca-46fd-94d3-1a59717006e7","year":2015},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.064837Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:753034f21bb906efc1f6f8712b43c0c3777b3c6c4683d02d07cf00304b254539","observation_id":"01f4d5b5-0c1d-43e4-beba-e4c3a0ee17c5","resolution":{"observed_at":"2026-08-14T13:58:09.996980Z","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-14T13:58:09.979716Z","title":"Pfeifer, J","venue":null,"work_id":"94aac2d7-60b3-49ee-8f3b-a702a4680005","year":2014},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.069277Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:5f41a01625e5129597c00c7d7d6a349cf43bf0d03e21ca70f5b13c5c3bd19232","observation_id":"1ec1fd38-3489-45d6-98a3-421887ef9f13","resolution":{"observed_at":"2026-08-14T13:58:09.983923Z","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":"1805.00475","last_updated":"2019-11-12T21:17:31Z","snapshot_observed_at":"2026-08-14T19:19:59.916116Z","submitted_at":"2018-05-01T18:00:01Z","title":"Fast counting with tensor networks","version":2},"cited_work":{"arxiv_id":"1805.00475","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.00475","snapshot_observed_at":"2026-08-14T13:58:09.337441Z","title":"Fast counting with tensor networks","venue":"cond-mat.stat-mech","work_id":"c958acb0-bf74-483a-92bf-f7c8de78298e","year":2018},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.073652Z"},"links":{"cited_paper":"/paper/1805.00475","citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:b3d8e5f9333246e4c347b7a35ba6ddd81ee34961627b4fac459b10ee0a638c43","observation_id":"42370043-d10f-4d7f-a68f-a3b676a24b18","resolution":{"observed_at":"2026-08-14T13:58:09.343790Z","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-14T13:58:09.079521Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.079521Z"},"links":{"cited_paper":"/paper/1708.09213","citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:ac9fe678ed74326fc38f7bd208f82e205093be3ffca7be7e4f3f384be03a972a","observation_id":"9b2141c9-4780-4c25-94a5-9beae31195c3","resolution":{"observed_at":"2026-08-14T13:58:09.079521Z","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-14T13:58:09.962584Z","title":"Greco, N","venue":null,"work_id":"2f13091e-1f27-43c0-adf5-9c2cc07947db","year":2017},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.085634Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:4fec945b0b5512332e956de015c75d3b9e324e1fd84f02802970b5e5e0bd17b9","observation_id":"12be83db-daea-4b1a-8ea6-fb20ad7f8fd0","resolution":{"observed_at":"2026-08-14T13:58:09.967934Z","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-14T13:58:09.949994Z","title":null,"venue":null,"work_id":"7f6f6d1f-6604-43fb-92c1-305c53ec24fd","year":2004},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.089936Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:9d10b96d68e8151a0e67d71a72ed5ac8198ac390978f10cdd51a7c96c99ca6a0","observation_id":"002738c7-c085-466c-9908-dd323e97a806","resolution":{"observed_at":"2026-08-14T13:58:09.954197Z","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-14T13:58:09.937944Z","title":null,"venue":null,"work_id":"6cb39690-bc76-4212-a6f3-55b604326383","year":2017},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.093881Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:e68996ca6ee0be8161380fc31243a12ea206a23173e8d2d8e249ec4116d494cf","observation_id":"fb396ee7-ee52-4f49-9c3b-4cc2d6814299","resolution":{"observed_at":"2026-08-14T13:58:09.941829Z","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-14T13:58:09.924339Z","title":"Abseher, N","venue":null,"work_id":"3f7db54b-9fcc-4ef5-a138-73aa4b5251ad","year":2017},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.097717Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:f1eed0c85d48500aebc891928451ca2ce1495579358163a836d245406ff1f489","observation_id":"e72eb6c0-b483-4bba-81e6-9cb7cc538de7","resolution":{"observed_at":"2026-08-14T13:58:09.928969Z","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-14T13:58:09.911920Z","title":"Hamann, B","venue":null,"work_id":"9e825f1e-53ba-4406-aea2-554fffab1497","year":2018},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.101471Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:758d724cf97898a607e27d0eac37ecb28c1c88d81cf831bc24780880d786b451","observation_id":"e8dc8ef0-83cb-4531-add7-743e333b1447","resolution":{"observed_at":"2026-08-14T13:58:09.915845Z","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-14T13:58:09.898516Z","title":"Tamaki, Positive-instance driven dynamic programming for tr eewidth, in: Proc","venue":null,"work_id":"602e383a-18e6-4c62-8767-23fc0a4008d1","year":2017},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.105106Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:bc79141fc2c2237ee04a08b806ff3dac916a997285c79df79f60bdf01894df57","observation_id":"2db6aef5-50b1-410b-a3b9-065a76021e5d","resolution":{"observed_at":"2026-08-14T13:58:09.902819Z","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-14T13:58:09.884688Z","title":"Fischer, J","venue":null,"work_id":"6dcfe885-22be-436e-a205-127515ab971f","year":2008},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.108803Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:01ec877598a64734e4454645efbb423b1b2d8a99fea56d775738d4d7db19485b","observation_id":"e5517d43-e77f-41ad-bce8-7b4ac014d525","resolution":{"observed_at":"2026-08-14T13:58:09.889106Z","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-14T13:58:09.872425Z","title":"Samer, S","venue":null,"work_id":"e8270e58-ab51-45ed-a9e2-c20848a77e2c","year":2010},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.112996Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:c960b72ac3c16066b41f07bf392e1e39b869fb2f6d19156911b96433cf89d690","observation_id":"69cc295a-323b-4a30-8e85-2fdfb9ef622c","resolution":{"observed_at":"2026-08-14T13:58:09.876628Z","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-14T13:58:09.859321Z","title":null,"venue":null,"work_id":"f5228b62-287c-46b2-a4f3-010859de5dbf","year":2008},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.116785Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:1cc35506531e3895fa4669945582d20b9ecc5e609e34e8a5de7f7efc013b9dff","observation_id":"10588bd7-28ac-425e-bc98-fe63a32bfc7b","resolution":{"observed_at":"2026-08-14T13:58:09.863639Z","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-14T13:58:09.847113Z","title":"de Oliveira Oliveira, On the satisfiability of quantum circuits of sm all treewidth, in: International Computer Science Symposium in Russia , Springer, 2015, pp","venue":null,"work_id":"7edeaa12-2abc-4048-99e2-f2ed1f42f88f","year":2015},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.121002Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:89754e8d299adcb52276a2d094d87595a1476c6a9c0058da1b7b2a2a325c3984","observation_id":"684b0e33-2e01-4509-9e33-e09561c84c46","resolution":{"observed_at":"2026-08-14T13:58:09.851312Z","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-14T13:58:09.835495Z","title":null,"venue":null,"work_id":"04c66752-40b5-435c-8439-c08be5371a53","year":null},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.124940Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:608049c5d14ab21511ba1c5fc5a052aec94baac9790f54c9e5f62c79231122cb","observation_id":"11bb6068-595f-4e76-8949-00858bc234f6","resolution":{"observed_at":"2026-08-14T13:58:09.839446Z","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-14T13:58:09.823657Z","title":"Grasedyck, Hierarchical singular value decomposition of ten sors, SIAM Journal on Matrix Analysis and Applications 31 (4) (2010) 2029–205 4","venue":null,"work_id":"f63e7f0e-b9f2-4c86-9142-720f806a40ce","year":2010},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.128806Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:e27cde8e4fd7c27cf4f9c367f6a1efaa981dc58a2c44a67244f2c86562aa5273","observation_id":"0f567e56-5f6e-4e38-a1ed-590b997a72fd","resolution":{"observed_at":"2026-08-14T13:58:09.827832Z","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-14T13:58:09.812067Z","title":null,"venue":null,"work_id":"6161cb0d-c566-44f1-b1a6-e3aa7df6d863","year":2005},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.132779Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:21f9686b9105351fcf7d8f5a4e8cc4a9976e2ab9b2034915357ef8847ea0322d","observation_id":"d15510da-ea7f-4157-8f2d-61401748fc1a","resolution":{"observed_at":"2026-08-14T13:58:09.815894Z","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-14T13:58:09.799052Z","title":"Lagniez, P","venue":null,"work_id":"3e3ba77c-1dfb-4dfb-a346-c191e451f493","year":2017},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.136684Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:e4707f4e1f5471dd9b5226aeb5cd6bb7f05fe36947af27cf55a6b8a27efc5bdf","observation_id":"1689dfad-c46f-486b-a006-cdfaea885427","resolution":{"observed_at":"2026-08-14T13:58:09.803125Z","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-14T13:58:09.786515Z","title":"Charwat, S","venue":null,"work_id":"1e5dd008-d222-4758-ba6c-0aedb7f749af","year":2016},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.140887Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:89e84005450ff9979172ed9b7c8b59813a31dbffcf86739fb512b50ae5ca2cdd","observation_id":"0d98609d-159f-4d13-abd2-67f1f875ed46","resolution":{"observed_at":"2026-08-14T13:58:09.790620Z","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-14T13:58:09.774259Z","title":null,"venue":null,"work_id":"20ab18f8-2584-4b95-8465-c06718882638","year":2017},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.144814Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:93c8581965503820b5402b947206eec25c7f8e295934c47f3a4286117a19d93c","observation_id":"2ce80430-6c4a-49ce-83c1-652743ef71bb","resolution":{"observed_at":"2026-08-14T13:58:09.778437Z","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-14T13:58:09.759790Z","title":null,"venue":null,"work_id":"e4ff5773-3bb8-4951-a5aa-9a1eab6e28dc","year":1994},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.148696Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:fc6da58a5a184645ff324c0a8acd71909edf145b94f79c8ce861883d2e6b6ad6","observation_id":"efa810f6-f5d4-41bb-861b-cc049c653839","resolution":{"observed_at":"2026-08-14T13:58:09.764173Z","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-14T13:58:09.747560Z","title":"Robertson, P","venue":null,"work_id":"ec719c68-f9c5-4e98-85d0-12ec71794615","year":1991},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.152378Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:76c5ca42792b2cf7c78f042b771a32a8804117cadc73ef0be99f00ef76449470","observation_id":"984b2826-013f-41b8-8573-8709a0a7473f","resolution":{"observed_at":"2026-08-14T13:58:09.751548Z","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-14T13:58:09.735490Z","title":"Sasak, Comparing 17 graph parameters, Master’s thesis, T he University of Bergen (2010)","venue":null,"work_id":"d9cd5c36-65fe-4f90-9470-87b4a049c23d","year":2010},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.156823Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:266ac7960393d20eadb8125dc98685a4f9370b28a7fd5cf8ec32f72ccd67557c","observation_id":"05302226-3f1d-4841-a616-3641e08fb0c3","resolution":{"observed_at":"2026-08-14T13:58:09.739405Z","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-14T13:58:09.723358Z","title":"Swami, A","venue":null,"work_id":"02bb65d1-03bc-491d-8fc6-84506c2cf7bc","year":1988},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.160570Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:43923c70ef9175e568a4243b5fb3067753eb03d1faa1462aa9723d5a36cc56a0","observation_id":"00bb8b2b-b3df-4158-b8c9-fbd8cdb760ca","resolution":{"observed_at":"2026-08-14T13:58:09.727534Z","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-14T13:58:09.709577Z","title":"Dechter, Bucket elimination: A unifying framework for reaso ning, Arti- ficial Intelligence 113 (1-2) (1999) 41–85","venue":null,"work_id":"c807a073-67e0-4104-a511-bf86fc1a5087","year":1999},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.165716Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:821a0275852046edd3b3f648a77ea46d9d1e97f4e60827d76dcf8c606573c62c","observation_id":"a18af759-4010-42c0-bc95-dce2d6e72413","resolution":{"observed_at":"2026-08-14T13:58:09.714164Z","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-14T13:58:09.695803Z","title":null,"venue":null,"work_id":"2f1627d5-2732-49f4-a641-d63f6f27b298","year":2011},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.169753Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:4502e4fad2983ce1d7d1ef54a09be0a88afcb2a894ea785f04119afe7a69143b","observation_id":"7d39f4b9-9fa9-4da7-af92-468ff0cef594","resolution":{"observed_at":"2026-08-14T13:58:09.699816Z","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-14T13:58:09.680202Z","title":"Chaudhuri, M","venue":null,"work_id":"02844a33-c5f9-4c7a-9ca6-80679996dd38","year":1993},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.173636Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:5bf69521b70ca8283895b6e3a9293d038439c70cddec5bb7bc4ee5e8b306ac08","observation_id":"950e08fc-f4d9-4790-ba33-e84eca08b747","resolution":{"observed_at":"2026-08-14T13:58:09.686347Z","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-14T13:58:09.668192Z","title":"Cavallo, M","venue":null,"work_id":"46631631-9a52-4e63-8e61-476c16ce1c74","year":1987},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.177760Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:d261ddbe2fd43850c8d99b9d184e1c4ecc3cc38a295336cbfb689670a05e0b74","observation_id":"1426b0aa-3d4d-48bc-95d6-cb19e11f134f","resolution":{"observed_at":"2026-08-14T13:58:09.672406Z","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-14T13:58:09.655035Z","title":null,"venue":null,"work_id":"02de776e-007c-4372-a205-202a8482af25","year":2019},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.183484Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:217a14e96c69446fb9469325c6ec98fc262a559557837c36d5a6a4326b844517","observation_id":"8c5c0708-4107-4a4b-94bc-eba57c131f76","resolution":{"observed_at":"2026-08-14T13:58:09.659498Z","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":{"arxiv_id":"1710.01437","last_updated":"2017-10-04T01:55:05Z","snapshot_observed_at":"2026-08-14T20:27:03.829640Z","submitted_at":"2017-10-04T01:55:05Z","title":"Duality of Graphical Models and Tensor Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.01437","snapshot_observed_at":"2026-08-14T13:58:09.188942Z","title":"Robeva, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.188942Z"},"links":{"cited_paper":"/paper/1710.01437","citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:7f6c79f9e1004e3df266eac30a3b53f4c6b74e45b082c65a8481e8728bfe9888","observation_id":"a4c5ff8a-7cb1-4123-b5ea-af896e941266","resolution":{"observed_at":"2026-08-14T13:58:09.188942Z","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-14T13:58:09.643692Z","title":"Abo Khamis, H","venue":null,"work_id":"516aae57-c71f-4021-a120-fdcc660c494a","year":2016},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.194733Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:4f429f99530afd31faa333ce79e5705a000deb5b74cae3a4cef05bd2158d5f39","observation_id":"5ce40932-bc59-4e1b-9da8-e38094dec598","resolution":{"observed_at":"2026-08-14T13:58:09.647489Z","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-14T13:58:09.631801Z","title":null,"venue":null,"work_id":"24bad1ec-37f2-43dd-95f3-449ae09591f4","year":null},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.199080Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:30128e9faf5853d859a875012214495b6649ed41cf11cea16673516b3eca0670","observation_id":"6e499177-6837-4326-8d5d-abe0e16a9dcc","resolution":{"observed_at":"2026-08-14T13:58:09.635842Z","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-14T13:58:09.619237Z","title":"Fatahalian, J","venue":null,"work_id":"fe2ae6dd-10be-4bea-ac05-0f050e1670fc","year":2004},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.203416Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:8dc2feef6b73dc86c4b02de41a355c3960d708ad355b6e1bd56475a2ac9f9081","observation_id":"4c6733b9-3042-4979-923a-766d9969dab7","resolution":{"observed_at":"2026-08-14T13:58:09.623168Z","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-14T13:58:09.605814Z","title":"Due˜ nas-Osorio, M","venue":null,"work_id":"d8e8a1ce-be93-4c5f-a399-3a17761ed793","year":2018},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.208157Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:05ac48aedf001501abc8dd35afac9e490e55ca444b32cefa2fc9f719954695fd","observation_id":"604722bb-ec19-4c16-827c-4f3d221dd764","resolution":{"observed_at":"2026-08-14T13:58:09.609469Z","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-14T13:58:09.594311Z","title":"Evenbly, R","venue":null,"work_id":"0f40cb94-544f-489f-8a8e-887ec1ad6f85","year":2014},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.212930Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:31ad836661ac1674f46ff4c948576c564f220286e04e33c2de73f5deb147a850","observation_id":"c5041816-8baf-4fb6-aac7-815dcac627b2","resolution":{"observed_at":"2026-08-14T13:58:09.598343Z","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-14T13:58:09.582340Z","title":"Dechter, Constraint processing, Morgan Kaufmann, 2003","venue":null,"work_id":"01bcabda-dfe7-47a2-b372-47683a037c38","year":2003},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.218103Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:d21737208b7455ef2688aca4acc9bed931f28b19bdf036314605c86c9ce450a4","observation_id":"a54c1959-5fe6-4438-9985-6ee1569e80d1","resolution":{"observed_at":"2026-08-14T13:58:09.586224Z","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-14T13:58:09.570458Z","title":"Ying, Tensor network skeletonization, Multiscale Modeling & Sim ulation 15 (4) (2017) 1423–1447","venue":null,"work_id":"aedb41e4-6a13-4fbb-a0f3-b30d2ecd4ee4","year":2017},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.222488Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:c36c3f92673687c20d3cc5654b3e217b36bfa7d82c9fce9ec5d2fd7aa51f4e09","observation_id":"ff872bf9-b7ff-479d-a9e9-e09acb913a88","resolution":{"observed_at":"2026-08-14T13:58:09.574475Z","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-14T13:58:09.557673Z","title":null,"venue":null,"work_id":"441c7039-8772-41fe-b12a-99a0ec20a12e","year":2008},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.228052Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:30bdb0f68c4106b29970d807fee6d14a9aba353a9fcdc866bc2d77641b868ad8","observation_id":"88e19450-81ed-468d-98e8-f3b3647d9f56","resolution":{"observed_at":"2026-08-14T13:58:09.562040Z","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-14T13:58:09.544179Z","title":"Dalmau, P","venue":null,"work_id":"d36cc370-2c3e-43c9-9750-30e30c4522e5","year":2002},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.235336Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:627d040d2e50428ab155bdcae620a1337986b382c82816e914a12acdc96efd89","observation_id":"987d505f-6381-4543-9a83-484de2dc65da","resolution":{"observed_at":"2026-08-14T13:58:09.548874Z","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-14T13:58:09.532125Z","title":null,"venue":null,"work_id":"77967c84-d33b-4f1c-802d-311275a76165","year":2005},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.239244Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:4dcfa43e7e1b094c863cba892cc60accbf54aa4ebdec5090d1104033a74bd61e","observation_id":"b1c92752-ffc4-49a2-8198-9b4b8bf6d93d","resolution":{"observed_at":"2026-08-14T13:58:09.535774Z","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-14T13:58:09.519551Z","title":null,"venue":null,"work_id":"0712a1ae-3db2-43fd-baeb-bf8c705084a0","year":2018},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.243680Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:3bcd08bf6ad17c5fbc622111c7d1575058f3145ed86e1e2f5a7b4e0d22d0a221","observation_id":"0e2a3315-99e4-411f-a35d-b06731abf4bd","resolution":{"observed_at":"2026-08-14T13:58:09.523528Z","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-14T13:58:09.505751Z","title":"`Alvarez, R","venue":null,"work_id":"580fe877-9dcd-470c-95fa-886cfa72b4ef","year":2007},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.247751Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:8c40a66d632df4a96e6cec70832a9bbe0d5470f6a0d7eeaf18e3d93164d11da4","observation_id":"2e3d1092-e452-49a5-8393-5ba28511f406","resolution":{"observed_at":"2026-08-14T13:58:09.510634Z","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-14T13:58:09.490665Z","title":null,"venue":null,"work_id":"2bc71cf4-102c-4a99-aaa0-5839c159a0d5","year":2011},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.252033Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:68447b6bb3786dd8613595710f1bbb875db3e0ff25ca44ce31effb23a83438f8","observation_id":"95b66abb-b140-4ce4-b119-c7dfa7c00609","resolution":{"observed_at":"2026-08-14T13:58:09.495233Z","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-14T13:58:09.477475Z","title":"Samer, S","venue":null,"work_id":"03bd614b-931c-4fe1-9e8c-ba9a73cf4a55","year":2010},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.256216Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:83b08d84ab5f84bfaa0d83b9e682925ca1aae2297030a87562c23de39654ece0","observation_id":"f4d9c672-a08b-4415-9e21-0b8fdc066815","resolution":{"observed_at":"2026-08-14T13:58:09.481980Z","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-14T13:58:09.462580Z","title":"de Oliveira Oliveira, Size-treewidth tradeoffs for circuits comp uting the element distinctness function, Theory of Computing Systems 62 (1 ) (2018) 136–161","venue":null,"work_id":"4b33a48b-9f83-4efa-acec-65dec23fda67","year":2018},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.260209Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:b1181385776357bd1a7163a78f06f99e3c10eb69b406f5984a7121f7ab709cc9","observation_id":"4135d6ab-3c1b-4108-859c-1f77d44d9e83","resolution":{"observed_at":"2026-08-14T13:58:09.468207Z","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-14T13:58:09.447056Z","title":"Viger, M","venue":null,"work_id":"6f4d6c28-3294-4829-ac1b-595f386bab4c","year":2005},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.264203Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:be48ddf67ab559157bb22e845bfbc6f52a8ed92c888555112d559ee8664a9579","observation_id":"5d569ab8-9c94-4193-9323-1e23e27a855c","resolution":{"observed_at":"2026-08-14T13:58:09.453755Z","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-14T13:58:09.434087Z","title":"Lagniez, P","venue":null,"work_id":"3f0f74f0-8112-441a-9187-1798c6c64d35","year":2014},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.268310Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:9b46c785889591ba3e069d992eddde93404f21bb2cce185cd4150d6906246a8a","observation_id":"18d683de-9671-4ee6-a202-17f19c57df28","resolution":{"observed_at":"2026-08-14T13:58:09.438272Z","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-14T13:58:09.420540Z","title":"Lagniez, E","venue":null,"work_id":"344e821e-08bc-4bab-87a5-0a8174a6383a","year":2016},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.273061Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:8cc2b5429ab5ecf275242af7fbdbd2b86d414b4891c857ee39d5dcbe1eb625f3","observation_id":"1558bbc8-ca2e-48de-8b9c-830115926f56","resolution":{"observed_at":"2026-08-14T13:58:09.425085Z","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-14T13:58:09.406772Z","title":null,"venue":null,"work_id":"494941ec-897b-43da-8581-fb4944400f55","year":2018},"citing_paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T13:58:09.276534Z"},"links":{"citing_paper":"/paper/1908.04381"},"observation_digest":"sha256:a8307ee3173ef57710fbe4ca3e3fce1601e070a3c14c3a4597a2cdf32046ae56","observation_id":"76dc6df5-e7b6-40ce-9272-702c3eb9f283","resolution":{"observed_at":"2026-08-14T13:58:09.411309Z","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"}}],"paper":{"arxiv_id":"1908.04381","last_updated":"2020-04-27T23:39:11Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T02:42:51.193716Z","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":1,"verified_fuzzy":37},"total_outbound_references":65},"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 15 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 2 inbound Pith citation observations for arXiv:1908.04381."}