{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S7EEPWSAZJVNT4BRUJGLRNR7OE","short_pith_number":"pith:S7EEPWSA","canonical_record":{"source":{"id":"1708.02062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-08-07T10:42:36Z","cross_cats_sorted":[],"title_canon_sha256":"fcf236cb6d8efd64906886add2a42e496ff355bcbac83d2a884ee0d7753d35a3","abstract_canon_sha256":"63c00ff55703c1d6a3805b6806e2fe2661c635a16d6ae5012072da5b468e43ff"},"schema_version":"1.0"},"canonical_sha256":"97c847da40ca6ad9f031a24cb8b63f7115b649976f8a2ca67565b50b3647afa5","source":{"kind":"arxiv","id":"1708.02062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02062","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02062v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02062","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"S7EEPWSAZJVN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S7EEPWSAZJVNT4BR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S7EEPWSA","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S7EEPWSAZJVNT4BRUJGLRNR7OE","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-08-07T10:42:36Z","cross_cats_sorted":[],"title_canon_sha256":"fcf236cb6d8efd64906886add2a42e496ff355bcbac83d2a884ee0d7753d35a3","abstract_canon_sha256":"63c00ff55703c1d6a3805b6806e2fe2661c635a16d6ae5012072da5b468e43ff"},"schema_version":"1.0"},"canonical_sha256":"97c847da40ca6ad9f031a24cb8b63f7115b649976f8a2ca67565b50b3647afa5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:32.413592Z","signature_b64":"hEYyLZJE1SBm0BKm82lx1oW9aG1vnQ+9GQtUcWsL7h3IHk0DyI7ktdBzAfru1BuAhytMvOU25AMhT/byR9uxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97c847da40ca6ad9f031a24cb8b63f7115b649976f8a2ca67565b50b3647afa5","last_reissued_at":"2026-05-18T00:38:32.413153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:32.413153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02062","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:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0m4TIu1Z4SM0CCB5jvwr9V+1/xBik64LK52PMMZytAAS7adA2pOoefIwvr8KVhspwsG9Pzwzr96hdwUQd/ZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:48:03.919482Z"},"content_sha256":"774a5bc45b325a2863dc8500cbd917611c6bbdb82d59db976ee100ac241d4a24","schema_version":"1.0","event_id":"sha256:774a5bc45b325a2863dc8500cbd917611c6bbdb82d59db976ee100ac241d4a24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S7EEPWSAZJVNT4BRUJGLRNR7OE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fishing in the Stream: Similarity Search over Endless Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"David Carmel, Idit Keidar, Naama Kraus","submitted_at":"2017-08-07T10:42:36Z","abstract_excerpt":"Similarity search is the task of retrieving data items that are similar to a given query. In this paper, we introduce the time-sensitive notion of similarity search over endless data-streams (SSDS), which takes into account data quality and temporal characteristics in addition to similarity. SSDS is challenging as it needs to process unbounded data, while computation resources are bounded. We propose Stream-LSH, a randomized SSDS algorithm that bounds the index size by retaining items according to their freshness, quality, and dynamic popularity attributes. We analytically show that Stream-LSH"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02062","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:38:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGz9DW/Ma/3BXH+6LW4LVGTIzaYQ9S/OgdDHVGhfzCvCdmQonpwDj2UCpd5Hx/JVvv+yIPWLGBCSUVPcOi7iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:48:03.920136Z"},"content_sha256":"c37933ac3c48e00e312287deb7f3c0e68b40b3e6a3659f280f39a0aad1910d5e","schema_version":"1.0","event_id":"sha256:c37933ac3c48e00e312287deb7f3c0e68b40b3e6a3659f280f39a0aad1910d5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7EEPWSAZJVNT4BRUJGLRNR7OE/bundle.json","state_url":"https://pith.science/pith/S7EEPWSAZJVNT4BRUJGLRNR7OE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7EEPWSAZJVNT4BRUJGLRNR7OE/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-05-31T05:48:03Z","links":{"resolver":"https://pith.science/pith/S7EEPWSAZJVNT4BRUJGLRNR7OE","bundle":"https://pith.science/pith/S7EEPWSAZJVNT4BRUJGLRNR7OE/bundle.json","state":"https://pith.science/pith/S7EEPWSAZJVNT4BRUJGLRNR7OE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7EEPWSAZJVNT4BRUJGLRNR7OE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S7EEPWSAZJVNT4BRUJGLRNR7OE","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":"63c00ff55703c1d6a3805b6806e2fe2661c635a16d6ae5012072da5b468e43ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-08-07T10:42:36Z","title_canon_sha256":"fcf236cb6d8efd64906886add2a42e496ff355bcbac83d2a884ee0d7753d35a3"},"schema_version":"1.0","source":{"id":"1708.02062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02062","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02062v1","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02062","created_at":"2026-05-18T00:38:32Z"},{"alias_kind":"pith_short_12","alias_value":"S7EEPWSAZJVN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S7EEPWSAZJVNT4BR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S7EEPWSA","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:c37933ac3c48e00e312287deb7f3c0e68b40b3e6a3659f280f39a0aad1910d5e","target":"graph","created_at":"2026-05-18T00:38:32Z","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":"Similarity search is the task of retrieving data items that are similar to a given query. In this paper, we introduce the time-sensitive notion of similarity search over endless data-streams (SSDS), which takes into account data quality and temporal characteristics in addition to similarity. SSDS is challenging as it needs to process unbounded data, while computation resources are bounded. We propose Stream-LSH, a randomized SSDS algorithm that bounds the index size by retaining items according to their freshness, quality, and dynamic popularity attributes. We analytically show that Stream-LSH","authors_text":"David Carmel, Idit Keidar, Naama Kraus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-08-07T10:42:36Z","title":"Fishing in the Stream: Similarity Search over Endless Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02062","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:774a5bc45b325a2863dc8500cbd917611c6bbdb82d59db976ee100ac241d4a24","target":"record","created_at":"2026-05-18T00:38:32Z","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":"63c00ff55703c1d6a3805b6806e2fe2661c635a16d6ae5012072da5b468e43ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-08-07T10:42:36Z","title_canon_sha256":"fcf236cb6d8efd64906886add2a42e496ff355bcbac83d2a884ee0d7753d35a3"},"schema_version":"1.0","source":{"id":"1708.02062","kind":"arxiv","version":1}},"canonical_sha256":"97c847da40ca6ad9f031a24cb8b63f7115b649976f8a2ca67565b50b3647afa5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97c847da40ca6ad9f031a24cb8b63f7115b649976f8a2ca67565b50b3647afa5","first_computed_at":"2026-05-18T00:38:32.413153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:32.413153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hEYyLZJE1SBm0BKm82lx1oW9aG1vnQ+9GQtUcWsL7h3IHk0DyI7ktdBzAfru1BuAhytMvOU25AMhT/byR9uxAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:32.413592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:774a5bc45b325a2863dc8500cbd917611c6bbdb82d59db976ee100ac241d4a24","sha256:c37933ac3c48e00e312287deb7f3c0e68b40b3e6a3659f280f39a0aad1910d5e"],"state_sha256":"f5f0dbeee1fa3468705511def9ca60d10eecb75260c83d3c8382c3abde13b21a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iz832y+tPoW13DatvYOgqraURj5N79pzOOuyvb8Vrw2BYrlCEPkGBXPHo23f66eVjECkMnrGUlAeg6+Roop+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:48:03.923592Z","bundle_sha256":"652f628b21f2e72589412bd5b6a068de74ff88908216d0e515aa1771bb945b69"}}