{"as_of":"2026-08-04T16:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6a92ee8e8001cf2109a3fc7a034177d386dae38289c922534302d3f9fa69fa05","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T21:05:22.517335Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.00036/citation-record","integrity":"/paper/2605.00036/integrity","json":"/paper/2605.00036/citation-record.json","paper":"/paper/2605.00036"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining association rulesbetweensetsofitemsinlargedatabases,in:TheACMSIGMOD International Conference on Management of Data, pp","venue":null,"work_id":"dc09a9ec-8702-45d0-b893-82999ce8ba5b","year":1993},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:ea040402e802b3d9a60c66ad34eab7ebf81a3dda966cf215c2226e0da21c6c85","observation_id":"5b92e067-91e9-4ab3-b93c-8def58f3011d","resolution":{"observed_at":"2026-05-23T16:25:42.619199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Privacy-preserving data mining, in: The ACM SIGMOD International Conference on Management of Data, pp","venue":null,"work_id":"60906d73-1bb5-499a-8bf4-39bd5157b38e","year":2000},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:3c8263f756e92fef55d2894fdf7c3cf8b79af487df1f0c5e0dca3ef567917a03","observation_id":"0c38bea7-0ef8-4f3e-b976-e1948e9f9a4e","resolution":{"observed_at":"2026-05-23T16:25:42.510152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient treestructuresforhighutilitypatternmininginincrementaldatabases","venue":null,"work_id":"141ea9d2-b796-4c2a-b316-baaa47d654e9","year":2009},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:863c6bdc7e7de6ae99cc7994e55fffc17136e36c7688735139488827d10d9b97","observation_id":"11704bd7-31fb-4d33-a8f5-3c5d68f9c61e","resolution":{"observed_at":"2026-05-23T16:25:42.632362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Preservingprivacyinassociationrule mining using multi-threshold particle swarm optimization","venue":null,"work_id":"cdf8b807-7b8c-41fd-9c9e-2fe9d2b214ff","year":2025},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:617cbb48786c5e92faf202f101b28389ec006f74a58716d7c3500a7b1cb20362","observation_id":"8a8dc404-610d-4c8e-b57d-a2795dc34a37","resolution":{"observed_at":"2026-05-23T16:25:42.506725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computers & Security 132, 103360","venue":null,"work_id":"17f44e9c-1895-46a8-ad6d-04314ac724f0","year":2023},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:bf0fe37842578ef6ef3c0073b00cdec823cc20706fb811dc2acf7318690c5ad6","observation_id":"eeaf547a-0de4-4c13-ba78-1ef54033108d","resolution":{"observed_at":"2026-05-23T16:25:42.605263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Discovering high-utility itemsets at multiple abstraction levels, in: New Trends in Databases and Information Systems, Springer","venue":null,"work_id":"7769348a-8cc3-4ebe-9996-d63535091421","year":2017},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:0fa955a26a683e5f6be1e6c4483e1aaebadb7654c35a83f2c3ec4da180c22db6","observation_id":"64399e44-1107-4987-87eb-502cd8a45b93","resolution":{"observed_at":"2026-05-23T16:25:42.613448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rare yet critical: Algorithms for privacy preserving rare itemset mining","venue":null,"work_id":"fb1e31dc-72de-4752-bef5-6e6a217a795e","year":2025},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:9f69a62ff93684590e9334d2fb7691aad2245f474ee5dd4584679103cfc08614","observation_id":"a2556388-bf16-420d-ac04-a419470bea14","resolution":{"observed_at":"2026-05-23T16:25:42.686643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An effi- cientutility-listbasedhigh-utilityitemsetminingalgorithm","venue":null,"work_id":"38572fc5-1ef3-4638-ae7e-b22a97657c79","year":2023},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:a4f7531d6048ac62bd9de83a01fe5a7a716d94c75460d8cd1f51d2000c50d1d9","observation_id":"6e8c09bf-5172-4482-9e95-0eb5ab1d23bd","resolution":{"observed_at":"2026-05-23T16:25:42.502741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficienthighutilityitemsetminingusingbufferedutility- lists","venue":null,"work_id":"2ee386c3-9541-4557-aa05-1fc9448bf418","year":2018},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:4fa90b82a164651e9236c4d9bdf74db9c2273290ada9e9b1ecb60832d9a13980","observation_id":"6294b233-d12a-41ee-924a-db3490d12a5c","resolution":{"observed_at":"2026-05-23T16:25:42.689927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c1578739-59f5-48f6-8075-8528a2860d91","year":null},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:df897405c248a533acf8c05117216716f117194f4e3077669d596bae7ebe439f","observation_id":"e3e90354-50e1-441b-943b-6ee333c462a2","resolution":{"observed_at":"2026-05-23T16:25:42.693452Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"36505b95-e224-4617-a59d-6309476a2961","year":null},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:559b8607618d76db110401bb17d57a45d7be750ab873c4d0e47d72e1c1ccaca4","observation_id":"3ef3c65a-d7c7-4c26-a094-cdc319fbeb4f","resolution":{"observed_at":"2026-05-23T16:25:42.700327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"FHM: Faster high-utility itemset mining using estimated utility co- occurrence pruning, in: Foundations of Intelligent Systems: 21st International Symposium, Springer","venue":null,"work_id":"e1c090fe-bf76-49d8-b614-95197d7c85ad","year":2014},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:9925846cb7bb0b879fc75d192a64281990496fa01a77422a75ae0fff35425e0f","observation_id":"ff34104c-c98b-475c-8820-3f560fa18bb6","resolution":{"observed_at":"2026-05-23T16:25:42.703584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Privacy preservingutilitymining:asurvey,in:IEEEInternationalConference on Big Data, IEEE","venue":null,"work_id":"3c565b18-b842-4d4d-91d0-1ba219d76fff","year":2018},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:112e16428dce140ead38a8c41c9cad4148fadda926f800ec1075b2cb6b574473","observation_id":"6c82a96c-12c5-44a2-9020-a167d32aa7f3","resolution":{"observed_at":"2026-05-23T16:25:42.682653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Data mining in distributed environment: a survey","venue":null,"work_id":"ca5775a0-d961-41e0-9f35-fcd3ee4fd60a","year":2017},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:213185d8c010a1699d77b8ce2f11e4202fd3a0a2be1e21080e7a27d34fb3f911","observation_id":"db9bda98-a93f-44ae-839d-3e9fa11619bb","resolution":{"observed_at":"2026-05-23T16:25:42.679181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey of utility-oriented pattern mining","venue":null,"work_id":"7b825d1a-67bf-439f-b380-67b9ddd3dac0","year":2021},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:6a5a8768caa06057a492a6dfc22b171634468a445d111df6eefae0c70045af80","observation_id":"ee3f3d69-cf0f-4de1-85b8-6804fda3d1e7","resolution":{"observed_at":"2026-05-23T16:25:42.706976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"HUOPM:High-utilityoccupancypatternmining","venue":null,"work_id":"4f7bb266-fc15-476a-acb6-76530582ec9b","year":2020},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:ab789ae85d40aff1b6375b5799c14fb927f23b8e333ab6f5e2c170e6ace924de","observation_id":"1edf4ac1-9d92-4dd6-bfa0-939cd74a72d5","resolution":{"observed_at":"2026-05-23T16:25:42.697021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Privacy preserving rare itemset mining","venue":null,"work_id":"3cdec4cd-73d8-48dd-b186-050adcf5c97c","year":2024},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:031b93abcd6f494b680f496511a1a11b55f7c589a79e65cfe97e7b54491c00f1","observation_id":"178a1029-6f6a-48a8-a4a3-5d89d718f803","resolution":{"observed_at":"2026-05-23T16:25:42.644126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining top- k constrained cross-level high-utility itemsets over data streams","venue":null,"work_id":"d043d2e2-138b-4c14-81cb-12a7eb5bd2bc","year":2024},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:2e3ed0796ba8e33ecf75d92344ee9afb75711ac67984ac083a6a2ebfdd5c731a","observation_id":"e4816e32-be61-4400-a934-55d081d0ac19","resolution":{"observed_at":"2026-05-23T16:25:42.636605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient algorithms for victim item selection in privacy-preserving utility mining","venue":null,"work_id":"36e8b2e6-c2c5-4e4d-b693-cd17e3ef18b7","year":2022},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:81dff1031fde53695c9f50a4ae13c67bc0f0c22d678c9f094d54cdccb6b4850c","observation_id":"e9b7a432-d6b2-4f41-9377-6ce2654e87ae","resolution":{"observed_at":"2026-05-23T16:25:42.586530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"H-FHAUI:Hidingfrequenthighaverageutilityitemsets","venue":null,"work_id":"b4817dbd-3436-4461-9a3d-7d7ce59d6d61","year":2022},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:ef827bcfe16f9e60dd3a910b3fe6ae562088974fcdb468b10fb3ad02648f3c3b","observation_id":"cdaf9f18-585c-447c-bafb-4551c1ff2d63","resolution":{"observed_at":"2026-05-23T16:25:42.590190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A novel algorithm for privacy preserving utility mining based on integer linear programming","venue":null,"work_id":"a45ab1af-5034-45d3-89b1-0bee464d4402","year":2019},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:ac59d3ba56797bd94b301d0769939825d51c362ca93e563b271a20e3facb557a","observation_id":"6647dc52-7f2a-49b1-a3d7-b46e38d6be86","resolution":{"observed_at":"2026-05-23T16:25:42.600771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient hiding of confidential high-utility itemsets with minimalsideeffects","venue":null,"work_id":"6080da49-e472-485a-a330-0bd017d5f29f","year":2017},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:c6aea1c763f19bd7e321a2170123dd9be7731599c629f9483f044ce800c448b0","observation_id":"eecd9fea-98c4-4b8d-8f66-7256178ee81f","resolution":{"observed_at":"2026-05-23T16:25:42.566011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining","venue":null,"work_id":"db62a626-d46f-4965-8392-67aac8deb66b","year":2016},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:9466747c4b8a610b86920c13f7504c903e0a47a0d4c6b64fdb4f899e78fa5031","observation_id":"67300477-a22d-454b-a078-b403d001a0ea","resolution":{"observed_at":"2026-05-23T16:25:42.574191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Privacy preserving data mining, in: Annual international cryptology conference, Springer","venue":null,"work_id":"11e985ed-8c8e-46e8-bb98-0ace7eee3a66","year":2000},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:9f256e64d394973b4ba05bd23820f9ea9b6856fdc14386869ddb1fd7f1e7aedd","observation_id":"9ee963ee-6f78-46e5-919d-68d7af543b6f","resolution":{"observed_at":"2026-05-23T16:25:42.675074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining high utility patterns in one phase without generating candidates","venue":null,"work_id":"9ffc8251-d5f8-43ff-99c6-586d609345c5","year":2015},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:7d37270117a2ec646867c436d57a1cee7519e5950326c2c53ae109880df9a4ca","observation_id":"1a04dde0-ec92-4504-9b31-ef8bed9db9a8","resolution":{"observed_at":"2026-05-23T16:25:42.670974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining high utility itemsets without candidate generation, in: The 21st ACM International Conference on Informa- tion and Knowledge Management, pp","venue":null,"work_id":"355d7923-8767-4a58-b05c-aeec30b02b54","year":2012},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:2e0950c13c11feb11812d4eff909e6eda189e3f8464fbc6f6b6da2bfa7f781da","observation_id":"fbff925e-8355-460b-9e01-e663ac12f06c","resolution":{"observed_at":"2026-05-23T16:25:42.558717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Animprovedsanitization algorithm in privacy-preserving utility mining","venue":null,"work_id":"07cc5f24-3ac2-4475-85a3-aa69c13b18f5","year":2020},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:7cb7b8ac12b363a04f662f217d5276c58b0952804280c84bfb12f0264e7d39fe","observation_id":"f7bef75a-1819-4a79-9dbb-189b81107775","resolution":{"observed_at":"2026-05-23T16:25:42.581114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A novel approach for hiding sensitive utility and frequent itemsets","venue":null,"work_id":"5004c3f3-cf50-49d7-827d-2d614b5e5b9c","year":2018},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:daa6a67a728c2c628eb037c252c772d800d85bd1d0c5b7c2254e0d9315bab24f","observation_id":"d2f57f8d-0355-449f-8176-84c4e973d86f","resolution":{"observed_at":"2026-05-23T16:25:42.550971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A two-phase algorithm forfastdiscoveryofhighutilityitemsets,in:AdvancesinKnowledge Discovery and Data Mining: 9th Pacific-Asia Conference, Springer","venue":null,"work_id":"7f0d42e4-cee3-4eff-9f90-c64288b773b7","year":2005},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:18de662566090bfccf47ff13b80983d7b8b77cbe83ba467c7fe68424e60ac0d4","observation_id":"870388ef-52f5-462e-a5d7-bdb7d36e449a","resolution":{"observed_at":"2026-05-23T16:25:42.651612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Novel stochastic algorithms for privacy- preserving utility mining","venue":null,"work_id":"4253942e-7e0f-4244-9837-2f4b3e84dfed","year":2024},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:b204da6d7eada06a7f1c7f899eba5c3bc35fe1e41c8968d0a9844826fe4bb353","observation_id":"11d822f8-4d07-48e2-bcc0-ffe9a6a82802","resolution":{"observed_at":"2026-05-23T16:25:42.647769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A new algorithm using inte- ger programming relaxation for privacy-preserving in utility mining","venue":null,"work_id":"09c9adc1-e60b-4595-a916-4d18a75ff76f","year":2023},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:69ef329f6935e27737d68ec03a29bfaf444abe42f4849393cc694eb540219c25","observation_id":"9aca6456-3e8b-45f8-bcf9-8b48138d2f10","resolution":{"observed_at":"2026-05-23T16:25:42.547047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5677ca24-b051-436f-9434-146094348f5b","year":null},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:1a157d1c56766543522dc61de3f233e81fcb3a1d41aa06a9932b41efda2c7abd","observation_id":"5611813e-e5df-4518-9188-291adb91c3ac","resolution":{"observed_at":"2026-05-23T16:25:42.654885Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"2ca3270c-2adb-4371-8264-5456105a6f85","year":null},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:e77ebd01741c4e316afe23f45958a0158efb682477ddcc3d58e76994691546d6","observation_id":"12dd1efe-2b1b-4ad5-a392-8fb4595eca6a","resolution":{"observed_at":"2026-05-23T16:25:42.555524Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mining high utility itemsets using prefix trees and utility vectors","venue":null,"work_id":"9855d35f-454f-4750-bc23-d59cbebc0458","year":2023},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:baad9a17994bfa9ce66f9a8429fae7bcadf3dbd9d7c20dd4e7a0c473475c09da","observation_id":"4ae16d10-75cc-41a4-a00c-09dbb219642a","resolution":{"observed_at":"2026-05-23T16:25:42.609479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient mining of top-k cross-level high utility itemsets, in: International Conference on Future Data and Security Engineering, Springer","venue":null,"work_id":"ff48a3ae-bd65-4c02-bdb6-2849bfd61787","year":2023},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:f6cdace09c6a7e1b43263aa6634ea0cfb1c31e4b792c472fcbedc6a5ffddf757","observation_id":"8a445995-ae6b-4409-b616-d040e88e1a4b","resolution":{"observed_at":"2026-05-23T16:25:42.535353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"IEEE Transactions on Knowledge and Data Engineering 25, 1772–1786","venue":null,"work_id":"3de9b34f-002b-42aa-89b5-3d3c98c41cb0","year":2012},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:ed4aca55505af9b432e34d06da69a770c374fc9edee0b4adbad13fd745156cf9","observation_id":"872a8f5e-564b-40fc-b457-1936d4bc004f","resolution":{"observed_at":"2026-05-23T16:25:42.531791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"UP-Growth: an efficient algorithm for high utility itemset mining, in: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp","venue":null,"work_id":"7a0e2abb-8649-47fe-8a41-41b514e47add","year":2010},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:4ce78e8e620544f5c189c8a646942d4af8f8c5a8c83d06f2376ec0db1f3d590e","observation_id":"39c17222-34ca-44e2-a1c9-0513a3424eb8","resolution":{"observed_at":"2026-05-23T16:25:42.662520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Information Sciences 587, 41– 62","venue":null,"work_id":"b1f33ffd-af7a-4e6d-b993-f97533ec2c7d","year":2022},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:8e27c60a91d27c1db8bb857a04d10e521e1ee4c52ca508bebcd729248fcbf8e4","observation_id":"e44270aa-5fbf-405d-aab3-ed2dd7d62777","resolution":{"observed_at":"2026-05-23T16:25:42.524907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Miningcross-levelhighutilityitemsetsinunstableand negativeprofitdatabases","venue":null,"work_id":"1191455e-0794-47c4-ac94-d254aa9ee56f","year":2025},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:5c0c6777363d84505c62cefa8697d972526408b97abfb29753ccdb1978d9ff1a","observation_id":"e11016d3-6a7b-47f1-b935-920683390abf","resolution":{"observed_at":"2026-05-23T16:25:42.527925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8be6a004-0056-4168-92a1-430ff413cf4a","year":null},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:2e429c14909f9f6140ae1a83c8e9ff61c9d6a8fd76e525a0bb8797c5e32ecc02","observation_id":"aec4219d-d6a2-4ca8-8117-6e7cf6bb14ae","resolution":{"observed_at":"2026-05-23T16:25:42.710366Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Future Generation Computer Systems 117, 169–180","venue":null,"work_id":"d6bf96e8-ec22-4da9-8cb7-08bf5a96f192","year":null},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:e56cac5575a5ec11ab50de44350f93cf07ff13edf2dfd44e98db48f90bf4e912","observation_id":"5975fb19-e340-4b6a-ab20-b2b720878e05","resolution":{"observed_at":"2026-05-23T16:25:42.624987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"UBP- Miner: An efficient bit-based high utility itemset mining algorithm","venue":null,"work_id":"5682438b-b143-4ff0-8526-59b5e9011642","year":2022},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:efdf439c1e5a31d899daff78d94388d072dd9351cedfbbaed3368b7ec709c51f","observation_id":"850aede1-f94c-40c1-8f58-36bbc3db6971","resolution":{"observed_at":"2026-05-23T16:25:42.539417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8e5c58a3-5a51-4f26-9d15-ac9aa4f6e375","year":null},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:1650d044572e08540bf7b848ead4a50524da4fa249ce3f3934d0f03dcd1ef0a2","observation_id":"f0ee460e-8094-4b95-96b4-e751ae134573","resolution":{"observed_at":"2026-05-23T16:25:42.667180Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Information Sciences 681, 121218","venue":null,"work_id":"3c6c512a-200b-4d4f-85d5-e41f0c0d7fef","year":null},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:50ce6533dfd9ec2ebc779058ddbfc65a6a4b06988e4e06674b28db4677e97133","observation_id":"5c95127d-d574-4c36-8e01-63ae24173ff4","resolution":{"observed_at":"2026-05-23T16:25:42.517201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Afoundationalapproachto mining itemset utilities from databases, in: The SIAM International Conference on Data Mining, SIAM","venue":null,"work_id":"a521ff65-5f6b-414f-9874-b9560359b6a2","year":2004},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:3590516ef76540748f6d2df303e153ef5cb032af4d55d43deddfa6b52d74acd1","observation_id":"b7a497ed-61c7-41e9-970a-b37813a7d5fa","resolution":{"observed_at":"2026-05-23T16:25:42.521271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"HHUIFandMSICF:Novelalgorithmsfor privacy preserving utility mining","venue":null,"work_id":"ff2c136a-050c-4c46-8c2f-4928d8f44212","year":2010},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:60734149e7cbedabe615579255b460ac8991229513b166e5285e115bda9380e4","observation_id":"246cac38-82e9-4fb3-ac76-8e32483d718e","resolution":{"observed_at":"2026-05-23T16:25:42.513442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fastprivacy-preservingutilityminingalgorithm based on utility-list dictionary","venue":null,"work_id":"a3d307d5-3c62-4543-82e2-e36ddaea7b35","year":2023},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:99585b71327b3ca8b3168604fc3a7c1633bc4532cf59e00ca2838d341bc6189c","observation_id":"7843ae2a-ad75-40ad-bac1-ba784773b166","resolution":{"observed_at":"2026-05-23T16:25:42.658482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A fast perturbation algorithm using tree structure for privacy preserving utility mining","venue":null,"work_id":"fbce8a5c-c1fb-4b94-ae06-2077a6bd701e","year":2015},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:2f6a1a962454efa4edb5b0cf16ee5120d4bf8a542a63c079a158f0745ed62fc3","observation_id":"6177ad3a-0133-4dd1-bf8e-dcdf2f751252","resolution":{"observed_at":"2026-05-23T16:25:42.543396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Utility-based privacy- preserving data mining","venue":null,"work_id":"96520724-a542-4d5c-ac55-21bb3b7c6f3b","year":2025},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:0d8fb033e8fc321384bd37e5368ba5229dfe43ed39dbdea69e642b547742c250","observation_id":"86b186c5-ccd8-44df-9ddd-72935caeed3a","resolution":{"observed_at":"2026-05-23T16:25:42.596885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efim: a fast and memory efficient algorithm for high-utility itemset mining","venue":null,"work_id":"349bf6e2-815e-4c59-ba8e-8bcd08262bf3","year":2017},"citing_paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-09T21:05:22.517335Z"},"links":{"citing_paper":"/paper/2605.00036"},"observation_digest":"sha256:fa70e944425113198c59b254e0823759b97a44b2730b275071598c6fe27d71a9","observation_id":"d8ed11ac-7a60-4c8a-b343-52757c6becc2","resolution":{"observed_at":"2026-05-23T16:25:42.640596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.00036","last_updated":"2026-04-28T06:41:01Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-02T21:56:05.239830Z","submitted_at":"2026-04-28T06:41:01Z","title":"Cross-level Privacy Preserving Utility Mining"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":44},"total_outbound_references":50},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2605.00036."}