{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6V4GCZ3I23D6GLKSRJLAHFNTUL","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":"80f03fd190f9a1c186c7498ec10ee4a7187cdf82d1442eb93b28752a7d4bb956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-26T10:55:12Z","title_canon_sha256":"aa91ab59f8b55f965e479aec5a240cb34531320aa21c5483e344ac0356b8bd9e"},"schema_version":"1.0","source":{"id":"1712.09230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09230","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09230v1","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09230","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"pith_short_12","alias_value":"6V4GCZ3I23D6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6V4GCZ3I23D6GLKS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6V4GCZ3I","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:e243f05b39125038823d5ea8876ce07c9fd37ac86db3aef6f0572dc547d06cc4","target":"graph","created_at":"2026-05-18T00:27:14Z","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":"Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in $O(n \\log n)$ time and space. Our goal in this paper is to reduce the space consumption while keeping the time complexity small. For $\\sqrt{n} \\le s \\le n$, we present algorithms that use $O(s \\log n)$ bits and $O(\\frac{1}{s} \\cdot n^{2} \\cdot \\log n)$ time for computing the length of a longest increasing subsequence, and $O(\\frac{1}{s} \\cdot n^{2} \\cdot \\log^{2} n)$ time for finding an actual subsequence. We also show that the time complexity of our al","authors_text":"Hirotaka Ono, Jun Tarui, Masashi Kiyomi, Pascal Schweitzer, Yota Otachi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-26T10:55:12Z","title":"Space-Efficient Algorithms for Longest Increasing Subsequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09230","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:276aa61cd3c9fbded5c1294cb04049cc7521cbabb989ca899a4fa91845552a10","target":"record","created_at":"2026-05-18T00:27:14Z","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":"80f03fd190f9a1c186c7498ec10ee4a7187cdf82d1442eb93b28752a7d4bb956","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-26T10:55:12Z","title_canon_sha256":"aa91ab59f8b55f965e479aec5a240cb34531320aa21c5483e344ac0356b8bd9e"},"schema_version":"1.0","source":{"id":"1712.09230","kind":"arxiv","version":1}},"canonical_sha256":"f578616768d6c7e32d528a560395b3a2dcadee4785134b85266d60ff67c6d95a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f578616768d6c7e32d528a560395b3a2dcadee4785134b85266d60ff67c6d95a","first_computed_at":"2026-05-18T00:27:14.153820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:14.153820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Apl32qLKrcP2e8L1hAgCeKUfRBypp2F9EOYfLQmwZvoBK9zfv3cTnZw8M15vl5Rfx22ZDHdGmISJm7hKAE3qDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:14.154449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:276aa61cd3c9fbded5c1294cb04049cc7521cbabb989ca899a4fa91845552a10","sha256:e243f05b39125038823d5ea8876ce07c9fd37ac86db3aef6f0572dc547d06cc4"],"state_sha256":"9e24f19f5087976dd6573dbc01d9edc166b873da2bac997308482ab04f763a9c"}