Paper Citation Record · LEDGER

Branch-and-bound method for calculating Viterbi path in triplet Markov models

As of 21 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2507.19338.

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

pith.paper-citation-record.v1
2507.19338 v1

Coverage vector

measured 41 of 41 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T18:00:16.644611Z

measured 41 of 41 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

41 of 41 outbound references displayed

verified exact16
verified fuzzy7
unresolved7
parse uncertain0
malformed identifier6
metadata mismatch5

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 636e3c3d-c38b-4bef-b8a6-05fcc1c756f1 · outbound

This paper cites Methodology and Computing in Applied Probability 25(2), 67 (2023) https://doi.org/10.1007/s11009-023-10044-z.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Methodology and Computing in Applied Probability 25(2), 67 (2023) https://doi.org/10.1007/s11009-023-10044-z

Reference 1

Resolution: verified exact; doi, observed 2026-08-15T18:00:17.068975Z

Source-reported events for the cited work

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

Observation 27e42a9a-1f15-4662-b218-cebcc53165b5 · outbound

This paper cites Stochastic Processes and their Applications 130(3), 1388–1425 (2020) https:// doi.org/10.1016/j.spa.2019.05.004.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Stochastic Processes and their Applications 130(3), 1388–1425 (2020) https:// doi.org/10.1016/j.spa.2019.05.004

Reference 2

Resolution: verified exact; doi, observed 2026-08-15T18:00:17.047132Z

Source-reported events for the cited work

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

Observation 39fdc111-277b-4274-a164-77adcebd0599 · outbound

This paper cites Journal of Theoretical Probability 34(1), 1–33 (2021) https://doi.org/10.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Journal of Theoretical Probability 34(1), 1–33 (2021) https://doi.org/10

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:00:18.192770Z

Source-reported events for the cited work

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

Observation 87f1db99-d25d-4940-a1e9-d218c8f0d8ee · outbound

This paper cites Electronic Journal of Probability 26, 1–30 (2021) https: //doi.org/10.1214/21-EJP628.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Electronic Journal of Probability 26, 1–30 (2021) https: //doi.org/10.1214/21-EJP628

Reference 4

Resolution: verified exact; doi, observed 2026-08-15T18:00:17.023002Z

Source-reported events for the cited work

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

Observation 2a935c9d-2783-4af2-9e20-9d4cedc396e0 · outbound

This paper cites Pedestrian Models for Autonomous Driving Part II: High-Level Models of Human Behavior.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Pedestrian Models for Autonomous Driving Part II: High-Level Models of Human Behavior

Reference 5

Resolution: malformed identifier; local_arxiv, observed 2026-08-15T18:00:17.985682Z

Source-reported events for the cited work

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

Observation 6bf2138c-3260-4ec4-b61d-dee6f1db7ec0 · outbound

This paper cites IEEE Transactions on Signal Processing 52(9), 2477–2489 (2004) https://doi.org/10.1109/TSP.2004.832015.

Branch-and-bound method for calculating Viterbi path in triplet Markov models IEEE Transactions on Signal Processing 52(9), 2477–2489 (2004) https://doi.org/10.1109/TSP.2004.832015

Reference 6

Resolution: metadata mismatch; raw_fallback, observed 2026-08-15T18:00:17.957515Z

Source-reported events for the cited work

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

Observation 222d0589-7f9e-47cd-912f-cd95df88c555 · outbound

This paper cites In: Advanced Concepts for Intelligent Vision Systems (2004).

Branch-and-bound method for calculating Viterbi path in triplet Markov models In: Advanced Concepts for Intelligent Vision Systems (2004)

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:00:18.168135Z

Source-reported events for the cited work

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

Observation e9bf4e00-34bc-4355-95e1-8dbf34ca663a · outbound

This paper cites Signal Processing 91, 163–175 (2011) https://doi.org/10.1016/j.sigpro.2010.05.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Signal Processing 91, 163–175 (2011) https://doi.org/10.1016/j.sigpro.2010.05

Reference 8

Resolution: verified exact; doi, observed 2026-08-15T18:00:17.002349Z

Source-reported events for the cited work

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

Observation 2107b0f5-c6f0-4acd-9e82-8063826c4c39 · outbound

This paper cites IEEE Signal Processing Letters 19(10), 619–622 (2012) https://doi.org/10.1109/LSP.2012.

