{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TZCU6SFMWIHYIU2XBZQ7EFRNF3","short_pith_number":"pith:TZCU6SFM","canonical_record":{"source":{"id":"1805.02874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-08T07:52:19Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"fb343b76cb619a7749241aa94712231997c6496361bb5a8d10ca05953a83b24a","abstract_canon_sha256":"1b18108ea9821c43c1a49f12a8e8ca1d777ace693ee4696eab734f18a16fbd90"},"schema_version":"1.0"},"canonical_sha256":"9e454f48acb20f8453570e61f2162d2ed9a18bef39fb29f37bdcea1eecec0268","source":{"kind":"arxiv","id":"1805.02874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02874","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02874v1","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02874","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"TZCU6SFMWIHY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TZCU6SFMWIHYIU2X","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TZCU6SFM","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TZCU6SFMWIHYIU2XBZQ7EFRNF3","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-08T07:52:19Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"fb343b76cb619a7749241aa94712231997c6496361bb5a8d10ca05953a83b24a","abstract_canon_sha256":"1b18108ea9821c43c1a49f12a8e8ca1d777ace693ee4696eab734f18a16fbd90"},"schema_version":"1.0"},"canonical_sha256":"9e454f48acb20f8453570e61f2162d2ed9a18bef39fb29f37bdcea1eecec0268","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:35.396627Z","signature_b64":"Jf/rSV4olfTOfYnRrskiqY8gbfav2GQbyuuTHfzYVCht4bjSoliN492fKTTSEHBHvtS8+UAJNNXOch6neNRDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e454f48acb20f8453570e61f2162d2ed9a18bef39fb29f37bdcea1eecec0268","last_reissued_at":"2026-05-18T00:16:35.395978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:35.395978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02874","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3OVL0Hbpk6qRj5TxxnlbE6xtrnLAxwLTrgXCWV3kBWaU/uQ6bNGLwxVa4wwnPJFje+k5pbpJ6y23o8e9+E7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:40:49.190349Z"},"content_sha256":"e4b0b599603c1c32afccf16fc17d85a6a7e80c39f23c13a64f82cabeeb5154a2","schema_version":"1.0","event_id":"sha256:e4b0b599603c1c32afccf16fc17d85a6a7e80c39f23c13a64f82cabeeb5154a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TZCU6SFMWIHYIU2XBZQ7EFRNF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Frequent Entities in Continuous Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.AI","authors_text":"Ferran Alet, Leslie P. Kaelbling, Rohan Chitnis, Tomas Lozano-Perez","submitted_at":"2018-05-08T07:52:19Z","abstract_excerpt":"In many applications that involve processing high-dimensional data, it is important to identify a small set of entities that account for a significant fraction of detections. Rather than formalize this as a clustering problem, in which all detections must be grouped into hard or soft categories, we formalize it as an instance of the frequent items or heavy hitters problem, which finds groups of tightly clustered objects that have a high density in the feature space. We show that the heavy hitters formulation generates solutions that are more accurate and effective than the clustering formulati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02874","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xEV9gXP6mUqrhgn1LF/HH2TalGSFnvnVClCHlD/uGLkv4AsLq+xsVBEwbSYF3LV3uIN3Sk5KAgWt2wlHdFtfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:40:49.191038Z"},"content_sha256":"bd94da17c62bced6c31a1125b4623fc328df00f9b588d9cb7db87996a2313ca3","schema_version":"1.0","event_id":"sha256:bd94da17c62bced6c31a1125b4623fc328df00f9b588d9cb7db87996a2313ca3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZCU6SFMWIHYIU2XBZQ7EFRNF3/bundle.json","state_url":"https://pith.science/pith/TZCU6SFMWIHYIU2XBZQ7EFRNF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZCU6SFMWIHYIU2XBZQ7EFRNF3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T16:40:49Z","links":{"resolver":"https://pith.science/pith/TZCU6SFMWIHYIU2XBZQ7EFRNF3","bundle":"https://pith.science/pith/TZCU6SFMWIHYIU2XBZQ7EFRNF3/bundle.json","state":"https://pith.science/pith/TZCU6SFMWIHYIU2XBZQ7EFRNF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZCU6SFMWIHYIU2XBZQ7EFRNF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TZCU6SFMWIHYIU2XBZQ7EFRNF3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1b18108ea9821c43c1a49f12a8e8ca1d777ace693ee4696eab734f18a16fbd90","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-08T07:52:19Z","title_canon_sha256":"fb343b76cb619a7749241aa94712231997c6496361bb5a8d10ca05953a83b24a"},"schema_version":"1.0","source":{"id":"1805.02874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02874","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02874v1","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02874","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"TZCU6SFMWIHY","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TZCU6SFMWIHYIU2X","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TZCU6SFM","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:bd94da17c62bced6c31a1125b4623fc328df00f9b588d9cb7db87996a2313ca3","target":"graph","created_at":"2026-05-18T00:16:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In many applications that involve processing high-dimensional data, it is important to identify a small set of entities that account for a significant fraction of detections. Rather than formalize this as a clustering problem, in which all detections must be grouped into hard or soft categories, we formalize it as an instance of the frequent items or heavy hitters problem, which finds groups of tightly clustered objects that have a high density in the feature space. We show that the heavy hitters formulation generates solutions that are more accurate and effective than the clustering formulati","authors_text":"Ferran Alet, Leslie P. Kaelbling, Rohan Chitnis, Tomas Lozano-Perez","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-08T07:52:19Z","title":"Finding Frequent Entities in Continuous Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02874","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e4b0b599603c1c32afccf16fc17d85a6a7e80c39f23c13a64f82cabeeb5154a2","target":"record","created_at":"2026-05-18T00:16:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1b18108ea9821c43c1a49f12a8e8ca1d777ace693ee4696eab734f18a16fbd90","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-08T07:52:19Z","title_canon_sha256":"fb343b76cb619a7749241aa94712231997c6496361bb5a8d10ca05953a83b24a"},"schema_version":"1.0","source":{"id":"1805.02874","kind":"arxiv","version":1}},"canonical_sha256":"9e454f48acb20f8453570e61f2162d2ed9a18bef39fb29f37bdcea1eecec0268","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e454f48acb20f8453570e61f2162d2ed9a18bef39fb29f37bdcea1eecec0268","first_computed_at":"2026-05-18T00:16:35.395978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:35.395978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jf/rSV4olfTOfYnRrskiqY8gbfav2GQbyuuTHfzYVCht4bjSoliN492fKTTSEHBHvtS8+UAJNNXOch6neNRDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:35.396627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4b0b599603c1c32afccf16fc17d85a6a7e80c39f23c13a64f82cabeeb5154a2","sha256:bd94da17c62bced6c31a1125b4623fc328df00f9b588d9cb7db87996a2313ca3"],"state_sha256":"abd2e97352ba8d8248ff3494d6bf6b60e398df9a0a0b75a6d3acbcce491371e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGJ8DEl96YQGmmxiNHxJGFH/7f22d/y2PdCbjbT0TUUn1GsmSpyRN+3rkb75ndPAHxKxwpbSPacGDFQ0+azWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:40:49.194830Z","bundle_sha256":"a7313e05b6f52435aa0b62e35e46db34d8bcc236da79c3605b3cc10119211a06"}}