{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3TYQE4IZ6RFKRKFOSACB4QBHKT","short_pith_number":"pith:3TYQE4IZ","canonical_record":{"source":{"id":"1408.1847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-08T13:27:31Z","cross_cats_sorted":[],"title_canon_sha256":"2fdb28474950d28ad81eb1edf797ff7676b877fc356169618cccb1e2aba60020","abstract_canon_sha256":"5a9b5c60c787ad334bef71c3423d0d132965e6fd16dedc3e12a229fb65afecae"},"schema_version":"1.0"},"canonical_sha256":"dcf1027119f44aa8a8ae90041e402754e140ead4323b785f8c7fff407e77864c","source":{"kind":"arxiv","id":"1408.1847","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1847","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1847v1","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1847","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"3TYQE4IZ6RFK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3TYQE4IZ6RFKRKFO","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3TYQE4IZ","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3TYQE4IZ6RFKRKFOSACB4QBHKT","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-08T13:27:31Z","cross_cats_sorted":[],"title_canon_sha256":"2fdb28474950d28ad81eb1edf797ff7676b877fc356169618cccb1e2aba60020","abstract_canon_sha256":"5a9b5c60c787ad334bef71c3423d0d132965e6fd16dedc3e12a229fb65afecae"},"schema_version":"1.0"},"canonical_sha256":"dcf1027119f44aa8a8ae90041e402754e140ead4323b785f8c7fff407e77864c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:38.993306Z","signature_b64":"V0alslbMXe2rjvjywVhaPDM4xDcczkQzXxnOKnR4VoGOg1BuZp12SsG4J4/tSlOrBIT7LCZMipHeJiBG3xEZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcf1027119f44aa8a8ae90041e402754e140ead4323b785f8c7fff407e77864c","last_reissued_at":"2026-05-18T02:45:38.992844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:38.992844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1847","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-18T02:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEYHGnKPvg2oAzCk1cbn65ZvTpigT8o23MuVeD6I1s8Fsi76ES4IYSdcexBJn45mrW+ZX14YBgfPBL3SHrQHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:54:41.134977Z"},"content_sha256":"c606ddff044e24c4a323e05b50b6c117321592230e528e73aeaac1987f1eada9","schema_version":"1.0","event_id":"sha256:c606ddff044e24c4a323e05b50b6c117321592230e528e73aeaac1987f1eada9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3TYQE4IZ6RFKRKFOSACB4QBHKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically exact streaming algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Munteanu, Christian Sohler, Marc Heinrich","submitted_at":"2014-08-08T13:27:31Z","abstract_excerpt":"We introduce a new computational model for data streams: asymptotically exact streaming algorithms. These algorithms have an approximation ratio that tends to one as the length of the stream goes to infinity while the memory used by the algorithm is restricted to polylog(n) size. Thus, the output of the algorithm is optimal in the limit. We show positive results in our model for a series of important problems that have been discussed in the streaming literature. These include computing the frequency moments, clustering problems and least squares regression. Our results also include lower bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1847","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-18T02:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUbJ5C99Oe7/OKDQd+6KnHm43td/L/UHLAKzy8AYcxcwVF+Ttib5brOLnu+SG/pHF6/Rh0iJifZSm88vEKa5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:54:41.135369Z"},"content_sha256":"90eeeb9813b2c189ac980bd9213c7a5053a4c2fc7fd73c29fd9507efb4f8a3c4","schema_version":"1.0","event_id":"sha256:90eeeb9813b2c189ac980bd9213c7a5053a4c2fc7fd73c29fd9507efb4f8a3c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TYQE4IZ6RFKRKFOSACB4QBHKT/bundle.json","state_url":"https://pith.science/pith/3TYQE4IZ6RFKRKFOSACB4QBHKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TYQE4IZ6RFKRKFOSACB4QBHKT/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-26T21:54:41Z","links":{"resolver":"https://pith.science/pith/3TYQE4IZ6RFKRKFOSACB4QBHKT","bundle":"https://pith.science/pith/3TYQE4IZ6RFKRKFOSACB4QBHKT/bundle.json","state":"https://pith.science/pith/3TYQE4IZ6RFKRKFOSACB4QBHKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TYQE4IZ6RFKRKFOSACB4QBHKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3TYQE4IZ6RFKRKFOSACB4QBHKT","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":"5a9b5c60c787ad334bef71c3423d0d132965e6fd16dedc3e12a229fb65afecae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-08T13:27:31Z","title_canon_sha256":"2fdb28474950d28ad81eb1edf797ff7676b877fc356169618cccb1e2aba60020"},"schema_version":"1.0","source":{"id":"1408.1847","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1847","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1847v1","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1847","created_at":"2026-05-18T02:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"3TYQE4IZ6RFK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3TYQE4IZ6RFKRKFO","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3TYQE4IZ","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:90eeeb9813b2c189ac980bd9213c7a5053a4c2fc7fd73c29fd9507efb4f8a3c4","target":"graph","created_at":"2026-05-18T02:45:38Z","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":"We introduce a new computational model for data streams: asymptotically exact streaming algorithms. These algorithms have an approximation ratio that tends to one as the length of the stream goes to infinity while the memory used by the algorithm is restricted to polylog(n) size. Thus, the output of the algorithm is optimal in the limit. We show positive results in our model for a series of important problems that have been discussed in the streaming literature. These include computing the frequency moments, clustering problems and least squares regression. Our results also include lower bound","authors_text":"Alexander Munteanu, Christian Sohler, Marc Heinrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-08T13:27:31Z","title":"Asymptotically exact streaming algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1847","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:c606ddff044e24c4a323e05b50b6c117321592230e528e73aeaac1987f1eada9","target":"record","created_at":"2026-05-18T02:45:38Z","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":"5a9b5c60c787ad334bef71c3423d0d132965e6fd16dedc3e12a229fb65afecae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-08T13:27:31Z","title_canon_sha256":"2fdb28474950d28ad81eb1edf797ff7676b877fc356169618cccb1e2aba60020"},"schema_version":"1.0","source":{"id":"1408.1847","kind":"arxiv","version":1}},"canonical_sha256":"dcf1027119f44aa8a8ae90041e402754e140ead4323b785f8c7fff407e77864c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcf1027119f44aa8a8ae90041e402754e140ead4323b785f8c7fff407e77864c","first_computed_at":"2026-05-18T02:45:38.992844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:38.992844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V0alslbMXe2rjvjywVhaPDM4xDcczkQzXxnOKnR4VoGOg1BuZp12SsG4J4/tSlOrBIT7LCZMipHeJiBG3xEZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:38.993306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1847","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c606ddff044e24c4a323e05b50b6c117321592230e528e73aeaac1987f1eada9","sha256:90eeeb9813b2c189ac980bd9213c7a5053a4c2fc7fd73c29fd9507efb4f8a3c4"],"state_sha256":"9ee61455f25a95555cd7fa7c236c858f4398a6e40109cdaa81f803ee13a12735"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ogOYJnNchV90ek8pvhSQ+Qrx43XD1CHqdhgJnO3ED+/7Wu4Q9Ddyweefl6CfYy0dmtTf7XXWVUA0nDb69JlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:54:41.138339Z","bundle_sha256":"59aa42d7626781183815f6fd6beecf242eb25dcb9c5c06475d90a7d096df7902"}}