Pith. sign in

Paper Citation Record · LEDGER

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2508.14020 v1

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-05T18:50:44.884650Z

measured 15 of 15 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T05:31:06.512984Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-05T05:31:07.647166Z

Reference resolution

14 of 14 outbound references displayed

  • verified exact2
  • verified fuzzy9
  • unresolved3
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation f1f3046d-dfa6-4a30-9b3b-d99ae356ebe6 · outbound

This paper cites Approximation Algorithms for the Longest Run Subsequence Problem.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem Approximation Algorithms for the Longest Run Subsequence Problem

Reference 1

Resolution
verified exact
doi, observed 2026-08-05T18:50:47.091544Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:43.816402Z digest=sha256:19478639feb2de91637870a72dc4e2c5c2c198ff34f05dbd7a5965bf841cef72

Observation 24d80049-83ed-4112-9f2c-fd565ce44573 · outbound

This paper cites The hyper-cube framework for ant colony optimization.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem The hyper-cube framework for ant colony optimization

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T18:50:46.946252Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:43.881794Z digest=sha256:e524ea0a846fc22d9db919f08668f76eef35c2307c913005e209eee5f7d5fe5d

Observation 8a602aa0-d50f-4551-9747-76f8ccb0d67b · outbound

This paper cites Metaheuristics for String Problems in Bio-informatics, volume 6.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem Metaheuristics for String Problems in Bio-informatics, volume 6

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-05T18:50:43.966180Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T18:50:43.966180Z digest=sha256:e58b63b11c2e7da2e555b4ffe046468b9e2a544d35ba3d7ad3ff84e50051f34a

Observation 8805163f-36fb-424b-a1ca-bac6c44f6205 · outbound

This paper cites STNWeb: a new visualization tool for analyzing optimization algorithms.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem STNWeb: a new visualization tool for analyzing optimization algorithms

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T18:50:46.723873Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.067353Z digest=sha256:8d87778f14c8a93208d4965a72c8d364ade1612e1b285b193c0a730cbab9fe5a

Observation 30929791-efe3-4308-a304-436499dcd476 · outbound

This paper cites Pattern recognition in bioinformatics.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem Pattern recognition in bioinformatics

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T18:50:46.566025Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.140126Z digest=sha256:414830fb6a88dee36c548edf31b2a768c6b72691b9445f73324cb589d610a740

Observation 7fcd2f5c-b9e1-4d0d-a9ff-5d7c7d535b2d · outbound

This paper cites The Longest Run Subsequence Problem: Further Complexity Results.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem The Longest Run Subsequence Problem: Further Complexity Results

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-05T18:50:44.248367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T18:50:44.248367Z digest=sha256:eef1354bf978850a29ce247bba8c9998fa69c1f1484cb1bacb8c8ddcfcfd6403

Observation 2bdcc187-b399-4f45-b763-0212be147dce · outbound

This paper cites How do rna folding algorithms work? Nature Biotechnology, 22 0 (11): 0 1457--1458, 2004.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem How do rna folding algorithms work? Nature Biotechnology, 22 0 (11): 0 1457--1458, 2004

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T18:50:46.405133Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.321277Z digest=sha256:ca57638b01c48ca05530f93b02c095585d69c415f38320b26202a80ca9400a68

Observation 0804f644-1b4f-47c4-b357-eafbf7cb7cb3 · outbound

This paper cites Distributed and sequential algorithms for bioinformatics, volume 23.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem Distributed and sequential algorithms for bioinformatics, volume 23

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T18:50:46.197247Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.422869Z digest=sha256:87fd43b3b88dac42038f9fefce9017546942ae2614fbef40e1031fed69f68ab5

Observation 36c070a0-aa4a-40f7-8c0c-069dd5a92163 · outbound

This paper cites Biased random-key genetic algorithms for combinatorial optimization.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem Biased random-key genetic algorithms for combinatorial optimization

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T18:50:46.040122Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.503632Z digest=sha256:c703e171ce05f63ee856556cc5b48b834c93f5544fe789d3c4e62cc2d9ac5661

Observation e1e50c50-92a1-4cb3-bdb2-a2b283a3447e · outbound

This paper cites Hirschberg.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem Hirschberg

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T18:50:45.862287Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.580605Z digest=sha256:1506da647524925079212762f4ecc89a0662c1bbcbbae4e39a781028dba7c538

Observation 78673768-a1a8-4cfb-a7c6-99938f7c8b5e · outbound

This paper cites A survey of sequence alignment algorithms for next-generation sequencing.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem A survey of sequence alignment algorithms for next-generation sequencing

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T18:50:45.710676Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.632597Z digest=sha256:7ce8b9935545c57e090e5021bbd2871b37c75810b909c64e2a15262a37db220b

Observation a822538d-d4b8-41b8-be07-1a6df814f451 · outbound

This paper cites Adding negative learning to ant colony optimization: A comprehensive study.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem Adding negative learning to ant colony optimization: A comprehensive study

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-05T18:50:45.510394Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.717531Z digest=sha256:af294e92d7ba3433ff9e737040b99e039d3fa98b2ccfefcd4c07792d509c4d13

Observation bc5e91bf-33cc-4807-9d71-bf4c92ef011c · outbound

This paper cites an unresolved cited work.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem Unresolved cited work

Reference 13

Resolution
verified exact
doi, observed 2026-08-05T18:50:45.154593Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.790171Z digest=sha256:12ba5bd0a05645e813253e7d1e48ae2994f0546e23ac65afa385ed05dd842420

Observation ff16d198-fb12-43c2-8366-4205fc19d9de · outbound

This paper cites an unresolved cited work.

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem Unresolved cited work

Reference 14

Resolution
unresolved
raw_fallback, observed 2026-08-05T18:50:45.325944Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.884650Z digest=sha256:7cb12a0c23f8b7c92a7dbc9c2a87e5dabcb3bbabc3a01ea01ef6d5e9de70499a

Pith citing papers

Observation 7d4b9efc-c89d-49f0-b646-7779d08e8981 · inbound

LLM-Based Instance-Driven Heuristic Bias In the Context of a Biased Random Key Genetic Algorithm cites this paper.

LLM-Based Instance-Driven Heuristic Bias In the Context of a Biased Random Key Genetic Algorithm A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem

Reference 5

Resolution
verified exact
local_arxiv, observed 2026-08-05T05:31:07.652316Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.

source=pdf_text observed=2026-08-05T05:31:06.512984Z digest=sha256:67e2d97096329772c5476dd7939f2200fb127fe7e2f4ea7160df7dd18a39f2ff