{"as_of":"2026-08-16T00:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e2dc78480857cc0ac8ada24a1f6f14f6b8471ce52d2d9bc76abdee3f5c4b88a9","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:11:39.276983Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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-01T05:02:01.210295Z","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-22T21:57:10.469827Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"cited_work":{"arxiv_id":"2411.17442","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.17442","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Applying the quantum approximate optimization algorithm to gen- eral constraint satisfaction problems","venue":null,"work_id":"a2ab6827-beda-453b-ba02-17f674a88369","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-15T14:00:56.378577Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2411.17442","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:5d91858f0c93ab79e85c5b685792be0327fc110a2bba4e7e32a8da998a4ff34c","observation_id":"29faec16-421a-418c-b39e-4e8a477df5d1","resolution":{"observed_at":"2026-05-22T21:57:10.473276Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.17442","snapshot_observed_at":"2026-08-01T05:02:01.210295Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.210295Z"},"links":{"cited_paper":"/paper/2411.17442","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:9784f7ff2977138765cf05a2a364c94253f0aff11e9de879deb73f6ee9edd580","observation_id":"b6f16748-68bc-4d9f-8d47-145822e4e301","resolution":{"observed_at":"2026-08-01T05:02:01.210295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.17442/citation-record","integrity":"/paper/2411.17442/integrity","json":"/paper/2411.17442/citation-record.json","paper":"/paper/2411.17442"},"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-12T12:11:39.455703Z","title":"This amounts to computing the single-clause polynomial, i.e","venue":null,"work_id":"3913707f-4658-41c0-a1e2-90c0b1a73bb4","year":null},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.222638Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:d8e007a280e276c3281fdea42113344347f4ca17d73784e0447c07a74c17e28b","observation_id":"b4b57da9-84a6-453c-a091-ac8f87dee708","resolution":{"observed_at":"2026-08-12T12:11:39.459947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.501921Z","title":"This results from pairing together original configuration basis numbers adding up to a reeduced configuration basis numbers, i.e","venue":null,"work_id":"968b2eea-d9f4-4f65-bc8b-2e7db2a2f6df","year":null},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.202731Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:3e214482f3294d610d7476960d0e9bc0594c648d2a131d0ee1d5d15938c4610f","observation_id":"588ad58f-d41d-4178-ae79-3f32779b2062","resolution":{"observed_at":"2026-08-12T12:11:39.505153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.493613Z","title":"Let q ≥ 1 an integer andq ∈ P(q) a weight-q configuration basis number","venue":null,"work_id":"f345f519-bf79-430f-883a-a3aa918129b0","year":null},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.206227Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:4d4475e954d940b0076eda084880f7d954c34d5917ae530149a586425050d0b3","observation_id":"21b34d39-32de-419e-8803-a1cb25d5f222","resolution":{"observed_at":"2026-08-12T12:11:39.496887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.485073Z","title":null,"venue":null,"work_id":"8a4523dd-526a-4a53-b5ab-b2164f5c2a30","year":null},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.210105Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:9dfb024d66931e2743de552c8c3e0e03d813f480d973c16a59069e6bd6fc232c","observation_id":"e058d44c-cbed-43b5-970b-ee42fd3fc20f","resolution":{"observed_at":"2026-08-12T12:11:39.488450Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.475792Z","title":"Hamming weight","venue":null,"work_id":"0e8b5968-3071-48f3-9436-7dc4c1d70b13","year":null},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.214496Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:494e18df420f2f110a4383d4ab2859e6e37cb03ca9baf5ae177754b6337d7572","observation_id":"03175645-e596-4f89-9924-4503de80ccd8","resolution":{"observed_at":"2026-08-12T12:11:39.478948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.465750Z","title":"Near-term quantum computing for solving hard industrial optimisation problems","venue":null,"work_id":"47db0466-9a1f-46c0-9748-604652c9e039","year":null},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.218829Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:a36e10d685059fdc6fc93cc15bce859b0107b020c7a0970e101cc7544a373325","observation_id":"650251af-359c-422c-957e-512632e84159","resolution":{"observed_at":"2026-08-12T12:11:39.470000Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.374141Z","title":"Boulebnane and A","venue":null,"work_id":"fa98948b-820f-4909-a20f-015ab98494c5","year":2024},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.254128Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:b574b55dbbd9079e128567fb88572e821d52d207aed529002df913b9abdc901b","observation_id":"92acf513-04e3-4fb5-b94f-bd09774c5d34","resolution":{"observed_at":"2026-08-12T12:11:39.377473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.446204Z","title":null,"venue":null,"work_id":"541133f3-c803-4d42-bccc-5569921f47fc","year":null},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.225734Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:2f94111fc39b9938763d34e6ffa072aa423932214574a82adfd59c2d0e6152b2","observation_id":"68ca7e37-d642-40a6-a580-eef881a25886","resolution":{"observed_at":"2026-08-12T12:11:39.449529Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.436385Z","title":"This problem corresponds to the functionT : {0, 1}k → {0, 1} where T (x) = 1 ⇔ 0 < |x| < k, and |x| denotes the Hamming weight","venue":null,"work_id":"f8898f9c-7b44-4be7-88af-be767c0c1050","year":null},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.229331Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:410cb35d705132d40cfc316635ba799461a070131daa79746f10e00f8b739b9c","observation_id":"1196c1f2-9dbb-49ed-a118-3d3adb78ac15","resolution":{"observed_at":"2026-08-12T12:11:39.440738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.427704Z","title":"Farhi, J","venue":null,"work_id":"4743f312-2704-4fdb-b6ef-abb016ee05d7","year":2014},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.232634Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:8705b52f4903e81d63b6e6561bf1c81f96ed3b61447d35601fbcaa18f9275958","observation_id":"34dd25c0-4a82-4569-af72-f52f4a47ca76","resolution":{"observed_at":"2026-08-12T12:11:39.430959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.511153Z","title":"(49) Similar to notationP(q) introduced in definition 5 for configuration basis numbers, we denote by P ′(q) (50) the set of reduced configuration basis numbers of weightq","venue":null,"work_id":"c8382283-9f29-4ba8-a954-1564a235b534","year":null},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.198422Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:9e7fcdd885c0ae976ec78b05adb67146672ec459d0ea0175892bb80025346117","observation_id":"855fb040-ed60-4f6d-9a83-ef7ca25cd39e","resolution":{"observed_at":"2026-08-12T12:11:39.514459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.418776Z","title":"Marwaha and S","venue":null,"work_id":"025af093-cd44-47aa-a9c4-1d6d5ea79a82","year":2022},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.236882Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:97ecf0e0741a555e1ec4adab908309f33917b6da2120799baeafc4f0cf03987a","observation_id":"aa2d1f6d-9d95-409f-be2e-3f7a7cd14cae","resolution":{"observed_at":"2026-08-12T12:11:39.421909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.409856Z","title":"Farhi, J","venue":null,"work_id":"cca55451-218e-4fd4-8be5-8b7d3d77ebc4","year":2022},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.240042Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:e2d65028dbc0b6608ad7b2e3731521f41616918949f9fbf9b92881975f351fc4","observation_id":"f0cb036c-4a97-4465-a69d-3d609af37410","resolution":{"observed_at":"2026-08-12T12:11:39.412952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.401178Z","title":"Basso, D","venue":null,"work_id":"eaa03d8c-f0e9-40a8-ac18-c6461ae94206","year":2022},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.243162Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:dafdba75c7bf071a91df23033e26da7dc2185318dc8cc4a69c615fbbc54bad5c","observation_id":"eba663a4-a7d8-4678-b44c-5a03db2db37e","resolution":{"observed_at":"2026-08-12T12:11:39.404177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.392241Z","title":"Basso, E","venue":null,"work_id":"9f40d297-aa08-4bbe-9a1a-cc08c4aada02","year":2022},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.247165Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:8f389b9c074c9c7f3d9ba1cab59bfe349dd7362ada8d0669c0657ca1cde6af57","observation_id":"0cd9b8fc-d8d2-49f1-8665-56b9df789e10","resolution":{"observed_at":"2026-08-12T12:11:39.395383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.383256Z","title":null,"venue":null,"work_id":"de386dd7-eaf4-497d-a5a8-77cb9803af1b","year":2024},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.250416Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:c4b278a1be5304eb3cfd620785b75e501557cba2a5025f99f1babafde2338361","observation_id":"bfe2f1e4-62aa-4b1a-b536-5cc9cf02920e","resolution":{"observed_at":"2026-08-12T12:11:39.386743Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.365132Z","title":null,"venue":null,"work_id":"162eb5ab-5f82-403a-afc9-c0483c2b7983","year":2000},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.257276Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:632a1d278d5e51826f3b80d4166ac695b0b97f986f8aa2556b8d2f8cb42dc823","observation_id":"70e44097-52f2-4ec2-8cd1-1f7dcf90d0c6","resolution":{"observed_at":"2026-08-12T12:11:39.368177Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.355871Z","title":null,"venue":null,"work_id":"0f006eb1-0082-4e70-83d0-fe399510d04e","year":2018},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.260399Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:d7d6f3c67d0f0d7423d64e45f83932f9c68229c2af1b3aaa27636d599b3844a0","observation_id":"dde2a3e9-7aca-41ee-ab6a-ff4de4015860","resolution":{"observed_at":"2026-08-12T12:11:39.359223Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.345443Z","title":"Boulebnane and A","venue":null,"work_id":"9107b333-553c-4efe-a276-1c2765d81f44","year":2021},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.264159Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:31600e5445372ad2a1720fcb14e7ffbbe7fd52db3650144c9b8d8e90b6ddbd34","observation_id":"218537bd-95c2-46c7-a6ad-c47bc22fe374","resolution":{"observed_at":"2026-08-12T12:11:39.349405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.335708Z","title":"Claes and W","venue":null,"work_id":"b629f472-7a38-422d-a778-3d985919d331","year":2021},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.267289Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:b361adab3d0cc6a9e8afc04149aeaede3185b722a05728a9a11ca8d5a2a0f12c","observation_id":"1d0375b8-4fdb-4aad-9e09-49d1dcba0755","resolution":{"observed_at":"2026-08-12T12:11:39.339196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.323931Z","title":null,"venue":null,"work_id":"2e528b2c-c44a-4f8a-8625-ad3eebfb73b4","year":2016},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.270409Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:c9f132b4995f76b777384c47505a0ec14b55a42fa1c891712998f2ced842df7a","observation_id":"699ccfd4-6db3-4856-ae36-a37182600478","resolution":{"observed_at":"2026-08-12T12:11:39.328270Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.313714Z","title":null,"venue":null,"work_id":"557c9101-0504-4626-8fcd-875a1eb2fda7","year":2002},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.273617Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:ea08b6476c76d454b0fce655a107c1ec0de8c437c57bc4998cc5d1378602b188","observation_id":"9d381746-db42-4bb8-bece-e6cfae8a50b4","resolution":{"observed_at":"2026-08-12T12:11:39.317119Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T12:11:39.302055Z","title":null,"venue":null,"work_id":"3a65924b-0029-415f-9cea-e6557970ff4f","year":2015},"citing_paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:11:39.276983Z"},"links":{"citing_paper":"/paper/2411.17442"},"observation_digest":"sha256:563f76e7ad0ecf0f20ab24e70002d16f341372fc26183b65b86bc6a7c35df64a","observation_id":"72259489-0659-42f0-a34d-956eefeae54a","resolution":{"observed_at":"2026-08-12T12:11:39.306331Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.17442","last_updated":"2024-11-26T14:00:34Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T12:04:22.141284Z","submitted_at":"2024-11-26T14:00:34Z","title":"Applying the quantum approximate optimization algorithm to general constraint satisfaction problems"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":23},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 2 inbound Pith citation observations for arXiv:2411.17442."}