{"as_of":"2026-08-14T08:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:048069edbef66dfd19ef401af0abf5db083bd12e55b4ce6deca043656e190557","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:41:26.338830Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"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/2608.09546/citation-record","integrity":"/paper/2608.09546/integrity","json":"/paper/2608.09546/citation-record.json","paper":"/paper/2608.09546"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:41:26.227428Z","title":"On the approximability of numerical taxonomy (fitting distances by tree metrics).SIAM Journal on Computing, 28(3):1073–1085, 1999.doi:10.1137/S0097539796309764","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.227428Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:e9d9d539529bfd853534d5552cc57be92abfa804082481e0b5d62dd6b9b97ae0","observation_id":"476b61c7-b1e3-4f7e-92e1-8f91adbcc5cb","resolution":{"observed_at":"2026-08-11T15:41:26.227428Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13409","last_updated":"2025-03-17T17:38:37Z","snapshot_observed_at":"2026-08-07T16:57:08.842875Z","submitted_at":"2025-03-17T17:38:37Z","title":"A $(1+\\epsilon)$-Approximation for Ultrametric Embedding in Subquadratic Time","version":1},"cited_work":{"arxiv_id":"2503.13409","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.13409","snapshot_observed_at":"2026-08-11T15:41:26.827357Z","title":"A $(1+\\epsilon)$-Approximation for Ultrametric Embedding in Subquadratic Time","venue":"cs.DS","work_id":"187d2bcc-9057-43bd-832d-f526450b6dee","year":2025},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.246769Z"},"links":{"cited_paper":"/paper/2503.13409","citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:d30938c75adb6f5fd272c91d9ea8e51ef8fc840b00131b8898c310e117b9ae63","observation_id":"9080602e-5d1c-4d0e-b866-435ee4fbd2ad","resolution":{"observed_at":"2026-08-11T15:41:26.832344Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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.1016/j.jda.2012.04.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:41:26.529826Z","title":"A golden ratio parameterized algorithm for cluster editing.Journal of Discrete Algorithms, 16:224–233, 2012.doi:10.1016/j.jda.2012.04.001","venue":null,"work_id":"7f793c44-cf44-4d67-952a-eb687a65d654","year":2012},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.251814Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:67e108418ecee667d6392f124db2c6d21565e62a388f11d8a5f0e132f2fda416","observation_id":"579d79d3-ac64-4276-8661-2cac7de6bb7b","resolution":{"observed_at":"2026-08-11T15:41:26.534659Z","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-11T15:41:26.261637Z","title":"16 Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, and Lukas Vogl","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.261637Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:68df89ebba152563ec4720dac7705a5f764c895378c9526e70d4483f78aa9451","observation_id":"2dfdf512-8282-4f46-9ff1-5d6c82b0176f","resolution":{"observed_at":"2026-08-11T15:41:26.261637Z","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-11T15:41:27.084380Z","title":"Clustering with qualitative information","venue":null,"work_id":"ceaafcf8-830e-4183-9da9-715e3bf33ef3","year":2003},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.280105Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:bfe8d9e81e1ca7a9404e3631826a2ce0e9eb9ff2416d0c4ff956ddebad1fb340","observation_id":"002637ef-d6a9-45e7-9cc5-3c75492f713a","resolution":{"observed_at":"2026-08-11T15:41:27.089342Z","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.1016/j.jcss.2011.04.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:41:26.491709Z","title":"A2k kernel for the cluster editing problem.Journal of Computer and System Sciences, 78(1):211 – 220, 2012.doi:10.1016/j.jcss.2011.04.001","venue":null,"work_id":"6a66ec2a-865d-4007-9ba6-907af8d9432a","year":2012},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.289011Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:bc8e6fd85b7579bebe4a05255d3f55ba32596617c2f50e71878a4ebbbbaf2803","observation_id":"f3220e33-fdf8-43f0-9128-89723b8eac77","resolution":{"observed_at":"2026-08-11T15:41:26.496617Z","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-11T15:41:26.293271Z","title":"30 Vincent Cohen-Addad, Euiwoong Lee, Shi Li, and Alantha Newman","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.293271Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:fd4391711ec69d2d6766b984ceb35cf906d06118da09ddb64ae47a472f9db66f","observation_id":"2440103c-2763-437e-b652-21c7a504b6f0","resolution":{"observed_at":"2026-08-11T15:41:26.293271Z","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.1137/1.9781611978964.28","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:41:26.468882Z","title":"Tree violation distance under constraints","venue":null,"work_id":"845cd38b-f73a-43e4-9cf7-15e40550fcd1","year":2026},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.302700Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:89c4e24c9e5938731365d11572ee359c63dc13971fdb6304351d18e6cbd8400c","observation_id":"1981ff21-70fa-455f-bbf2-a36598bb66b0","resolution":{"observed_at":"2026-08-11T15:41:26.473360Z","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":"10.1609/aaai.v24i1.7684","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:41:26.415665Z","title":"51 Sampath K","venue":null,"work_id":"3b74c2c5-7851-40f5-a8c3-a5e34440139d","year":null},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.320717Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:c4ec190022f505f6769f262e9d802e22c52481b3d946dd76c700d902dfde89a1","observation_id":"7850d3f5-4493-4829-9875-ee7dd7d1b6e4","resolution":{"observed_at":"2026-08-11T15:41:26.420435Z","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":"10.1007/978-3-642-18381-2_29","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"54 Christian Komusiewicz and Johannes Uhlmann","venue":"Lecture notes in computer science","work_id":"0be23274-ba6f-432d-ab2e-922eab023ffd","year":null},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.329637Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:00c616d44290078684e6d6febd722ef1253049a5a5428783554fccf428f60847","observation_id":"e753990d-5cb3-4a7d-bcc0-364ed13a9328","resolution":{"observed_at":"2026-08-11T15:41:26.395966Z","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-11T15:41:26.334210Z","title":"Algorithms for hierarchical clustering: an overview","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.334210Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:f89e11b405bca85d758d03363ea3ae705c73dd9057ffed6a6a06f6f3643df541","observation_id":"cf40fceb-14a2-46aa-8eed-265f724d3ed6","resolution":{"observed_at":"2026-08-11T15:41:26.334210Z","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-11T15:41:26.325406Z","title":"Kimes, Yufeng Liu, David Neil Hayes, and James Stephen Marron","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.325406Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:735b1cd3810e119a6103dc6d38341b03f44b414a62d44fb6a0c3bf2a8d3e04f1","observation_id":"66064030-4da7-4b8e-ab06-de00c8c4ba66","resolution":{"observed_at":"2026-08-11T15:41:26.325406Z","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-11T15:41:26.338830Z","title":null,"venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":1962,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.338830Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:85b5a758b1bbba73ea50736287d7ef3a76d048d06d47b48cc0538b8d7e61d513","observation_id":"95c446ac-05d2-4537-8355-7e34936a34e4","resolution":{"observed_at":"2026-08-11T15:41:26.338830Z","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-11T15:41:27.100035Z","title":"Improved approximations for ultrametric violation distance","venue":null,"work_id":"816ba170-2808-40d7-b471-9430fb16e802","year":2024},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":1967,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.275695Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:3209bb2dfe28cd46d7cb6d04890f6a8f94aa9e0a94a5e8898e8137a682dac183","observation_id":"ab526f66-5a71-46d8-8b06-f95b609df0e2","resolution":{"observed_at":"2026-08-11T15:41:27.125116Z","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.1016/0022-2496(75)90028-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:41:26.514467Z","title":"15 Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, and Hanwen Zhang","venue":null,"work_id":"f38506ce-e2e4-46ec-8ce2-a2c367f6eda9","year":null},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":1975,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.256594Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:ed66eb331a902b105af52fe59ff5ae868de08d5bd89ae16d987cd265c48e3979","observation_id":"7ef196f2-3497-48f5-b7fe-b48078123108","resolution":{"observed_at":"2026-08-11T15:41:26.519387Z","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":"10.1007/bf01188585","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:41:26.445344Z","title":"A robust model for finding optimal evolutionary trees.Algorithmica, 13:155–179, 1995.doi:10.1007/BF01188585","venue":null,"work_id":"215df687-6021-41eb-8c82-aefb8ad6affa","year":1995},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.311659Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:f643fa82edadd2c028e82d8b574e8243e5248a7e28fa6f84c5a3b6aab6cdc548","observation_id":"3b7599f2-154d-40cd-a9b9-242faa67d8af","resolution":{"observed_at":"2026-08-11T15:41:26.450032Z","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-11T15:41:26.241953Z","title":"8 Gabriel Bathie and Guillaume Lagarde","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.241953Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:766e975a22b4b725537b0deb8d8c5abad24cafa2d9d89258a6669ed9d17feea7","observation_id":"af67eb2e-26bf-4fe8-9c7f-17fc3d1824e3","resolution":{"observed_at":"2026-08-11T15:41:26.241953Z","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-11T15:41:27.068745Z","title":"Maximizing quadratic programs: Extending Grothendieck’s inequality","venue":null,"work_id":"97e7be3d-54bb-4487-a33e-af8d1b203ac4","year":2004},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.284608Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:363d3e35f60660f1e1c2cad1e59586d511814daf522e6c97201f72980b4467e5","observation_id":"2d0b8692-2f8a-4454-8308-3e8d68bc0cdb","resolution":{"observed_at":"2026-08-11T15:41:27.073882Z","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-11T15:41:26.270652Z","title":"Fitting tree metrics and ultrametrics in data streams","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.270652Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:1822ca0f5bd6e48f1a79840feeade7a129c406bbb0ec5d14c244f0bbd182bc18","observation_id":"401b6bcd-6344-4371-89e5-2da055c01833","resolution":{"observed_at":"2026-08-11T15:41:26.270652Z","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-11T15:41:26.232881Z","title":"Aggregating inconsistent information: Ranking and clustering.J","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.232881Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:da51565663ea5f9b601cb3f78bf929838caf890b325a083246e114dc210ee0f7","observation_id":"0710fb83-964b-407a-bec7-ab8153f252d2","resolution":{"observed_at":"2026-08-11T15:41:26.232881Z","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.jcss.2014","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T15:41:26.430644Z","title":"04.015,doi:10.1016/J.JCSS.2014.04.015","venue":null,"work_id":"65cf4602-c429-40b9-80cb-e71d36dee13a","year":2014},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.315917Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:38931bed92b2dca8cd44f821159e42499ccb4b7fe679ecda60f9e84c4e14be07","observation_id":"14e8de01-a2ec-434c-a9f8-d6463a617833","resolution":{"observed_at":"2026-08-11T15:41:26.435172Z","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-11T15:41:26.297719Z","title":"34 Peter Damaschke","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.297719Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:0e88626b067759c65495f49c4365fb57e3280ccced7147720c33e7ca191b81a3","observation_id":"ef54d466-2225-4a4c-80f1-b6bde9fcc8e1","resolution":{"observed_at":"2026-08-11T15:41:26.297719Z","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-11T15:41:26.307075Z","title":"38 ChenglinFan, BenjaminRaichel, andGregoryVanBuskirk","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.307075Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:f55f83149f88dd4dcac20e07c34845af43cca7dea8b96085d956ae365e3ca832","observation_id":"00d86094-878e-4547-b42c-7a2de9e18232","resolution":{"observed_at":"2026-08-11T15:41:26.307075Z","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-11T15:41:26.266046Z","title":"17 Yixin Cao and Jianer Chen","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.266046Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:a7f1f373488375883b04fdb733ea1186bd9bb45bdb01287970ff1d284d62590c","observation_id":"037ccd20-138e-42c8-b349-f477d8bc6725","resolution":{"observed_at":"2026-08-11T15:41:26.266046Z","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-11T15:41:26.237373Z","title":"6 Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, and Muli Safra","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-11T15:41:26.237373Z"},"links":{"citing_paper":"/paper/2608.09546"},"observation_digest":"sha256:505a745f797cd5bfe29232977e52e0ece9e2de2dba2c3d4cc39a33bca3998d52","observation_id":"cff74366-7660-4646-b473-2dd6dac6015f","resolution":{"observed_at":"2026-08-11T15:41:26.237373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.09546","last_updated":"2026-08-10T12:45:25Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T23:45:01.727266Z","submitted_at":"2026-08-10T12:45:25Z","title":"Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":12,"verified_exact":8,"verified_fuzzy":3},"total_outbound_references":25},"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 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2608.09546."}