{"as_of":"2026-08-10T10:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a69802e236b0341393ce7b7c7b7b50ee805ba6bfde72660e3146ab21150ea168","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:26:13.137422Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"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/2506.14129/citation-record","integrity":"/paper/2506.14129/integrity","json":"/paper/2506.14129/citation-record.json","paper":"/paper/2506.14129"},"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-07T00:26:13.911877Z","title":"ACM Computing Surveys (CSUR)45(1), 1–61 (2012)","venue":null,"work_id":"4258b1fc-2fc6-4217-9e0b-50cdedd3fc4a","year":2012},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.942028Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:14c4e0e68057c6fa2bc586889b27e98e8fb30088900fa6d3938da348c2efab58","observation_id":"aa5eaa2b-5815-4eed-951b-92e823fa381d","resolution":{"observed_at":"2026-08-07T00:26:13.917224Z","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-07T00:26:13.895858Z","title":"Optimization and Engineering 1, 171–188 (2000)","venue":null,"work_id":"88a783c2-0cbf-4912-9854-e54b81f81caa","year":2000},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.948250Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:cf27993d929243ffb707ec7b2048e6ab4b9965b8bc1fcfc5f6af85b77893a784","observation_id":"845380f7-2222-4888-8bfd-8926cd93d349","resolution":{"observed_at":"2026-08-07T00:26:13.900625Z","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-07T00:26:13.879158Z","title":"In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp","venue":null,"work_id":"b7fde302-22e0-46ad-ace9-53425d3836ad","year":2007},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.953316Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:c739d93b35febf1ddd68c693c03ff2ea9f5a6255657a2d30af8939a10c3eeed0","observation_id":"8198926b-4f46-4fe8-ae76-7a4bb9220fdc","resolution":{"observed_at":"2026-08-07T00:26:13.885253Z","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-07T00:26:13.863088Z","title":"In: The 2nd International Conference on Software Engineering and Data Mining, pp","venue":null,"work_id":"40b3fa31-006d-47c1-b978-2363e52cb8cd","year":2010},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.958227Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:364798711ed3ff1f3744204bfa9bb7cb9b9840c086022873fddf8d8cef5477c0","observation_id":"aa18a51f-fe48-469d-9bc6-c7f86da0b4b6","resolution":{"observed_at":"2026-08-07T00:26:13.868414Z","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-07T00:26:13.846151Z","title":null,"venue":null,"work_id":"62fc8e08-40a2-47ae-b567-5f5ddb7849a6","year":2019},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.964603Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:2261ec5a6b487ff1427671b056122504977ac42359a01d821dfb22bcffe383f8","observation_id":"07caa8b6-cd59-464e-aa5b-b834025d831a","resolution":{"observed_at":"2026-08-07T00:26:13.851621Z","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-07T00:26:13.827994Z","title":"Alexandria Engineering Journal 61(9), 6991–7005 (2022)","venue":null,"work_id":"e6dbc85d-dce5-4e37-ba26-c248969ea918","year":2022},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.969722Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:7d25aeed39ef033b5634c8606e5e26f328064f234f0e82063ab6923d69c27756","observation_id":"fdc843cc-9913-43bd-97ae-30345f8a9ba6","resolution":{"observed_at":"2026-08-07T00:26:13.834106Z","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-07T00:26:13.807565Z","title":"Information and Software Technology 65, 1–13 (2015)","venue":null,"work_id":"b0d51382-b69c-4521-bf6a-2fb83c6a439b","year":2015},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.975450Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:fd015a50994c3f0113bd719bb2d9e267faaf37de75f1448f2a6707e2fe190b56","observation_id":"24ea6aa9-f249-4c61-9481-bd8ab0160e40","resolution":{"observed_at":"2026-08-07T00:26:13.815822Z","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-07T00:26:13.791456Z","title":"Information and Software Technology 147, 106825 (2022)","venue":null,"work_id":"3d4947b9-055d-4f48-91ac-27f43c5fcc07","year":2022},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.980299Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:eefad61e6d6a51ac75603c56e80c9693720849924665b3e74b231b9bff8ad3e5","observation_id":"6ec04e49-98ad-40e6-ab29-2f62e014ee3a","resolution":{"observed_at":"2026-08-07T00:26:13.796639Z","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-07T00:26:13.776563Z","title":"Journal of Systems and Software 84(12), 2208–2221 (2011)","venue":null,"work_id":"aef6d2ef-a942-4857-be1a-ec9a6a8c2ece","year":2011},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.985150Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:5f461928b94f96b58a714ad34e532f489089197bbb1eec2e5cb1b72166063623","observation_id":"9641f7d0-e9ac-4eb2-b3ab-bc3958bac6d9","resolution":{"observed_at":"2026-08-07T00:26:13.781759Z","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-07T00:26:13.759197Z","title":"In: 2013 1st International Workshop on Combining Modelling and Search-Based Software Engineering (CMSBSE), pp","venue":null,"work_id":"cfa2da19-b33e-43df-b5a3-6ab584338745","year":2013},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.990532Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:bc66f23cacf8b28ef63a67af0413202182bff7e52d57a6194780d232241bdf49","observation_id":"88a92f4d-b068-44ca-b6b8-11006d2911c5","resolution":{"observed_at":"2026-08-07T00:26:13.765199Z","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-07T00:26:13.743272Z","title":"Applied Soft Computing 49, 1215–1231 (2016)","venue":null,"work_id":"0b33ca80-5fe5-4a87-ae13-11097f953bd9","year":2016},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:12.996388Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:ceb17533089f922411f3be821be64444532769eee38a031786cfa9e15565c3f1","observation_id":"4e13f93b-2c95-4adb-a122-00583eb194d8","resolution":{"observed_at":"2026-08-07T00:26:13.748144Z","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-07T00:26:13.726761Z","title":"In: 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering, vol","venue":null,"work_id":"7768e9c6-c49d-441f-8359-991662287f16","year":2015},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.001641Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:019e5c4b6767621fd4db30e92cf70d4b60db706e9af1ca4f158c8b548daadda8","observation_id":"28a997fe-06e3-4c68-8d9f-777d6fc14d72","resolution":{"observed_at":"2026-08-07T00:26:13.732164Z","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-07T00:26:13.708980Z","title":"Software & Systems Modeling 18, 1447–1466 (2019)","venue":null,"work_id":"481f2712-38bf-4a16-9795-ec81a2014ce1","year":2019},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.006445Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:0c45d1e02efed966e8e4d2b7f41abebee0a9182780ef041826c43ab1efbca283","observation_id":"62a8d3fd-992a-40f7-ac09-8d5486fb297a","resolution":{"observed_at":"2026-08-07T00:26:13.715507Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:26:13.011649Z","title":"In: Proceedings of the 40th International Conference on Software Engineering","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.011649Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:71640ff014b568b413deddee48019fc239ae71766270e1ddd27c2ed02b987a29","observation_id":"560171f4-8ae1-4120-a5b7-1b630e864daa","resolution":{"observed_at":"2026-08-07T00:26:13.011649Z","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-07T00:26:13.692708Z","title":"Engineering with Computers38(Suppl 3), 1845–1863 (2022)","venue":null,"work_id":"cde7fb3b-a6d5-4c3d-9c0b-611bcf3e9dec","year":2022},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.016750Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:c74addb1b7ea9eabd21ac611b0a24205fcb4972d0f1600e3e07c59af656cef54","observation_id":"d3b6195b-c205-440c-af81-c0bed0d3cae0","resolution":{"observed_at":"2026-08-07T00:26:13.697669Z","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-07T00:26:13.676153Z","title":"Industrial & Engineering Chemistry Research 56(2), 560–574 (2017)","venue":null,"work_id":"710b12a6-42b7-4766-927f-e7cf056f0871","year":2017},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.021396Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:1fa3fd4c9e67e9e3f94076f8135c36505bedd09ab90d9d221cb7815cf958b61b","observation_id":"9a1a6e38-1e4f-4a5c-9c86-714e2a7908ec","resolution":{"observed_at":"2026-08-07T00:26:13.681417Z","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-07T00:26:13.660052Z","title":"Journal of statistical physics 22, 563–591 (1980)","venue":null,"work_id":"c55e6bad-64be-4030-aa41-85de16e6ed29","year":1980},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.026973Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:c6a7f439850e9ae96ea723dc101668c9b6b1c723db5ea77fda61ff17c0e78821","observation_id":"a87894d1-ee7d-422e-b396-f3c96de29a69","resolution":{"observed_at":"2026-08-07T00:26:13.665403Z","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-07T00:26:13.644399Z","title":"In: Pro- ceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp","venue":null,"work_id":"dfd3d865-1794-42a0-bd30-6db8b699b3c9","year":1996},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.032127Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:889fa11543a565f01324f07cbfc290529a2e4964fcef1009b9bda2e5d93f773f","observation_id":"1957eb97-2f0a-4575-98ae-8e4477b3e4c1","resolution":{"observed_at":"2026-08-07T00:26:13.649843Z","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-07T00:26:13.628377Z","title":"Nature Physics, 1–7 (2025)","venue":null,"work_id":"d78fccfd-ddef-452f-849d-7dffcd0120a6","year":2025},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.037318Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:5c602387e3dcd3c6af95a6c3f01e770150a843bcb04897669c725bac3e61c908","observation_id":"5d0476fe-25d2-49ee-b110-4b6f46890fc2","resolution":{"observed_at":"2026-08-07T00:26:13.633538Z","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-07T00:26:13.611202Z","title":"Reviews of Modern Physics 80(3), 1061 (2008)","venue":null,"work_id":"a88eb669-42b8-4db1-a044-69e4ddc30a17","year":2008},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.042666Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:2ca3419a90b45e72c1b68411d02ed228f1785d57507da4636bf71c998951f7ef","observation_id":"4d3b762b-728c-498c-bc5b-f6746eb9be1e","resolution":{"observed_at":"2026-08-07T00:26:13.616631Z","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-07T00:26:13.592932Z","title":"https://docs.dwavesys.com/docs/ latest/handbook decomposing.html","venue":null,"work_id":"2dddb079-0d08-4275-b0d7-9adf92e77084","year":null},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.047224Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:1b51e898332f57d600add7018df25716c7bb5ce690861b1d2e017bb0f730bddd","observation_id":"4fb478e7-98d2-4bbc-a492-33756ba3d4a9","resolution":{"observed_at":"2026-08-07T00:26:13.598399Z","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-07T00:26:13.576070Z","title":"European Journal of Operational Research 199(1), 25–35 (2009)","venue":null,"work_id":"04c40f0f-e297-476d-b176-5c38c7159180","year":2009},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.052338Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:364bd75078fece16fbc6a871dc8b7e8eb485a4f0ab576bee395ab616d3d6847a","observation_id":"6ac7b4f3-e92b-4a73-872e-cbc956ab2b94","resolution":{"observed_at":"2026-08-07T00:26:13.581192Z","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-07T00:26:13.559267Z","title":"Information Sciences 585, 441–453 (2022)","venue":null,"work_id":"d28c4014-9f03-4415-bd09-a5396c814d8a","year":2022},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.057236Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:c456bcb2c86e6c6cb2cd82b10d65c9392ea73c4f84da39ca486e0d673087d1ff","observation_id":"3561948e-9487-4335-b1f4-b8c369958c79","resolution":{"observed_at":"2026-08-07T00:26:13.565302Z","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-07T00:26:13.542899Z","title":"Applied Soft Computing, 110472 (2023)","venue":null,"work_id":"3c160705-150f-4aeb-8657-b4872c8b7c0c","year":2023},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.062944Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:405cd8a487e82a4d77ecffd7840ea0925a2aa99927ac8db33099d9bf8c6b1a44","observation_id":"292b3a76-2555-44e2-a302-898c2e430208","resolution":{"observed_at":"2026-08-07T00:26:13.548454Z","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":"2406.17248","last_updated":"2024-07-10T12:53:46Z","snapshot_observed_at":"2026-08-05T12:35:13.533142Z","submitted_at":"2024-06-25T03:28:40Z","title":"MindSpore Quantum: A User-Friendly, High-Performance, and AI-Compatible Quantum Computing Framework","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.17248","snapshot_observed_at":"2026-08-07T00:26:13.067843Z","title":"https://arxiv.org/abs/2406.17248","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.067843Z"},"links":{"cited_paper":"/paper/2406.17248","citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:cc14472801d34d4340a26207603c5d5dd53d6515d041b46e05d17b70be873c3c","observation_id":"c726635b-7ef5-44ef-9b45-89abf3389aab","resolution":{"observed_at":"2026-08-07T00:26:13.067843Z","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-07T00:26:13.527093Z","title":"In: Search-Based Software Engineering: 6th International Symposium, SSBSE 2014, Fortaleza, Brazil, August 26-29, 2014","venue":null,"work_id":"a002e453-b625-4431-a98d-f5f0b5610274","year":2014},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.072854Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:88dee5e3112d4cdfb26549ac65d174c03bb2f1acac2b1b89faa481b50d92bae5","observation_id":"ab909522-9c70-4b57-8805-5e5168b3912d","resolution":{"observed_at":"2026-08-07T00:26:13.532451Z","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-07T00:26:13.512150Z","title":"Information and Software Technology 87, 104–118 (2017)","venue":null,"work_id":"4489aadb-4792-4343-b1f5-70334b4d9817","year":2017},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.077524Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:071384823cc7c036771d19e676863dce79131fa29b65bc97152d3392b8ab4905","observation_id":"1d18b65e-1f1f-47f3-b58f-f1a28abfd1b4","resolution":{"observed_at":"2026-08-07T00:26:13.516928Z","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-07T00:26:13.496163Z","title":"ACM Transactions on Software Engineering and Methodology (TOSEM) 27(1), 1–32 (2018)","venue":null,"work_id":"4b5bb301-9754-414f-aefe-def6a0804576","year":2018},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.083242Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:77dea04565263a7681472187adb3149a356c2e2f2043ee1f2d7f8cd0f86abeea","observation_id":"7ef15767-4b9d-4c56-8be8-8b938b4e7549","resolution":{"observed_at":"2026-08-07T00:26:13.501356Z","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-07T00:26:13.479559Z","title":"IEEE Transactions on Software Engineering 38(5), 1195–1212 (2012)","venue":null,"work_id":"45f98ef9-cbdf-4728-ba68-a1858d5540cb","year":2012},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.087852Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:c8ff8331312aeb3fe50e05c8b2d04a171b8732310b0e7e4df800188affd3ce53","observation_id":"3070bc7c-6822-431f-97ec-6a69f87f5002","resolution":{"observed_at":"2026-08-07T00:26:13.484716Z","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-07T00:26:13.461890Z","title":"In: Proceedings of the 24th ACM SIGPLAN Conference Companion on Object Oriented Programming Systems Languages and Applications, pp","venue":null,"work_id":"71bf59a6-e226-4bbd-bfe4-9e3642c373cc","year":2009},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.092390Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:adb09f3e2841fb2d4a689cd57edf0aee45025c2aeafe36bf6206dac041a9d11a","observation_id":"ccc85d81-c0fe-4da2-981b-2485ea3dbf5d","resolution":{"observed_at":"2026-08-07T00:26:13.467811Z","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-07T00:26:13.442079Z","title":"Generative Software Development Laboratory, University of Waterloo, Technical Report (2012)","venue":null,"work_id":"612a2e9d-156a-4687-93de-14facea0c908","year":2012},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.097550Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:5fe3170bcf45a513ae6901799b85a14fb71ac5e63d11426c0ec10a7b12cc328f","observation_id":"375b7a16-c8a7-486a-af8b-119feb62da0a","resolution":{"observed_at":"2026-08-07T00:26:13.447398Z","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-07T00:26:13.421440Z","title":"In: 2013 35Th International Conference on Software Engineering (ICSE), pp","venue":null,"work_id":"9fd8a1cc-eaac-4e5d-96a8-6f97da080829","year":2013},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.102197Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:0a48f87839cdc8416fdbbf019eda5927aab3c04980afdbff0b013ab4c456ef97","observation_id":"b2a0d3a5-e378-4ab5-bc49-58d359c84553","resolution":{"observed_at":"2026-08-07T00:26:13.426597Z","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-07T00:26:13.403535Z","title":"In: Proceedings of the 2015 International Symposium on Software Testing and Analysis, pp","venue":null,"work_id":"53a6ae7d-6d4b-4a94-ba67-c73b05156cb4","year":2015},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.107212Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:aaef2e0701a0ee5800417470421bdff0801b24f30dc7670d5c31c02f775f8f72","observation_id":"8c738ee1-c2e6-49ac-a012-ee958b1bae31","resolution":{"observed_at":"2026-08-07T00:26:13.409501Z","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-07T00:26:13.385687Z","title":"1: User’s manual for cplex","venue":null,"work_id":"50bbb59d-e3f9-434d-b6c8-eda745b949e6","year":2009},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.112192Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:36558e756ba21d0e7155682d0989f685431ec243f50ff59de35efeb622bab32a","observation_id":"0de6d834-afef-4d4f-a137-ccff4c89ed65","resolution":{"observed_at":"2026-08-07T00:26:13.390650Z","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-07T00:26:13.368786Z","title":"European journal of operational research 292(2), 397–422 (2021)","venue":null,"work_id":"21a16767-bda1-45e1-9841-540ed894f8dc","year":2021},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.117297Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:ef6fa3f447121578d617c7508faa2155deb7e40706319f9bd1ddb0efb8053760","observation_id":"7774a56d-5e6f-492d-b749-453795af83e1","resolution":{"observed_at":"2026-08-07T00:26:13.374322Z","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-07T00:26:13.352756Z","title":"In: Proceedings of the International Symposium on Combinatorial Search, vol","venue":null,"work_id":"a272fb05-5e92-4df1-84e3-a2aaebfdcb46","year":2016},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.122308Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:f534315987e26333f58e87362540b71414e5a5f2462e54677160b023010fa22e","observation_id":"19ee0e38-ee51-4c7c-b6b9-bb1838becbb3","resolution":{"observed_at":"2026-08-07T00:26:13.358131Z","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-07T00:26:13.335983Z","title":"Nature Reviews Physics, 1–18 (2024)","venue":null,"work_id":"2ea012d5-34f1-4d3b-8141-9957172618b1","year":2024},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.129397Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:bd80ebbe6d4684431769050791eca3667a55264cbf9a941be77b510cf9667524","observation_id":"b37507e4-f943-488b-8ce4-647d8e2eabe2","resolution":{"observed_at":"2026-08-07T00:26:13.341507Z","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-07T00:26:13.313495Z","title":null,"venue":null,"work_id":"a2684207-e7e0-47fe-8787-cfa4dfc2e312","year":2020},"citing_paper":{"arxiv_id":"2506.14129","last_updated":"2025-06-28T09:28:37Z","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T00:26:13.137422Z"},"links":{"citing_paper":"/paper/2506.14129"},"observation_digest":"sha256:626234a1eaf5cebad375b61e2497d12c592bfafa891ace33893fdc800ddbd8dc","observation_id":"34bed544-46db-42e2-97af-1432ec92108c","resolution":{"observed_at":"2026-08-07T00:26:13.322625Z","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":"2506.14129","last_updated":"2025-06-28T09:28:37Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-09T10:39:11.809808Z","submitted_at":"2025-06-17T02:46:53Z","title":"A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":38},"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 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2506.14129."}