{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GMU4UBSACHFZH5RJZDAPW6PQWY","short_pith_number":"pith:GMU4UBSA","schema_version":"1.0","canonical_sha256":"3329ca064011cb93f629c8c0fb79f0b605216e61944fc155374b9d44a76a6ee1","source":{"kind":"arxiv","id":"1608.07002","version":1},"attestation_state":"computed","paper":{"title":"A simple linear space algorithm for computing a longest common increasing subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daxin Zhu, Lei Wang, Tinran Wang, Xiaodong Wang","submitted_at":"2016-08-25T01:56:40Z","abstract_excerpt":"This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common increasing subsequence of sizes $n$ and $m$ respectively, in time $O(nm)$ using additional $\\min\\{n,m\\}+1$ space."},"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":"1608.07002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-25T01:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"a5b73dc6a75566021d33cbf35987f05e9fbaa8fe9258da2c82392995cf459b30","abstract_canon_sha256":"031e6fd14f9f1571e245c0d6ee67bdac0637375421949f59ecc71559b2d477fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:56.307862Z","signature_b64":"P5OuKey/2UjfdJAfyGpQWLDJpneCM7eSk49YQfnBj095ARAs/Lbwjv3hbHjlv+//8Vi1xrMGgFhtt0qwFldTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3329ca064011cb93f629c8c0fb79f0b605216e61944fc155374b9d44a76a6ee1","last_reissued_at":"2026-05-18T01:07:56.307427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:56.307427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple linear space algorithm for computing a longest common increasing subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daxin Zhu, Lei Wang, Tinran Wang, Xiaodong Wang","submitted_at":"2016-08-25T01:56:40Z","abstract_excerpt":"This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common increasing subsequence of sizes $n$ and $m$ respectively, in time $O(nm)$ using additional $\\min\\{n,m\\}+1$ space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07002","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.07002","created_at":"2026-05-18T01:07:56.307488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07002v1","created_at":"2026-05-18T01:07:56.307488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07002","created_at":"2026-05-18T01:07:56.307488+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMU4UBSACHFZ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMU4UBSACHFZH5RJ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMU4UBSA","created_at":"2026-05-18T12:30:19.053100+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/GMU4UBSACHFZH5RJZDAPW6PQWY","json":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY.json","graph_json":"https://pith.science/api/pith-number/GMU4UBSACHFZH5RJZDAPW6PQWY/graph.json","events_json":"https://pith.science/api/pith-number/GMU4UBSACHFZH5RJZDAPW6PQWY/events.json","paper":"https://pith.science/paper/GMU4UBSA"},"agent_actions":{"view_html":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY","download_json":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY.json","view_paper":"https://pith.science/paper/GMU4UBSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07002&json=true","fetch_graph":"https://pith.science/api/pith-number/GMU4UBSACHFZH5RJZDAPW6PQWY/graph.json","fetch_events":"https://pith.science/api/pith-number/GMU4UBSACHFZH5RJZDAPW6PQWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/action/storage_attestation","attest_author":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/action/author_attestation","sign_citation":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/action/citation_signature","submit_replication":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/action/replication_record"}},"created_at":"2026-05-18T01:07:56.307488+00:00","updated_at":"2026-05-18T01:07:56.307488+00:00"}