{"as_of":"2026-08-09T22:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6a72fa354629c5c088a65b2b273d0e2ec75924e07f109780d59f36d4c89708f0","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T20:47:06.522094Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2509.08433/citation-record","integrity":"/paper/2509.08433/integrity","json":"/paper/2509.08433/citation-record.json","paper":"/paper/2509.08433"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:47:09.117222Z","title":"Probabilistic logic under co- herence, model-theoretic probabilistic logic, and de- fault reasoning in system p","venue":null,"work_id":"5e7466af-0a33-4413-a2a9-0f53a9a59b63","year":2002},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.205605Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:6a397c145077b9d82d75c10d866aab85a73072b0577c651f3257be290eb8ab44","observation_id":"bf98fe66-0498-4816-825a-bb0248bb6802","resolution":{"observed_at":"2026-08-04T20:47:09.120900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.138372Z","title":"Théorème 3 (Cohérence après réparation)","venue":null,"work_id":"a265b39e-20ce-4f5d-af97-d34983c14007","year":null},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.039458Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:1ddaec94627056b0f0700a4bb122d0be675a61e062ca5c56d35befc169e1e038","observation_id":"48deeca0-aa59-4866-9fdd-0290679c5e74","resolution":{"observed_at":"2026-08-04T20:47:09.141515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.127970Z","title":"(19) Même après réparation, K1 et K ′ 2 ne dépassent pas le seuil de regroupement","venue":null,"work_id":"27c55034-1dd5-4157-9219-b0b091bfaf28","year":null},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.111108Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:43b104a3a159413434bccee005868f770384c36d4b924018784e366d312ae83d","observation_id":"2c32cad5-1205-4485-a4d5-9b0f9d7b3fcc","resolution":{"observed_at":"2026-08-04T20:47:09.131303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.087927Z","title":"The tractability of subsumption in frame-based description languages","venue":null,"work_id":"84aab7cd-3b9c-4a7d-a9f9-41e21bc4c51b","year":1984},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.597867Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:1899481ad1f8673a4a94a9be92dbe5e19a9569df85649621284bdc305a366747","observation_id":"c57b5cf6-4fd6-4006-8960-d13b353ea2b5","resolution":{"observed_at":"2026-08-04T20:47:09.091751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.106960Z","title":"A mea- sure of similarity between graph vertices : Applica- tions to synonym extraction and web searching.SIAM review, 46(4) :647–666, 2004","venue":null,"work_id":"b7147efe-2841-4bdb-89da-43d59b9501a3","year":2004},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.326398Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:47634c5891ba3b39e6620191007ea91516da7e3089a235568e37eb5575176662","observation_id":"52c09276-82d3-406a-9318-278fe735e3b5","resolution":{"observed_at":"2026-08-04T20:47:09.110490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:04.439045Z","title":"Knowledge representation and reasoning","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.439045Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:16aaff3c1fd54a0ba9dada95e2e7206a7a8818e066f24cfbcd678ac8f587d9c5","observation_id":"302c7b76-438e-4ff3-95cd-98b050ef6fb3","resolution":{"observed_at":"2026-08-04T20:47:04.439045Z","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-04T20:47:09.066405Z","title":"On the theory of inconsistent formal systems","venue":null,"work_id":"bf7b1c38-2cfb-44b6-9e13-b1d805d6b168","year":1974},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.871548Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:d5ba428c49e40422078c1463f82d4c965c1d26df762f5e05e00d0e03897dda5d","observation_id":"27c3f6eb-9fa0-487f-8a66-67fa74a155c4","resolution":{"observed_at":"2026-08-04T20:47:09.069728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.11175","last_updated":"2018-04-12T17:03:44Z","snapshot_observed_at":"2026-07-06T06:30:55.970076Z","submitted_at":"2018-03-29T17:43:03Z","title":"Universal Sentence Encoder","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.11175","snapshot_observed_at":"2026-08-04T20:47:04.735503Z","title":"Universal sentence encoder","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.735503Z"},"links":{"cited_paper":"/paper/1803.11175","citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:41867e6d9af4d9b5eef2e62ca192d7b34cf97bf7d724971aebae66db473f24bf","observation_id":"4db9106b-13f4-4cd2-bfbe-f75fdf15e7f7","resolution":{"observed_at":"2026-08-04T20:47:04.735503Z","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-04T20:47:09.076765Z","title":"Semantic mo- deling of natural scenes based on contextual bayesian networks","venue":null,"work_id":"ba540bea-185b-466d-9a28-c83c8600e802","year":2010},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.801229Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:05aabc3e72a16f98f132e4a477e21955ed037a4efda0160ce015169341774127","observation_id":"d6c441b1-8d11-45fc-adf1-629365802918","resolution":{"observed_at":"2026-08-04T20:47:09.080649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.038024Z","title":"A survey of graph edit distance","venue":null,"work_id":"dc002237-de49-418c-a815-86f2cfd0f0b2","year":2010},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.199200Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:98cc19678e646a197c8f5c1515e22ae7fd1987c9739b217e1905a3b8897758b7","observation_id":"1942ad5c-d7e7-4c83-91b1-ba35353067d8","resolution":{"observed_at":"2026-08-04T20:47:09.041121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.056702Z","title":"Bert : Pre-training of deep bidi- rectional transformers for language understanding","venue":null,"work_id":"04f63a9b-8103-4b00-b2bc-960fa1b58cc9","year":2019},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:04.972240Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:6360216b42de601585dc69b79937235af865ae84e30f57c374844f26ea75e933","observation_id":"63bb7b8d-445f-400e-a690-a1439e9336d9","resolution":{"observed_at":"2026-08-04T20:47:09.060044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.047282Z","title":"Ontology matching : A machine lear- ning approach","venue":null,"work_id":"fcc02e80-865c-4532-8a91-39ee9191bffe","year":2004},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.114986Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:ea72eb5f5700133a56e54b9597f12d1dafbddd1b627fdc4a3eef982212d48c4c","observation_id":"99aa74b6-2f43-4383-9913-3b6793fdbd5a","resolution":{"observed_at":"2026-08-04T20:47:09.050497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.010732Z","title":"An over- view of ontoclean","venue":null,"work_id":"cca36823-966c-4e1a-85ab-9e7b5b4cca36","year":2009},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.584466Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:522575e960f01c32edd5c04a010a550bf99a7ecc1aa1d52e9ee8f07b2007a398","observation_id":"da03abec-df13-4b37-a447-41d603265ee7","resolution":{"observed_at":"2026-08-04T20:47:09.013835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.029608Z","title":"Goldstone and J.Y","venue":null,"work_id":"c94b4901-e65c-4713-903d-c93f03e74c28","year":2012},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.373892Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:1b50e8ad3ac4d9c32e3f31f3e708bbabcb932fe0e04a2e2d085040a012838955","observation_id":"d78c3465-7b2c-4f5f-885a-fc4e6a0af8ae","resolution":{"observed_at":"2026-08-04T20:47:09.032534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.020514Z","title":"Description logic programs : Combi- ning logic programs with description logic","venue":null,"work_id":"9f593b30-4bac-4066-8fbd-b522490338a7","year":2003},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.513538Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:729510bd19bc9fa3fe3aaa9fb6f68dc451acb019450a113681838c302ca5f0d9","observation_id":"f4a6b750-ea37-49f0-b162-287eb1199fe3","resolution":{"observed_at":"2026-08-04T20:47:09.023685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:08.847990Z","title":"Incomplete data : what went wrong, and how to fix it","venue":null,"work_id":"0654abc8-b518-496a-99de-88bae8d1668a","year":2014},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.728070Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:6ff85b7c9277d947725a8ed4172e8b488c9d08703ebd07f3e57003f72d8c4421","observation_id":"a11d87e5-e750-4ad2-a0cd-289c4670d125","resolution":{"observed_at":"2026-08-04T20:47:08.873919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:08.981362Z","title":"Probabilistic latent semantic in- dexing","venue":null,"work_id":"74c4aaf8-c8c6-42b9-97a2-3f03569cf311","year":1999},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.656167Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:b2683cb88965076016cd84b55759526a31139f36584a7f6cab995dbd6c7c1aee","observation_id":"d0e2934e-ea4b-43e4-9ff8-13ff43d9aeff","resolution":{"observed_at":"2026-08-04T20:47:09.003840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:08.925897Z","title":"Learning semantic similarity.Advances in neu- ral information processing systems, 15, 2002","venue":null,"work_id":"e7df80f0-8250-488f-8483-e8caf7aff4f7","year":2002},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.692986Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:0102a481260f49802a6dae0463a0ccb637a477f2aec758df17da377f5af34f77","observation_id":"b75a0b13-9f1e-4569-82a5-d0b5b133549b","resolution":{"observed_at":"2026-08-04T20:47:08.971011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:08.108421Z","title":"Probabilistic reasoning in intelligent sys- tems : networks of plausible inference","venue":null,"work_id":"3fa6be60-4b54-49db-9925-560193172261","year":2014},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.904258Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:393ac64c24315468bd806f4a01e4ec7848cc04fc8e23c4313ea77fb421a4e30f","observation_id":"77500d4f-4854-4410-946c-d0e7e70abf0f","resolution":{"observed_at":"2026-08-04T20:47:08.187126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:08.606659Z","title":"Some natural properties of strong- identification in inductive inference","venue":null,"work_id":"a658fc0b-b8f1-495b-8e10-f73fb456f749","year":1976},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.765402Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:ef6a15d36f5908fe744630bdbd33951855ce9e13410930a1ca9b376ff8b947e5","observation_id":"f57b0e9e-4248-4c44-84b8-27c110efa871","resolution":{"observed_at":"2026-08-04T20:47:08.692409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:08.354914Z","title":"Hamming distance metric learning","venue":null,"work_id":"fd305a52-c92b-4e56-986e-d8019a8e72e4","year":2012},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.819502Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:66e6ffbe8c2276b350d0c3ced54351a2b1b2802705e276948dfa1027c6ba8a30","observation_id":"c53946f7-246d-4261-b0e6-50b0a3a9ea71","resolution":{"observed_at":"2026-08-04T20:47:08.435879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:07.805682Z","title":"A logic for concepts and similarity","venue":null,"work_id":"133ccda7-6144-443d-9236-272f3569f48c","year":2007},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:06.071195Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:eda8d27b8c99452aeb6def22396ac1034313d64161a12239e226eda60dad0c3a","observation_id":"8ac2ffcd-7645-4496-a32a-456d0069f408","resolution":{"observed_at":"2026-08-04T20:47:07.885392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:09.148488Z","title":"Cependant, ces approches sont confrontées à des défis computationnels im- portants, notamment lorsqu’il s’agit de traiter de grandes bases de données","venue":null,"work_id":"1454a58e-ff90-4995-b820-b03bd9442dae","year":null},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:03.950718Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:92766ffebd688f8a192c541c7b25dce99d41a1222efa05e092a7771a24a69856","observation_id":"2b10e40e-d9ae-403c-b847-9f9aaa229ab5","resolution":{"observed_at":"2026-08-04T20:47:09.152140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:07.987351Z","title":"Beyond the limits of thought","venue":null,"work_id":"e7ca7f5c-1881-45c9-a11a-a6ec29d6184a","year":2002},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:05.955965Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:2ac8e33144c9d65430333cf908dfa380a1bd05fb39e21ef5bac1819c5fd4941a","observation_id":"9aac2e46-9418-464f-8cf9-6d89732363fb","resolution":{"observed_at":"2026-08-04T20:47:08.038438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cmp-lg/9511007","last_updated":"1995-11-29T19:32:04Z","snapshot_observed_at":"2026-07-07T01:33:45.075000Z","submitted_at":"1995-11-29T19:32:04Z","title":"Using Information Content to Evaluate Semantic Similarity in a Taxonomy","version":1},"cited_work":{"arxiv_id":"cmp-lg/9511007","doi":null,"metadata_source":"pith","pith_arxiv_id":"cmp-lg/9511007","snapshot_observed_at":"2026-08-04T20:47:06.605096Z","title":"Using Information Content to Evaluate Semantic Similarity in a Taxonomy","venue":"cmp-lg","work_id":"c93538f2-7e5b-4fa9-8893-24e1fb85dfd2","year":1995},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:06.014373Z"},"links":{"cited_paper":"/paper/cmp-lg/9511007","citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:aef3e3a226cdb8b076f44454455ad90caaed45f4820ae1e72637b2897d3c0415","observation_id":"90af2960-9111-43e6-8541-d5bee2dc0034","resolution":{"observed_at":"2026-08-04T20:47:06.658204Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:07.523263Z","title":"Ontology mat- ching : state of the art and future challenges","venue":null,"work_id":"6f7fc444-c5be-4e22-94e0-9a1ccfc5c556","year":2011},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:06.130706Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:107c735057b209a33a9a9a83b180849cd7e4282d7ced69c54bc1683734bff8d7","observation_id":"2f200c92-4a6f-41ee-b60e-120b056be42a","resolution":{"observed_at":"2026-08-04T20:47:07.688194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:07.417070Z","title":"Conceptual graphs","venue":null,"work_id":"996f31a4-9beb-414f-b54a-79534ee9718f","year":2008},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:06.184530Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:4c4ed0d21622cc9799db2f9462c4be7ec087d67924ba999d35c0dd96ebdff283","observation_id":"167b5854-fdaf-4ecb-b9c5-5c1e1c24a43c","resolution":{"observed_at":"2026-08-04T20:47:07.460170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:07.268937Z","title":"From frequency to meaning : Vector space models of semantics","venue":null,"work_id":"b28eb2ce-f4c7-4fca-b2d2-77a413ab5eee","year":2010},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:06.243211Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:8d0a108bb8d8febe322235af2d6030d45b8e23a835e15b8e5f72c4186f550ca8","observation_id":"5b3ffd28-8c39-4470-9025-9f5ed130341c","resolution":{"observed_at":"2026-08-04T20:47:07.294580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:07.158279Z","title":"Features of similarity","venue":null,"work_id":"d3914744-a358-4d00-832f-d4f617243333","year":1977},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:06.326965Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:1b71e40fb07586f284156dc0253aeaa154bece3d73a87ea1ebedd62077737239","observation_id":"35b0b217-a3a9-4669-a1dd-2005fe00e2bf","resolution":{"observed_at":"2026-08-04T20:47:07.211931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:07.021496Z","title":"Building intelligent da- tabases through similarity : Interaction of logical and qualitative reasoning","venue":null,"work_id":"dc3f7da0-04a3-4e52-840e-bff190f7de8b","year":2024},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:06.384400Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:46d7c17d30a5bdb2ed5b7576dd88abac6a03515f7ae9fe623c9ec0d2278405ee","observation_id":"3b670b95-a5a4-45a8-bb5f-53f92e0ab9f9","resolution":{"observed_at":"2026-08-04T20:47:07.070598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:06.880367Z","title":"Efficient approximate entity matching using jaro-winkler dis- tance","venue":null,"work_id":"d1e52fe7-fe2b-45cc-8e41-e733ebaccb18","year":2017},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:06.464899Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:311a4575784cbccd26b6919bc5aa30a89c82d6423579913be0edd664ce1c99d4","observation_id":"b71cadc0-40e7-49a3-8202-456e9e9bd46c","resolution":{"observed_at":"2026-08-04T20:47:06.932391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-04T20:47:06.771548Z","title":"A normalized levenshtein dis- tance metric","venue":null,"work_id":"59aa5a83-8f4f-4d69-8e48-85387001f066","year":2007},"citing_paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T20:47:06.522094Z"},"links":{"citing_paper":"/paper/2509.08433"},"observation_digest":"sha256:baf785028d367cfa073e4dfa481b731ea1039f09317ed5f52eb74b7997b484df","observation_id":"a71fdebe-e2f2-4a4d-b01e-03dcb13c71ea","resolution":{"observed_at":"2026-08-04T20:47:06.820813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.08433","last_updated":"2025-09-10T09:26:50Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-08T12:46:48.093391Z","submitted_at":"2025-09-10T09:26:50Z","title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":29},"total_outbound_references":32},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2509.08433."}