{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:32MWW2HY3RVW4LWF3DNLJPIIF4","short_pith_number":"pith:32MWW2HY","canonical_record":{"source":{"id":"1907.07574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T15:20:43Z","cross_cats_sorted":[],"title_canon_sha256":"2b03a3a25ee172b55efd685bad77a78347ba142c2f7cae71a394efba91cdb8d7","abstract_canon_sha256":"22fb7fe0ec4c67e7811a2e4488d528b8dd7cbae635fa3960e1ec3317480ae860"},"schema_version":"1.0"},"canonical_sha256":"de996b68f8dc6b6e2ec5d8dab4bd082f2376e667ba6b327179bac77f3c235d00","source":{"kind":"arxiv","id":"1907.07574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07574","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07574v1","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07574","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"32MWW2HY3RVW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"32MWW2HY3RVW4LWF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"32MWW2HY","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:32MWW2HY3RVW4LWF3DNLJPIIF4","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T15:20:43Z","cross_cats_sorted":[],"title_canon_sha256":"2b03a3a25ee172b55efd685bad77a78347ba142c2f7cae71a394efba91cdb8d7","abstract_canon_sha256":"22fb7fe0ec4c67e7811a2e4488d528b8dd7cbae635fa3960e1ec3317480ae860"},"schema_version":"1.0"},"canonical_sha256":"de996b68f8dc6b6e2ec5d8dab4bd082f2376e667ba6b327179bac77f3c235d00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:21.699210Z","signature_b64":"IyFY+pdXVs0wl5wX+yuRUr3mc3Sdhf3W/xgLGysgEZYNI0LHHufhoMaLXVXRD9hvuD4FJq5LjDxYWR5gN3lXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de996b68f8dc6b6e2ec5d8dab4bd082f2376e667ba6b327179bac77f3c235d00","last_reissued_at":"2026-05-17T23:40:21.698421Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:21.698421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07574","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-17T23:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGcCvSGon18JShMxWR432Zxlk7/LJwq1ummCNZAJvyr9FjRA5GI8s08xJbBBUQRTVKiSzC+aTe5suhsDT8iIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:48.319976Z"},"content_sha256":"e58124bb267901de7c0bede1b044e386abb0b312fd709e9f360d0c1a012e39ff","schema_version":"1.0","event_id":"sha256:e58124bb267901de7c0bede1b044e386abb0b312fd709e9f360d0c1a012e39ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:32MWW2HY3RVW4LWF3DNLJPIIF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithms for Time Decay Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Enayat Ullah, Harry Lang, Samson Zhou, Vladimir Braverman","submitted_at":"2019-07-17T15:20:43Z","abstract_excerpt":"In the time-decay model for data streams, elements of an underlying data set arrive sequentially with the recently arrived elements being more important. A common approach for handling large data sets is to maintain a \\emph{coreset}, a succinct summary of the processed data that allows approximate recovery of a predetermined query. We provide a general framework that takes any offline-coreset and gives a time-decay coreset for polynomial time decay functions.\n  We also consider the exponential time decay model for $k$-median clustering, where we provide a constant factor approximation algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07574","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-17T23:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0U4ZQnwc4Ehe193gzSuBa0MWud5GANDfJTpPljX5igYlRj7oQmSvMh31SW4rvWjGNG0G5vu8BYElP/TY5gaRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:48.320600Z"},"content_sha256":"21ede0e35d8d87441725bde85ed607976b104fa60d32f71d7f010318d6270570","schema_version":"1.0","event_id":"sha256:21ede0e35d8d87441725bde85ed607976b104fa60d32f71d7f010318d6270570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/bundle.json","state_url":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/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-26T11:54:48Z","links":{"resolver":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4","bundle":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/bundle.json","state":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:32MWW2HY3RVW4LWF3DNLJPIIF4","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":"22fb7fe0ec4c67e7811a2e4488d528b8dd7cbae635fa3960e1ec3317480ae860","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T15:20:43Z","title_canon_sha256":"2b03a3a25ee172b55efd685bad77a78347ba142c2f7cae71a394efba91cdb8d7"},"schema_version":"1.0","source":{"id":"1907.07574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07574","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07574v1","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07574","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"32MWW2HY3RVW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"32MWW2HY3RVW4LWF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"32MWW2HY","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:21ede0e35d8d87441725bde85ed607976b104fa60d32f71d7f010318d6270570","target":"graph","created_at":"2026-05-17T23:40:21Z","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 the time-decay model for data streams, elements of an underlying data set arrive sequentially with the recently arrived elements being more important. A common approach for handling large data sets is to maintain a \\emph{coreset}, a succinct summary of the processed data that allows approximate recovery of a predetermined query. We provide a general framework that takes any offline-coreset and gives a time-decay coreset for polynomial time decay functions.\n  We also consider the exponential time decay model for $k$-median clustering, where we provide a constant factor approximation algorith","authors_text":"Enayat Ullah, Harry Lang, Samson Zhou, Vladimir Braverman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T15:20:43Z","title":"Improved Algorithms for Time Decay Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07574","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:e58124bb267901de7c0bede1b044e386abb0b312fd709e9f360d0c1a012e39ff","target":"record","created_at":"2026-05-17T23:40:21Z","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":"22fb7fe0ec4c67e7811a2e4488d528b8dd7cbae635fa3960e1ec3317480ae860","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T15:20:43Z","title_canon_sha256":"2b03a3a25ee172b55efd685bad77a78347ba142c2f7cae71a394efba91cdb8d7"},"schema_version":"1.0","source":{"id":"1907.07574","kind":"arxiv","version":1}},"canonical_sha256":"de996b68f8dc6b6e2ec5d8dab4bd082f2376e667ba6b327179bac77f3c235d00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de996b68f8dc6b6e2ec5d8dab4bd082f2376e667ba6b327179bac77f3c235d00","first_computed_at":"2026-05-17T23:40:21.698421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:21.698421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IyFY+pdXVs0wl5wX+yuRUr3mc3Sdhf3W/xgLGysgEZYNI0LHHufhoMaLXVXRD9hvuD4FJq5LjDxYWR5gN3lXBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:21.699210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e58124bb267901de7c0bede1b044e386abb0b312fd709e9f360d0c1a012e39ff","sha256:21ede0e35d8d87441725bde85ed607976b104fa60d32f71d7f010318d6270570"],"state_sha256":"7790a664948f54c499c18cf0cfdc8708294427536f5559cc3768f8c20ff55105"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNZ88SkDtlrD+lpY+u+0JtzWU9Hwx6+uMM1q4PVkk6BS9kkpU582GuAj9J+PpRqUBQVnr6xWQbCuneXHu5UyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:54:48.323966Z","bundle_sha256":"3331e54661929f019f78d1b40f47a4de36f8b1ee5caca6636880dda27376b271"}}