{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SVQN3DEENQRQSIXQNQ2VZE34PS","short_pith_number":"pith:SVQN3DEE","schema_version":"1.0","canonical_sha256":"9560dd8c846c230922f06c355c937c7c920b93ab721ce2252a075d0343fb2878","source":{"kind":"arxiv","id":"2305.14822","version":2},"attestation_state":"computed","paper":{"title":"Can Copyright be Reduced to Privacy?","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Niva Elkin-Koren, Roi Livni, Shay Moran, Uri Hacohen","submitted_at":"2023-05-24T07:22:41Z","abstract_excerpt":"There is a growing concern that generative AI models will generate outputs closely resembling the copyrighted materials for which they are trained. This worry has intensified as the quality and complexity of generative models have immensely improved, and the availability of extensive datasets containing copyrighted material has expanded. Researchers are actively exploring strategies to mitigate the risk of generating infringing samples, with a recent line of work suggesting to employ techniques such as differential privacy and other forms of algorithmic stability to provide guarantees on the l"},"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":"2305.14822","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-24T07:22:41Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"7251f5eb911f8ee5f7fde951f41e2cd55d380af1c2d25f87db336baedb3efed6","abstract_canon_sha256":"e63106bb38e8c9029040a4e11bb56c65f75e3a5a465e48b24e3e56d52785ed1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:59:50.688801Z","signature_b64":"CNkpESB6I4xhfW8YTKGrHrrneGl8f67l35DPAq+wGyDeq2t37rnuZIQyzIWUO6PJ4BF0khoeHR8HP8GSCJUoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9560dd8c846c230922f06c355c937c7c920b93ab721ce2252a075d0343fb2878","last_reissued_at":"2026-07-05T07:59:50.688334Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:59:50.688334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Copyright be Reduced to Privacy?","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Niva Elkin-Koren, Roi Livni, Shay Moran, Uri Hacohen","submitted_at":"2023-05-24T07:22:41Z","abstract_excerpt":"There is a growing concern that generative AI models will generate outputs closely resembling the copyrighted materials for which they are trained. This worry has intensified as the quality and complexity of generative models have immensely improved, and the availability of extensive datasets containing copyrighted material has expanded. Researchers are actively exploring strategies to mitigate the risk of generating infringing samples, with a recent line of work suggesting to employ techniques such as differential privacy and other forms of algorithmic stability to provide guarantees on the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.14822","kind":"arxiv","version":2},"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/2305.14822/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":"2305.14822","created_at":"2026-07-05T07:59:50.688394+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.14822v2","created_at":"2026-07-05T07:59:50.688394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.14822","created_at":"2026-07-05T07:59:50.688394+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVQN3DEENQRQ","created_at":"2026-07-05T07:59:50.688394+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVQN3DEENQRQSIXQ","created_at":"2026-07-05T07:59:50.688394+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVQN3DEE","created_at":"2026-07-05T07:59:50.688394+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05159","citing_title":"A Lightweight Method to Disrupt Memorized Sequences in LLM","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SVQN3DEENQRQSIXQNQ2VZE34PS","json":"https://pith.science/pith/SVQN3DEENQRQSIXQNQ2VZE34PS.json","graph_json":"https://pith.science/api/pith-number/SVQN3DEENQRQSIXQNQ2VZE34PS/graph.json","events_json":"https://pith.science/api/pith-number/SVQN3DEENQRQSIXQNQ2VZE34PS/events.json","paper":"https://pith.science/paper/SVQN3DEE"},"agent_actions":{"view_html":"https://pith.science/pith/SVQN3DEENQRQSIXQNQ2VZE34PS","download_json":"https://pith.science/pith/SVQN3DEENQRQSIXQNQ2VZE34PS.json","view_paper":"https://pith.science/paper/SVQN3DEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.14822&json=true","fetch_graph":"https://pith.science/api/pith-number/SVQN3DEENQRQSIXQNQ2VZE34PS/graph.json","fetch_events":"https://pith.science/api/pith-number/SVQN3DEENQRQSIXQNQ2VZE34PS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVQN3DEENQRQSIXQNQ2VZE34PS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVQN3DEENQRQSIXQNQ2VZE34PS/action/storage_attestation","attest_author":"https://pith.science/pith/SVQN3DEENQRQSIXQNQ2VZE34PS/action/author_attestation","sign_citation":"https://pith.science/pith/SVQN3DEENQRQSIXQNQ2VZE34PS/action/citation_signature","submit_replication":"https://pith.science/pith/SVQN3DEENQRQSIXQNQ2VZE34PS/action/replication_record"}},"created_at":"2026-07-05T07:59:50.688394+00:00","updated_at":"2026-07-05T07:59:50.688394+00:00"}