Branch-and-bound method for calculating Viterbi path in triplet Markov models IEEE Signal Processing Letters 19(10), 619–622 (2012) https://doi.org/10.1109/LSP.2012

Reference 9

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.982376Z

Source-reported events for the cited work

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

Observation b85875ec-6aa0-4a99-9c26-7722e56c703e · outbound

This paper cites Computational Statistics and Data Analysis 63, 81–98 (2013) https://doi.org/10.1016/j.csda.2013.01.027.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Computational Statistics and Data Analysis 63, 81–98 (2013) https://doi.org/10.1016/j.csda.2013.01.027

Reference 10

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.960318Z

Source-reported events for the cited work

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

Observation 3eb03a6d-5099-426b-949c-b3d146173c1f · outbound

This paper cites Signal Processing 128, 8–17 (2019) https://doi.org/10.1016/j.sigpro.2016.03.008.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Signal Processing 128, 8–17 (2019) https://doi.org/10.1016/j.sigpro.2016.03.008

Reference 11

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.941005Z

Source-reported events for the cited work

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

Observation 95fde98b-53ec-4bb9-a54e-432c9ffef88b · outbound

This paper cites Signal Processing 145, 183–192 (2018) https://doi.org/10.1016/j.sigpro.2017.12.006.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Signal Processing 145, 183–192 (2018) https://doi.org/10.1016/j.sigpro.2017.12.006

Reference 12

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.921256Z

Source-reported events for the cited work

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

Observation ab88ef17-0c6d-4c5c-9062-827ad6aa3023 · outbound

This paper cites IEEE Transactions on Pattern Analysis and Machine Intelligence 29(8), 1367–1378 (2007) https://doi.org/10.1109/TPAMI.

Branch-and-bound method for calculating Viterbi path in triplet Markov models IEEE Transactions on Pattern Analysis and Machine Intelligence 29(8), 1367–1378 (2007) https://doi.org/10.1109/TPAMI

Reference 13

Resolution: malformed identifier; no resolver link, observed 2026-08-15T18:00:16.441669Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c4742c9-2881-4164-b9dc-211245599a1d · outbound

This paper cites In: 3rd IEEE International Symposium on Biomedical Imaging, pp.

Branch-and-bound method for calculating Viterbi path in triplet Markov models In: 3rd IEEE International Symposium on Biomedical Imaging, pp

Reference 14

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.895485Z

Source-reported events for the cited work

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

Observation 7aa60ccb-c29a-431d-9130-c01107d8f24b · outbound

This paper cites Compu- tational Statistics & Data Analysis 180 (2023) https://doi.org/10.1016/j.csda.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Compu- tational Statistics & Data Analysis 180 (2023) https://doi.org/10.1016/j.csda

Reference 15

Resolution: malformed identifier; no resolver link, observed 2026-08-15T18:00:16.456132Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c045e407-4e3c-4e20-a565-856b2cf573d4 · outbound

This paper cites IEEE Transactions on Wireless Communications 12(9), 4582– 4591 (2013) https://doi.org/10.1109/TWC.2013.072513.121864.

Branch-and-bound method for calculating Viterbi path in triplet Markov models IEEE Transactions on Wireless Communications 12(9), 4582– 4591 (2013) https://doi.org/10.1109/TWC.2013.072513.121864

Reference 16

Resolution: metadata mismatch; raw_fallback, observed 2026-08-15T18:00:17.720162Z

Source-reported events for the cited work

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

Observation 2afacddd-c588-40ac-b11e-6e9e1362b0d0 · outbound

This paper cites IEEE Transactions on Wireless Communications 15(8), 5430–5439 (2016) https://doi.org/10.1109/TWC.2016.

Branch-and-bound method for calculating Viterbi path in triplet Markov models IEEE Transactions on Wireless Communications 15(8), 5430–5439 (2016) https://doi.org/10.1109/TWC.2016

Reference 17

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.872747Z

Source-reported events for the cited work

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

Observation f50bdee8-1210-4c11-a0b0-b1382b170546 · outbound

This paper cites Neurocomputing 362, 94–105 (2019) https://doi.org/10.1016/j.neucom.2019.06.081.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Neurocomputing 362, 94–105 (2019) https://doi.org/10.1016/j.neucom.2019.06.081

