{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XY7BZCBJMSZLFZFY6IADMJTKPH","short_pith_number":"pith:XY7BZCBJ","canonical_record":{"source":{"id":"1604.02552","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-09T11:48:47Z","cross_cats_sorted":[],"title_canon_sha256":"401c18418ce04ce5fa2bc4227034b02bfb2c0457e43b9d9e2313db5aa441e4ad","abstract_canon_sha256":"3329773d120fdadf25e10a542e10e19f3425b429cccc73e684b7eab3dd8624f9"},"schema_version":"1.0"},"canonical_sha256":"be3e1c882964b2b2e4b8f20036266a79db1c3931fdbda376b1314fd0b1777998","source":{"kind":"arxiv","id":"1604.02552","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02552","created_at":"2026-05-18T01:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02552v4","created_at":"2026-05-18T01:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02552","created_at":"2026-05-18T01:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"XY7BZCBJMSZL","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XY7BZCBJMSZLFZFY","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XY7BZCBJ","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XY7BZCBJMSZLFZFY6IADMJTKPH","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02552","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-09T11:48:47Z","cross_cats_sorted":[],"title_canon_sha256":"401c18418ce04ce5fa2bc4227034b02bfb2c0457e43b9d9e2313db5aa441e4ad","abstract_canon_sha256":"3329773d120fdadf25e10a542e10e19f3425b429cccc73e684b7eab3dd8624f9"},"schema_version":"1.0"},"canonical_sha256":"be3e1c882964b2b2e4b8f20036266a79db1c3931fdbda376b1314fd0b1777998","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:44.615510Z","signature_b64":"iZUjH43/LuxyyuxIK563O1iQ5RICoVtcldmUuC6dUfqeO0oB5v5hwS7vo81ehSsjL59WJO+o67ngJTn1WA/qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be3e1c882964b2b2e4b8f20036266a79db1c3931fdbda376b1314fd0b1777998","last_reissued_at":"2026-05-18T01:02:44.615078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:44.615078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02552","source_version":4,"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-18T01:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZpa8TQSiQOwKpPn7+xn+pUYq7Fv67ssth47JfFv/UkXnJ9xsqxU6q/0ytnaKAvswPnJ2FuD54RVFILJsOgCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:31:57.050246Z"},"content_sha256":"f94d7eafe1efa6af5446362b5552173aa22e013e24f3675646221abf513c6bb1","schema_version":"1.0","event_id":"sha256:f94d7eafe1efa6af5446362b5552173aa22e013e24f3675646221abf513c6bb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XY7BZCBJMSZLFZFY6IADMJTKPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Longest Increasing Subsequence Over Sequential Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dongyan Zhao, Huaming Zhang, Lei Zou, Youhuan Li","submitted_at":"2016-04-09T11:48:47Z","abstract_excerpt":"In this paper, we propose a data structure, a quadruple neighbor list (QN-list, for short), to support real time queries of all longest increasing subsequence (LIS) and LIS with constraints over sequential data streams. The QN-List built by our algorithm requires $O(w)$ space, where $w$ is the time window size. The running time for building the initial QN-List takes $O(w\\log w)$ time. Applying the QN-List, insertion of the new item takes $O(\\log w)$ time and deletion of the first item takes $O(w)$ time. To the best of our knowledge, this is the first work to support both LIS enumeration and LI"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02552","kind":"arxiv","version":4},"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-18T01:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AI6ngLqQ0jNe4nKGQRNuKGXhO5C7INU/SwCLfiUhU6y8vBTRl2iVtY/3uyBb1JmFew9O4d9F8yca76t/XcKmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:31:57.050612Z"},"content_sha256":"ed641ada14d32e436fe3fdfebd3408b3564c15be9a4032a5a5c8f279d97d345d","schema_version":"1.0","event_id":"sha256:ed641ada14d32e436fe3fdfebd3408b3564c15be9a4032a5a5c8f279d97d345d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/bundle.json","state_url":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/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-07-02T16:31:57Z","links":{"resolver":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH","bundle":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/bundle.json","state":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XY7BZCBJMSZLFZFY6IADMJTKPH","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":"3329773d120fdadf25e10a542e10e19f3425b429cccc73e684b7eab3dd8624f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-09T11:48:47Z","title_canon_sha256":"401c18418ce04ce5fa2bc4227034b02bfb2c0457e43b9d9e2313db5aa441e4ad"},"schema_version":"1.0","source":{"id":"1604.02552","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02552","created_at":"2026-05-18T01:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02552v4","created_at":"2026-05-18T01:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02552","created_at":"2026-05-18T01:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"XY7BZCBJMSZL","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XY7BZCBJMSZLFZFY","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XY7BZCBJ","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:ed641ada14d32e436fe3fdfebd3408b3564c15be9a4032a5a5c8f279d97d345d","target":"graph","created_at":"2026-05-18T01:02:44Z","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":"In this paper, we propose a data structure, a quadruple neighbor list (QN-list, for short), to support real time queries of all longest increasing subsequence (LIS) and LIS with constraints over sequential data streams. The QN-List built by our algorithm requires $O(w)$ space, where $w$ is the time window size. The running time for building the initial QN-List takes $O(w\\log w)$ time. Applying the QN-List, insertion of the new item takes $O(\\log w)$ time and deletion of the first item takes $O(w)$ time. To the best of our knowledge, this is the first work to support both LIS enumeration and LI","authors_text":"Dongyan Zhao, Huaming Zhang, Lei Zou, Youhuan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-09T11:48:47Z","title":"Computing Longest Increasing Subsequence Over Sequential Data Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02552","kind":"arxiv","version":4},"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:f94d7eafe1efa6af5446362b5552173aa22e013e24f3675646221abf513c6bb1","target":"record","created_at":"2026-05-18T01:02:44Z","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":"3329773d120fdadf25e10a542e10e19f3425b429cccc73e684b7eab3dd8624f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-09T11:48:47Z","title_canon_sha256":"401c18418ce04ce5fa2bc4227034b02bfb2c0457e43b9d9e2313db5aa441e4ad"},"schema_version":"1.0","source":{"id":"1604.02552","kind":"arxiv","version":4}},"canonical_sha256":"be3e1c882964b2b2e4b8f20036266a79db1c3931fdbda376b1314fd0b1777998","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be3e1c882964b2b2e4b8f20036266a79db1c3931fdbda376b1314fd0b1777998","first_computed_at":"2026-05-18T01:02:44.615078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:44.615078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iZUjH43/LuxyyuxIK563O1iQ5RICoVtcldmUuC6dUfqeO0oB5v5hwS7vo81ehSsjL59WJO+o67ngJTn1WA/qCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:44.615510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02552","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f94d7eafe1efa6af5446362b5552173aa22e013e24f3675646221abf513c6bb1","sha256:ed641ada14d32e436fe3fdfebd3408b3564c15be9a4032a5a5c8f279d97d345d"],"state_sha256":"7a7d675756a056813da09d7aeb687a640d2860f6133e756a4160a3681835a55d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnwC8fXMAlZ5j5VC0qmuINtPGYTnwN44v9c8t1bPkk5WmeMwLDD4y9yg3E3yxeImMmCHTaiNTyxbdUEhiufzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T16:31:57.052454Z","bundle_sha256":"b4dbbd6a56d683e21f6f039a9a553794b943a24bc2d472263c10c3a1432f7d18"}}