{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CX6T5SSGKLETKJ7YBN42OGR6VW","short_pith_number":"pith:CX6T5SSG","schema_version":"1.0","canonical_sha256":"15fd3eca4652c93527f80b79a71a3eada449658ef1498a68034f61607bd3fd1a","source":{"kind":"arxiv","id":"2505.12293","version":1},"attestation_state":"computed","paper":{"title":"Hidden Sketch: A Space-Efficient Reversible Sketch for Tracking Frequent Items in Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Tong Yang, Yuhan Wu, Yuxuan Tian, Zicang Xu","submitted_at":"2025-05-18T08:10:01Z","abstract_excerpt":"Modern data stream applications demand memory-efficient solutions for accurately tracking frequent items, such as heavy hitters and heavy changers, under strict resource constraints. Traditional sketches face inherent accuracy-memory trade-offs: they either lose precision to reduce memory usage or inflate memory costs to enable high recording capacity. This paper introduces Hidden Sketch, a space-efficient reversible data structure for key and frequency encoding. Our design uniquely combines a Reversible Bloom Filter (RBF) and a Count-Min (CM) Sketch for invertible key and frequency storage, e"},"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.12293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-05-18T08:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"33f1b8fad21e5666711485dd40a275e214672eb36b0b2decfb7b1f412736dd68","abstract_canon_sha256":"162d6402eab27ed00848c8a7f6c7117ffc8ad9028c6bb33d23a8f0fdf4ad602d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:01.761423Z","signature_b64":"xFv5IRlwjg18S089uq0TqI+AMW5SxM/DZGfRS6hFWO85XIsAL2QGe6zA4lE/ZVa9BBgsP+8ugyddXMasB4xfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15fd3eca4652c93527f80b79a71a3eada449658ef1498a68034f61607bd3fd1a","last_reissued_at":"2026-07-05T11:05:01.760886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:01.760886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hidden Sketch: A Space-Efficient Reversible Sketch for Tracking Frequent Items in Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Tong Yang, Yuhan Wu, Yuxuan Tian, Zicang Xu","submitted_at":"2025-05-18T08:10:01Z","abstract_excerpt":"Modern data stream applications demand memory-efficient solutions for accurately tracking frequent items, such as heavy hitters and heavy changers, under strict resource constraints. Traditional sketches face inherent accuracy-memory trade-offs: they either lose precision to reduce memory usage or inflate memory costs to enable high recording capacity. This paper introduces Hidden Sketch, a space-efficient reversible data structure for key and frequency encoding. Our design uniquely combines a Reversible Bloom Filter (RBF) and a Count-Min (CM) Sketch for invertible key and frequency storage, e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12293","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.12293/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.12293","created_at":"2026-07-05T11:05:01.760945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.12293v1","created_at":"2026-07-05T11:05:01.760945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12293","created_at":"2026-07-05T11:05:01.760945+00:00"},{"alias_kind":"pith_short_12","alias_value":"CX6T5SSGKLET","created_at":"2026-07-05T11:05:01.760945+00:00"},{"alias_kind":"pith_short_16","alias_value":"CX6T5SSGKLETKJ7Y","created_at":"2026-07-05T11:05:01.760945+00:00"},{"alias_kind":"pith_short_8","alias_value":"CX6T5SSG","created_at":"2026-07-05T11:05:01.760945+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CX6T5SSGKLETKJ7YBN42OGR6VW","json":"https://pith.science/pith/CX6T5SSGKLETKJ7YBN42OGR6VW.json","graph_json":"https://pith.science/api/pith-number/CX6T5SSGKLETKJ7YBN42OGR6VW/graph.json","events_json":"https://pith.science/api/pith-number/CX6T5SSGKLETKJ7YBN42OGR6VW/events.json","paper":"https://pith.science/paper/CX6T5SSG"},"agent_actions":{"view_html":"https://pith.science/pith/CX6T5SSGKLETKJ7YBN42OGR6VW","download_json":"https://pith.science/pith/CX6T5SSGKLETKJ7YBN42OGR6VW.json","view_paper":"https://pith.science/paper/CX6T5SSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.12293&json=true","fetch_graph":"https://pith.science/api/pith-number/CX6T5SSGKLETKJ7YBN42OGR6VW/graph.json","fetch_events":"https://pith.science/api/pith-number/CX6T5SSGKLETKJ7YBN42OGR6VW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CX6T5SSGKLETKJ7YBN42OGR6VW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CX6T5SSGKLETKJ7YBN42OGR6VW/action/storage_attestation","attest_author":"https://pith.science/pith/CX6T5SSGKLETKJ7YBN42OGR6VW/action/author_attestation","sign_citation":"https://pith.science/pith/CX6T5SSGKLETKJ7YBN42OGR6VW/action/citation_signature","submit_replication":"https://pith.science/pith/CX6T5SSGKLETKJ7YBN42OGR6VW/action/replication_record"}},"created_at":"2026-07-05T11:05:01.760945+00:00","updated_at":"2026-07-05T11:05:01.760945+00:00"}