{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RUQGG3JQJS6RTVFGTQ2KNSTNYI","short_pith_number":"pith:RUQGG3JQ","schema_version":"1.0","canonical_sha256":"8d20636d304cbd19d4a69c34a6ca6dc218e0fb205fa06e6f269248fb71da5cd6","source":{"kind":"arxiv","id":"1808.03307","version":1},"attestation_state":"computed","paper":{"title":"Longest Increasing Subsequence under Persistent Comparison Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barbara Geissmann","submitted_at":"2018-08-09T19:06:40Z","abstract_excerpt":"We study the problem of computing a longest increasing subsequence in a sequence $S$ of $n$ distinct elements in the presence of persistent comparison errors. In this model, every comparison between two elements can return the wrong result with some fixed (small) probability $ p $, and comparisons cannot be repeated. Computing the longest increasing subsequence exactly is impossible in this model, therefore, the objective is to identify a subsequence that (i) is indeed increasing and (ii) has a length that approximates the length of the longest increasing subsequence.\n  We present asymptotical"},"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":"1808.03307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-09T19:06:40Z","cross_cats_sorted":[],"title_canon_sha256":"ca3771feec9c4eb36f32c55f2eca17b5357eb1b821f324e43ff9e5a61575a611","abstract_canon_sha256":"106c70171b26eaedf310034d7a6d6e43631a02b20e15bb22e7435e934c5898a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:27.686400Z","signature_b64":"bSpx57PD2no9pRb7NgT5UI9qRkGPmXjtKUd3ecKGtYh15Er0jWZxcNoJWjevKUKVYKcoSgsBO/pPPzc8eNMfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d20636d304cbd19d4a69c34a6ca6dc218e0fb205fa06e6f269248fb71da5cd6","last_reissued_at":"2026-05-18T00:08:27.685731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:27.685731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Increasing Subsequence under Persistent Comparison Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barbara Geissmann","submitted_at":"2018-08-09T19:06:40Z","abstract_excerpt":"We study the problem of computing a longest increasing subsequence in a sequence $S$ of $n$ distinct elements in the presence of persistent comparison errors. In this model, every comparison between two elements can return the wrong result with some fixed (small) probability $ p $, and comparisons cannot be repeated. Computing the longest increasing subsequence exactly is impossible in this model, therefore, the objective is to identify a subsequence that (i) is indeed increasing and (ii) has a length that approximates the length of the longest increasing subsequence.\n  We present asymptotical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03307","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":"1808.03307","created_at":"2026-05-18T00:08:27.685842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03307v1","created_at":"2026-05-18T00:08:27.685842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03307","created_at":"2026-05-18T00:08:27.685842+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUQGG3JQJS6R","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUQGG3JQJS6RTVFG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUQGG3JQ","created_at":"2026-05-18T12:32:50.500415+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/RUQGG3JQJS6RTVFGTQ2KNSTNYI","json":"https://pith.science/pith/RUQGG3JQJS6RTVFGTQ2KNSTNYI.json","graph_json":"https://pith.science/api/pith-number/RUQGG3JQJS6RTVFGTQ2KNSTNYI/graph.json","events_json":"https://pith.science/api/pith-number/RUQGG3JQJS6RTVFGTQ2KNSTNYI/events.json","paper":"https://pith.science/paper/RUQGG3JQ"},"agent_actions":{"view_html":"https://pith.science/pith/RUQGG3JQJS6RTVFGTQ2KNSTNYI","download_json":"https://pith.science/pith/RUQGG3JQJS6RTVFGTQ2KNSTNYI.json","view_paper":"https://pith.science/paper/RUQGG3JQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03307&json=true","fetch_graph":"https://pith.science/api/pith-number/RUQGG3JQJS6RTVFGTQ2KNSTNYI/graph.json","fetch_events":"https://pith.science/api/pith-number/RUQGG3JQJS6RTVFGTQ2KNSTNYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUQGG3JQJS6RTVFGTQ2KNSTNYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUQGG3JQJS6RTVFGTQ2KNSTNYI/action/storage_attestation","attest_author":"https://pith.science/pith/RUQGG3JQJS6RTVFGTQ2KNSTNYI/action/author_attestation","sign_citation":"https://pith.science/pith/RUQGG3JQJS6RTVFGTQ2KNSTNYI/action/citation_signature","submit_replication":"https://pith.science/pith/RUQGG3JQJS6RTVFGTQ2KNSTNYI/action/replication_record"}},"created_at":"2026-05-18T00:08:27.685842+00:00","updated_at":"2026-05-18T00:08:27.685842+00:00"}