{"as_of":"2026-08-17T18:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf793a7757675d963c34184cd4789e7fec30b3288ed30505a37674d90b0fa5e7","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:00:16.644611Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2507.19338/citation-record","integrity":"/paper/2507.19338/integrity","json":"/paper/2507.19338/citation-record.json","paper":"/paper/2507.19338"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11009-023-10044-z","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:17.061602Z","title":"Methodology and Computing in Applied Probability 25(2), 67 (2023) https://doi.org/10.1007/s11009-023-10044-z","venue":null,"work_id":"168b300b-b407-4a0c-8e72-e380198ce7e6","year":2023},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.360017Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:b39679daaeef0130a6db295f2792c0c5725c1eff542e0cf63beaca2a86d7f442","observation_id":"636e3c3d-c38b-4bef-b8a6-05fcc1c756f1","resolution":{"observed_at":"2026-08-15T18:00:17.068975Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.spa.2019.05.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:17.036736Z","title":"Stochastic Processes and their Applications 130(3), 1388–1425 (2020) https:// doi.org/10.1016/j.spa.2019.05.004","venue":null,"work_id":"566f278b-2ef2-42c9-9e3f-1cca34122476","year":2020},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.366200Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:83fcafcd4a45103196a4c67ab3228431db2a905b278d8d3a2c35e17a6c3c5760","observation_id":"27e42a9a-1f15-4662-b218-cebcc53165b5","resolution":{"observed_at":"2026-08-15T18:00:17.047132Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:18.181154Z","title":"Journal of Theoretical Probability 34(1), 1–33 (2021) https://doi.org/10","venue":null,"work_id":"6b32ab3f-934b-4cc8-8989-dc8e275895af","year":2021},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.371933Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:7417987a473141c124652a517a6f841df4f56369fee9c826853344930520d03e","observation_id":"39fdc111-277b-4274-a164-77adcebd0599","resolution":{"observed_at":"2026-08-15T18:00:18.192770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/21-ejp628","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:17.016581Z","title":"Electronic Journal of Probability 26, 1–30 (2021) https: //doi.org/10.1214/21-EJP628","venue":null,"work_id":"7701b8fd-1643-4d0a-99f9-921f7e44bddd","year":2021},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.381670Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:3e123b09efa8574f599fd1ee69bef0b1a9493fb91eb318c5b235f1d47cbf420d","observation_id":"87f1db99-d25d-4940-a1e9-d218c8f0d8ee","resolution":{"observed_at":"2026-08-15T18:00:17.023002Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.11959","last_updated":"2020-07-20T14:48:59Z","snapshot_observed_at":"2026-08-17T04:07:16.585202Z","submitted_at":"2020-03-26T14:55:18Z","title":"Pedestrian Models for Autonomous Driving Part II: High-Level Models of Human Behavior","version":2},"cited_work":{"arxiv_id":"2003.11959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.11959","snapshot_observed_at":"2026-08-15T18:00:17.978808Z","title":"Pedestrian Models for Autonomous Driving Part II: High-Level Models of Human Behavior","venue":"cs.RO","work_id":"33c33d04-4d0f-4c2d-ab5b-99ee1a483674","year":2020},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.388479Z"},"links":{"cited_paper":"/paper/2003.11959","citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:de4f4ee58db7ff947059ee6da3929a12a4c3008b46779588a0a50bf156a8ac4c","observation_id":"2a935c9d-2783-4af2-9e20-9d4cedc396e0","resolution":{"observed_at":"2026-08-15T18:00:17.985682Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2004.83201","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:17.949188Z","title":"IEEE Transactions on Signal Processing 52(9), 2477–2489 (2004) https://doi.org/10.1109/TSP.2004.832015","venue":null,"work_id":"c4a5ada5-2f82-48f6-a0b4-261a8c50aeca","year":2004},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.395360Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:f2298ab602e63ede9d877e5998ff29d8a200112fdcf97f2f4ae103757d22bb16","observation_id":"6bf2138c-3260-4ec4-b61d-dee6f1db7ec0","resolution":{"observed_at":"2026-08-15T18:00:17.957515Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:18.161242Z","title":"In: Advanced Concepts for Intelligent Vision Systems (2004)","venue":null,"work_id":"3a1ec292-5f2d-4e17-9665-e811b5bc0ce3","year":2004},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.401391Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:fc35d20d037ebab1292fb2f02728b0f5f1483e872b00f38d1c68641c31e63c16","observation_id":"222d0589-7f9e-47cd-912f-cd95df88c555","resolution":{"observed_at":"2026-08-15T18:00:18.168135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.sigpro.2010.05","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.995427Z","title":"Signal Processing 91, 163–175 (2011) https://doi.org/10.1016/j.sigpro.2010.05","venue":null,"work_id":"2801530c-0824-4cbb-aea9-258ab11c941f","year":2011},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.406824Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:1ad675811ab29e4743845125f1dd559048eb95914f493060010e73cb2394866c","observation_id":"e9bf4e00-34bc-4355-95e1-8dbf34ca663a","resolution":{"observed_at":"2026-08-15T18:00:17.002349Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/lsp.2012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.976424Z","title":"IEEE Signal Processing Letters 19(10), 619–622 (2012) https://doi.org/10.1109/LSP.2012","venue":null,"work_id":"99450145-a5c1-417d-a379-cb212ee1ecfa","year":2012},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.412648Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:1dee6c4306a407d5c27805aa08593834fd839a563310e25281783f1a47d8d2ae","observation_id":"2107b0f5-c6f0-4acd-9e82-8063826c4c39","resolution":{"observed_at":"2026-08-15T18:00:16.982376Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.csda.2013.01.027","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.954370Z","title":"Computational Statistics and Data Analysis 63, 81–98 (2013) https://doi.org/10.1016/j.csda.2013.01.027","venue":null,"work_id":"96d7a008-8067-4533-9c0c-15112d0a26bd","year":2013},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.421808Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:4f8beff6760daa49b0af46ece634cacd8330b72c20408bda885275fc5740bece","observation_id":"b85875ec-6aa0-4a99-9c26-7722e56c703e","resolution":{"observed_at":"2026-08-15T18:00:16.960318Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.sigpro.2016.03.008","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.935546Z","title":"Signal Processing 128, 8–17 (2019) https://doi.org/10.1016/j.sigpro.2016.03.008","venue":null,"work_id":"c3599db9-1092-4d5d-9588-fde6abfa5719","year":2019},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.428495Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:6c0f196de4c2d671f395640cc07eeefe31cb88febc14a09cb86a9636525b7676","observation_id":"3eb03a6d-5099-426b-949c-b3d146173c1f","resolution":{"observed_at":"2026-08-15T18:00:16.941005Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.sigpro.2017.12.006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.914081Z","title":"Signal Processing 145, 183–192 (2018) https://doi.org/10.1016/j.sigpro.2017.12.006","venue":null,"work_id":"aa8bf89d-5e03-46b7-b7de-637f55a6e3c8","year":2018},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.435279Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:858f0182495d568b7f232ffd61f58b9ebe5b8279ed57390786fe62b26d5f60a7","observation_id":"95fde98b-53ec-4bb9-a54e-432c9ffef88b","resolution":{"observed_at":"2026-08-15T18:00:16.921256Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:16.441669Z","title":"IEEE Transactions on Pattern Analysis and Machine Intelligence 29(8), 1367–1378 (2007) https://doi.org/10.1109/TPAMI","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.441669Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:a4ef1577ae85aaa8056acef99ca10ba9cb4f3f44883b0dfa45ad6f6e966e4f6d","observation_id":"ab88ef17-0c6d-4c5c-9062-827ad6aa3023","resolution":{"observed_at":"2026-08-15T18:00:16.441669Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/isbi.2006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.888262Z","title":"In: 3rd IEEE International Symposium on Biomedical Imaging, pp","venue":null,"work_id":"065675b9-27b7-435a-b9ce-afd2228a14cf","year":2006},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.448052Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:ee3f19da334eb959a7d5bbcbef0ceb49b2fc5e5889c5e5364ca1377934e9e2a8","observation_id":"8c4742c9-2881-4164-b9dc-211245599a1d","resolution":{"observed_at":"2026-08-15T18:00:16.895485Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:16.456132Z","title":"Compu- tational Statistics & Data Analysis 180 (2023) https://doi.org/10.1016/j.csda","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.456132Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:eb7173c5e3c4e26ba54aff3d7e2047845817d10e7743f8e60e17f1f69593b27d","observation_id":"7aa60ccb-c29a-431d-9130-c01107d8f24b","resolution":{"observed_at":"2026-08-15T18:00:16.456132Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2013.07251","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:17.702952Z","title":"IEEE Transactions on Wireless Communications 12(9), 4582– 4591 (2013) https://doi.org/10.1109/TWC.2013.072513.121864","venue":null,"work_id":"98a6522a-e80f-4725-a754-0d026dc0fa54","year":2013},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.464307Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:24efc64ec387a914468c914f865348754ab21fea9629f18cd681d2a7ff0eb77f","observation_id":"c045e407-4e3c-4e20-a565-856b2cf573d4","resolution":{"observed_at":"2026-08-15T18:00:17.720162Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/twc.2016","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.866611Z","title":"IEEE Transactions on Wireless Communications 15(8), 5430–5439 (2016) https://doi.org/10.1109/TWC.2016","venue":null,"work_id":"34939720-8dd5-40e8-b346-df83ff407518","year":2016},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.471611Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:793d9fbbdbe80014fe705235e57dad27ec669a05c91f8df49bf60a4903c1f572","observation_id":"2afacddd-c588-40ac-b11e-6e9e1362b0d0","resolution":{"observed_at":"2026-08-15T18:00:16.872747Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.neucom.2019.06.081","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.843778Z","title":"Neurocomputing 362, 94–105 (2019) https://doi.org/10.1016/j.neucom.2019.06.081","venue":null,"work_id":"338e7d73-a405-4c25-b489-7fa7d627a4c2","year":2019},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.482485Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:c2d2e2cc0a640020bc62e02418c9b0c7f67cd79e24cb096f1c45157532b2df88","observation_id":"f50bdee8-1210-4c11-a0b0-b1382b170546","resolution":{"observed_at":"2026-08-15T18:00:16.851486Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.sigpro.2011.06.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.823350Z","title":"Signal Processing 92, 29–42 (2012) https: //doi.org/10.1016/j.sigpro.2011.06.001","venue":null,"work_id":"382ba82a-9506-4876-ade7-776c26fad436","year":2012},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.491706Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:08b9f01fe49d43046d97dd1ef6714e90e3827ba55f049e9308716d1c3a13b480","observation_id":"8c3ea892-be37-4506-8930-8c055fa1d696","resolution":{"observed_at":"2026-08-15T18:00:16.830886Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.sigpro.2010.04.008","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.802131Z","title":"Signal Processing 90, 2899– 2910 (2010) https://doi.org/10.1016/j.sigpro.2010.04.008","venue":null,"work_id":"d4f5056f-f487-4f8d-854f-c6b040c96fad","year":2010},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.498576Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:cdea53ba5d80e41ca34f1a5e6d11d9273da91ec71c11c53af8827da9b8e362be","observation_id":"3b09f815-a5c5-4874-a471-06f266dad80e","resolution":{"observed_at":"2026-08-15T18:00:16.808319Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:16.508599Z","title":"International Journal of Approximate Reasoning 162 (2023) https://doi.org/10.1016/j.ijar.2023.109025","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.508599Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:b95d1dbd93eb9197d0b7a0073fe4cfcc81cfd22757d6cc8cd328c5e8356e817e","observation_id":"b133f6df-aa21-4ad5-a06a-b55f38bff1a3","resolution":{"observed_at":"2026-08-15T18:00:16.508599Z","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-15T18:00:18.137761Z","title":"MIT Press, USA (2009)","venue":null,"work_id":"357b7393-dbc1-4b94-a93f-820f9657e0f0","year":2009},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.517087Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:1a9ec1b702ffa112697763fafe269e9e590af0e80cb5b431a7bcd1a38dbdd94d","observation_id":"f5201353-cc33-42bb-80ba-94dc1e021450","resolution":{"observed_at":"2026-08-15T18:00:18.142850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:18.119805Z","title":"Journal of Machine Learning Research 15, 1–15 (2014)","venue":null,"work_id":"2219e583-b5de-4089-9c2f-93589955e3a7","year":2014},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.524978Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:cd47fd2c51dbdf9fc2336a08402c917d9171c4a25ccbd0d27d468cc8009fbecb","observation_id":"8db22864-4f60-496b-bafe-9a1d511ec3b4","resolution":{"observed_at":"2026-08-15T18:00:18.125534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:18.098892Z","title":"In: Dymarski, P","venue":null,"work_id":"4ddc7038-46d8-4caf-a6eb-56d3134d5b66","year":2011},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.531081Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:8ba006f71d1efa84c6d54e890643d75e30fb2304f5784a97d35eea3c383ded07","observation_id":"1418705c-7fbf-4fd3-a555-3f879963809d","resolution":{"observed_at":"2026-08-15T18:00:18.105711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:18.072113Z","title":"Annals of Applied Statistics 7(3), 1814–1835 (2013) https://doi.org/10.1214/ 13-AOAS657","venue":null,"work_id":"641a2db5-2f87-4e6d-b515-7b937b3fbfdd","year":2013},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.537377Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:ab26187505f9f558601250673cfe93e9905eced449db9f8e6261abc6e9e0510f","observation_id":"e00b8982-f2f7-4282-a2c6-d4132c74eb48","resolution":{"observed_at":"2026-08-15T18:00:18.084174Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15156","last_updated":"2025-04-21T14:58:35Z","snapshot_observed_at":"2026-08-17T02:16:16.469572Z","submitted_at":"2025-04-21T14:58:35Z","title":"Advanced posterior analyses of hidden Markov models: finite Markov chain imbedding and hybrid decoding","version":1},"cited_work":{"arxiv_id":"2504.15156","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.15156","snapshot_observed_at":"2026-08-15T18:00:17.469920Z","title":"Advanced posterior analyses of hidden Markov models: finite Markov chain imbedding and hybrid decoding","venue":"stat.ML","work_id":"3a1daad5-7cb0-431d-9247-7980b494ab0b","year":2025},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.543273Z"},"links":{"cited_paper":"/paper/2504.15156","citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:4c60cea9cefc2af15cafbeb6d447f317112ddfe9e15683a572dbf68a6b676a2a","observation_id":"1477bfcc-0c0d-4673-a393-2c0ab7bb1931","resolution":{"observed_at":"2026-08-15T18:00:17.477292Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cmp-lg/9805007","last_updated":"1998-05-19T16:43:26Z","snapshot_observed_at":"2026-07-07T01:34:10.308885Z","submitted_at":"1998-05-19T16:43:26Z","title":"Parsing Inside-Out","version":1},"cited_work":{"arxiv_id":"cmp-lg/9805007","doi":null,"metadata_source":"pith","pith_arxiv_id":"cmp-lg/9805007","snapshot_observed_at":"2026-08-15T18:00:17.435560Z","title":"Parsing Inside-Out","venue":"cmp-lg","work_id":"c3e16df0-ee0d-4d0c-8462-b17b71590422","year":1998},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.549692Z"},"links":{"cited_paper":"/paper/cmp-lg/9805007","citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:559cf99bcf932184dd1798e6bc681427b98e67799026d1d321354fec053071d0","observation_id":"d46cb9cc-e42a-42ec-b3e2-92c3bf49e8f4","resolution":{"observed_at":"2026-08-15T18:00:17.444161Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0022-0000(02)00009-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.782174Z","title":"Journal of Computer and System Sciences 65(3), 545–569 (2002) https://doi.org/10.1016/S0022-0000(02)00009-0","venue":null,"work_id":"c091b0e2-5f0f-4460-9aaf-a00fdbb1fba2","year":2002},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.556770Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:16d9c9df8deda98dedcfa7832ab6e4af084a238d98efc875fbe24ccc28030688","observation_id":"6246ba67-0f1c-44c1-8296-2f9845310a5b","resolution":{"observed_at":"2026-08-15T18:00:16.788793Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:16.562811Z","title":"In: Bayesian Statistics 9","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.562811Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:fb91ec8f360a1047ff3e7630b33428a44a6fe5d69e641f0019fa6b82718661c9","observation_id":"47ea3e02-8913-4c79-b752-aa4f7139a767","resolution":{"observed_at":"2026-08-15T18:00:16.562811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1212.2497","last_updated":"2012-10-19T15:07:27Z","snapshot_observed_at":"2026-08-15T00:42:29.278114Z","submitted_at":"2012-10-19T15:07:27Z","title":"Solving MAP Exactly using Systematic Search","version":1},"cited_work":{"arxiv_id":"1212.2497","doi":null,"metadata_source":"pith","pith_arxiv_id":"1212.2497","snapshot_observed_at":"2026-08-15T18:00:17.322981Z","title":"Solving MAP Exactly using Systematic Search","venue":"cs.AI","work_id":"15bbec20-4d66-4e3e-b043-d16594c6a4a7","year":2012},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.569359Z"},"links":{"cited_paper":"/paper/1212.2497","citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:0b0681de49874a8b17871c81278ac84be96096a41c9ab49ba59ad836405e1f1f","observation_id":"d9a7a5c0-f531-40dc-8b59-ed03c598f21f","resolution":{"observed_at":"2026-08-15T18:00:17.330673Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:16.575271Z","title":"Artificial Intelligence 42(2), 393–405 (1990) https: //doi.org/10.1016/0004-3702(90)90060-D","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.575271Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:c4603494bd8924610870fe34415036be6cc1790024bd68d8a1ab20599502ba39","observation_id":"8e952552-24ef-4ba7-b927-e392ffa2bd5d","resolution":{"observed_at":"2026-08-15T18:00:16.575271Z","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":"10.1016/0004-3702(93)90036-b","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.746351Z","title":"Artificial Intelligence 60(1), 141–153 (1993) https://doi","venue":null,"work_id":"928487ab-c2e5-44b1-893d-c6b0e4c43e9a","year":1993},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.582316Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:4991c668e93d92bb72b69920998a5c9dae4dca10dabddb2cda64fb09416f1110","observation_id":"3c576b45-f2c4-4b4d-a625-93713f26e26c","resolution":{"observed_at":"2026-08-15T18:00:16.753534Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:16.588617Z","title":"In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.588617Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:b77cec3248bddd027eb3ae738215014e8a36916603f6f02d5de9c87e30e28465","observation_id":"3e47c55b-ce9d-4989-87b8-22f754990b5c","resolution":{"observed_at":"2026-08-15T18:00:16.588617Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s40300-019-00152-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:00:16.725397Z","title":"METRON 77 (2018) https://doi.org/ 10.1007/s40300-019-00152-7","venue":null,"work_id":"f706f8c7-f4db-4f57-9d16-1ae09616778b","year":2018},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.594991Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:be143a10680e7aad0fc76d2464a0acdd4385d1c330f8f3ff37d73515d2fdcd71","observation_id":"12e84550-4738-4bcd-8782-a1e671184765","resolution":{"observed_at":"2026-08-15T18:00:16.732397Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:16.601458Z","title":"Journal of Applied Statistics 49(5), 1203–1234 (2022) https://doi.org/10.1080/02664763.2020.1858273","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.601458Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:c8d4f643c78f4f45c8cb467d3dcc2420a8b58e2c6a5b042d2e4c366c5cb184a1","observation_id":"08e993b7-dd9d-4a7a-aa06-ea7a71ca72b3","resolution":{"observed_at":"2026-08-15T18:00:16.601458Z","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-15T18:00:16.612521Z","title":"IMA Journal of Numerical Analysis 41(4), 2311–2330 (2020) https://doi.org/10.1093/imanum/draa038","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.612521Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:237f264cd890677f0d322811b3ce6672b8ceecb9ff520e7e85994dd539b65670","observation_id":"21e08a49-3160-4f21-a878-3affb10392cf","resolution":{"observed_at":"2026-08-15T18:00:16.612521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1305.1979","last_updated":"2014-07-07T07:25:40Z","snapshot_observed_at":"2026-08-15T00:18:27.536367Z","submitted_at":"2013-05-09T00:22:17Z","title":"Analytical Approach to Parallel Repetition","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.1979","snapshot_observed_at":"2026-08-15T18:00:16.619992Z","title":"The American Statistician 33, 143–144 (1979) https://doi.org/10.1080/00031305.1979.10482683","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.619992Z"},"links":{"cited_paper":"/paper/1305.1979","citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:d7a13b6982f541463c7a2f7069876a6f122ca0339c471fae0416a7221159fa9e","observation_id":"2870f70f-40d9-4fff-92bf-867b18263eab","resolution":{"observed_at":"2026-08-15T18:00:16.619992Z","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-15T18:00:18.049713Z","title":"Mas- ter’s thesis, University of Tartu (2023)","venue":null,"work_id":"b7c786f7-a166-48c1-92e5-e52ee462e5a7","year":2023},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.626878Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:3e47ddc3090389c3e0cf72f94e2d551daf9eaf3c1109acc77aa4097b0be5945c","observation_id":"587acc91-89af-431b-a20a-a3c2c03367b4","resolution":{"observed_at":"2026-08-15T18:00:18.057078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:18.023524Z","title":"share.neic.no (2018)","venue":null,"work_id":"487a4d9d-7b09-47a2-bc71-15aa2bdf84d1","year":2018},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.632776Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:f730c05af587fc32ee51f0d2f2ddf7c88214464ab98547bdb9c0b373417779cc","observation_id":"268e417e-3970-4e96-a65b-899cd4dca05d","resolution":{"observed_at":"2026-08-15T18:00:18.029720Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:18.002410Z","title":"Addison-Wesley, USA (1984)","venue":null,"work_id":"75a20eb8-730d-43e0-b8ee-96f05d60973e","year":1984},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.638797Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:50f4edc3f3979c5ca47a309dd8f41f22ca24a1546deb025ac2f231136eab9c6d","observation_id":"b1b13c9b-74d2-4cc4-96ca-b3c4abc60246","resolution":{"observed_at":"2026-08-15T18:00:18.008413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T18:00:16.644611Z","title":"Journal of Combinatorial Theory, Series A 116(1), 55–75 (2009) https://doi.org/10.1016/j.jcta.2008.05.005 36","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.644611Z"},"links":{"citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:d457e816ee7d5eb3f6bffe0034357c957fdde85558636d999641658ce6a75845","observation_id":"ba891a15-a475-464c-90fc-911a6b4e86e0","resolution":{"observed_at":"2026-08-15T18:00:16.644611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","latest_version":1,"primary_category":"stat.CO","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":6,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":7,"verified_exact":16,"verified_fuzzy":7},"total_outbound_references":41},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2507.19338."}