{"as_of":"2026-08-10T00:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:28f3aa3c18d66f5631515277492529528fe920a40de7ab9603ee37a84bd69769","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T11:52:31.062953Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2508.00027/citation-record","integrity":"/paper/2508.00027/integrity","json":"/paper/2508.00027/citation-record.json","paper":"/paper/2508.00027"},"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-06T11:52:31.311229Z","title":"Carletti et al., ``Performance‐driven qubo for feature selection in recommender systems,'' Scientific Reports, 2023","venue":null,"work_id":"3598b2f3-610d-4b77-9daf-8674956a6608","year":2023},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.016397Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:69db86d45e6914c2a883c8d4e14fb974192321ed4607e124e50ed94247b4eacb","observation_id":"33e4c606-3434-4942-a75e-09979d4c7190","resolution":{"observed_at":"2026-08-06T11:52:31.314126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.303726Z","title":"ucke, R. Heese, S. M\\","venue":null,"work_id":"40d434db-2510-4820-b3c9-2b2d5eb8abed","year":2023},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.019386Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:590c8f2160d4855c5637e178147893e6383974300350116830a7a544228f5c9f","observation_id":"ea17f40c-a5ef-4d10-8a93-66a5287350ab","resolution":{"observed_at":"2026-08-06T11:52:31.306396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.296782Z","title":"Mensch, J","venue":null,"work_id":"96cb89e5-5256-46ed-a371-f10e826959bc","year":2016},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.022004Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:8276c58266fd315afd826296bb51d53dd1d32192bc239ef9dd793f31cd6b68a0","observation_id":"ff001896-3a07-4cb9-9bbb-8687dd3461db","resolution":{"observed_at":"2026-08-06T11:52:31.299387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.289328Z","title":null,"venue":null,"work_id":"86353231-4082-4d37-93d9-247559c12e3b","year":2018},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.025027Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:4e4291e1ad8b831d0dac2a9db6012936842d5c50c5ae099c61431b37156b4560","observation_id":"d0626cac-9dac-4c5f-940f-6ccac5901bc7","resolution":{"observed_at":"2026-08-06T11:52:31.291935Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.281918Z","title":"Turati, M","venue":null,"work_id":"619e019d-2103-47e0-b4fb-cf129bdbf0dc","year":2022},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.027800Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:29ce2d419cc4696f0d773167e57f0929ebc77dbf4fbe45d763c959068ed1ec4a","observation_id":"ddae41fa-daf8-4871-8bfa-41257aa7d4d4","resolution":{"observed_at":"2026-08-06T11:52:31.284939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.274999Z","title":"Nembrini, M","venue":null,"work_id":"0355a68f-1c22-492c-b83f-765ca36e5530","year":2021},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.030569Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:974e2daea69cbaa99141e97581b3d409961d9a5a3e03c1eaec6c98977b4efb25","observation_id":"07bddfa5-8287-48b6-816a-06b1829700eb","resolution":{"observed_at":"2026-08-06T11:52:31.277577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.267399Z","title":"Bravyi, A","venue":null,"work_id":"f890e8ce-013f-47dc-8b2a-424150055cd5","year":2020},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.033304Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:2523f1d8185132be63e20f5a4046816bbe1efbffbf8b0b4d498f0e4ed1225ac8","observation_id":"031b94e9-1c0c-4bc9-8632-ed51bcc1a7d8","resolution":{"observed_at":"2026-08-06T11:52:31.270006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.259426Z","title":"Harrigan et al., ``Quantum approximate optimization of non‐commuting hamiltonians,'' in Nature Physics, 2021","venue":null,"work_id":"0724fc3d-b761-4c36-88a5-0bc9ad59916e","year":2021},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.035887Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:8a7ac6b66058c1d2fe7a4d3b38933409e2ac47a09bdc10eb779a3744bdf8b7d8","observation_id":"304cbc39-0d3a-4597-b032-5905b3753c73","resolution":{"observed_at":"2026-08-06T11:52:31.262216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.251128Z","title":null,"venue":null,"work_id":"6505d017-7121-49c2-b56b-a3a567a5e064","year":2022},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.038339Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:625651e9ec7a9801d15238ebf3319ccae4bec57051605aad95169546f83c737e","observation_id":"0b95b93e-7e55-4925-a235-a0842906b746","resolution":{"observed_at":"2026-08-06T11:52:31.253933Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2301.00520","last_updated":"2023-03-18T07:23:41Z","snapshot_observed_at":"2026-08-09T15:22:42.550797Z","submitted_at":"2023-01-02T04:19:46Z","title":"Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00520","snapshot_observed_at":"2026-08-06T11:52:31.040915Z","title":"Pelofske, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.040915Z"},"links":{"cited_paper":"/paper/2301.00520","citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:93b1233e3f20c7aa6bde8463e45efa17f9927e59bedab12994314677cdd852b2","observation_id":"6923d5eb-72e2-4f84-a810-b2e76635a724","resolution":{"observed_at":"2026-08-06T11:52:31.040915Z","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-06T11:52:31.243862Z","title":"Sato and M","venue":null,"work_id":"12d49a65-868f-452c-9ca5-e245eeb5a7a4","year":2025},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.043843Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:71fdb8d56eecbf7c1ad82310ca7efc699aceac4ed45b44ed67525633301be332","observation_id":"dbd64f05-7906-42ff-9b60-cedb9469fca5","resolution":{"observed_at":"2026-08-06T11:52:31.246708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.235363Z","title":"Halko, P.-G","venue":null,"work_id":"01e54a9f-34b6-42ec-abf6-8d61f603ad0f","year":2011},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.046319Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:e0c471f6307757abf00a287c26b6572caa416334fc273fddc03d65d9ae91f51a","observation_id":"e2d4716d-25de-419d-85d7-bf57d0e41333","resolution":{"observed_at":"2026-08-06T11:52:31.238092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-06T11:52:31.048917Z","title":"Farhi, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.048917Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:89c7f372195224a5b5ed2138fd29d362975d1b0a1277130b825ca6d3f622dae8","observation_id":"bd4c49f6-585b-409a-bec2-ce116798f2c7","resolution":{"observed_at":"2026-08-06T11:52:31.048917Z","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-06T11:52:31.227436Z","title":null,"venue":null,"work_id":"93c20ac4-1422-4f8f-b6bb-e327f9e9d77a","year":1992},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.051682Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:144a2139dc9e977bac2cd4c7501b182aecfa40e9b09045724d420b74cab178b1","observation_id":"7cfa58bf-1381-49b4-b377-ddec52cf2348","resolution":{"observed_at":"2026-08-06T11:52:31.230065Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:52:31.218750Z","title":"Breiman, ``Bagging predictors,'' Machine Learning, vol","venue":null,"work_id":"8c710499-d9aa-4ff0-b0e3-fcbb366f91b5","year":1996},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.054068Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:17bf841786811fc1f046c212b22412b38bb7766119162dec2554c86ff01e0d69","observation_id":"ea231500-fcfe-4ba4-9288-990fe34ae477","resolution":{"observed_at":"2026-08-06T11:52:31.222183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1811.04968","last_updated":"2022-07-29T22:39:54Z","snapshot_observed_at":"2026-07-06T07:14:13.912107Z","submitted_at":"2018-11-12T19:18:57Z","title":"PennyLane: Automatic differentiation of hybrid quantum-classical computations","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.04968","snapshot_observed_at":"2026-08-06T11:52:31.057532Z","title":"Bergholm, J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.057532Z"},"links":{"cited_paper":"/paper/1811.04968","citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:bedd0c8d81fe95c74d9ffcc9aa780a2dc04c89ab63cb5e67cc8ebda4515db17f","observation_id":"64feab26-3737-484c-b1f9-3b0ffc046d6e","resolution":{"observed_at":"2026-08-06T11:52:31.057532Z","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-06T11:52:31.060393Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.060393Z"},"links":{"citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:5065c2b330e4a47d9017248ac3fcdcbcd86189dacbc8a2a1f02d08e4c90ce8fe","observation_id":"44fa2594-3f11-4af7-b6c8-bbd8162aacbe","resolution":{"observed_at":"2026-08-06T11:52:31.060393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.15272","last_updated":"2026-04-30T05:18:02Z","snapshot_observed_at":"2026-07-06T19:36:32.581033Z","submitted_at":"2024-10-20T04:05:18Z","title":"Performance-Driven QUBO for Recommender Systems on Quantum Annealers","version":3},"cited_work":{"arxiv_id":"2410.15272","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.15272","snapshot_observed_at":"2026-08-06T11:52:31.207725Z","title":"Performance-Driven QUBO for Recommender Systems on Quantum Annealers","venue":"cs.IR","work_id":"bf12f608-6415-431c-bfb6-7e2dff271e8e","year":2024},"citing_paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T11:52:31.062953Z"},"links":{"cited_paper":"/paper/2410.15272","citing_paper":"/paper/2508.00027"},"observation_digest":"sha256:f5d252781c3f1ca11c3e777547c97094ee6839308eee9e76e44fbd0901052182","observation_id":"7f31c352-c23c-4a54-89bd-704aaf8efd1d","resolution":{"observed_at":"2026-08-06T11:52:31.212799Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}}],"paper":{"arxiv_id":"2508.00027","last_updated":"2025-07-30T03:20:44Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T11:52:29.781725Z","submitted_at":"2025-07-30T03:20:44Z","title":"Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":18},"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 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2508.00027."}