{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:W3H65LVEUYLJPW6VLZAM77AQLI","short_pith_number":"pith:W3H65LVE","canonical_record":{"source":{"id":"cs/0610046","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-10-09T22:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"970f69b99dc17f2ff17a8e2e7fce9aca35cd99f01f71663d7087d1c83c057e66","abstract_canon_sha256":"2a2ce8c822228457bf30df5926f2411bc2e0cb3cdd64700cf7ce5f848113e419"},"schema_version":"1.0"},"canonical_sha256":"b6cfeeaea4a61697dbd55e40cffc105a01f7aa75904442f735312be76156c69a","source":{"kind":"arxiv","id":"cs/0610046","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610046","created_at":"2026-05-18T04:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610046v5","created_at":"2026-05-18T04:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610046","created_at":"2026-05-18T04:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"W3H65LVEUYLJ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"W3H65LVEUYLJPW6V","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"W3H65LVE","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:W3H65LVEUYLJPW6VLZAM77AQLI","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0610046","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-10-09T22:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"970f69b99dc17f2ff17a8e2e7fce9aca35cd99f01f71663d7087d1c83c057e66","abstract_canon_sha256":"2a2ce8c822228457bf30df5926f2411bc2e0cb3cdd64700cf7ce5f848113e419"},"schema_version":"1.0"},"canonical_sha256":"b6cfeeaea4a61697dbd55e40cffc105a01f7aa75904442f735312be76156c69a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:42.885140Z","signature_b64":"+Gq/mD50iswRajERfMBdczDFCz9awb8tbLvckuEvQYfBtoyaqRturl4PeQXiLBMDpe25bImOyPwR1i+29Td2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6cfeeaea4a61697dbd55e40cffc105a01f7aa75904442f735312be76156c69a","last_reissued_at":"2026-05-18T04:04:42.884675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:42.884675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0610046","source_version":5,"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-18T04:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvl3BmKFZEs8mGGRboj6qanIFWZjNg7yOSKtovUzoImBzV8bR/1X2Wjoq+RuFbHPKAkCSK+vR3KbFn4dWGOKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:31:30.966376Z"},"content_sha256":"270d8f1de4d9fb62b4b784fa4bb3eb162cc1195c383e2e864a141cfc29efdb64","schema_version":"1.0","event_id":"sha256:270d8f1de4d9fb62b4b784fa4bb3eb162cc1195c383e2e864a141cfc29efdb64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:W3H65LVEUYLJPW6VLZAM77AQLI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lemire","submitted_at":"2006-10-09T22:09:42Z","abstract_excerpt":"The running maximum-minimum (max-min) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time series analysis. We present an easy-to-implement online algorithm requiring no more than 3 comparisons per element, in the worst case. Comparatively, no algorithm is known to compute the running maximum (or minimum) filter in 1.5 comparisons per element, in the worst case. Our algorithm has reduced latency and memory usage."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610046","kind":"arxiv","version":5},"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-18T04:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1shOpSXpCk/bQKUiU+ylQJrAmZihZ0xXJfdRARkjPVqzjIYN4znoyM1hDxx9Gx2wo5jP518irTUWkMFdaSpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:31:30.966993Z"},"content_sha256":"5e396f7f613de50e8bc9ab8f3ce99b05684438a6517e6e3fcae467417d4c3897","schema_version":"1.0","event_id":"sha256:5e396f7f613de50e8bc9ab8f3ce99b05684438a6517e6e3fcae467417d4c3897"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3H65LVEUYLJPW6VLZAM77AQLI/bundle.json","state_url":"https://pith.science/pith/W3H65LVEUYLJPW6VLZAM77AQLI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3H65LVEUYLJPW6VLZAM77AQLI/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-27T10:31:30Z","links":{"resolver":"https://pith.science/pith/W3H65LVEUYLJPW6VLZAM77AQLI","bundle":"https://pith.science/pith/W3H65LVEUYLJPW6VLZAM77AQLI/bundle.json","state":"https://pith.science/pith/W3H65LVEUYLJPW6VLZAM77AQLI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3H65LVEUYLJPW6VLZAM77AQLI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:W3H65LVEUYLJPW6VLZAM77AQLI","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":"2a2ce8c822228457bf30df5926f2411bc2e0cb3cdd64700cf7ce5f848113e419","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2006-10-09T22:09:42Z","title_canon_sha256":"970f69b99dc17f2ff17a8e2e7fce9aca35cd99f01f71663d7087d1c83c057e66"},"schema_version":"1.0","source":{"id":"cs/0610046","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610046","created_at":"2026-05-18T04:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610046v5","created_at":"2026-05-18T04:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610046","created_at":"2026-05-18T04:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"W3H65LVEUYLJ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"W3H65LVEUYLJPW6V","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"W3H65LVE","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:5e396f7f613de50e8bc9ab8f3ce99b05684438a6517e6e3fcae467417d4c3897","target":"graph","created_at":"2026-05-18T04:04:42Z","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":"The running maximum-minimum (max-min) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time series analysis. We present an easy-to-implement online algorithm requiring no more than 3 comparisons per element, in the worst case. Comparatively, no algorithm is known to compute the running maximum (or minimum) filter in 1.5 comparisons per element, in the worst case. Our algorithm has reduced latency and memory usage.","authors_text":"Daniel Lemire","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2006-10-09T22:09:42Z","title":"Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610046","kind":"arxiv","version":5},"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:270d8f1de4d9fb62b4b784fa4bb3eb162cc1195c383e2e864a141cfc29efdb64","target":"record","created_at":"2026-05-18T04:04:42Z","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":"2a2ce8c822228457bf30df5926f2411bc2e0cb3cdd64700cf7ce5f848113e419","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2006-10-09T22:09:42Z","title_canon_sha256":"970f69b99dc17f2ff17a8e2e7fce9aca35cd99f01f71663d7087d1c83c057e66"},"schema_version":"1.0","source":{"id":"cs/0610046","kind":"arxiv","version":5}},"canonical_sha256":"b6cfeeaea4a61697dbd55e40cffc105a01f7aa75904442f735312be76156c69a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6cfeeaea4a61697dbd55e40cffc105a01f7aa75904442f735312be76156c69a","first_computed_at":"2026-05-18T04:04:42.884675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:42.884675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Gq/mD50iswRajERfMBdczDFCz9awb8tbLvckuEvQYfBtoyaqRturl4PeQXiLBMDpe25bImOyPwR1i+29Td2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:42.885140Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0610046","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:270d8f1de4d9fb62b4b784fa4bb3eb162cc1195c383e2e864a141cfc29efdb64","sha256:5e396f7f613de50e8bc9ab8f3ce99b05684438a6517e6e3fcae467417d4c3897"],"state_sha256":"60ad504a2f5403998ce199821c1775f1a141e0857c9bc8e9aff50e3f833cdfad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KoKK8xUW4G2YGKs1Je/7+wlttMcsuj+lAA0rfilKomFYBoLC9pBhIrNfMPccALfjdoWEuFo5R4JnUZPbK4ueAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:31:30.970290Z","bundle_sha256":"0f0c2eeab051f70bc96ef4c2d6a978d4b5573c8396ceb7b735b698a13172fa8a"}}