{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G6GRIXMWGZS73RRP323DBMTKKP","short_pith_number":"pith:G6GRIXMW","canonical_record":{"source":{"id":"1309.7724","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-30T05:24:37Z","cross_cats_sorted":[],"title_canon_sha256":"e70ee1013c7f996002748f55a5f3d33176d2d527c06a0bd5ef767636c1c0efb2","abstract_canon_sha256":"efc35280b927230bbde21db28971080b4782ae7e31d1bef7bc0402f8281df374"},"schema_version":"1.0"},"canonical_sha256":"378d145d963665fdc62fdeb630b26a53dced1c61f71dc6c47151c57769f41838","source":{"kind":"arxiv","id":"1309.7724","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7724","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7724v4","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7724","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"G6GRIXMWGZS7","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G6GRIXMWGZS73RRP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G6GRIXMW","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G6GRIXMWGZS73RRP323DBMTKKP","target":"record","payload":{"canonical_record":{"source":{"id":"1309.7724","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-30T05:24:37Z","cross_cats_sorted":[],"title_canon_sha256":"e70ee1013c7f996002748f55a5f3d33176d2d527c06a0bd5ef767636c1c0efb2","abstract_canon_sha256":"efc35280b927230bbde21db28971080b4782ae7e31d1bef7bc0402f8281df374"},"schema_version":"1.0"},"canonical_sha256":"378d145d963665fdc62fdeb630b26a53dced1c61f71dc6c47151c57769f41838","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:37.023256Z","signature_b64":"zX4JIeFbp72XtTqdFhHJZaKvqnp0tPH2xMUcilc/a9Ow5BsCJDhwyNoHGy1LCYsN41MUem0q2vjwU9CExDwTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"378d145d963665fdc62fdeb630b26a53dced1c61f71dc6c47151c57769f41838","last_reissued_at":"2026-05-18T03:04:37.022523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:37.022523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.7724","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-18T03:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YfnJat0W0Q9hHZLVXtXwa087NvH2U+mIulI6FlyUYvy2s/jWHuvULhQbdyym8qDVfs1iMzxj0hN4EZPIkjOwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:00:30.219884Z"},"content_sha256":"f1450e8f948259b3f9884bc8a9ae8e0f81690535243fbfbf585f2cc43178724b","schema_version":"1.0","event_id":"sha256:f1450e8f948259b3f9884bc8a9ae8e0f81690535243fbfbf585f2cc43178724b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G6GRIXMWGZS73RRP323DBMTKKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Dynamic Longest Increasing Subsequence Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Chen, Nathan Pinsker, Timothy Chu","submitted_at":"2013-09-30T05:24:37Z","abstract_excerpt":"In this paper, we construct a data structure to efficiently compute the longest increasing subsequence of a sequence subject to dynamic updates. Our data structure supports a query for the longest increasing subsequence in $O(r+\\log n)$ worst-case time and supports inserts anywhere in the sequence in $O \\left(r\\log{n/r}\\right)$ worst-case time (where $r$ is the length of the longest increasing subsequence). The same data structure with a minor modification supports $O(\\log n)$ worst-case time insertions if the insertions are performed at the end of the sequence. The data structure presented ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7724","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-18T03:04:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNKE4WGs9HQRD592qY+z9MsVQ5ZdvQf56oybk6S4OgHJgDDeg+6A4dHSzYBvN2njqajwq7PYuUm3fw/PCb8iAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T02:00:30.220224Z"},"content_sha256":"09acc9b5d236125572816b1f710b5db24d0b166fe8690e2d76ee58a017ee8dcf","schema_version":"1.0","event_id":"sha256:09acc9b5d236125572816b1f710b5db24d0b166fe8690e2d76ee58a017ee8dcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6GRIXMWGZS73RRP323DBMTKKP/bundle.json","state_url":"https://pith.science/pith/G6GRIXMWGZS73RRP323DBMTKKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6GRIXMWGZS73RRP323DBMTKKP/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-25T02:00:30Z","links":{"resolver":"https://pith.science/pith/G6GRIXMWGZS73RRP323DBMTKKP","bundle":"https://pith.science/pith/G6GRIXMWGZS73RRP323DBMTKKP/bundle.json","state":"https://pith.science/pith/G6GRIXMWGZS73RRP323DBMTKKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6GRIXMWGZS73RRP323DBMTKKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G6GRIXMWGZS73RRP323DBMTKKP","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":"efc35280b927230bbde21db28971080b4782ae7e31d1bef7bc0402f8281df374","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-30T05:24:37Z","title_canon_sha256":"e70ee1013c7f996002748f55a5f3d33176d2d527c06a0bd5ef767636c1c0efb2"},"schema_version":"1.0","source":{"id":"1309.7724","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7724","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7724v4","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7724","created_at":"2026-05-18T03:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"G6GRIXMWGZS7","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G6GRIXMWGZS73RRP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G6GRIXMW","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:09acc9b5d236125572816b1f710b5db24d0b166fe8690e2d76ee58a017ee8dcf","target":"graph","created_at":"2026-05-18T03:04:37Z","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 construct a data structure to efficiently compute the longest increasing subsequence of a sequence subject to dynamic updates. Our data structure supports a query for the longest increasing subsequence in $O(r+\\log n)$ worst-case time and supports inserts anywhere in the sequence in $O \\left(r\\log{n/r}\\right)$ worst-case time (where $r$ is the length of the longest increasing subsequence). The same data structure with a minor modification supports $O(\\log n)$ worst-case time insertions if the insertions are performed at the end of the sequence. The data structure presented ca","authors_text":"Alex Chen, Nathan Pinsker, Timothy Chu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-30T05:24:37Z","title":"The Dynamic Longest Increasing Subsequence Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7724","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:f1450e8f948259b3f9884bc8a9ae8e0f81690535243fbfbf585f2cc43178724b","target":"record","created_at":"2026-05-18T03:04:37Z","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":"efc35280b927230bbde21db28971080b4782ae7e31d1bef7bc0402f8281df374","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-30T05:24:37Z","title_canon_sha256":"e70ee1013c7f996002748f55a5f3d33176d2d527c06a0bd5ef767636c1c0efb2"},"schema_version":"1.0","source":{"id":"1309.7724","kind":"arxiv","version":4}},"canonical_sha256":"378d145d963665fdc62fdeb630b26a53dced1c61f71dc6c47151c57769f41838","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"378d145d963665fdc62fdeb630b26a53dced1c61f71dc6c47151c57769f41838","first_computed_at":"2026-05-18T03:04:37.022523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:37.022523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zX4JIeFbp72XtTqdFhHJZaKvqnp0tPH2xMUcilc/a9Ow5BsCJDhwyNoHGy1LCYsN41MUem0q2vjwU9CExDwTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:37.023256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7724","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1450e8f948259b3f9884bc8a9ae8e0f81690535243fbfbf585f2cc43178724b","sha256:09acc9b5d236125572816b1f710b5db24d0b166fe8690e2d76ee58a017ee8dcf"],"state_sha256":"a4793faafb985682bda08b680719e6f058ef1386bef8055f017e3978575f8bf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y37hMKdf8YCJSwfQRcbRdn9wHnuwEMXZ7lwnaWlXicWR6ZQ9dK53pDPLcH/lXdsZ+8n+wM6d1mB1FtGizzXNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T02:00:30.222128Z","bundle_sha256":"63652d44956aa56b9dab6cd3df5e4258dc62463ca51fbd44c9067b70e2462b84"}}