{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XY7BZCBJMSZLFZFY6IADMJTKPH","short_pith_number":"pith:XY7BZCBJ","schema_version":"1.0","canonical_sha256":"be3e1c882964b2b2e4b8f20036266a79db1c3931fdbda376b1314fd0b1777998","source":{"kind":"arxiv","id":"1604.02552","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.02552","created_at":"2026-05-18T01:02:44.615133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02552v4","created_at":"2026-05-18T01:02:44.615133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02552","created_at":"2026-05-18T01:02:44.615133+00:00"},{"alias_kind":"pith_short_12","alias_value":"XY7BZCBJMSZL","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XY7BZCBJMSZLFZFY","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XY7BZCBJ","created_at":"2026-05-18T12:30:51.357362+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/XY7BZCBJMSZLFZFY6IADMJTKPH","json":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH.json","graph_json":"https://pith.science/api/pith-number/XY7BZCBJMSZLFZFY6IADMJTKPH/graph.json","events_json":"https://pith.science/api/pith-number/XY7BZCBJMSZLFZFY6IADMJTKPH/events.json","paper":"https://pith.science/paper/XY7BZCBJ"},"agent_actions":{"view_html":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH","download_json":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH.json","view_paper":"https://pith.science/paper/XY7BZCBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02552&json=true","fetch_graph":"https://pith.science/api/pith-number/XY7BZCBJMSZLFZFY6IADMJTKPH/graph.json","fetch_events":"https://pith.science/api/pith-number/XY7BZCBJMSZLFZFY6IADMJTKPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/action/storage_attestation","attest_author":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/action/author_attestation","sign_citation":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/action/citation_signature","submit_replication":"https://pith.science/pith/XY7BZCBJMSZLFZFY6IADMJTKPH/action/replication_record"}},"created_at":"2026-05-18T01:02:44.615133+00:00","updated_at":"2026-05-18T01:02:44.615133+00:00"}