{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:32MWW2HY3RVW4LWF3DNLJPIIF4","short_pith_number":"pith:32MWW2HY","schema_version":"1.0","canonical_sha256":"de996b68f8dc6b6e2ec5d8dab4bd082f2376e667ba6b327179bac77f3c235d00","source":{"kind":"arxiv","id":"1907.07574","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.07574","created_at":"2026-05-17T23:40:21.698585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07574v1","created_at":"2026-05-17T23:40:21.698585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07574","created_at":"2026-05-17T23:40:21.698585+00:00"},{"alias_kind":"pith_short_12","alias_value":"32MWW2HY3RVW","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"32MWW2HY3RVW4LWF","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"32MWW2HY","created_at":"2026-05-18T12:33:07.085635+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/32MWW2HY3RVW4LWF3DNLJPIIF4","json":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4.json","graph_json":"https://pith.science/api/pith-number/32MWW2HY3RVW4LWF3DNLJPIIF4/graph.json","events_json":"https://pith.science/api/pith-number/32MWW2HY3RVW4LWF3DNLJPIIF4/events.json","paper":"https://pith.science/paper/32MWW2HY"},"agent_actions":{"view_html":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4","download_json":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4.json","view_paper":"https://pith.science/paper/32MWW2HY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07574&json=true","fetch_graph":"https://pith.science/api/pith-number/32MWW2HY3RVW4LWF3DNLJPIIF4/graph.json","fetch_events":"https://pith.science/api/pith-number/32MWW2HY3RVW4LWF3DNLJPIIF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/action/storage_attestation","attest_author":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/action/author_attestation","sign_citation":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/action/citation_signature","submit_replication":"https://pith.science/pith/32MWW2HY3RVW4LWF3DNLJPIIF4/action/replication_record"}},"created_at":"2026-05-17T23:40:21.698585+00:00","updated_at":"2026-05-17T23:40:21.698585+00:00"}