{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YHLXDKY7NS7URWZJK2PO7XICP2","short_pith_number":"pith:YHLXDKY7","canonical_record":{"source":{"id":"1210.4882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:44:59Z","cross_cats_sorted":[],"title_canon_sha256":"515765df22ea0f96a79921d2147079adf397566ceb7fda570d0a01e8d786be41","abstract_canon_sha256":"5eada09ce0b583d2900a3881f9fedaf94cd441b67377f632872bd03b2e372e04"},"schema_version":"1.0"},"canonical_sha256":"c1d771ab1f6cbf48db29569eefdd027e905b9a70e7e82791140e05a53249e41b","source":{"kind":"arxiv","id":"1210.4882","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4882","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4882v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4882","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"YHLXDKY7NS7U","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YHLXDKY7NS7URWZJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YHLXDKY7","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YHLXDKY7NS7URWZJK2PO7XICP2","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:44:59Z","cross_cats_sorted":[],"title_canon_sha256":"515765df22ea0f96a79921d2147079adf397566ceb7fda570d0a01e8d786be41","abstract_canon_sha256":"5eada09ce0b583d2900a3881f9fedaf94cd441b67377f632872bd03b2e372e04"},"schema_version":"1.0"},"canonical_sha256":"c1d771ab1f6cbf48db29569eefdd027e905b9a70e7e82791140e05a53249e41b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.205525Z","signature_b64":"ZB01CEXy3C3CLiBCPeZofcAuEkmoyzMYUvdr9u4RNWBAOUsLzk12eD2nMKi55ow39lPXseDPeyDvlv710Z7RCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1d771ab1f6cbf48db29569eefdd027e905b9a70e7e82791140e05a53249e41b","last_reissued_at":"2026-05-18T03:42:55.204787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.204787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4882","source_version":1,"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:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQ4NnnXXd0UHUqM5/7MMuKVnhLhS/YFisceov+ctddxIqAgZz15PIrwJkUUmyrz96fBVDVicZfHlcxnM7AteBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:52:23.778295Z"},"content_sha256":"d82b762c99f343918d88712844eb729d24470e0ec539ba424b374e3b2e50c34f","schema_version":"1.0","event_id":"sha256:d82b762c99f343918d88712844eb729d24470e0ec539ba424b374e3b2e50c34f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YHLXDKY7NS7URWZJK2PO7XICP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Maximum Likelihood Approach For Selecting Sets of Alternatives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariel D. Procaccia, Nisarg Shah, Sashank J. Reddi","submitted_at":"2012-10-16T17:44:59Z","abstract_excerpt":"We consider the problem of selecting a subset of alternatives given noisy evaluations of the relative strength of different alternatives. We wish to select a k-subset (for a given k) that provides a maximum likelihood estimate for one of several objectives, e.g., containing the strongest alternative. Although this problem is NP-hard, we show that when the noise level is sufficiently high, intuitive methods provide the optimal solution. We thus generalize classical results about singling out one alternative and identifying the hidden ranking of alternatives by strength. Extensive experiments sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4882","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"},"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:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uHJ9Wt2Zq6UXi5eggRFQV6g2E8H/bV4TC8F2Yn00UNJwBWAIDldHYXAzmvFw2OQZSWxvi6dJhx+FaaJDyXK2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:52:23.778654Z"},"content_sha256":"810eea106c8a7f0abb4497c5a2778687e1fb2ee8f15bc389cdfc32e08b6bac07","schema_version":"1.0","event_id":"sha256:810eea106c8a7f0abb4497c5a2778687e1fb2ee8f15bc389cdfc32e08b6bac07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHLXDKY7NS7URWZJK2PO7XICP2/bundle.json","state_url":"https://pith.science/pith/YHLXDKY7NS7URWZJK2PO7XICP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHLXDKY7NS7URWZJK2PO7XICP2/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-03T14:52:23Z","links":{"resolver":"https://pith.science/pith/YHLXDKY7NS7URWZJK2PO7XICP2","bundle":"https://pith.science/pith/YHLXDKY7NS7URWZJK2PO7XICP2/bundle.json","state":"https://pith.science/pith/YHLXDKY7NS7URWZJK2PO7XICP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHLXDKY7NS7URWZJK2PO7XICP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YHLXDKY7NS7URWZJK2PO7XICP2","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":"5eada09ce0b583d2900a3881f9fedaf94cd441b67377f632872bd03b2e372e04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:44:59Z","title_canon_sha256":"515765df22ea0f96a79921d2147079adf397566ceb7fda570d0a01e8d786be41"},"schema_version":"1.0","source":{"id":"1210.4882","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4882","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4882v1","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4882","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"YHLXDKY7NS7U","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YHLXDKY7NS7URWZJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YHLXDKY7","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:810eea106c8a7f0abb4497c5a2778687e1fb2ee8f15bc389cdfc32e08b6bac07","target":"graph","created_at":"2026-05-18T03:42:55Z","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":"We consider the problem of selecting a subset of alternatives given noisy evaluations of the relative strength of different alternatives. We wish to select a k-subset (for a given k) that provides a maximum likelihood estimate for one of several objectives, e.g., containing the strongest alternative. Although this problem is NP-hard, we show that when the noise level is sufficiently high, intuitive methods provide the optimal solution. We thus generalize classical results about singling out one alternative and identifying the hidden ranking of alternatives by strength. Extensive experiments sh","authors_text":"Ariel D. Procaccia, Nisarg Shah, Sashank J. Reddi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:44:59Z","title":"A Maximum Likelihood Approach For Selecting Sets of Alternatives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4882","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:d82b762c99f343918d88712844eb729d24470e0ec539ba424b374e3b2e50c34f","target":"record","created_at":"2026-05-18T03:42:55Z","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":"5eada09ce0b583d2900a3881f9fedaf94cd441b67377f632872bd03b2e372e04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:44:59Z","title_canon_sha256":"515765df22ea0f96a79921d2147079adf397566ceb7fda570d0a01e8d786be41"},"schema_version":"1.0","source":{"id":"1210.4882","kind":"arxiv","version":1}},"canonical_sha256":"c1d771ab1f6cbf48db29569eefdd027e905b9a70e7e82791140e05a53249e41b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1d771ab1f6cbf48db29569eefdd027e905b9a70e7e82791140e05a53249e41b","first_computed_at":"2026-05-18T03:42:55.204787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:55.204787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZB01CEXy3C3CLiBCPeZofcAuEkmoyzMYUvdr9u4RNWBAOUsLzk12eD2nMKi55ow39lPXseDPeyDvlv710Z7RCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:55.205525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4882","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d82b762c99f343918d88712844eb729d24470e0ec539ba424b374e3b2e50c34f","sha256:810eea106c8a7f0abb4497c5a2778687e1fb2ee8f15bc389cdfc32e08b6bac07"],"state_sha256":"a6109b70724c239b3f8be49af2aaad0880970a6c07792e29b4c7754af4541c0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y15QlBOMNJey2QeFUJ60e+eh5Atrf40EhYH2bE/cFIIAf/Eb/Xze7eexrklEbMuZ5tB3SayGKlxTQL0pJlLwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:52:23.780457Z","bundle_sha256":"9c0e288ca4a6f0362788bdffa891c537954da9f179a0a896693d48c58dbb9a25"}}