{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JY3I3PED2ULGGOLVG6PTOJVGPW","short_pith_number":"pith:JY3I3PED","schema_version":"1.0","canonical_sha256":"4e368dbc83d516633975379f3726a67db232187c4c3e919d33526a068e265f36","source":{"kind":"arxiv","id":"2505.16877","version":1},"attestation_state":"computed","paper":{"title":"Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bo Xiong, Daniel Hern\\'andez, Evgeny Kharlamov, Steffen Staab, Yuan He, Yuqicheng Zhu, Zifeng Ding","submitted_at":"2025-05-22T16:33:20Z","abstract_excerpt":"Uncertainty quantification in Knowledge Graph Embedding (KGE) methods is crucial for ensuring the reliability of downstream applications. A recent work applies conformal prediction to KGE methods, providing uncertainty estimates by generating a set of answers that is guaranteed to include the true answer with a predefined confidence level. However, existing methods provide probabilistic guarantees averaged over a reference set of queries and answers (marginal coverage guarantee). In high-stakes applications such as medical diagnosis, a stronger guarantee is often required: the predicted sets m"},"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":"2505.16877","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-22T16:33:20Z","cross_cats_sorted":[],"title_canon_sha256":"c938ea6d743936f440b820019e20dac4becd904d463a644cf8eef2fc490b69b6","abstract_canon_sha256":"c842f97a7a2fce099af0a7b95d9b3147b10ce4859809d900e426c469c74b4d6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:42.905743Z","signature_b64":"103odEeKexfKQoWqjn75yts2Cpt3zVWsx+y2ITtA9vnlWBA32TMwLMZINK67UkR3dl+zlvMcXz688bTjFTVpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e368dbc83d516633975379f3726a67db232187c4c3e919d33526a068e265f36","last_reissued_at":"2026-07-05T11:07:42.905235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:42.905235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bo Xiong, Daniel Hern\\'andez, Evgeny Kharlamov, Steffen Staab, Yuan He, Yuqicheng Zhu, Zifeng Ding","submitted_at":"2025-05-22T16:33:20Z","abstract_excerpt":"Uncertainty quantification in Knowledge Graph Embedding (KGE) methods is crucial for ensuring the reliability of downstream applications. A recent work applies conformal prediction to KGE methods, providing uncertainty estimates by generating a set of answers that is guaranteed to include the true answer with a predefined confidence level. However, existing methods provide probabilistic guarantees averaged over a reference set of queries and answers (marginal coverage guarantee). In high-stakes applications such as medical diagnosis, a stronger guarantee is often required: the predicted sets m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.16877","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/2505.16877/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":"2505.16877","created_at":"2026-07-05T11:07:42.905298+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.16877v1","created_at":"2026-07-05T11:07:42.905298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16877","created_at":"2026-07-05T11:07:42.905298+00:00"},{"alias_kind":"pith_short_12","alias_value":"JY3I3PED2ULG","created_at":"2026-07-05T11:07:42.905298+00:00"},{"alias_kind":"pith_short_16","alias_value":"JY3I3PED2ULGGOLV","created_at":"2026-07-05T11:07:42.905298+00:00"},{"alias_kind":"pith_short_8","alias_value":"JY3I3PED","created_at":"2026-07-05T11:07:42.905298+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06599","citing_title":"Direct Prediction Set Minimization via Bilevel Conformal Classifier Training","ref_index":109,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JY3I3PED2ULGGOLVG6PTOJVGPW","json":"https://pith.science/pith/JY3I3PED2ULGGOLVG6PTOJVGPW.json","graph_json":"https://pith.science/api/pith-number/JY3I3PED2ULGGOLVG6PTOJVGPW/graph.json","events_json":"https://pith.science/api/pith-number/JY3I3PED2ULGGOLVG6PTOJVGPW/events.json","paper":"https://pith.science/paper/JY3I3PED"},"agent_actions":{"view_html":"https://pith.science/pith/JY3I3PED2ULGGOLVG6PTOJVGPW","download_json":"https://pith.science/pith/JY3I3PED2ULGGOLVG6PTOJVGPW.json","view_paper":"https://pith.science/paper/JY3I3PED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.16877&json=true","fetch_graph":"https://pith.science/api/pith-number/JY3I3PED2ULGGOLVG6PTOJVGPW/graph.json","fetch_events":"https://pith.science/api/pith-number/JY3I3PED2ULGGOLVG6PTOJVGPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JY3I3PED2ULGGOLVG6PTOJVGPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JY3I3PED2ULGGOLVG6PTOJVGPW/action/storage_attestation","attest_author":"https://pith.science/pith/JY3I3PED2ULGGOLVG6PTOJVGPW/action/author_attestation","sign_citation":"https://pith.science/pith/JY3I3PED2ULGGOLVG6PTOJVGPW/action/citation_signature","submit_replication":"https://pith.science/pith/JY3I3PED2ULGGOLVG6PTOJVGPW/action/replication_record"}},"created_at":"2026-07-05T11:07:42.905298+00:00","updated_at":"2026-07-05T11:07:42.905298+00:00"}