{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QFDOIQVBYUYUBFUSN7EAWKEDQU","short_pith_number":"pith:QFDOIQVB","schema_version":"1.0","canonical_sha256":"8146e442a1c5314096926fc80b2883851f685284d81638d099f87baa3c7d7a4e","source":{"kind":"arxiv","id":"1601.04448","version":3},"attestation_state":"computed","paper":{"title":"On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander M\\\"acker, Friedhelm Meyer auf der Heide, Manuel Malatyali","submitted_at":"2016-01-18T10:10:59Z","abstract_excerpt":"Consider the continuous distributed monitoring model in which $n$ distributed nodes, receiving individual data streams, are connected to a designated server. The server is asked to continuously monitor a function defined over the values observed across all streams while minimizing the communication. We study a variant in which the server is equipped with a broadcast channel and is supposed to keep track of an approximation of the set of nodes currently observing the $k$ largest values. Such an approximate set is exact except for some imprecision in an $\\varepsilon$-neighborhood of the $k$-th l"},"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":"1601.04448","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-18T10:10:59Z","cross_cats_sorted":[],"title_canon_sha256":"117993cb4bbcaa04e15943df8bb487185faf5ee919583607d3effd14265e412a","abstract_canon_sha256":"12ea311b7f3d7914ff83a99a12de89b028f72a802160abc4f000788a74fa2075"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:08.673076Z","signature_b64":"JJ2Ok1Ql9qmS80L1DBGa8t6uLSU9ues+OmWzFsVADiVvwEY6/L/j0A2gLfF6+cn8D54NHNTlhyVt7y4YrbdiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8146e442a1c5314096926fc80b2883851f685284d81638d099f87baa3c7d7a4e","last_reissued_at":"2026-05-18T01:01:08.672242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:08.672242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander M\\\"acker, Friedhelm Meyer auf der Heide, Manuel Malatyali","submitted_at":"2016-01-18T10:10:59Z","abstract_excerpt":"Consider the continuous distributed monitoring model in which $n$ distributed nodes, receiving individual data streams, are connected to a designated server. The server is asked to continuously monitor a function defined over the values observed across all streams while minimizing the communication. We study a variant in which the server is equipped with a broadcast channel and is supposed to keep track of an approximation of the set of nodes currently observing the $k$ largest values. Such an approximate set is exact except for some imprecision in an $\\varepsilon$-neighborhood of the $k$-th l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04448","kind":"arxiv","version":3},"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":"1601.04448","created_at":"2026-05-18T01:01:08.672337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04448v3","created_at":"2026-05-18T01:01:08.672337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04448","created_at":"2026-05-18T01:01:08.672337+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFDOIQVBYUYU","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFDOIQVBYUYUBFUS","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFDOIQVB","created_at":"2026-05-18T12:30:39.010887+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/QFDOIQVBYUYUBFUSN7EAWKEDQU","json":"https://pith.science/pith/QFDOIQVBYUYUBFUSN7EAWKEDQU.json","graph_json":"https://pith.science/api/pith-number/QFDOIQVBYUYUBFUSN7EAWKEDQU/graph.json","events_json":"https://pith.science/api/pith-number/QFDOIQVBYUYUBFUSN7EAWKEDQU/events.json","paper":"https://pith.science/paper/QFDOIQVB"},"agent_actions":{"view_html":"https://pith.science/pith/QFDOIQVBYUYUBFUSN7EAWKEDQU","download_json":"https://pith.science/pith/QFDOIQVBYUYUBFUSN7EAWKEDQU.json","view_paper":"https://pith.science/paper/QFDOIQVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04448&json=true","fetch_graph":"https://pith.science/api/pith-number/QFDOIQVBYUYUBFUSN7EAWKEDQU/graph.json","fetch_events":"https://pith.science/api/pith-number/QFDOIQVBYUYUBFUSN7EAWKEDQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFDOIQVBYUYUBFUSN7EAWKEDQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFDOIQVBYUYUBFUSN7EAWKEDQU/action/storage_attestation","attest_author":"https://pith.science/pith/QFDOIQVBYUYUBFUSN7EAWKEDQU/action/author_attestation","sign_citation":"https://pith.science/pith/QFDOIQVBYUYUBFUSN7EAWKEDQU/action/citation_signature","submit_replication":"https://pith.science/pith/QFDOIQVBYUYUBFUSN7EAWKEDQU/action/replication_record"}},"created_at":"2026-05-18T01:01:08.672337+00:00","updated_at":"2026-05-18T01:01:08.672337+00:00"}