{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZLEZJ4FJMLEXC2RBEXEFILVOPE","short_pith_number":"pith:ZLEZJ4FJ","canonical_record":{"source":{"id":"1204.5229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T23:08:38Z","cross_cats_sorted":[],"title_canon_sha256":"b45334557a8f1b133a9ce0e9b3093f4e0548f95ded31a5e27352ac2441df2c82","abstract_canon_sha256":"728f64ddd3a087951bdcfe922e47b401d81aaa719561418676fd92f11fd48a8f"},"schema_version":"1.0"},"canonical_sha256":"cac994f0a962c9716a2125c8542eae791f5e3f003741c805f4c4f037b3592754","source":{"kind":"arxiv","id":"1204.5229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5229","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5229v2","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5229","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZLEZJ4FJMLEX","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZLEZJ4FJMLEXC2RB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZLEZJ4FJ","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZLEZJ4FJMLEXC2RBEXEFILVOPE","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T23:08:38Z","cross_cats_sorted":[],"title_canon_sha256":"b45334557a8f1b133a9ce0e9b3093f4e0548f95ded31a5e27352ac2441df2c82","abstract_canon_sha256":"728f64ddd3a087951bdcfe922e47b401d81aaa719561418676fd92f11fd48a8f"},"schema_version":"1.0"},"canonical_sha256":"cac994f0a962c9716a2125c8542eae791f5e3f003741c805f4c4f037b3592754","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:49.068992Z","signature_b64":"sk5IzqlCp8K+xIcZncSpqtl00tBptO3nQwDYYbfyt7m4dv77p4k/cy3d02Ab09xXcnoRCglO5uto4G0PmyvmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac994f0a962c9716a2125c8542eae791f5e3f003741c805f4c4f037b3592754","last_reissued_at":"2026-05-18T03:46:49.068241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:49.068241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5229","source_version":2,"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:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RUcvN6Zsagqvp3Vso8dv2OS9jg5uQWaKKlKX4caSVSplebIHqhNp709s6Wcu6lGH1Rr6cRoiqj4ifPpGTEm5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:25:53.307823Z"},"content_sha256":"a4e7a63766430673593711cc56c11e18999bed82b362f4badcef3941cdf60c2c","schema_version":"1.0","event_id":"sha256:a4e7a63766430673593711cc56c11e18999bed82b362f4badcef3941cdf60c2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZLEZJ4FJMLEXC2RBEXEFILVOPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nimrod Talmon, Tsvi Kopelowitz","submitted_at":"2012-04-23T23:08:38Z","abstract_excerpt":"The selection problem, where one wishes to locate the $k^{th}$ smallest element in an unsorted array of size $n$, is one of the basic problems studied in computer science. The main focus of this work is designing algorithms for solving the selection problem in the presence of memory faults. These can happen as the result of cosmic rays, alpha particles, or hardware failures.\n  Specifically, the computational model assumed here is a faulty variant of the RAM model (abbreviated as FRAM), which was introduced by Finocchi and Italiano. In this model, the content of memory cells might get corrupted"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5229","kind":"arxiv","version":2},"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:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeKvTKoDd1KuINnVwyuOtjlOsbEnQajkZsu0P2RQ/gUtbz3VI+TvN50FIksi4lf+ItB7CrYqI8uh+CphjGu8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:25:53.308562Z"},"content_sha256":"870be37b7ca1b571e4e9161eede048a065e711853e1724fbddd6d5360fef56d3","schema_version":"1.0","event_id":"sha256:870be37b7ca1b571e4e9161eede048a065e711853e1724fbddd6d5360fef56d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLEZJ4FJMLEXC2RBEXEFILVOPE/bundle.json","state_url":"https://pith.science/pith/ZLEZJ4FJMLEXC2RBEXEFILVOPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLEZJ4FJMLEXC2RBEXEFILVOPE/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-01T01:25:53Z","links":{"resolver":"https://pith.science/pith/ZLEZJ4FJMLEXC2RBEXEFILVOPE","bundle":"https://pith.science/pith/ZLEZJ4FJMLEXC2RBEXEFILVOPE/bundle.json","state":"https://pith.science/pith/ZLEZJ4FJMLEXC2RBEXEFILVOPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLEZJ4FJMLEXC2RBEXEFILVOPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZLEZJ4FJMLEXC2RBEXEFILVOPE","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":"728f64ddd3a087951bdcfe922e47b401d81aaa719561418676fd92f11fd48a8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T23:08:38Z","title_canon_sha256":"b45334557a8f1b133a9ce0e9b3093f4e0548f95ded31a5e27352ac2441df2c82"},"schema_version":"1.0","source":{"id":"1204.5229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5229","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5229v2","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5229","created_at":"2026-05-18T03:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZLEZJ4FJMLEX","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZLEZJ4FJMLEXC2RB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZLEZJ4FJ","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:870be37b7ca1b571e4e9161eede048a065e711853e1724fbddd6d5360fef56d3","target":"graph","created_at":"2026-05-18T03:46:49Z","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":"The selection problem, where one wishes to locate the $k^{th}$ smallest element in an unsorted array of size $n$, is one of the basic problems studied in computer science. The main focus of this work is designing algorithms for solving the selection problem in the presence of memory faults. These can happen as the result of cosmic rays, alpha particles, or hardware failures.\n  Specifically, the computational model assumed here is a faulty variant of the RAM model (abbreviated as FRAM), which was introduced by Finocchi and Italiano. In this model, the content of memory cells might get corrupted","authors_text":"Nimrod Talmon, Tsvi Kopelowitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T23:08:38Z","title":"Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5229","kind":"arxiv","version":2},"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:a4e7a63766430673593711cc56c11e18999bed82b362f4badcef3941cdf60c2c","target":"record","created_at":"2026-05-18T03:46:49Z","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":"728f64ddd3a087951bdcfe922e47b401d81aaa719561418676fd92f11fd48a8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T23:08:38Z","title_canon_sha256":"b45334557a8f1b133a9ce0e9b3093f4e0548f95ded31a5e27352ac2441df2c82"},"schema_version":"1.0","source":{"id":"1204.5229","kind":"arxiv","version":2}},"canonical_sha256":"cac994f0a962c9716a2125c8542eae791f5e3f003741c805f4c4f037b3592754","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cac994f0a962c9716a2125c8542eae791f5e3f003741c805f4c4f037b3592754","first_computed_at":"2026-05-18T03:46:49.068241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:49.068241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sk5IzqlCp8K+xIcZncSpqtl00tBptO3nQwDYYbfyt7m4dv77p4k/cy3d02Ab09xXcnoRCglO5uto4G0PmyvmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:49.068992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4e7a63766430673593711cc56c11e18999bed82b362f4badcef3941cdf60c2c","sha256:870be37b7ca1b571e4e9161eede048a065e711853e1724fbddd6d5360fef56d3"],"state_sha256":"3527f7bde42ba7758d00251330cb24264fd205d469b3d7cc3078365933a64d2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I42Bp4913skMo1QUYIGYVLl3VYyrpW8ARL6Bo8jbbVq/8vPSxDj5SijmrtEs9dKI2jFzl8PN6A6EJGcxIHGFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:25:53.312983Z","bundle_sha256":"758eccbaa4e7c1cb9f6a4f03bacc341dac679aaa0d7ae236096e25ced5d3a633"}}