{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:76DCEVJP2E4EAHQMV4WGWEXODN","short_pith_number":"pith:76DCEVJP","schema_version":"1.0","canonical_sha256":"ff8622552fd138401e0caf2c6b12ee1b62e44e81d87df0e68473c9a416aa1210","source":{"kind":"arxiv","id":"2507.18365","version":4},"attestation_state":"computed","paper":{"title":"RecPS: Privacy Risk Scoring for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.IR","authors_text":"Jiajie He, Keke Chen, Yuechun Gu","submitted_at":"2025-07-24T12:46:30Z","abstract_excerpt":"Recommender systems (RecSys) have become an essential component of many web applications. The core of the system is a recommendation model trained on highly sensitive user-item interaction data. While privacy-enhancing techniques are actively studied in the research community, the real-world model development still depends on minimal privacy protection, e.g., via controlled access. Users of such systems should have the right to choose \\emph{not} to share highly sensitive interactions. However, there is no method allowing the user to know which interactions are more sensitive than others. Thus,"},"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":"2507.18365","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-07-24T12:46:30Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"dda6160dd9818300413d7a967780339a536a573f1ea48066fed981c0583d34f7","abstract_canon_sha256":"07eeb530d81d56b98f1542dc52140a1725c4d9ce84fccd781be13117f2aadc22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:16.683360Z","signature_b64":"WKC7IMOsb7u4hLbuPjm/w4+T2pIgYhXsJVVM48hCYnvAZfCLb+syYyDBVS/FvpAF03ojT+uSDUwPQ3l3j8V7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff8622552fd138401e0caf2c6b12ee1b62e44e81d87df0e68473c9a416aa1210","last_reissued_at":"2026-07-05T12:06:16.682855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:16.682855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RecPS: Privacy Risk Scoring for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.IR","authors_text":"Jiajie He, Keke Chen, Yuechun Gu","submitted_at":"2025-07-24T12:46:30Z","abstract_excerpt":"Recommender systems (RecSys) have become an essential component of many web applications. The core of the system is a recommendation model trained on highly sensitive user-item interaction data. While privacy-enhancing techniques are actively studied in the research community, the real-world model development still depends on minimal privacy protection, e.g., via controlled access. Users of such systems should have the right to choose \\emph{not} to share highly sensitive interactions. However, there is no method allowing the user to know which interactions are more sensitive than others. Thus,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.18365","kind":"arxiv","version":4},"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/2507.18365/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":"2507.18365","created_at":"2026-07-05T12:06:16.682913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.18365v4","created_at":"2026-07-05T12:06:16.682913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.18365","created_at":"2026-07-05T12:06:16.682913+00:00"},{"alias_kind":"pith_short_12","alias_value":"76DCEVJP2E4E","created_at":"2026-07-05T12:06:16.682913+00:00"},{"alias_kind":"pith_short_16","alias_value":"76DCEVJP2E4EAHQM","created_at":"2026-07-05T12:06:16.682913+00:00"},{"alias_kind":"pith_short_8","alias_value":"76DCEVJP","created_at":"2026-07-05T12:06:16.682913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.18671","citing_title":"Auditing Approximate Machine Unlearning for Differentially Private Models","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/76DCEVJP2E4EAHQMV4WGWEXODN","json":"https://pith.science/pith/76DCEVJP2E4EAHQMV4WGWEXODN.json","graph_json":"https://pith.science/api/pith-number/76DCEVJP2E4EAHQMV4WGWEXODN/graph.json","events_json":"https://pith.science/api/pith-number/76DCEVJP2E4EAHQMV4WGWEXODN/events.json","paper":"https://pith.science/paper/76DCEVJP"},"agent_actions":{"view_html":"https://pith.science/pith/76DCEVJP2E4EAHQMV4WGWEXODN","download_json":"https://pith.science/pith/76DCEVJP2E4EAHQMV4WGWEXODN.json","view_paper":"https://pith.science/paper/76DCEVJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.18365&json=true","fetch_graph":"https://pith.science/api/pith-number/76DCEVJP2E4EAHQMV4WGWEXODN/graph.json","fetch_events":"https://pith.science/api/pith-number/76DCEVJP2E4EAHQMV4WGWEXODN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76DCEVJP2E4EAHQMV4WGWEXODN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76DCEVJP2E4EAHQMV4WGWEXODN/action/storage_attestation","attest_author":"https://pith.science/pith/76DCEVJP2E4EAHQMV4WGWEXODN/action/author_attestation","sign_citation":"https://pith.science/pith/76DCEVJP2E4EAHQMV4WGWEXODN/action/citation_signature","submit_replication":"https://pith.science/pith/76DCEVJP2E4EAHQMV4WGWEXODN/action/replication_record"}},"created_at":"2026-07-05T12:06:16.682913+00:00","updated_at":"2026-07-05T12:06:16.682913+00:00"}