Reference 18

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.851486Z

Source-reported events for the cited work

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

Observation 8c3ea892-be37-4506-8930-8c055fa1d696 · outbound

This paper cites Signal Processing 92, 29–42 (2012) https: //doi.org/10.1016/j.sigpro.2011.06.001.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Signal Processing 92, 29–42 (2012) https: //doi.org/10.1016/j.sigpro.2011.06.001

Reference 19

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.830886Z

Source-reported events for the cited work

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

Observation 3b09f815-a5c5-4874-a471-06f266dad80e · outbound

This paper cites Signal Processing 90, 2899– 2910 (2010) https://doi.org/10.1016/j.sigpro.2010.04.008.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Signal Processing 90, 2899– 2910 (2010) https://doi.org/10.1016/j.sigpro.2010.04.008

Reference 20

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.808319Z

Source-reported events for the cited work

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

Observation b133f6df-aa21-4ad5-a06a-b55f38bff1a3 · outbound

This paper cites International Journal of Approximate Reasoning 162 (2023) https://doi.org/10.1016/j.ijar.2023.109025.

Branch-and-bound method for calculating Viterbi path in triplet Markov models International Journal of Approximate Reasoning 162 (2023) https://doi.org/10.1016/j.ijar.2023.109025

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-15T18:00:16.508599Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5201353-cc33-42bb-80ba-94dc1e021450 · outbound

This paper cites MIT Press, USA (2009).

Branch-and-bound method for calculating Viterbi path in triplet Markov models MIT Press, USA (2009)

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:00:18.142850Z

Source-reported events for the cited work

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

Observation 8db22864-4f60-496b-bafe-9a1d511ec3b4 · outbound

This paper cites Journal of Machine Learning Research 15, 1–15 (2014).

Branch-and-bound method for calculating Viterbi path in triplet Markov models Journal of Machine Learning Research 15, 1–15 (2014)

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:00:18.125534Z

Source-reported events for the cited work

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

Observation 1418705c-7fbf-4fd3-a555-3f879963809d · outbound

This paper cites In: Dymarski, P.

Branch-and-bound method for calculating Viterbi path in triplet Markov models In: Dymarski, P

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:00:18.105711Z

Source-reported events for the cited work

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

Observation e00b8982-f2f7-4282-a2c6-d4132c74eb48 · outbound

This paper cites Annals of Applied Statistics 7(3), 1814–1835 (2013) https://doi.org/10.1214/ 13-AOAS657.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Annals of Applied Statistics 7(3), 1814–1835 (2013) https://doi.org/10.1214/ 13-AOAS657

Reference 25

Resolution: malformed identifier; raw_fallback, observed 2026-08-15T18:00:18.084174Z

Source-reported events for the cited work

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

Observation 1477bfcc-0c0d-4673-a393-2c0ab7bb1931 · outbound

This paper cites Advanced posterior analyses of hidden Markov models: finite Markov chain imbedding and hybrid decoding.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Advanced posterior analyses of hidden Markov models: finite Markov chain imbedding and hybrid decoding

Reference 26

Resolution: metadata mismatch; local_arxiv, observed 2026-08-15T18:00:17.477292Z

Source-reported events for the cited work

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

Observation d46cb9cc-e42a-42ec-b3e2-92c3bf49e8f4 · outbound

This paper cites Parsing Inside-Out.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Parsing Inside-Out

Reference 27

Resolution: metadata mismatch; local_arxiv, observed 2026-08-15T18:00:17.444161Z

Source-reported events for the cited work

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

Observation 6246ba67-0f1c-44c1-8296-2f9845310a5b · outbound

This paper cites Journal of Computer and System Sciences 65(3), 545–569 (2002) https://doi.org/10.1016/S0022-0000(02)00009-0.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Journal of Computer and System Sciences 65(3), 545–569 (2002) https://doi.org/10.1016/S0022-0000(02)00009-0

Reference 28

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.788793Z

Source-reported events for the cited work

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

Observation 47ea3e02-8913-4c79-b752-aa4f7139a767 · outbound

This paper cites In: Bayesian Statistics 9.

Branch-and-bound method for calculating Viterbi path in triplet Markov models In: Bayesian Statistics 9

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-15T18:00:16.562811Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9a7a5c0-f531-40dc-8b59-ed03c598f21f · outbound

