{"as_of":"2026-08-14T07:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b06aecf09aef480e6ed14bb4df2c0be60a200b091d0fb26e826d371f2ae79c9","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:18:56.910642Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2501.05529/citation-record","integrity":"/paper/2501.05529/integrity","json":"/paper/2501.05529/citation-record.json","paper":"/paper/2501.05529"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:56.668320Z","title":"Bauer, B","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.668320Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:6c830187830acad190f78b3ea8f061bd37772e0adc887c0378b06fc81d2c10bb","observation_id":"fcd84e47-af51-4a4d-be73-c660f714b3ef","resolution":{"observed_at":"2026-08-10T21:18:56.668320Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:56.674032Z","title":"Beketayev, D","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.674032Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:89ce14ee5f3457a6dc94dddc8ca0a1d343321aa77f35a6048a222a98195ba1cb","observation_id":"bc8693be-0e58-4364-be5c-b9604d58a136","resolution":{"observed_at":"2026-08-10T21:18:56.674032Z","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-10T21:18:56.679436Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.679436Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:fab0c30e88a613d7e2e26037ecd1d4d5b2f96b508f3f528fb9f3dff9b859b5e7","observation_id":"00312b0b-a350-4bea-acb5-80bfd24ea763","resolution":{"observed_at":"2026-08-10T21:18:56.679436Z","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/j.tcs.2004.12","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:57.144208Z","title":null,"venue":null,"work_id":"e1377ad6-a80f-479f-af92-897a7867103a","year":2005},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.685225Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:05097580f3bc5a203a0d8bd81c62c30270b7d1d813be1b634399a32c10bfd10a","observation_id":"36ff0001-622b-4c50-94df-0e6248b457ed","resolution":{"observed_at":"2026-08-10T21:18:57.151112Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.690929Z","title":"Bollen, P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.690929Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:416ee7e40a77359da21b29106966c6da00715da0615cc2fc5166ea3397984c93","observation_id":"daf4f871-6cc7-4e10-a294-10b2f717791e","resolution":{"observed_at":"2026-08-10T21:18:56.690929Z","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.1007/978-0-387-73301-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":null,"venue":"Texts and monographs in computer science","work_id":"75663447-0547-4df8-b79f-8d8a10c8efb9","year":2009},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.695987Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:601a388e107d7cbf0475225df9b7bff3409b1795e390784a922bba4ad5d35a35","observation_id":"829d1d4f-5174-41f8-82db-ab8aa6a9ccf9","resolution":{"observed_at":"2026-08-10T21:18:57.131410Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:59.075395Z","title":null,"venue":null,"work_id":"7fe93f52-5c93-4757-b57b-0802a7c55565","year":2000},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.701527Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:5ac9c56a27affc50aec697251295d9f38c7d10f71e5987a8b3e42d73f6fa81ac","observation_id":"38fb0b3e-2e46-4229-8508-5a19c6b94745","resolution":{"observed_at":"2026-08-10T21:18:59.080001Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1021/acs.jpca.3c02582","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:57.110502Z","title":"Chakraborty, R","venue":null,"work_id":"d31f8593-f333-4043-a22d-8112cb6fe689","year":2023},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.706415Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:2183851a7931967bf0c156c9258a6c810d768c668690b5e09d4e92ce3f060db8","observation_id":"05971fd5-c09d-48ad-be06-291d50e46168","resolution":{"observed_at":"2026-08-10T21:18:57.115851Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.711233Z","title":"Chazal, D","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.711233Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:cc0fec17fc5cfe2831399279f7e49ff24913d08c9a4d035e444f856a4318de37","observation_id":"11bde527-6f3a-4fbf-9554-412b18243d04","resolution":{"observed_at":"2026-08-10T21:18:56.711233Z","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-10T21:18:59.061069Z","title":"Cohen-Steiner, H","venue":null,"work_id":"7ae22f06-4c31-458d-874a-277c63d85496","year":2007},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.716458Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:8e58418f8b35e0c38010feba898e2a722c3b9f49fac1972f5f9812bf70292c6e","observation_id":"21c46d8f-f3ea-4c31-8cf7-3f137f09e2c7","resolution":{"observed_at":"2026-08-10T21:18:59.065582Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:59.045900Z","title":"Dagum and R","venue":null,"work_id":"0cbe0dfa-b04d-43d9-97ac-9ce04b476c16","year":1998},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.721093Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:20cb8bd47c9bb7f0cb4990f8491780e89e4d190f284bc59a935942f376306210","observation_id":"bb2eedb3-7417-4367-b119-c796b905c670","resolution":{"observed_at":"2026-08-10T21:18:59.050907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:59.029838Z","title":"Edelsbrunner and J","venue":null,"work_id":"f71c9227-eeba-4fb8-8bf1-fc8d2fd633f8","year":2010},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.726087Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:55e06563b823874cb9b948ee3894e783082893e67b7ba7fcd2e6954ad058033e","observation_id":"c023dd6e-d9f7-4469-89bc-a9c81bb57369","resolution":{"observed_at":"2026-08-10T21:18:59.035545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.730799Z","title":"Edelsbrunner, D","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.730799Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:7be0bf011e7cedccefb325345468f5de6601780c774c33c46c2cc69db894f890","observation_id":"e4579ee5-1dc5-4574-baef-88e5f4377b9f","resolution":{"observed_at":"2026-08-10T21:18:56.730799Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:59.013723Z","title":null,"venue":null,"work_id":"9c0c048f-c51d-45e3-96b2-60603599e3dc","year":2010},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.734735Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:4b75dd490c9a179cbb7d48a5d55b1d7285b72e648dd2c11e417acc6538fc3c32","observation_id":"8c62729d-5921-4f77-8d37-13fefeb084f8","resolution":{"observed_at":"2026-08-10T21:18:59.018496Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-016","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:57.079779Z","title":null,"venue":null,"work_id":"65dde588-d877-45a4-87b5-7342706ee6a7","year":2016},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.743206Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:20900ae2c093c29ebf1f8d112088da08fd7c14f3e51adef0bc68bdb56d80de2a","observation_id":"4c2932f7-2227-4efa-8aac-991b5d84aeb3","resolution":{"observed_at":"2026-08-10T21:18:57.084616Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:58.997303Z","title":"Flum and M","venue":null,"work_id":"7116edec-6185-45de-8797-fb2a7b30f47e","year":2006},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.747522Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:40e51f12576e448054de40059d22c4e4e7defba07091d4a5be357e075b2fa1d9","observation_id":"23de036d-46dd-4223-9be7-16d13405d431","resolution":{"observed_at":"2026-08-10T21:18:59.002169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.00063","last_updated":"2022-02-02T18:19:36Z","snapshot_observed_at":"2026-08-14T07:22:02.555222Z","submitted_at":"2019-07-31T19:42:44Z","title":"Intrinsic Interleaving Distance for Merge Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00063","snapshot_observed_at":"2026-08-10T21:18:56.751383Z","title":"Gasparovic, E","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.751383Z"},"links":{"cited_paper":"/paper/1908.00063","citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:b2c8ccf95ee34ff2e5baaa62e1532bb253ff9f8c914235b5d64449025d1cfacd","observation_id":"13c28c64-b426-4cc6-9e1b-b4e1fd99ba1d","resolution":{"observed_at":"2026-08-10T21:18:56.751383Z","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-10T21:18:58.982251Z","title":"Heine, H","venue":null,"work_id":"7f00089c-e800-4eef-b82e-a6f378c99792","year":2016},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.756537Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:c45169d29304376a83aabb1edf56886551a6ea739c3d1be733fed70fe7a14c0f","observation_id":"480e68a3-1a25-474d-a1e5-170c13cbe398","resolution":{"observed_at":"2026-08-10T21:18:58.987452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:58.966893Z","title":"Hilaga, Y","venue":null,"work_id":"d02bda09-985c-4ecc-8fbd-dbea299b59bc","year":2001},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.761373Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:6319da0f00a8ca3543989f6f58910878ef4a2ee1f80c87ef0d7439762d4fd507","observation_id":"43d7ae1c-95fa-4057-a64a-29e448886035","resolution":{"observed_at":"2026-08-10T21:18:58.971501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.765822Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.765822Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:0380e8653aba8c1f75fade4907a4d2c3bd8e57660746cd88706d8cb8414eb399","observation_id":"07a839b5-a046-4f5b-9420-922d30642341","resolution":{"observed_at":"2026-08-10T21:18:56.765822Z","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.1111/cgf.13985","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:57.064053Z","title":null,"venue":null,"work_id":"eecccd6a-09b4-42f7-baaf-3e0b06e68a98","year":2020},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.770246Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:03f745b8438ec2541f6df92922824431502212acaf7f4718f374130684d4c5ef","observation_id":"dabccfaa-4284-4c5c-b79f-617048b700ce","resolution":{"observed_at":"2026-08-10T21:18:57.068885Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:58.949961Z","title":"Morozov, K","venue":null,"work_id":"ec6d0f42-69e0-48a1-989a-258fc0ce90c6","year":2014},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.774721Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:ff5c667552ff64c2f3844d7bd92078b9f6c46a7a1cd69cb6ecb041a1c5db3ef6","observation_id":"9a244415-e25e-4283-81c1-b0f5142156ef","resolution":{"observed_at":"2026-08-10T21:18:58.955260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.779095Z","title":"Morozov and G","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.779095Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:ca01ed416dda462edb13fe1924b06b152349c5d2ebdc4fa19d2989ae8520c5c1","observation_id":"da9504cf-8dbd-4bff-b35c-662310ea9ee4","resolution":{"observed_at":"2026-08-10T21:18:56.779095Z","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-10T21:18:58.933065Z","title":null,"venue":null,"work_id":"61fdeaba-1d10-45e9-983e-47f397a99b7d","year":null},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.783560Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:8960d4807738f6d4b1416b018740a9bbb732cc63ab0127c080dc792efb04b074","observation_id":"dd72c647-1630-470e-87da-2523e669b1d5","resolution":{"observed_at":"2026-08-10T21:18:58.938012Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.793053Z","title":"Narayanan, D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.793053Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:93419c148d0ca54d6500d10ca03dce37123394d604411638c6562b69ccd353e3","observation_id":"6bae1a05-9e02-48e7-93fe-cfa78892acc2","resolution":{"observed_at":"2026-08-10T21:18:56.793053Z","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-10T21:18:58.916053Z","title":"OpenMP Application Program Interface Version 3.0, May 2008","venue":null,"work_id":"ce00888f-9c55-4027-9bee-e843612d4d4d","year":2008},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.797445Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:bc4f21ddee73638b99b245c26e6c4d3c8af71c4fb11f24d4c580f1a414df9723","observation_id":"f10f975a-75ce-43f9-abb7-fcb15a3574c1","resolution":{"observed_at":"2026-08-10T21:18:58.922746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.801868Z","title":"Pont and J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.801868Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:ae7e020b59e508943e1a2abfd582a78cd46c14db57b81ecab9a05a79a617f1db","observation_id":"1921df78-157a-42bb-bc49-044629810899","resolution":{"observed_at":"2026-08-10T21:18:56.801868Z","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-10T21:18:56.806602Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.806602Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:e265aa13981e4949121ef6a682c4bb115712274e3a8818eb4434a6d8fbf02d8d","observation_id":"85104003-4428-4809-a9d5-b25ed4c3328a","resolution":{"observed_at":"2026-08-10T21:18:56.806602Z","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-10T21:18:56.810947Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.810947Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:64dde63898ccfe2da2e72ca7d6be523d1b49fd6543ee5f9887218dab9bbc1764","observation_id":"18a058ba-7a79-489f-b3e4-f808bb12cdf6","resolution":{"observed_at":"2026-08-10T21:18:56.810947Z","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-10T21:18:58.900372Z","title":null,"venue":null,"work_id":"876cc84e-3658-4855-abe7-c360cd533b46","year":2004},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.815594Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:fd4e7f254f926a26edcbab5f117f980156253b99fb778f3ede48cdd598b31c5d","observation_id":"5f8a2fa6-4875-4ff0-baa5-9eefbcb5ed86","resolution":{"observed_at":"2026-08-10T21:18:58.905025Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.820131Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.820131Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:958245525da651fb1e46c6cb0fa400e4c135ed0187c80512e55e73bd88910d03","observation_id":"31fd58b4-b6d7-4622-aa63-c160243f3c7b","resolution":{"observed_at":"2026-08-10T21:18:56.820131Z","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-10T21:18:56.825458Z","title":"Saikia, H","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.825458Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:7346cfe16ef45dedc42c5e7e212901d41e14e49d71ac2204e9544c59a7616abd","observation_id":"bdbeb438-1f61-460f-968f-f5ccaf6aef30","resolution":{"observed_at":"2026-08-10T21:18:56.825458Z","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/0020-0190(77)90064-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:57.018989Z","title":null,"venue":null,"work_id":"59188141-b480-4728-b6ce-689a7bf39a87","year":1977},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.830049Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:d9928885447468539591f5f91f38976c156764bc63b56bb82a7052bf99f6cbea","observation_id":"9d81a1a3-88d7-4a7e-9d23-3d163b50f1b2","resolution":{"observed_at":"2026-08-10T21:18:57.023760Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.834832Z","title":"Sridharamurthy, T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.834832Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:3d3541c4eaa65e9e66c137ad266b3f8e768f7c24c905118472808b7452953884","observation_id":"81ced0df-913d-4046-9337-859becd76285","resolution":{"observed_at":"2026-08-10T21:18:56.834832Z","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-10T21:18:56.839600Z","title":"Sridharamurthy and V","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.839600Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:51d9c57b5827bb49c6d82e8342e1d172da41dec45e1c309980be3fbb9267f1ba","observation_id":"ae145c89-4791-45a9-9c50-6d4e1bae4e5c","resolution":{"observed_at":"2026-08-10T21:18:56.839600Z","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-10T21:18:58.884480Z","title":"Taylor, A","venue":null,"work_id":"186bbc84-91e1-40ca-91e2-297555ca06c2","year":2008},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.844250Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:2eaa9c5478460892497f3d41dfdaa461bf14dcc5506fabf552b94fcb523ae831","observation_id":"419620c9-0ade-42f8-8dc8-f2f8af14ffa5","resolution":{"observed_at":"2026-08-10T21:18:58.889150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tvcg.2013.148","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:57.002463Z","title":null,"venue":null,"work_id":"e5bf0425-5891-44b0-82eb-a16fbf847ba9","year":2013},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.848752Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:fe31d9479ad6c544b961df989f214b28853cdd7faef661299e7454b51695b6b6","observation_id":"13b86aec-314c-4262-b602-675c0217a506","resolution":{"observed_at":"2026-08-10T21:18:57.008351Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.853121Z","title":"Tierny, G","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.853121Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:ce11bd2c0ac0fe784e001a92e65cb020eb26337bcfc876404699705dc21e5ad4","observation_id":"e4e86cb9-0d59-4486-b88c-30b8f6e9229a","resolution":{"observed_at":"2026-08-10T21:18:56.853121Z","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-10T21:18:58.868778Z","title":"Weinkauf and H","venue":null,"work_id":"5f3dac49-46f1-4e30-827a-94e00906540e","year":2010},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.857543Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:1edf0fb13c9a2461c520f8d70436ad184997dd8d0e4a1c635fe95ae9d0a2f4a2","observation_id":"57214d02-dce5-4a58-9640-f4a5d3e9647f","resolution":{"observed_at":"2026-08-10T21:18:58.873583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.861959Z","title":"Wetzels, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.861959Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:e31fe316f68aba886d38fe210ffbb53096ba23519ea4f101b5693d0f587b1cac","observation_id":"336b6227-b3dd-4b46-99dc-513a80786be6","resolution":{"observed_at":"2026-08-10T21:18:56.861959Z","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-10T21:18:56.866294Z","title":"Wetzels and C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.866294Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:6823f2021dc35cc29d37d54f52fc9e8eb7abe2770591fea799a4b9f0142466ec","observation_id":"b0ebf6bb-bf0e-40e1-8153-22a522b05bcd","resolution":{"observed_at":"2026-08-10T21:18:56.866294Z","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-10T21:18:58.853775Z","title":"Wetzels, H","venue":null,"work_id":"e6970fe0-0b18-4f19-918d-c6f4632eb9e0","year":null},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.870487Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:beaca485234b79e867e13ddca50f704c9b3cc2e3f0cb6e2749d08b07f603b0b9","observation_id":"535247f9-806c-4a4e-9756-48ad2cecc081","resolution":{"observed_at":"2026-08-10T21:18:58.858477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:58.837450Z","title":"Wetzels, H","venue":null,"work_id":"0892e47f-1f89-4052-b037-790a777bac1e","year":2025},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.878916Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:dd947f32f97001b05441c0ed64362f70e1161cc9a9f8070f2c73b888b6f196f7","observation_id":"1c97c10e-c3a4-4962-ad7d-9525a7a9559e","resolution":{"observed_at":"2026-08-10T21:18:58.842740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.883089Z","title":"Wetzels, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.883089Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:0a318b0c7edc1e6b20a159d68d05f8459d6e30074f1f0ef65bf43f23712b0a04","observation_id":"048fb73b-496d-4f96-ac98-6bed552ac63d","resolution":{"observed_at":"2026-08-10T21:18:56.883089Z","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-10T21:18:56.887520Z","title":"Wetzels, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.887520Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:e85c9afefce6c45b3fdaceaa63a2ec2addb5bfb8ad41d72e489e5fe915514f32","observation_id":"342419e9-a91f-4c3b-a8ae-57312b5ae1d9","resolution":{"observed_at":"2026-08-10T21:18:56.887520Z","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-10T21:18:56.891654Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.891654Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:86cf765cb741a9809952f1d2231690b6f868ed059c4efba4fbffa51a6cf9e56b","observation_id":"8dee2312-9528-4d80-8223-5a4732610542","resolution":{"observed_at":"2026-08-10T21:18:56.891654Z","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-10T21:18:56.896698Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.896698Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:a35d8665d00a1a4b59d4d9fb1658d32ef2119620a793a8847093ca0f745483ad","observation_id":"002dd472-f472-45ae-b9a4-6018a86a0678","resolution":{"observed_at":"2026-08-10T21:18:56.896698Z","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-10T21:18:56.901195Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.901195Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:9f8ed0a4027f1732558892646abee3f10864d79dea84290adf8a61f80897e878","observation_id":"1555d725-6804-46a1-86a6-5db5ca7f0a3e","resolution":{"observed_at":"2026-08-10T21:18:56.901195Z","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.1007/bf01975866","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:56.943759Z","title":null,"venue":null,"work_id":"7c32d5c3-2878-4a73-82a4-c70567a40e08","year":1996},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.906104Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:10f6afa28c7f4eee72eec37c25def7525bb120112eef7e5f18760c62f71cc4c3","observation_id":"6c2afdb4-f500-4e17-837e-f24ffefc4b07","resolution":{"observed_at":"2026-08-10T21:18:56.950095Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:58.821458Z","title":"Zhang, R","venue":null,"work_id":"d62839d0-a710-43e5-9f5c-9979823098e0","year":1992},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.910642Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:d73e3e94f70829403cbc0d8b2cfa5b18ad6d441cea9ce6ba9dfb39a6cbc66177","observation_id":"8d024353-0d7e-4dee-8fa8-e135366233c3","resolution":{"observed_at":"2026-08-10T21:18:58.826683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.788164Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":1957,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.788164Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:3b55fe50688b00d7890215294e3cb1628171428682ac117a900a566afb636cc0","observation_id":"fb478a19-96c1-4015-9759-363c7d6d9a9b","resolution":{"observed_at":"2026-08-10T21:18:56.788164Z","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/j.entcs.2012.05.006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:18:57.095190Z","title":null,"venue":null,"work_id":"dd9a6414-8da8-4066-b1de-8ed78bb46128","year":2012},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.739012Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:c3345121b16674680eb014dda266a1ccb6aad4e5e6440f28254943f34b81ace0","observation_id":"bbcf704c-3410-4979-abf9-d48856ffc853","resolution":{"observed_at":"2026-08-10T21:18:57.099789Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-10T21:18:56.874535Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.874535Z"},"links":{"citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:d10749cae6ea57cc27297c22da7c538f1f62d864eb4800e4b23b541c60e82eff","observation_id":"d695311b-ba86-4b3f-870c-4ab8afb0b7f5","resolution":{"observed_at":"2026-08-10T21:18:56.874535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-14T03:04:04.077561Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":9,"verified_fuzzy":12},"total_outbound_references":53},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2501.05529."}