{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SYDEWMRGXIUYOZK3HUARHHN4LP","short_pith_number":"pith:SYDEWMRG","schema_version":"1.0","canonical_sha256":"96064b3226ba2987655b3d01139dbc5be63f5688111ee7dd84577d34aa9417ce","source":{"kind":"arxiv","id":"2409.06014","version":1},"attestation_state":"computed","paper":{"title":"Robust Max Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Trung Dang, Zhiyi Huang","submitted_at":"2024-09-09T19:12:22Z","abstract_excerpt":"We introduce a new model to study algorithm design under unreliable information, and apply this model for the problem of finding the uncorrupted maximum element of a list containing $n$ elements, among which are $k$ corrupted elements. Under our model, algorithms can perform black-box comparison queries between any pair of elements. However, queries regarding corrupted elements may have arbitrary output. In particular, corrupted elements do not need to behave as any consistent values, and may introduce cycles in the elements' ordering. This imposes new challenges for designing correct algorith"},"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":"2409.06014","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-09-09T19:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"fe8fdb5fc6fab04ba7ed9abe4da9fa93c25e26ed761c6573a7eb25179dfa159d","abstract_canon_sha256":"b707b00128e6f6944108eec7525464e02496f946e5ac6564b2ab6f3bb93f15b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:05:00.862657Z","signature_b64":"OAF5RcbMb25Ofo2TvQYdrr4dvt6Ht26f1sDaNBMpKexNqdl260QzN0EtdynwLlJW3/YjUFynSLAh/JR4CZf/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96064b3226ba2987655b3d01139dbc5be63f5688111ee7dd84577d34aa9417ce","last_reissued_at":"2026-07-05T09:05:00.862269Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:05:00.862269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Max Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Trung Dang, Zhiyi Huang","submitted_at":"2024-09-09T19:12:22Z","abstract_excerpt":"We introduce a new model to study algorithm design under unreliable information, and apply this model for the problem of finding the uncorrupted maximum element of a list containing $n$ elements, among which are $k$ corrupted elements. Under our model, algorithms can perform black-box comparison queries between any pair of elements. However, queries regarding corrupted elements may have arbitrary output. In particular, corrupted elements do not need to behave as any consistent values, and may introduce cycles in the elements' ordering. This imposes new challenges for designing correct algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06014","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.06014/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.06014","created_at":"2026-07-05T09:05:00.862325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.06014v1","created_at":"2026-07-05T09:05:00.862325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06014","created_at":"2026-07-05T09:05:00.862325+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYDEWMRGXIUY","created_at":"2026-07-05T09:05:00.862325+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYDEWMRGXIUYOZK3","created_at":"2026-07-05T09:05:00.862325+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYDEWMRG","created_at":"2026-07-05T09:05:00.862325+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/SYDEWMRGXIUYOZK3HUARHHN4LP","json":"https://pith.science/pith/SYDEWMRGXIUYOZK3HUARHHN4LP.json","graph_json":"https://pith.science/api/pith-number/SYDEWMRGXIUYOZK3HUARHHN4LP/graph.json","events_json":"https://pith.science/api/pith-number/SYDEWMRGXIUYOZK3HUARHHN4LP/events.json","paper":"https://pith.science/paper/SYDEWMRG"},"agent_actions":{"view_html":"https://pith.science/pith/SYDEWMRGXIUYOZK3HUARHHN4LP","download_json":"https://pith.science/pith/SYDEWMRGXIUYOZK3HUARHHN4LP.json","view_paper":"https://pith.science/paper/SYDEWMRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.06014&json=true","fetch_graph":"https://pith.science/api/pith-number/SYDEWMRGXIUYOZK3HUARHHN4LP/graph.json","fetch_events":"https://pith.science/api/pith-number/SYDEWMRGXIUYOZK3HUARHHN4LP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYDEWMRGXIUYOZK3HUARHHN4LP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYDEWMRGXIUYOZK3HUARHHN4LP/action/storage_attestation","attest_author":"https://pith.science/pith/SYDEWMRGXIUYOZK3HUARHHN4LP/action/author_attestation","sign_citation":"https://pith.science/pith/SYDEWMRGXIUYOZK3HUARHHN4LP/action/citation_signature","submit_replication":"https://pith.science/pith/SYDEWMRGXIUYOZK3HUARHHN4LP/action/replication_record"}},"created_at":"2026-07-05T09:05:00.862325+00:00","updated_at":"2026-07-05T09:05:00.862325+00:00"}