This paper cites Solving MAP Exactly using Systematic Search.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Solving MAP Exactly using Systematic Search

Reference 30

Resolution: metadata mismatch; local_arxiv, observed 2026-08-15T18:00:17.330673Z

Source-reported events for the cited work

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

Observation 8e952552-24ef-4ba7-b927-e392ffa2bd5d · outbound

This paper cites Artificial Intelligence 42(2), 393–405 (1990) https: //doi.org/10.1016/0004-3702(90)90060-D.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Artificial Intelligence 42(2), 393–405 (1990) https: //doi.org/10.1016/0004-3702(90)90060-D

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-15T18:00:16.575271Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c576b45-f2c4-4b4d-a625-93713f26e26c · outbound

This paper cites Artificial Intelligence 60(1), 141–153 (1993) https://doi.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Artificial Intelligence 60(1), 141–153 (1993) https://doi

Reference 32

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.753534Z

Source-reported events for the cited work

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

Observation 3e47c55b-ce9d-4989-87b8-22f754990b5c · outbound

This paper cites In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing.

Branch-and-bound method for calculating Viterbi path in triplet Markov models In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing

Reference 33

Resolution: malformed identifier; no resolver link, observed 2026-08-15T18:00:16.588617Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12e84550-4738-4bcd-8782-a1e671184765 · outbound

This paper cites METRON 77 (2018) https://doi.org/ 10.1007/s40300-019-00152-7.

Branch-and-bound method for calculating Viterbi path in triplet Markov models METRON 77 (2018) https://doi.org/ 10.1007/s40300-019-00152-7

Reference 34

Resolution: verified exact; doi, observed 2026-08-15T18:00:16.732397Z

Source-reported events for the cited work

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

Observation 08e993b7-dd9d-4a7a-aa06-ea7a71ca72b3 · outbound

This paper cites Journal of Applied Statistics 49(5), 1203–1234 (2022) https://doi.org/10.1080/02664763.2020.1858273.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Journal of Applied Statistics 49(5), 1203–1234 (2022) https://doi.org/10.1080/02664763.2020.1858273

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-15T18:00:16.601458Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21e08a49-3160-4f21-a878-3affb10392cf · outbound

This paper cites IMA Journal of Numerical Analysis 41(4), 2311–2330 (2020) https://doi.org/10.1093/imanum/draa038.

Branch-and-bound method for calculating Viterbi path in triplet Markov models IMA Journal of Numerical Analysis 41(4), 2311–2330 (2020) https://doi.org/10.1093/imanum/draa038

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-15T18:00:16.612521Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2870f70f-40d9-4fff-92bf-867b18263eab · outbound

This paper cites Analytical Approach to Parallel Repetition.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Analytical Approach to Parallel Repetition

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-15T18:00:16.619992Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 587acc91-89af-431b-a20a-a3c2c03367b4 · outbound

This paper cites Mas- ter’s thesis, University of Tartu (2023).

Branch-and-bound method for calculating Viterbi path in triplet Markov models Mas- ter’s thesis, University of Tartu (2023)

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:00:18.057078Z

Source-reported events for the cited work

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

Observation 268e417e-3970-4e96-a65b-899cd4dca05d · outbound

This paper cites share.neic.no (2018).

Branch-and-bound method for calculating Viterbi path in triplet Markov models share.neic.no (2018)

Reference 39

Resolution: malformed identifier; raw_fallback, observed 2026-08-15T18:00:18.029720Z

Source-reported events for the cited work

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

Observation b1b13c9b-74d2-4cc4-96ca-b3c4abc60246 · outbound

This paper cites Addison-Wesley, USA (1984).

Branch-and-bound method for calculating Viterbi path in triplet Markov models Addison-Wesley, USA (1984)

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:00:18.008413Z

Source-reported events for the cited work

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

Observation ba891a15-a475-464c-90fc-911a6b4e86e0 · outbound

This paper cites Journal of Combinatorial Theory, Series A 116(1), 55–75 (2009) https://doi.org/10.1016/j.jcta.2008.05.005 36.

Branch-and-bound method for calculating Viterbi path in triplet Markov models Journal of Combinatorial Theory, Series A 116(1), 55–75 (2009) https://doi.org/10.1016/j.jcta.2008.05.005 36

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-15T18:00:16.644611Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.