Pith. sign in

Paper Citation Record · LEDGER

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

As of 18 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-18T06:34:40.430872+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-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-05T18:50:43.816402Z digest=sha256:70292efc87611451c0522f4b70d875327011479a3792aa40759c741652ac82ce

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-18T06:34:40.430872+00:00.

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

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:236f38a82a4e1d16b5ecd274d908e50013d14a10220a8020c5cce980d4ad6b09

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.140126Z digest=sha256:7b6d57ad69fc9ea151870da8e629edd860a00ed3b0af71b27334e7e8cc1f207f

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:df284c6e03805eb570a4e5113e089ecac0227cf84dfa13a1533337db4a3564e0

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.632597Z digest=sha256:111384674e90e1190dc46a96cb1d27ba722c92f83172388a8dac21a55efabf2a

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-18T06:34:40.430872+00:00.

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

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-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.790171Z digest=sha256:84e15fafe24c9233fc4e9f0dde592d8d6ffd04da34fac877be31b49c0f0c7202

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-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-05T18:50:44.884650Z digest=sha256:0ec2db7844bd8ce96626c242a6eda4d98a32b35a981830fa0a2e00a9e4ca41f1

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-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-05T05:31:06.512984Z digest=sha256:81e902c75a231c6a0d532d7aedc27f315990cc5fd87a0279c52d6c2fc4006d50