{"as_of":"2026-08-15T21:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:550096758ff5acc5dfee5f776ac9de799f117dbd369c6006051e543316c53d2c","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:50:44.884650Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T05:31:06.512984Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T05:31:07.647166Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"cited_work":{"arxiv_id":"2508.14020","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.14020","snapshot_observed_at":"2026-08-05T05:31:07.647166Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","venue":"cs.AI","work_id":"d2a62f20-f2b6-4b98-a62e-98b33640536c","year":2025},"citing_paper":{"arxiv_id":"2509.09707","last_updated":"2025-09-05T21:46:41Z","snapshot_observed_at":"2026-08-10T19:18:12.135113Z","submitted_at":"2025-09-05T21:46:41Z","title":"LLM-Based Instance-Driven Heuristic Bias In the Context of a Biased Random Key Genetic Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T05:31:06.512984Z"},"links":{"cited_paper":"/paper/2508.14020","citing_paper":"/paper/2509.09707"},"observation_digest":"sha256:67e2d97096329772c5476dd7939f2200fb127fe7e2f4ea7160df7dd18a39f2ff","observation_id":"7d4b9efc-c89d-49f0-b646-7779d08e8981","resolution":{"observed_at":"2026-08-05T05:31:07.652316Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.14020/citation-record","integrity":"/paper/2508.14020/integrity","json":"/paper/2508.14020/citation-record.json","paper":"/paper/2508.14020"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.cpm.2023.2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Approximation Algorithms for the Longest Run Subsequence Problem","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"53a4a217-3f30-4c62-b2a0-45b4d4ddea1e","year":2023},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:43.816402Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:19478639feb2de91637870a72dc4e2c5c2c198ff34f05dbd7a5965bf841cef72","observation_id":"f1f3046d-dfa6-4a30-9b3b-d99ae356ebe6","resolution":{"observed_at":"2026-08-05T18:50:47.091544Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:46.875635Z","title":"The hyper-cube framework for ant colony optimization","venue":null,"work_id":"98006fc4-b4c4-4fc6-8bc1-a6aefb22aa86","year":2004},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:43.881794Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:e524ea0a846fc22d9db919f08668f76eef35c2307c913005e209eee5f7d5fe5d","observation_id":"24d80049-83ed-4112-9f2c-fd565ce44573","resolution":{"observed_at":"2026-08-05T18:50:46.946252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:43.966180Z","title":"Metaheuristics for String Problems in Bio-informatics, volume 6","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:43.966180Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:e58b63b11c2e7da2e555b4ffe046468b9e2a544d35ba3d7ad3ff84e50051f34a","observation_id":"8a602aa0-d50f-4551-9747-76f8ccb0d67b","resolution":{"observed_at":"2026-08-05T18:50:43.966180Z","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-05T18:50:46.637157Z","title":"STNWeb: a new visualization tool for analyzing optimization algorithms","venue":null,"work_id":"be1e0bf6-311d-489d-bbb7-db565ec7f9d1","year":2023},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.067353Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:8d87778f14c8a93208d4965a72c8d364ade1612e1b285b193c0a730cbab9fe5a","observation_id":"8805163f-36fb-424b-a1ca-bac6c44f6205","resolution":{"observed_at":"2026-08-05T18:50:46.723873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:46.500567Z","title":"Pattern recognition in bioinformatics","venue":null,"work_id":"d81faa2a-11d5-4710-80f2-f01d91993476","year":2013},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.140126Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:414830fb6a88dee36c548edf31b2a768c6b72691b9445f73324cb589d610a740","observation_id":"30929791-efe3-4308-a304-436499dcd476","resolution":{"observed_at":"2026-08-05T18:50:46.566025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:44.248367Z","title":"The Longest Run Subsequence Problem: Further Complexity Results","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.248367Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:eef1354bf978850a29ce247bba8c9998fa69c1f1484cb1bacb8c8ddcfcfd6403","observation_id":"7fcd2f5c-b9e1-4d0d-a9ff-5d7c7d535b2d","resolution":{"observed_at":"2026-08-05T18:50:44.248367Z","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-05T18:50:46.345786Z","title":"How do rna folding algorithms work? Nature Biotechnology, 22 0 (11): 0 1457--1458, 2004","venue":null,"work_id":"d7b75e03-77f3-43d8-a8a9-d52a3df85641","year":2004},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.321277Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:ca57638b01c48ca05530f93b02c095585d69c415f38320b26202a80ca9400a68","observation_id":"2bdcc187-b399-4f45-b763-0212be147dce","resolution":{"observed_at":"2026-08-05T18:50:46.405133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:46.117793Z","title":"Distributed and sequential algorithms for bioinformatics, volume 23","venue":null,"work_id":"184bd84f-4504-4618-8061-f911625b106c","year":2015},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.422869Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:87fd43b3b88dac42038f9fefce9017546942ae2614fbef40e1031fed69f68ab5","observation_id":"0804f644-1b4f-47c4-b357-eafbf7cb7cb3","resolution":{"observed_at":"2026-08-05T18:50:46.197247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:45.974882Z","title":"Biased random-key genetic algorithms for combinatorial optimization","venue":null,"work_id":"1d0f6f3d-78bd-4d2b-a320-175dc545b6f2","year":2011},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.503632Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:c703e171ce05f63ee856556cc5b48b834c93f5544fe789d3c4e62cc2d9ac5661","observation_id":"36c070a0-aa4a-40f7-8c0c-069dd5a92163","resolution":{"observed_at":"2026-08-05T18:50:46.040122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:45.811995Z","title":"Hirschberg","venue":null,"work_id":"808a9876-faee-49a7-8e0e-caf66bf6aa49","year":1977},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.580605Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:1506da647524925079212762f4ecc89a0662c1bbcbbae4e39a781028dba7c538","observation_id":"e1e50c50-92a1-4cb3-bdb2-a2b283a3447e","resolution":{"observed_at":"2026-08-05T18:50:45.862287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:45.617565Z","title":"A survey of sequence alignment algorithms for next-generation sequencing","venue":null,"work_id":"12815c70-e006-4f2f-a4e8-db46de146285","year":2010},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.632597Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:7ce8b9935545c57e090e5021bbd2871b37c75810b909c64e2a15262a37db220b","observation_id":"78673768-a1a8-4cfb-a7c6-99938f7c8b5e","resolution":{"observed_at":"2026-08-05T18:50:45.710676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:45.429957Z","title":"Adding negative learning to ant colony optimization: A comprehensive study","venue":null,"work_id":"d811861d-923c-47f2-909e-ab072720b238","year":2021},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.717531Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:af294e92d7ba3433ff9e737040b99e039d3fa98b2ccfefcd4c07792d509c4d13","observation_id":"a822538d-d4b8-41b8-be07-1a6df814f451","resolution":{"observed_at":"2026-08-05T18:50:45.510394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.wabi.202","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:45.016652Z","title":null,"venue":null,"work_id":"785e0177-c6f4-498c-95aa-3311a724133a","year":2020},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.790171Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:12ba5bd0a05645e813253e7d1e48ae2994f0546e23ac65afa385ed05dd842420","observation_id":"bc5e91bf-33cc-4807-9d71-bf4c92ef011c","resolution":{"observed_at":"2026-08-05T18:50:45.154593Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:50:45.258607Z","title":null,"venue":null,"work_id":"5c75018a-9aaf-4441-bd5f-c3e8a65b7d58","year":2000},"citing_paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T18:50:44.884650Z"},"links":{"citing_paper":"/paper/2508.14020"},"observation_digest":"sha256:7cb12a0c23f8b7c92a7dbc9c2a87e5dabcb3bbabc3a01ea01ef6d5e9de70499a","observation_id":"ff16d198-fb12-43c2-8366-4205fc19d9de","resolution":{"observed_at":"2026-08-05T18:50:45.325944Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.14020","last_updated":"2025-08-19T17:27:29Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T05:22:21.793933Z","submitted_at":"2025-08-19T17:27:29Z","title":"A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":9},"total_outbound_references":14},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 1 inbound Pith citation observation for arXiv:2508.14020."}