{"as_of":"2026-08-20T16:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15753b2e19df26738176e6880c9155167b6f9af1afeef781c627877d22fbd9e2","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:31:59.044960Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2501.12261/citation-record","integrity":"/paper/2501.12261/integrity","json":"/paper/2501.12261/citation-record.json","paper":"/paper/2501.12261"},"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-10T17:31:59.778776Z","title":"Improved approximation algorithms and lower bounds for search-diversification problems","venue":null,"work_id":"2211a7aa-bf63-48dc-8735-7ed470993c65","year":2022},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.816422Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:ced33f410162f54edc5e26dc67e6e88aff19c2de088786b7684eee2282b3aef5","observation_id":"dc6e63ed-4d64-48fc-98ad-ef038422f4c8","resolution":{"observed_at":"2026-08-10T17:31:59.782969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.767541Z","title":"Geometric knapsack problems.Algorithmica, 10(5):399–427, 1993","venue":null,"work_id":"03a52ce0-8c4f-44e5-a2e9-124c0188d59e","year":1993},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.821376Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:11dd219e69abeb27a013f953aecc0ca84cef79f018804425a89b6b9268774da1","observation_id":"90387761-80dc-4482-bcab-5616ef59de44","resolution":{"observed_at":"2026-08-10T17:31:59.771571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.756127Z","title":"Fair near neighbor search: Independent range sampling in high dimensions","venue":null,"work_id":"081dce95-1f96-490d-8de7-f6ae0b4c957a","year":2020},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.825459Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:561e7c67d58e41220beb1497d699e9623f79f2031118daf3c982ca26033eba20","observation_id":"4801d8d7-6d02-4e1d-8176-cbb954b31841","resolution":{"observed_at":"2026-08-10T17:31:59.760315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.744320Z","title":"Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments","venue":null,"work_id":"28f32175-3a7c-44e8-b1e8-75e6944d9cf8","year":2025},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.830048Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:6c210c1dadcf8dce22eb09227f3348bcf9c88802e853b640c6bec0109cae7907","observation_id":"97a9cac9-a242-4d0d-9b66-0a367ce52458","resolution":{"observed_at":"2026-08-10T17:31:59.748151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.733506Z","title":"Approximation algorithms for NP-complete problems on planar graphs.Journal of the ACM (JACM), 41(1):153–180, 1994","venue":null,"work_id":"91683499-5de5-49e6-9268-4845aab254dc","year":1994},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.833975Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:040874196ffd51c843858287027e2e558b5df027e5ffaa45d85709f61cf4c1bd","observation_id":"2e488209-51df-4601-a449-76ef0dc0bb4a","resolution":{"observed_at":"2026-08-10T17:31:59.737371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.722422Z","title":"Diversity of solutions: An exploration through the lens of fixed- parameter tractability theory.Artificial Intelligence, 303:103644, 2022","venue":null,"work_id":"d4e7e664-798c-417a-8231-77f8b65c8db2","year":2022},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.838166Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:c66473fc7b6d15ea8ebdf772333256f722322a9f58014ebd8251efc132f6454a","observation_id":"6c22df8e-4ddc-40ad-bbd0-ee00f8e5340a","resolution":{"observed_at":"2026-08-10T17:31:59.726680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.711160Z","title":"FPT algorithms for diverse collections of hitting sets.Algorithms, 12(12):254, 2019","venue":null,"work_id":"7a4e6e3f-9c82-482e-a105-c9dbd9b716b9","year":2019},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.842266Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:c8bae34fd0dd64e9701f204e8494591bf29e4d579678a1bcdbf2e5ce6f686584","observation_id":"7289ac0b-9c1f-4063-b802-f469abf8a238","resolution":{"observed_at":"2026-08-10T17:31:59.715279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.701149Z","title":"Dynamic programming treatment of the travelling salesman problem.Journal of the ACM (JACM), 9(1):61–63, 1962","venue":null,"work_id":"d956295d-21b8-4d7c-a3fc-87f1d1733ec3","year":1962},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.846063Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:3111ea1453429789495d61f0d2e190cc8e773244010914fe36e181eba73358c1","observation_id":"8c58ffe5-2a8c-46a0-9ad4-8e16bcb7030e","resolution":{"observed_at":"2026-08-10T17:31:59.704749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.690679Z","title":"Bodlaender","venue":null,"work_id":"0e567a23-dbb2-4ef5-9bb2-b80b0c0a8d0b","year":1988},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.850038Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:604cf114a9a25abb3f21725e8fe5626c142273aa40d78b81bb427c0b08379a4f","observation_id":"c941feda-95a0-4fbd-ba27-47db29509e68","resolution":{"observed_at":"2026-08-10T17:31:59.694109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.681067Z","title":null,"venue":null,"work_id":"ca19aec8-d9cd-4840-84de-a83da5ec5dd6","year":2023},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.853835Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:6c9bda1564e2bef8948104ab7624980b5bddf5dc744ca2169c3a994f287fc5e4","observation_id":"52e4c7ac-486a-44b0-b08e-17ee3a079c92","resolution":{"observed_at":"2026-08-10T17:31:59.684092Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.670340Z","title":"Brouwer, J.B","venue":null,"work_id":"4fb8cc59-5ba1-4a54-a8b2-5596b05582ff","year":1990},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.857640Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:3605021092913379459a211dc2cea8a884f74f940330f6689eedc126ec2f2db2","observation_id":"2c9276c9-7979-48bb-830c-60cee7f5af7f","resolution":{"observed_at":"2026-08-10T17:31:59.673925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.658793Z","title":"An improved analysis of local search for MAX-SUM diversification","venue":null,"work_id":"2623e050-4863-4c9e-8b7c-41c9f909c0d7","year":2019},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.861879Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:6cf6cb7cb1e4e4c6ec8120ca582f4ee6f8cb9a2633dd229de9ff47bbaad01381","observation_id":"a3d0bd66-6861-433e-9f1c-ace3e1db56b5","resolution":{"observed_at":"2026-08-10T17:31:59.662895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.647112Z","title":"Springer, 2015","venue":null,"work_id":"22f7f56a-5126-4d13-a5cb-0ace0e5d89a3","year":2015},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.865491Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:c0adbe9d4c75157d4ba6b7b1e8d276d340edda6afd96f7e2d9e34c1baa0c2aa8","observation_id":"602c7057-4b3d-48e1-b7bf-e2849b310e51","resolution":{"observed_at":"2026-08-10T17:31:59.651234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.633337Z","title":"Finding diverse minimum s-t cuts","venue":null,"work_id":"cf01156f-cfb0-40f4-b897-507a63907a78","year":2023},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.869140Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:11a9d4d5f847f5d4a8da8e0580e390d34867121fef789024c19f9bdb37022b1b","observation_id":"852a27ef-05ad-4d52-8acb-744fefa2507e","resolution":{"observed_at":"2026-08-10T17:31:59.638556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.621419Z","title":"The bidimensionality theory and its algorithmic applications","venue":null,"work_id":"ab7734f0-1ce1-4a1f-a0a4-7ba04a2b690c","year":2008},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.872948Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:237e58b394551923853777faa773dae1643933d7075965f90189aec79724db8a","observation_id":"ffb6da01-9e91-4ad7-98e5-fda78b33de12","resolution":{"observed_at":"2026-08-10T17:31:59.625653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.609952Z","title":"Analysis of evolutionary diversity optimization for permutation problems.ACM Transactions on Evolutionary Learning, 2(3):1–27, 2022","venue":null,"work_id":"56bc311a-1488-4000-a879-11ee72a15a14","year":2022},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.876596Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:3edf621f26070c38ffdf7fd4e3fd512430ce13ea4cc828165eccae3664e7bf37","observation_id":"f6aed6a2-035e-403b-ad61-8ebe0bfc9ccc","resolution":{"observed_at":"2026-08-10T17:31:59.614010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.598245Z","title":"Evolving diverse sets of tours for the travelling salesperson problem","venue":null,"work_id":"253b507b-20a2-4e06-a7a1-6a0a4dd2fa88","year":2020},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.880147Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:79fa286e1d9e12c7076826dd6e6f29044d5e7fac2feb7e1bbb7826d07623bb3a","observation_id":"e9c9cebd-6683-416f-9896-c03d66565ed9","resolution":{"observed_at":"2026-08-10T17:31:59.602254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.584977Z","title":"Data-driven solution portfolios","venue":null,"work_id":"7d04e029-3c36-4f2f-bb28-923b34ab3df4","year":2025},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.883717Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:469eb2ad3625610697624cd74f6b6d6f93925b8d383f67c5553dbb1b3081ad4b","observation_id":"ca839684-f733-4bd5-96b9-2ac98958eb1c","resolution":{"observed_at":"2026-08-10T17:31:59.589660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.571503Z","title":"Determinantal sieving","venue":null,"work_id":"4f5e4304-3769-4ece-b60e-3f61b55c40a1","year":2024},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.887163Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:76dc78e04027036aedcbbe31d224e4fe92a495f8d7b9cabf18418ff07458e72a","observation_id":"c868fca7-cefe-40e6-84c5-0b775b7b103f","resolution":{"observed_at":"2026-08-10T17:31:59.575835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.560766Z","title":"Diverse pairs of matchings","venue":null,"work_id":"76f99303-42b2-4db0-baf7-9f9679516cfb","year":2020},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.890732Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:bbdb7f2c6ff370598f59de21855aceb30d32107ee4364fe7fdb8d81bb82ca249","observation_id":"2eee75e1-04a2-4abf-a4a8-92e267c441a4","resolution":{"observed_at":"2026-08-10T17:31:59.564152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.549520Z","title":"Diverse collections in matroids and graphs.Mathematical Programming, pages 1–33, 2023","venue":null,"work_id":"cdbc2ad1-2ff6-4396-9a1d-c0fefd68a9c9","year":2023},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.894206Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:c2177b82baafdbf243a6585ef8bccd165c5ae3b7e61767d2a3ba4c05ece184aa","observation_id":"341c39ae-ba8a-4dde-9494-10a847a78fe0","resolution":{"observed_at":"2026-08-10T17:31:59.553547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14376","last_updated":"2024-02-22T08:40:03Z","snapshot_observed_at":"2026-08-16T14:16:19.806122Z","submitted_at":"2024-02-22T08:40:03Z","title":"Parameterized Complexity of Finding Dissimilar Shortest Paths","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14376","snapshot_observed_at":"2026-08-10T17:31:58.897642Z","title":"Parameterized complexity of finding dissimilar shortest paths","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.897642Z"},"links":{"cited_paper":"/paper/2402.14376","citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:d0ac0f755d76694768a6ca290a87e6d15a08c0d8304e100aa377a0618d012c61","observation_id":"4d8b462e-6fb5-4041-812d-3cdf2f4ad38a","resolution":{"observed_at":"2026-08-10T17:31:58.897642Z","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-10T17:31:59.536854Z","title":"Approximation schemes for packing problems withℓp-norm diversity constraints","venue":null,"work_id":"fb48d261-74d4-4f64-9231-00e69fde766e","year":2022},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.901417Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:6e19b3483be531b0d29e646d9de3ecda5f6f051aa955a88159b58348f8d27ece","observation_id":"162006d5-7abe-44f7-b9de-a25c0543f4ac","resolution":{"observed_at":"2026-08-10T17:31:59.541502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.524772Z","title":"Obtaining approximately optimal and diverse solutions via dispersion","venue":null,"work_id":"f2ac1289-6ac0-48d7-a72c-99c9ae37294b","year":2022},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.904167Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:60085b7c3cb004223da371e5dbd37f4cc472f0ca35f013c7b4c633e1bbf45630","observation_id":"5b763a03-9584-488f-9902-11bb26e53ae0","resolution":{"observed_at":"2026-08-10T17:31:59.529112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:58.907288Z","title":"freeman San Francisco, 1979","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.907288Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:d0976d5afa3544f28f1ff79952e0fa113b0127ac484a7c24b535a78582324367","observation_id":"d903a2bf-9a1d-49f8-843d-805b80527955","resolution":{"observed_at":"2026-08-10T17:31:58.907288Z","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-10T17:31:59.504551Z","title":"Approximating geometric knapsack via l-packings.ACM Trans","venue":null,"work_id":"9a226ef3-2499-4cc4-8434-d0ebed08defe","year":2021},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.910338Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:6d41048e3e5c835759e56ae15cf09193cb465feda8de381c4de759f6986c51a2","observation_id":"d4768ba2-2a5a-49c4-b7d4-f7adb390d33a","resolution":{"observed_at":"2026-08-10T17:31:59.508851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.492654Z","title":"A framework to design approximation algorithms for finding diverse solutions in combinatorial problems","venue":null,"work_id":"c15526e4-00f8-4588-8b76-809895e499be","year":2023},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.913399Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:14c127f01ad1d36113e19e7a29b2c0ffa7a91588fd5162579365cdf412d7954d","observation_id":"3904dfce-2bb8-48ae-86a2-c67071bd3d07","resolution":{"observed_at":"2026-08-10T17:31:59.496770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.480380Z","title":"Computing diverse shortest paths efficiently: A theoretical and experimental study","venue":null,"work_id":"01e7b4ee-80bb-4fba-ad82-5c98bd5a0530","year":2022},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.916590Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:55354d296da9fced15656aa53abb6f3c515f6f6cad25a4afc58158d7dfc75fdd","observation_id":"a24328da-8867-4818-ae27-f72a962cad54","resolution":{"observed_at":"2026-08-10T17:31:59.484932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.468281Z","title":"Finding diverse trees, paths, and more","venue":null,"work_id":"b04aec16-7d0a-4c38-9c9f-f38103131864","year":2021},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.919578Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:0ced45e9622e9f1f73433002ec43d4bffea10738ed5b13829bff39d7a089ab53","observation_id":"a725327d-3bda-4a34-9311-df5a9d41e74b","resolution":{"observed_at":"2026-08-10T17:31:59.472585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.456323Z","title":"A dynamic programming approach to sequencing problems.Journal of the Society for Industrial and Applied mathematics, 10(1):196–210, 1962","venue":null,"work_id":"a4378f91-48d6-4ca6-a6d5-487018eea2c1","year":1962},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.922508Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:aa417ca46175c7d4774d35119aee26ee14324bf634ee235138c0520b90cb1417","observation_id":"621c0ebb-38c8-4dcd-85d7-fda0f6eca48f","resolution":{"observed_at":"2026-08-10T17:31:59.460377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:58.926434Z","title":"Efficient planarity testing.Journal of the ACM (JACM), 21(4):549–568, 1974","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.926434Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:c304108717e9df794f21b7795a8231d889a41c22c9827d76d8112ea06c464f95","observation_id":"014988f5-cbb0-4068-ac00-8aaa7fe10b42","resolution":{"observed_at":"2026-08-10T17:31:58.926434Z","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-10T17:31:58.930026Z","title":"Ibarra and Chul E","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.930026Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:1dc9841816d0ebd935dc26b99300352de0a5e021a0e4ac875d6e3ed7ab3d31f9","observation_id":"b0162a9e-dc49-47b5-8618-1912b5727b1a","resolution":{"observed_at":"2026-08-10T17:31:58.930026Z","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-10T17:31:59.427459Z","title":"Maximizing the lifetime of wireless sensor networks through domatic partition","venue":null,"work_id":"df2b430c-f66a-44f4-8ef9-a7da41b65aa5","year":2009},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.933810Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:213e6fad7f404ab7f0f6e28d0c4caf9ec933803311241a3aaa4087ac7583c724","observation_id":"61564f57-bb71-4431-86fa-bf280f54f7d7","resolution":{"observed_at":"2026-08-10T17:31:59.432071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.415119Z","title":"Coffman Jr., M","venue":null,"work_id":"16bab282-0ba1-4558-b730-157c9701a3b9","year":1980},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.941853Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:aed9eb46d6b50377b7d46f793a940fda7b90576c4367f8387c091bcbff77eee9","observation_id":"c476a2f9-0341-4037-8b08-72cf1413f4e9","resolution":{"observed_at":"2026-08-10T17:31:59.419113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.403655Z","title":"Pearson, 2005","venue":null,"work_id":"f8fd5e29-a290-4aec-99dd-5ede4c013c8d","year":2005},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.946197Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:8604d13d38b10842d09a15a6903a288160aeac785aa7a9c68ad05459c6afa9d9","observation_id":"7c31a19f-0c7f-47e4-a727-37946d602a66","resolution":{"observed_at":"2026-08-10T17:31:59.407537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.02845","last_updated":"2025-06-27T07:13:24Z","snapshot_observed_at":"2026-08-16T13:02:53.233483Z","submitted_at":"2024-11-05T06:34:29Z","title":"Max-Distance Sparsification for Diversification and Clustering","version":2},"cited_work":{"arxiv_id":"2411.02845","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.02845","snapshot_observed_at":"2026-08-10T17:31:59.077638Z","title":"Max-Distance Sparsification for Diversification and Clustering","venue":"cs.DS","work_id":"eb52e52c-9b3d-40a1-a566-ab0bfb9ba046","year":2024},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.950246Z"},"links":{"cited_paper":"/paper/2411.02845","citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:2f9be5f2f2aa80224723a53e3f14becdfba7e47927285f53f7672e1e5610dbfe","observation_id":"9be22951-d06e-4e27-92ca-fdfbfd2599df","resolution":{"observed_at":"2026-08-10T17:31:59.084423Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.391872Z","title":null,"venue":null,"work_id":"3de12d4d-e76c-4d21-9039-b0b9b4b6ddc0","year":1972},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.954478Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:c80dcf56a247d86f64adaed0f20e36e21574be877d44b7e0da4ac52edcddcaae","observation_id":"c0319f7c-ded9-498a-af74-ea02f6e0380d","resolution":{"observed_at":"2026-08-10T17:31:59.396311Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.381441Z","title":"A separator theorem for planar graphs.SIAM Journal on Applied Mathematics, 36(2):177–189, 1979","venue":null,"work_id":"67e9a64d-9922-46df-9e57-5ae42064377f","year":1979},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.958595Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:8d2a566eb805188dd6fd6bd574fc0466f0b2e9191020b4b9980dedc9cbbcf213","observation_id":"a228e97a-4ecf-4d09-8326-92d986a29454","resolution":{"observed_at":"2026-08-10T17:31:59.384951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.370491Z","title":"On the parameterized complexity of diverse sat","venue":null,"work_id":"279bd35e-202e-48a8-9b72-6b70442281e9","year":2024},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.962160Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:62e35c583fd29d26a03517fbf6ac1cbdaaa44fd61a034d11c97c3d16cde0b237","observation_id":"689bf130-306b-4b6a-8333-0c3b1876609f","resolution":{"observed_at":"2026-08-10T17:31:59.374195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:58.966024Z","title":null,"venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.966024Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:9d048be86dd5e1e27add73bbd35cdb3effa30295223ce192ef78337c7c007951","observation_id":"24fb05e6-e55d-4c44-9df5-caf8a0d07077","resolution":{"observed_at":"2026-08-10T17:31:58.966024Z","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-10T17:31:59.349907Z","title":"Finding multiple optimal solutions to an integer linear program by random perturbations of its objective function","venue":null,"work_id":"8dd13b49-47ec-438b-8282-e9e0f5789dfb","year":2025},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.969749Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:02457da176701e819c03fa4510da2c8fe3c06087509f0f1dfdacf8a8b25b9af3","observation_id":"e1171da1-5fd2-4171-8f1b-0e60a2a10c9f","resolution":{"observed_at":"2026-08-10T17:31:59.354641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.337723Z","title":"Finding diverse strings and longest common subsequences in a graph","venue":null,"work_id":"c312f9f2-b709-410b-b4f6-8202a9b1b479","year":2024},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.973429Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:cca202dfa92c90317d1f839bcd40d9f8116e5fc44107e538fa5ad43bebbe81af","observation_id":"e927a42d-a788-4c41-8adf-96bdbb463d5e","resolution":{"observed_at":"2026-08-10T17:31:59.341865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.326321Z","title":"Complexity of two perfect matchings with minimum shared edges? URL: https://cstheory.stackexchange.com/questions/1278/ complexity-of-two-perfect-matchings-with-minimum-shared-edges","venue":null,"work_id":"dda6f9c1-1614-4512-9f40-434bca7e659e","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.977339Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:d2192b58cacd6f4f56955cbfe142aab38688c0a898d3141431f6f702e557e556","observation_id":"47a5dead-51f2-4436-b85d-dc0977037454","resolution":{"observed_at":"2026-08-10T17:31:59.330471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.314271Z","title":"Dominating set, independent set, discretek-center, dispersion, and related problems for planar points in convex position","venue":null,"work_id":"20245668-ab21-44cb-bef8-d78baffff6a9","year":2025},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.981553Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:3248af37dd4dfa086929ef723e9f4a4660bf73175471cf1213fdb3bac31d2bdc","observation_id":"7fcf8694-9cc5-48f0-a839-93a7fc550ab7","resolution":{"observed_at":"2026-08-10T17:31:59.318761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.302045Z","title":"Springer, 2001","venue":null,"work_id":"063deca0-982a-4761-9b0e-d8ffa0c2bb99","year":2001},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.985474Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:fcadf8bd4b404911341645ba30126ac90f78b76d54c5c2654b3a321fc7a948d1","observation_id":"f6e45372-261f-441b-b4d7-b2393d4e6f7b","resolution":{"observed_at":"2026-08-10T17:31:59.306244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.290217Z","title":"Linear degree extractors and the inapproximability of max clique and chromatic number","venue":null,"work_id":"8daf887e-b756-41a1-8b84-9ffb72d2aa18","year":2007},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.989543Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:1a0640bb18987f7001f503f538bef87ecb726e048de4165903c4b4642e79d57d","observation_id":"b0f0c228-16d9-4b1a-b0a9-66bfd2df3186","resolution":{"observed_at":"2026-08-10T17:31:59.294368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.278366Z","title":"algorithm with(1 − δ)-RA","venue":null,"work_id":"9fd61014-af6f-4d85-8c91-1d42f1cb8386","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.993377Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:4c59c9cfda4657e6935032fc8ac80fc572d226d9d4f15959612a1fc0cc0528f0","observation_id":"79bb5779-e82f-44e3-a5f7-a67894fe587e","resolution":{"observed_at":"2026-08-10T17:31:59.282716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.265742Z","title":"algorithm with (1 − δ)-RA","venue":null,"work_id":"e9b2bc1a-64e7-4711-ad0f-20d73c16ac7a","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:58.997248Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:82968e4ba2c405a9c6e60fdfbe1d79cc0e91976328b1419e6d76f18dc475fd38","observation_id":"ddb91ccc-2e87-4944-b62e-03c0f4711c45","resolution":{"observed_at":"2026-08-10T17:31:59.270383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.254078Z","title":null,"venue":null,"work_id":"06f7ccaf-b2b0-467e-b63c-23e4d6cf2816","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.002012Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:e5274720e4c44d9a8e799c06a4f9fa836c1b26e35263ae7dcfb2321fcd83c882","observation_id":"b0e4e6b3-fa1e-47dc-97d8-d447144c06ee","resolution":{"observed_at":"2026-08-10T17:31:59.258406Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.241658Z","title":"Definition 22","venue":null,"work_id":"97dea9bc-39bc-4268-b9bb-332a9aba3fa7","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.005760Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:3b7512195d1fe6fbe1f05f8e8851740e362d419e30d4de123d16fc811e34e214","observation_id":"6dd452a6-53d2-4121-aaa7-41af5b98788a","resolution":{"observed_at":"2026-08-10T17:31:59.245889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.230549Z","title":"The values ofH and W belong to a set that can be efficiently computed just by knowing the instance","venue":null,"work_id":"6654e9eb-f58c-42e1-8d73-8d1ebb82da97","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.009578Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:ea413f79d0960984325511802c09f7460c2ab1c9e2e6e56435ae9c90e98bca5f","observation_id":"0ab01e61-a712-40e2-a6ba-ff0ed55a302c","resolution":{"observed_at":"2026-08-10T17:31:59.234028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.220353Z","title":null,"venue":null,"work_id":"cb87595c-74d3-4c08-8f7b-3eebfe8b932f","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.012942Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:baf84506e842b61260e712f371491ec752b8e15964dd4c0136ce41a85cc2f42d","observation_id":"d194f1ad-92bd-46a5-99cf-5cb77774d4bd","resolution":{"observed_at":"2026-08-10T17:31:59.223449Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.210203Z","title":"See Figure 4 for examples of container-based andL&C-based packings","venue":null,"work_id":"f06dc226-d62d-4554-9b0a-ba66146c34bb","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.015963Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:d5c1a2b6e8828b8fbd1b01a7c9a39d0aa16f624e91eb6a416c2712d71df0800b","observation_id":"3ef3453c-25ea-460e-a161-20eed41f3eb1","resolution":{"observed_at":"2026-08-10T17:31:59.213618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.197666Z","title":null,"venue":null,"work_id":"914062b3-c727-4f81-9625-1845fcaddbce","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.019387Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:74d0a0dd88f90a84afbe1357fe5d92686810477c5958cbfa4cbc5cda7b067854","observation_id":"50cfbf4a-d305-44db-8843-3cffcb1167cc","resolution":{"observed_at":"2026-08-10T17:31:59.201740Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.186220Z","title":null,"venue":null,"work_id":"c5c95a51-1d35-4380-b8c0-1eb50ddcd7a8","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.022378Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:3f50f3c99239d983e4141fa1aeaecd6222ad85b591d00b5a8f3f8feb50f4c127","observation_id":"78a5bf19-9a0c-4ea5-93d8-dd808ef8fd90","resolution":{"observed_at":"2026-08-10T17:31:59.190123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.174290Z","title":null,"venue":null,"work_id":"7a31e753-6314-40fc-afde-e0dbdcd99a05","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.025488Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:188bbce7bfbfe267efd41ea03609e7bd6bcc663391b4c88ee16e8d41dc642e6b","observation_id":"4f720647-f40a-43e5-84e0-e16424f29f4c","resolution":{"observed_at":"2026-08-10T17:31:59.178611Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.160861Z","title":null,"venue":null,"work_id":"d7d6304e-64f8-46b8-8f1c-4ca74150e127","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.028838Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:b313a6cd3752a07147c7e1e5c765fa5e1b44ad66a4aa5af979fb200840276d23","observation_id":"304b53d2-061d-4a60-9752-ad21f36c5634","resolution":{"observed_at":"2026-08-10T17:31:59.165427Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.148047Z","title":null,"venue":null,"work_id":"b94b6768-2df1-4f06-ab4b-ac7c2e28a0e0","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.032284Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:7a0c8ee09ce39e3ca7c0d46f0a0813c21803b09ee1e8a2bdb016357db22dc89f","observation_id":"4b1662d8-3778-485b-b4ac-98a83d33c719","resolution":{"observed_at":"2026-08-10T17:31:59.152327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.134940Z","title":null,"venue":null,"work_id":"f1784858-864a-49a0-a121-6fc3dc332dc1","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.037002Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:2c58399ba7ad8a621f7a08b6c79307e4a21536390869904e6cefd3177cfaec0b","observation_id":"c602f380-03d1-4762-acc8-65754418e6fa","resolution":{"observed_at":"2026-08-10T17:31:59.139183Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.121852Z","title":"We computemini̸=j ℓ(s, pi, pj, ˜V ) in order of increasing˜v and s, for ˜v = 1,","venue":null,"work_id":"2e588691-658a-46c9-bba3-f85470c45aac","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.040959Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:38c9dc69b5fcaa85b709a7a287e68c3e90e7ee7ce355bb22e138e37c329c9797","observation_id":"d8a61cb2-2ec4-4d66-8570-bf3a8bd0a6a3","resolution":{"observed_at":"2026-08-10T17:31:59.126168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:31:59.108158Z","title":"If there are less thank such tours, the rest of the components ofLk(W ′, i, S) is filled with∞","venue":null,"work_id":"2a20097f-a7e7-4e67-a50e-ccc03cfe8a27","year":null},"citing_paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","version":4},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T17:31:59.044960Z"},"links":{"citing_paper":"/paper/2501.12261"},"observation_digest":"sha256:6c7cba1c5e8d751247ca36d7bf0182cd4043905b43bd3a49a8f8b7b06428e5ab","observation_id":"5f12cc9b-1f94-4cb3-976d-d3995065c19d","resolution":{"observed_at":"2026-08-10T17:31:59.112820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.12261","last_updated":"2025-06-10T15:36:59Z","latest_version":4,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-15T23:23:27.674757Z","submitted_at":"2025-01-21T16:32:08Z","title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":14,"verified_exact":1,"verified_fuzzy":45},"total_outbound_references":61},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 0 inbound Pith citation observations for arXiv:2501.12261."}