{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GMU4UBSACHFZH5RJZDAPW6PQWY","short_pith_number":"pith:GMU4UBSA","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"},"canonical_sha256":"3329ca064011cb93f629c8c0fb79f0b605216e61944fc155374b9d44a76a6ee1","source":{"kind":"arxiv","id":"1608.07002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07002","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07002v1","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07002","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"GMU4UBSACHFZ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GMU4UBSACHFZH5RJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GMU4UBSA","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GMU4UBSACHFZH5RJZDAPW6PQWY","target":"record","payload":{"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"},"canonical_sha256":"3329ca064011cb93f629c8c0fb79f0b605216e61944fc155374b9d44a76a6ee1","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"},"source_kind":"arxiv","source_id":"1608.07002","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-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEp5Yq+wt3z1/XKV9jL+xFB6patIlF15gDJsLa8Z8ms1ipVbK/pfWI+SEE5oyPc141rEdS+BMdmmuCikCkDrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:28:14.362166Z"},"content_sha256":"cd8e5e766ba9546b08a897ede89da02563ef55d21d4f4f6d42660eaf01d19fa0","schema_version":"1.0","event_id":"sha256:cd8e5e766ba9546b08a897ede89da02563ef55d21d4f4f6d42660eaf01d19fa0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GMU4UBSACHFZH5RJZDAPW6PQWY","target":"graph","payload":{"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"},"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:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1jXw3VMw3tzroEtXAUI7TJgSbWcazGL0of2nMcOeyTZm3FbRTnMCARaJoHCdtqHp2I1OQpqEQ67mzRe3etBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:28:14.362680Z"},"content_sha256":"e79ff013d3f160debc5a4d5fe6c940a482b99f9dac461f49a8097f3052b394e3","schema_version":"1.0","event_id":"sha256:e79ff013d3f160debc5a4d5fe6c940a482b99f9dac461f49a8097f3052b394e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/bundle.json","state_url":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/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-06-07T10:28:14Z","links":{"resolver":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY","bundle":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/bundle.json","state":"https://pith.science/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMU4UBSACHFZH5RJZDAPW6PQWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GMU4UBSACHFZH5RJZDAPW6PQWY","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":"031e6fd14f9f1571e245c0d6ee67bdac0637375421949f59ecc71559b2d477fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-25T01:56:40Z","title_canon_sha256":"a5b73dc6a75566021d33cbf35987f05e9fbaa8fe9258da2c82392995cf459b30"},"schema_version":"1.0","source":{"id":"1608.07002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07002","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07002v1","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07002","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"GMU4UBSACHFZ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GMU4UBSACHFZH5RJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GMU4UBSA","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:e79ff013d3f160debc5a4d5fe6c940a482b99f9dac461f49a8097f3052b394e3","target":"graph","created_at":"2026-05-18T01:07:56Z","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":"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.","authors_text":"Daxin Zhu, Lei Wang, Tinran Wang, Xiaodong Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-25T01:56:40Z","title":"A simple linear space algorithm for computing a longest common increasing subsequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07002","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:cd8e5e766ba9546b08a897ede89da02563ef55d21d4f4f6d42660eaf01d19fa0","target":"record","created_at":"2026-05-18T01:07:56Z","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":"031e6fd14f9f1571e245c0d6ee67bdac0637375421949f59ecc71559b2d477fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-25T01:56:40Z","title_canon_sha256":"a5b73dc6a75566021d33cbf35987f05e9fbaa8fe9258da2c82392995cf459b30"},"schema_version":"1.0","source":{"id":"1608.07002","kind":"arxiv","version":1}},"canonical_sha256":"3329ca064011cb93f629c8c0fb79f0b605216e61944fc155374b9d44a76a6ee1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3329ca064011cb93f629c8c0fb79f0b605216e61944fc155374b9d44a76a6ee1","first_computed_at":"2026-05-18T01:07:56.307427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:56.307427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5OuKey/2UjfdJAfyGpQWLDJpneCM7eSk49YQfnBj095ARAs/Lbwjv3hbHjlv+//8Vi1xrMGgFhtt0qwFldTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:56.307862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd8e5e766ba9546b08a897ede89da02563ef55d21d4f4f6d42660eaf01d19fa0","sha256:e79ff013d3f160debc5a4d5fe6c940a482b99f9dac461f49a8097f3052b394e3"],"state_sha256":"cca91e80cf8a5d6dbd1cd3ae25e777b26c85a341b9bb4c0c76b712829b5d8ee1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6fjtgLPqJZTJYRmrY6tt+abgqx+hi4lX89OJIYZIIJysRosIvXNORohfw4eTtsXRPbWFcRYh8wrvum6NvSzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:28:14.365311Z","bundle_sha256":"5f20a18d761f23b298750d8462bc8d6868db0173c8a776e7c1fa2581d7138c7b"}}