{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VR7ETSDL4UZWV4GVVD5VCZWCFM","short_pith_number":"pith:VR7ETSDL","schema_version":"1.0","canonical_sha256":"ac7e49c86be5336af0d5a8fb5166c22b012af14c9f77a06fb7d368ada7b8b4a6","source":{"kind":"arxiv","id":"2011.10180","version":1},"attestation_state":"computed","paper":{"title":"Survey and Open Problems in Privacy Preserving Knowledge Graph: Merging, Query, Representation, Completion and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DB","authors_text":"Chaochao Chen, Guanfeng Liu, Jamie Cui, Jia Wu, Li Wang","submitted_at":"2020-11-20T02:35:47Z","abstract_excerpt":"Knowledge Graph (KG) has attracted more and more companies' attention for its ability to connect different types of data in meaningful ways and support rich data services. However, the data isolation problem limits the performance of KG and prevents its further development. That is, multiple parties have their own KGs but they cannot share with each other due to regulation or competition reasons. Therefore, how to conduct privacy preserving KG becomes an important research question to answer. That is, multiple parties conduct KG related tasks collaboratively on the basis of protecting the priv"},"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":"2011.10180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-11-20T02:35:47Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"c1033defdfd980f8902478b6c3081f6c4f44d7cca163755a6ddca1eea4f85590","abstract_canon_sha256":"4966f4c78469e3f3538ca9f19ad1798e08b38d8dff2d05a9791d22dcca142ce5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:12.099664Z","signature_b64":"QIWwqFH6Kab++ajKgOIqPfQL0OMj3kILRySbwpgUuUMAbQ43pct4YsM+PTBPr2QNCzKbqLFnFENXU1IMDgYQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac7e49c86be5336af0d5a8fb5166c22b012af14c9f77a06fb7d368ada7b8b4a6","last_reissued_at":"2026-07-05T01:53:12.099279Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:12.099279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Survey and Open Problems in Privacy Preserving Knowledge Graph: Merging, Query, Representation, Completion and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DB","authors_text":"Chaochao Chen, Guanfeng Liu, Jamie Cui, Jia Wu, Li Wang","submitted_at":"2020-11-20T02:35:47Z","abstract_excerpt":"Knowledge Graph (KG) has attracted more and more companies' attention for its ability to connect different types of data in meaningful ways and support rich data services. However, the data isolation problem limits the performance of KG and prevents its further development. That is, multiple parties have their own KGs but they cannot share with each other due to regulation or competition reasons. Therefore, how to conduct privacy preserving KG becomes an important research question to answer. That is, multiple parties conduct KG related tasks collaboratively on the basis of protecting the priv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.10180","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/2011.10180/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":"2011.10180","created_at":"2026-07-05T01:53:12.099339+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.10180v1","created_at":"2026-07-05T01:53:12.099339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10180","created_at":"2026-07-05T01:53:12.099339+00:00"},{"alias_kind":"pith_short_12","alias_value":"VR7ETSDL4UZW","created_at":"2026-07-05T01:53:12.099339+00:00"},{"alias_kind":"pith_short_16","alias_value":"VR7ETSDL4UZWV4GV","created_at":"2026-07-05T01:53:12.099339+00:00"},{"alias_kind":"pith_short_8","alias_value":"VR7ETSDL","created_at":"2026-07-05T01:53:12.099339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.20543","citing_title":"Enhancing Semantic Document Retrieval- Employing Group Steiner Tree Algorithm with Domain Knowledge Enrichment","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VR7ETSDL4UZWV4GVVD5VCZWCFM","json":"https://pith.science/pith/VR7ETSDL4UZWV4GVVD5VCZWCFM.json","graph_json":"https://pith.science/api/pith-number/VR7ETSDL4UZWV4GVVD5VCZWCFM/graph.json","events_json":"https://pith.science/api/pith-number/VR7ETSDL4UZWV4GVVD5VCZWCFM/events.json","paper":"https://pith.science/paper/VR7ETSDL"},"agent_actions":{"view_html":"https://pith.science/pith/VR7ETSDL4UZWV4GVVD5VCZWCFM","download_json":"https://pith.science/pith/VR7ETSDL4UZWV4GVVD5VCZWCFM.json","view_paper":"https://pith.science/paper/VR7ETSDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.10180&json=true","fetch_graph":"https://pith.science/api/pith-number/VR7ETSDL4UZWV4GVVD5VCZWCFM/graph.json","fetch_events":"https://pith.science/api/pith-number/VR7ETSDL4UZWV4GVVD5VCZWCFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VR7ETSDL4UZWV4GVVD5VCZWCFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VR7ETSDL4UZWV4GVVD5VCZWCFM/action/storage_attestation","attest_author":"https://pith.science/pith/VR7ETSDL4UZWV4GVVD5VCZWCFM/action/author_attestation","sign_citation":"https://pith.science/pith/VR7ETSDL4UZWV4GVVD5VCZWCFM/action/citation_signature","submit_replication":"https://pith.science/pith/VR7ETSDL4UZWV4GVVD5VCZWCFM/action/replication_record"}},"created_at":"2026-07-05T01:53:12.099339+00:00","updated_at":"2026-07-05T01:53:12.099339+00:00"}