{"as_of":"2026-08-10T08:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:923d6b6f7707ba586180c730dcef7b0724c1a4f254dc4ce16714500fa4b95826","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:02:36.477483Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.06649/citation-record","integrity":"/paper/2507.06649/integrity","json":"/paper/2507.06649/citation-record.json","paper":"/paper/2507.06649"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.05551","last_updated":"2024-04-08T14:19:25Z","snapshot_observed_at":"2026-08-09T09:29:51.766151Z","submitted_at":"2024-04-08T14:19:25Z","title":"Improving Quantum and Classical Decomposition Methods for Vehicle Routing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05551","snapshot_observed_at":"2026-08-06T19:02:36.393510Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.393510Z"},"links":{"cited_paper":"/paper/2404.05551","citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:862027898526bda71b1b264bae8a4c3e5298e9b0464e26776f5ec424a0b120fb","observation_id":"b97b6a60-c63f-4be5-9e48-b7a31691f08b","resolution":{"observed_at":"2026-08-06T19:02:36.393510Z","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-06T19:02:36.831112Z","title":"Wagner, J","venue":null,"work_id":"18be44d6-996b-4d2c-8018-99a6b988bbf0","year":2025},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.398088Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:cfbee45e88395c14612ef232accdaf371495681b8637d6b0043701fa91873d3f","observation_id":"2ebf971d-e8aa-4069-969c-51d8c206af9b","resolution":{"observed_at":"2026-08-06T19:02:36.834991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.819324Z","title":null,"venue":null,"work_id":"c0a014ff-2849-4112-a780-71faf54d859f","year":2009},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.402281Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:fcde1d451653c39ead33d8f585546c1924bea50b0d56ebd13afcaa3d75104b79","observation_id":"f194af02-3901-4b4c-8115-ef9076837b3f","resolution":{"observed_at":"2026-08-06T19:02:36.823068Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.807471Z","title":"Mitarai and K","venue":null,"work_id":"64c44b72-3e04-4a0a-b028-b72e03038ea5","year":2021},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.406316Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:9a61f3bf68aca9599856e58d60a9a48b70a1f4dc1e558ff93538f0b8ee6abeb1","observation_id":"f54cc64d-7715-4c09-b0d8-c2a983ac1a66","resolution":{"observed_at":"2026-08-06T19:02:36.811302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.795142Z","title":"Ufrecht, M","venue":null,"work_id":"b5feb663-6cef-44df-9452-2286a4e4f9a2","year":2023},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.410735Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:11124c2a9e76fb1d791d6826a9e107f6898f2f5f9aef3b0c70fb292e0f1bfc81","observation_id":"eacffe0c-9b5a-4e8a-966e-e007eb9535c7","resolution":{"observed_at":"2026-08-06T19:02:36.799151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.782906Z","title":"Piveteau and D","venue":null,"work_id":"7ceab3b2-3f77-40ef-991f-6ae30ed52727","year":2024},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.415244Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:bf2088df5651660cec8c3d8660ca9953fc54359a36498c164b150a97afaff084","observation_id":"d634054f-c6e8-4249-8a2a-e4c9c168c75d","resolution":{"observed_at":"2026-08-06T19:02:36.786618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11638","last_updated":"2025-02-10T13:12:25Z","snapshot_observed_at":"2026-08-10T02:20:41.342416Z","submitted_at":"2023-12-18T19:00:07Z","title":"Cutting circuits with multiple two-qubit unitaries","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11638","snapshot_observed_at":"2026-08-06T19:02:36.419595Z","title":"Schmitt, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.419595Z"},"links":{"cited_paper":"/paper/2312.11638","citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:7b52952a94bc3c7409b0007898f0c89988a7b07414593aa664299875f68ed21c","observation_id":"1152cdf1-c150-48f3-ad6a-9100612540c5","resolution":{"observed_at":"2026-08-06T19:02:36.419595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01018","last_updated":"2024-12-17T20:58:10Z","snapshot_observed_at":"2026-07-06T17:38:26.164353Z","submitted_at":"2024-03-01T22:31:33Z","title":"Optimal quantum circuit cuts with application to clustered Hamiltonian simulation","version":2},"cited_work":{"arxiv_id":"2403.01018","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.01018","snapshot_observed_at":"2026-08-06T19:02:36.627603Z","title":"Optimal quantum circuit cuts with application to clustered Hamiltonian simulation","venue":"quant-ph","work_id":"e1027013-4b2d-4f04-b723-29ff1cb979c3","year":2024},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.423877Z"},"links":{"cited_paper":"/paper/2403.01018","citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:2da6611bbc7c6d204b906332eb427b664f7613404b79b385bb2d2ad7dfdba5b0","observation_id":"0724abbc-c97a-44e9-bf64-3bedf4ee5e5e","resolution":{"observed_at":"2026-08-06T19:02:36.632170Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.770738Z","title":null,"venue":null,"work_id":"e54b8791-de1b-41c2-8ece-1cd7cfc5e6df","year":2020},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.428528Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:cf257fb8efd2f6e3205a9c7900d33d68c4d80600827a1c05db0f8dbfdf3c4f26","observation_id":"7f3aeb0f-5d29-482a-b7d1-bd92b6e25d68","resolution":{"observed_at":"2026-08-06T19:02:36.774654Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.758170Z","title":null,"venue":null,"work_id":"37d01aff-f1ae-4855-aae9-3f042012b3e6","year":2023},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.434555Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:5fdd1a1deb4cef9ad1329acbfb789642273e936a9ac1f96a3d589bfe5d6a005a","observation_id":"d8429aa2-d777-4059-a0b4-4b3c8a774223","resolution":{"observed_at":"2026-08-06T19:02:36.762241Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.439178Z","title":"Brenner, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.439178Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:a045a7162d4bd63299e206013d3f7eb9d63da47a319265f862cdd60f32e3b96a","observation_id":"edb7b6fc-1466-41d4-89c2-1daf5e87b082","resolution":{"observed_at":"2026-08-06T19:02:36.439178Z","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-06T19:02:36.745386Z","title":"Harada, K","venue":null,"work_id":"ab6048f7-740e-4b21-933a-fc95dbd8ffc1","year":2024},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.444112Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:d6a74aff73a9c27b0fa7ae9403245bc112a1194733ed5e615595bcdffcdd232b","observation_id":"4eb585f1-1eaf-42ed-abda-6c75490c4f1f","resolution":{"observed_at":"2026-08-06T19:02:36.749862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.732700Z","title":null,"venue":null,"work_id":"9ff5befe-cc8f-4e3d-bff7-ea7cd955d4a1","year":1992},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.448697Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:30dd453368f2eb7d7af172762d9cb9a1cd9f977df417b8229b087690c85fc21a","observation_id":"782cd267-3c13-41f3-acfd-26ef78359729","resolution":{"observed_at":"2026-08-06T19:02:36.736669Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.718823Z","title":null,"venue":null,"work_id":"60c1a5d6-717a-4eb7-aa6b-6830fd2df09f","year":2020},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.453288Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:a985f7329309d0773b2d390108e042f07156f8e23a092824e7cdf547262678e9","observation_id":"a5891e70-4caa-4c0b-a3a4-b219a822fb4f","resolution":{"observed_at":"2026-08-06T19:02:36.722860Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.17242","last_updated":"2024-12-24T09:05:15Z","snapshot_observed_at":"2026-07-31T22:09:07.625596Z","submitted_at":"2024-04-26T08:29:04Z","title":"Quantum and classical correlations in shrinking algorithms for optimization","version":2},"cited_work":{"arxiv_id":"2404.17242","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.17242","snapshot_observed_at":"2026-08-06T19:02:36.522336Z","title":"Quantum and classical correlations in shrinking algorithms for optimization","venue":"quant-ph","work_id":"4f6eec64-47b1-4060-8d38-ad305e89b630","year":2024},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.457286Z"},"links":{"cited_paper":"/paper/2404.17242","citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:e3be66c4a3b121743fd4cadcf5430576f377cedd31a37225b57981b9372e6cb2","observation_id":"d417d9be-4e7c-4ee3-a692-16940408c6d6","resolution":{"observed_at":"2026-08-06T19:02:36.528520Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.706100Z","title":null,"venue":null,"work_id":"1669ada5-ceee-4154-8343-a4be048b807e","year":2025},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.461037Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:10290c795054cad387e4a2fc7de7ca1a9eafd3ec5d4ef3a603c94b20077c423e","observation_id":"3b99bd47-d1d1-42c8-b7c2-56b73668f732","resolution":{"observed_at":"2026-08-06T19:02:36.710121Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.693229Z","title":null,"venue":null,"work_id":"7f7c7b98-1162-4ad0-a0a6-f1db5b97ee58","year":2021},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.465036Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:63a2211ac9db2b454f852c24237ff5cf6d885629e58a7d80de8e2f6c2c5670c0","observation_id":"48ef92fc-19e4-4806-9ebc-b5f5642881c8","resolution":{"observed_at":"2026-08-06T19:02:36.697493Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:02:36.680422Z","title":"Bolusani, M","venue":null,"work_id":"47e19039-5074-447e-8f7e-2393d079a978","year":2024},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.468729Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:c76c30e169b4c8c57960cbce9065d9b57a1042206e35cd443e66952f0454023e","observation_id":"dccc3b1d-37f2-47d1-93f2-b2a004e0941e","resolution":{"observed_at":"2026-08-06T19:02:36.684389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08810","last_updated":"2024-06-19T01:39:44Z","snapshot_observed_at":"2026-07-06T18:14:20.889736Z","submitted_at":"2024-05-14T17:55:32Z","title":"Quantum computing with Qiskit","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08810","snapshot_observed_at":"2026-08-06T19:02:36.472232Z","title":"Javadi-Abhari, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.472232Z"},"links":{"cited_paper":"/paper/2405.08810","citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:8c55653203caa18970fa585c6c852fd09deaa3447e121626c52a296fd733071c","observation_id":"4709b6d9-32d8-4e13-87fb-fef3b971172c","resolution":{"observed_at":"2026-08-06T19:02:36.472232Z","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-06T19:02:36.667871Z","title":null,"venue":null,"work_id":"1b3abec9-995e-4e7d-a86f-493e1e946b50","year":null},"citing_paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:02:36.477483Z"},"links":{"citing_paper":"/paper/2507.06649"},"observation_digest":"sha256:ef095be9188a0e469b266a3cf5d7490264ef177471242060ba24112fbba68461","observation_id":"67073b24-6d80-466e-abb4-8a0792888794","resolution":{"observed_at":"2026-08-06T19:02:36.671890Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.06649","last_updated":"2025-07-09T08:27:38Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T22:55:48.291688Z","submitted_at":"2025-07-09T08:27:38Z","title":"Optimized Circuit Cutting for QAOA Sampling Tasks"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":2,"verified_fuzzy":6},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2507.06649."}