{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MRWMW2Z3VOASCDDBM4FZ4PX4H2","short_pith_number":"pith:MRWMW2Z3","schema_version":"1.0","canonical_sha256":"646ccb6b3bab81210c61670b9e3efc3e9a3e016688c89880560add31f6a8dfa6","source":{"kind":"arxiv","id":"1812.09824","version":1},"attestation_state":"computed","paper":{"title":"The Online Event-Detection Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cynthia A. Phillips, Jonathan W. Berry, Martin Farach-Colton, Michael A. Bender, Prashant Pandey, Rob Johnson, Shikha Singh, Thomas M. Kroeger","submitted_at":"2018-12-24T04:16:53Z","abstract_excerpt":"Given a stream $S = (s_1, s_2, ..., s_N)$, a $\\phi$-heavy hitter is an item $s_i$ that occurs at least $\\phi N$ times in $S$. The problem of finding heavy-hitters has been extensively studied in the database literature. In this paper, we study a related problem. We say that there is a $\\phi$-event at time $t$ if $s_t$ occurs exactly $\\phi N$ times in $(s_1, s_2, ..., s_t)$. Thus, for each $\\phi$-heavy hitter there is a single $\\phi$-event which occurs when its count reaches the reporting threshold $\\phi N$. We define the online event-detection problem (OEDP) as: given $\\phi$ and a stream $S$, "},"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":"1812.09824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-24T04:16:53Z","cross_cats_sorted":[],"title_canon_sha256":"dc0ebd0c4597f28c4e268717c0fbbf0283cde0b2d91bf32b0fa1015dd82d9529","abstract_canon_sha256":"dedc51f1ef60eb22ed4d898fd7ac757ecaea2d1c5801e153d2f94c7d8a0d0c33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:26.701780Z","signature_b64":"kMEPtGzSx5OR/sqAtdw4U/s0P3pZQpvn9K1Ya4J9KxjnWR6OPBtR14ElS/kk40c2NQ2t4eJalBYcsCybjXE9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"646ccb6b3bab81210c61670b9e3efc3e9a3e016688c89880560add31f6a8dfa6","last_reissued_at":"2026-05-17T23:57:26.701094Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:26.701094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Online Event-Detection Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cynthia A. Phillips, Jonathan W. Berry, Martin Farach-Colton, Michael A. Bender, Prashant Pandey, Rob Johnson, Shikha Singh, Thomas M. Kroeger","submitted_at":"2018-12-24T04:16:53Z","abstract_excerpt":"Given a stream $S = (s_1, s_2, ..., s_N)$, a $\\phi$-heavy hitter is an item $s_i$ that occurs at least $\\phi N$ times in $S$. The problem of finding heavy-hitters has been extensively studied in the database literature. In this paper, we study a related problem. We say that there is a $\\phi$-event at time $t$ if $s_t$ occurs exactly $\\phi N$ times in $(s_1, s_2, ..., s_t)$. Thus, for each $\\phi$-heavy hitter there is a single $\\phi$-event which occurs when its count reaches the reporting threshold $\\phi N$. We define the online event-detection problem (OEDP) as: given $\\phi$ and a stream $S$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09824","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":"1812.09824","created_at":"2026-05-17T23:57:26.701185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.09824v1","created_at":"2026-05-17T23:57:26.701185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09824","created_at":"2026-05-17T23:57:26.701185+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRWMW2Z3VOAS","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRWMW2Z3VOASCDDB","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRWMW2Z3","created_at":"2026-05-18T12:32:40.477152+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/MRWMW2Z3VOASCDDBM4FZ4PX4H2","json":"https://pith.science/pith/MRWMW2Z3VOASCDDBM4FZ4PX4H2.json","graph_json":"https://pith.science/api/pith-number/MRWMW2Z3VOASCDDBM4FZ4PX4H2/graph.json","events_json":"https://pith.science/api/pith-number/MRWMW2Z3VOASCDDBM4FZ4PX4H2/events.json","paper":"https://pith.science/paper/MRWMW2Z3"},"agent_actions":{"view_html":"https://pith.science/pith/MRWMW2Z3VOASCDDBM4FZ4PX4H2","download_json":"https://pith.science/pith/MRWMW2Z3VOASCDDBM4FZ4PX4H2.json","view_paper":"https://pith.science/paper/MRWMW2Z3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.09824&json=true","fetch_graph":"https://pith.science/api/pith-number/MRWMW2Z3VOASCDDBM4FZ4PX4H2/graph.json","fetch_events":"https://pith.science/api/pith-number/MRWMW2Z3VOASCDDBM4FZ4PX4H2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRWMW2Z3VOASCDDBM4FZ4PX4H2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRWMW2Z3VOASCDDBM4FZ4PX4H2/action/storage_attestation","attest_author":"https://pith.science/pith/MRWMW2Z3VOASCDDBM4FZ4PX4H2/action/author_attestation","sign_citation":"https://pith.science/pith/MRWMW2Z3VOASCDDBM4FZ4PX4H2/action/citation_signature","submit_replication":"https://pith.science/pith/MRWMW2Z3VOASCDDBM4FZ4PX4H2/action/replication_record"}},"created_at":"2026-05-17T23:57:26.701185+00:00","updated_at":"2026-05-17T23:57:26.701185+00:00"}