{"as_of":"2026-08-10T06:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1849ab6184aa2cf1426382104a22eeda25d4c967d02527b42a2b599d4c186ed6","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T14:50:33.167332Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-08-01T14:05:00.410672Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T00:49:18.709410Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"cited_work":{"arxiv_id":"2512.19623","doi":null,"metadata_source":"pith","pith_arxiv_id":"2512.19623","snapshot_observed_at":"2026-07-04T00:49:18.709410Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","venue":"quant-ph","work_id":"6728b591-77ba-48d9-a035-7464f95789f1","year":2025},"citing_paper":{"arxiv_id":"2606.19035","last_updated":"2026-06-18T16:35:21Z","snapshot_observed_at":"2026-08-06T11:55:03.720164Z","submitted_at":"2026-06-17T13:05:47Z","title":"Scalable quantum circuit knitting using a weak-coupling approximation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T20:57:02.576483Z"},"links":{"cited_paper":"/paper/2512.19623","citing_paper":"/paper/2606.19035"},"observation_digest":"sha256:89c9166ac17da1a8d5fbeb5b49b2d8383b418f98865f995b825b9f9c16ed1580","observation_id":"0d417c14-d1a9-4693-ae52-5010a7dd5a14","resolution":{"observed_at":"2026-07-04T00:49:18.711601Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.19623","snapshot_observed_at":"2026-08-01T14:05:00.410672Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18888","last_updated":"2026-07-21T09:15:14Z","snapshot_observed_at":"2026-08-07T04:54:58.301139Z","submitted_at":"2026-07-21T09:15:14Z","title":"MOSAIQC: Mixed-topology-aware Optimization for Scalable Approximate noise-Informed Quantum circuit Cutting","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T14:05:00.410672Z"},"links":{"cited_paper":"/paper/2512.19623","citing_paper":"/paper/2607.18888"},"observation_digest":"sha256:4c5b7f22219ad27ece0a02536eb7fb7e30f01a6c92f65027f26c8a01902eb89f","observation_id":"fc63e5bd-7c37-4a9a-9d37-1fc88beede29","resolution":{"observed_at":"2026-08-01T14:05:00.410672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2512.19623/citation-record","integrity":"/paper/2512.19623/integrity","json":"/paper/2512.19623/citation-record.json","paper":"/paper/2512.19623"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.076442Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.076442Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:1d619ed7c5fe2478b7f2aa63fa02ba38fca71c475786fd061339d6ced59ab420","observation_id":"2fe03c38-d7ea-4c9b-bfd8-3affe0df9ab6","resolution":{"observed_at":"2026-08-03T14:50:33.076442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.081551Z","title":"Denote byO Φ := Φ†(O)the corresponding effective observable, and let ˜OΦ be its Hermitian approximation satisfying∥ ˜OΦ −O Φ∥∞ ≤ϵ","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.081551Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:baff7f9bdef0e288a850546acedca2a0ca0d7f601b9134c699251873acf60c42","observation_id":"6750d48d-b28c-46d0-a4ff-ced3e018faa1","resolution":{"observed_at":"2026-08-03T14:50:33.081551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.086508Z","title":"Denote byO Φ := Φ†(O)the corresponding effective observable, and let ˜OΦ be its Hermitian approximation satisfying∥ ˜OΦ − OΦ∥∞ ≤ϵ","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.086508Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:f3d802824ae2a3b207e6c69829f3c1d305ed8f6cc30ee3c6f47cfae30663ab46","observation_id":"13d0563d-643f-4b44-8c6b-5253c7180b5c","resolution":{"observed_at":"2026-08-03T14:50:33.086508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.090563Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.090563Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:e310f1cf637e485c71b7a98a75b121188a31ef81ae0d0cbc7ae44b0f60a27e77","observation_id":"cc0bbe96-ed0a-4c5a-8e34-17e3e1411914","resolution":{"observed_at":"2026-08-03T14:50:33.090563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.094770Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.094770Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:47ea8e08e24d393ef33ea78a7d92531282c7485d1ab46a75fcfb4f3c6c72c6e1","observation_id":"eb41212e-f7b4-45a8-86ca-21550e59e823","resolution":{"observed_at":"2026-08-03T14:50:33.094770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.099208Z","title":"Theorem 4 (Performance guarantee for ˆOΦ,x).LetΦ :L(C din )→L(C dout )be an unknown CPTP map, and letO∈H(C dout )be a known Hermitian operator","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.099208Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:aa3aaa3b5a35799dccdf8c532b7fd6a708076707c8774893f91e4e26360032aa","observation_id":"18020288-57e0-4f09-b938-0a85cfe6cb4c","resolution":{"observed_at":"2026-08-03T14:50:33.099208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.103603Z","title":"L[ i=1 Ei # ≤ LX i=1 Pr(Ei).(S47) In our analysis, we often use the following equivalent inequality obtained by applying De Morgan’s law: 1− LX i=1 Pr [Ec i ]≤Pr","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.103603Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:1d449f994b9091b91f094153e69d0db1eb706fd51e96da2bbcb0190cbfce9a1c","observation_id":"ddaa5df7-cf60-4a80-9f0b-57bdc2e89d10","resolution":{"observed_at":"2026-08-03T14:50:33.103603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.107396Z","title":"RO k=1 M(k) apr(Mk) ! ρ # −tr","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.107396Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:e5351ba16795ae9597b8a51da6fdc5fbdcf27dc0f2ea17fd214c46a213772918","observation_id":"6d414332-3cea-4e67-a42a-80a6511e0e0d","resolution":{"observed_at":"2026-08-03T14:50:33.107396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.111204Z","title":"Assume that we have access only to devices whose size is bounded by the maximal number of qubits required to representρandΦ (i1,...,il) for each l= 1, ..., L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.111204Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:9687265f2194925244bf66310b573d8ebdc5e5f4963949eee3d172a7c3085f8f","observation_id":"6108e9bc-195e-4dd4-8790-088586ef3bea","resolution":{"observed_at":"2026-08-03T14:50:33.111204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.114916Z","title":"RO i1=1 ˜Mi1 ρ # ≤ϵ 0.(S474) Similarly, it is sufficient to take ϵ0 = ϵ 2 ,(S475) by the triangle inequality, ˆµ−tr","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.114916Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:4c782ca6b14f15e06a7b024f88707d077166fec3d1a35ba68df2b52093646452","observation_id":"8efb8815-fb1d-4312-97bd-9b210fb1ce65","resolution":{"observed_at":"2026-08-03T14:50:33.114916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.118726Z","title":"First, we summarize the good-tomography event for the learning procedure at each depth","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.118726Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:8fcfd11eac1c46d02ec02b65a9f1666c2dc85f4415ca45feebf3c68698fd7d0b","observation_id":"46a3a0f2-a698-48e0-b0e4-fb03a13f9fbb","resolution":{"observed_at":"2026-08-03T14:50:33.118726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.122431Z","title":"7 at the wires betweenΦ i andΦ i+1 for i= 0, ..., L−1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.122431Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:ac2447bd3b2a94b4e98f50179bf655b44e162940642619636d6d5863ef9923ad","observation_id":"0f115a98-a197-4593-bb5d-09fabe769d12","resolution":{"observed_at":"2026-08-03T14:50:33.122431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.126090Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.126090Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:17fd50705e4d20298422ce25bc55723472eb74df2f93456cdfb6d04c5f64c7c3","observation_id":"df9319df-27fd-4454-b57c-29d9a3dd6f62","resolution":{"observed_at":"2026-08-03T14:50:33.126090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.130255Z","title":"Ex[τ ⊗2 x ] RO r=1 EUr U † r |vr ηi,s⟩ ⟨vr ηi,s|U r ⊗2 # (S521) =p 2 ηi ω2 ηi,sd2Rtr","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.130255Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:3c51569a8566f1118673ae07ff5fdc37e8609e3bc38c4d724d2751c89b674d9c","observation_id":"bfb6248f-dc77-422c-98d2-e5401cbff49c","resolution":{"observed_at":"2026-08-03T14:50:33.130255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.134417Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.134417Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:7489c3f9156e2ff09b963bdbc68fc4474d1c30c51dfb5c6006fefe2a3011c3db","observation_id":"8041a3e7-31c3-4b4d-ae71-4f1b394a2d59","resolution":{"observed_at":"2026-08-03T14:50:33.134417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.138140Z","title":"In the following, we briefly review these two approaches and explain how our results relate to the existing methods","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.138140Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:3d71c3814853c96820cd759d6dd5591dbd7f6ba018e49611ade02b3d646be02e","observation_id":"c66aec8a-389a-40b3-a40a-f99b6fa1b7b6","resolution":{"observed_at":"2026-08-03T14:50:33.138140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.141938Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.141938Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:9c699177f6ce5d2cbc289cb2470661a98fee013edb0f26f8ff28f7aa296661de","observation_id":"73d68d47-9b64-4dbf-849e-bbb364328720","resolution":{"observed_at":"2026-08-03T14:50:33.141938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.145522Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.145522Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:468fe4a4563be9683f784036320bd566b8e861f36a60f598a4e2f67503287c34","observation_id":"466447d1-abe4-45c0-9102-7308dcc65a30","resolution":{"observed_at":"2026-08-03T14:50:33.145522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.148997Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.148997Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:3147ca8a64b5d9e01b0debd6508e120a7a5ad74674b7239d3b5aac6df11b6742","observation_id":"344520d4-486b-4499-8139-2ad921d8815f","resolution":{"observed_at":"2026-08-03T14:50:33.148997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.152464Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.152464Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:2887653caf641d935bd65bf29be5526adee4839b28b169d6e6563b0188ff9a2c","observation_id":"03489dbe-3ffb-4dc8-a799-cb13c2dd490f","resolution":{"observed_at":"2026-08-03T14:50:33.152464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.155839Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.155839Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:46a4535a6b27f3f45c0a75664757ecfe30fb157d55bd33b96a95e3f46e3fb1b5","observation_id":"cdd87fa6-7652-4c35-8166-935d5e4c842e","resolution":{"observed_at":"2026-08-03T14:50:33.155839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.159798Z","title":"LO” denotes local operations without classical communication, whereas “LOCC","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.159798Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:45bfa65e1c010fd67bd2c1d3ef417154e0cd4c5015ee55301cc1a2a7a777a205","observation_id":"b71f76d2-9cc0-487e-af88-0fa6b1cd22c5","resolution":{"observed_at":"2026-08-03T14:50:33.159798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.163694Z","title":"In this subsection, we focus on wire cuts, which are most relevant to our work, and discuss how existing constructions relate to our results","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.163694Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:6f712123edc4d3f5fc20b4baa4811ee994ef8edc293a9bdca301fbbbff8528c4","observation_id":"53f8c617-3402-444c-bf50-9c44e742f96c","resolution":{"observed_at":"2026-08-03T14:50:33.163694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T14:50:33.167332Z","title":"Below, we summarize the main prior works [113–115], and show that these works can be reformulated in the language of expectation-value-level QPDs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T14:50:33.167332Z"},"links":{"citing_paper":"/paper/2512.19623"},"observation_digest":"sha256:b9d3e3f114e8b257953665e07571a3da032402b22fc903d34d199fca6244eff3","observation_id":"8582ff3e-93e9-46ff-b232-e3154c47b85a","resolution":{"observed_at":"2026-08-03T14:50:33.167332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.19623","last_updated":"2026-06-30T16:48:18Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-03T14:50:30.037161Z","submitted_at":"2025-12-22T17:55:47Z","title":"Learning Enables Exponential-to-Polynomial Sampling Overhead Scaling in Quantum Divide-and-Conquer for Tree-Structured Circuits"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":24},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 2 inbound Pith citation observations for arXiv:2512.19623."}