{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BMEXWDLGUTHZAJRRJP4EKD2KSH","short_pith_number":"pith:BMEXWDLG","schema_version":"1.0","canonical_sha256":"0b097b0d66a4cf9026314bf8450f4a91d824cf43556988ccc8a791a4f53acef7","source":{"kind":"arxiv","id":"2509.08433","version":1},"attestation_state":"computed","paper":{"title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LO","cs.SC","math.CT","math.IT"],"primary_cat":"cs.DB","authors_text":"Jos\\'e-Luis Vilchis Medina (ENSTA Bretagne, Lab-STICC, Lab-STICC_ROBEX)","submitted_at":"2025-09-10T09:26:50Z","abstract_excerpt":"This article proposes a paraconsistent framework for evaluating similarity in knowledge bases. Unlike classical approaches, this framework explicitly integrates contradictions, enabling a more robust and interpretable similarity measure. A new measure $ S^* $ is introduced, which penalizes inconsistencies while rewarding shared properties. Paraconsistent super-categories $ \\Xi_K^* $ are defined to hierarchically organize knowledge entities. The model also includes a contradiction extractor $ E $ and a repair mechanism, ensuring consistency in the evaluations. Theoretical results guarantee refl"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.08433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-09-10T09:26:50Z","cross_cats_sorted":["cs.IT","cs.LO","cs.SC","math.CT","math.IT"],"title_canon_sha256":"b64c457af150e176704e9bb88805e364bbc87c250564345095a6ad096edbafd0","abstract_canon_sha256":"eb2a8578401302b2044213e6d5760e5981801056b98181127e422aafce52ce52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:30.030990Z","signature_b64":"wBhSJOXrgGfBRTJsBGElU2SkNK6H2aZkooCuoNZjYQZtvXh8RPiCYw3GxxsNB1pIS11YGqimDCuup+ZOZbCKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b097b0d66a4cf9026314bf8450f4a91d824cf43556988ccc8a791a4f53acef7","last_reissued_at":"2026-07-05T12:08:30.030390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:30.030390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Un cadre paraconsistant pour l'{\\'e}valuation de similarit{\\'e} dans les bases de connaissances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LO","cs.SC","math.CT","math.IT"],"primary_cat":"cs.DB","authors_text":"Jos\\'e-Luis Vilchis Medina (ENSTA Bretagne, Lab-STICC, Lab-STICC_ROBEX)","submitted_at":"2025-09-10T09:26:50Z","abstract_excerpt":"This article proposes a paraconsistent framework for evaluating similarity in knowledge bases. Unlike classical approaches, this framework explicitly integrates contradictions, enabling a more robust and interpretable similarity measure. A new measure $ S^* $ is introduced, which penalizes inconsistencies while rewarding shared properties. Paraconsistent super-categories $ \\Xi_K^* $ are defined to hierarchically organize knowledge entities. The model also includes a contradiction extractor $ E $ and a repair mechanism, ensuring consistency in the evaluations. Theoretical results guarantee refl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08433","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.08433/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.08433","created_at":"2026-07-05T12:08:30.030461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08433v1","created_at":"2026-07-05T12:08:30.030461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08433","created_at":"2026-07-05T12:08:30.030461+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMEXWDLGUTHZ","created_at":"2026-07-05T12:08:30.030461+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMEXWDLGUTHZAJRR","created_at":"2026-07-05T12:08:30.030461+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMEXWDLG","created_at":"2026-07-05T12:08:30.030461+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BMEXWDLGUTHZAJRRJP4EKD2KSH","json":"https://pith.science/pith/BMEXWDLGUTHZAJRRJP4EKD2KSH.json","graph_json":"https://pith.science/api/pith-number/BMEXWDLGUTHZAJRRJP4EKD2KSH/graph.json","events_json":"https://pith.science/api/pith-number/BMEXWDLGUTHZAJRRJP4EKD2KSH/events.json","paper":"https://pith.science/paper/BMEXWDLG"},"agent_actions":{"view_html":"https://pith.science/pith/BMEXWDLGUTHZAJRRJP4EKD2KSH","download_json":"https://pith.science/pith/BMEXWDLGUTHZAJRRJP4EKD2KSH.json","view_paper":"https://pith.science/paper/BMEXWDLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08433&json=true","fetch_graph":"https://pith.science/api/pith-number/BMEXWDLGUTHZAJRRJP4EKD2KSH/graph.json","fetch_events":"https://pith.science/api/pith-number/BMEXWDLGUTHZAJRRJP4EKD2KSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMEXWDLGUTHZAJRRJP4EKD2KSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMEXWDLGUTHZAJRRJP4EKD2KSH/action/storage_attestation","attest_author":"https://pith.science/pith/BMEXWDLGUTHZAJRRJP4EKD2KSH/action/author_attestation","sign_citation":"https://pith.science/pith/BMEXWDLGUTHZAJRRJP4EKD2KSH/action/citation_signature","submit_replication":"https://pith.science/pith/BMEXWDLGUTHZAJRRJP4EKD2KSH/action/replication_record"}},"created_at":"2026-07-05T12:08:30.030461+00:00","updated_at":"2026-07-05T12:08:30.030461+00:00"}