{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HEZBNXLVEBHP2WL26JHMTSAKZB","short_pith_number":"pith:HEZBNXLV","schema_version":"1.0","canonical_sha256":"393216dd75204efd597af24ec9c80ac876851628a74bebc75d3112e64a070f33","source":{"kind":"arxiv","id":"1206.5280","version":1},"attestation_state":"computed","paper":{"title":"Ranking Under Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.AI","authors_text":"Eytan Domany, Liat Ein-Dor, Or Zuk","submitted_at":"2012-06-20T15:10:59Z","abstract_excerpt":"Ranking objects is a simple and natural procedure for organizing data. It is often performed by assigning a quality score to each object according to its relevance to the problem at hand. Ranking is widely used for object selection, when resources are limited and it is necessary to select a subset of most relevant objects for further processing. In real world situations, the object's scores are often calculated from noisy measurements, casting doubt on the ranking reliability. We introduce an analytical method for assessing the influence of noise levels on the ranking reliability. We use two s"},"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":"1206.5280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:10:59Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"dea799ffed4fbcc0bd71f694038a117fd3bb9de132e8b6c65d5edc2a5194f9fc","abstract_canon_sha256":"f42de8dcae7d26b35ed0355891966c85832e0dfc98f33efc72d5bc51801ad0f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.596739Z","signature_b64":"0gnfP6/QpTtxopY6o+lKMrSb3e0koTsZZ3NE7bhUgzikZW7GcFy2MXHVN5FA4zFmP7rUCdWO5MW1E5ZTyWmtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"393216dd75204efd597af24ec9c80ac876851628a74bebc75d3112e64a070f33","last_reissued_at":"2026-05-18T03:52:40.596102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.596102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranking Under Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.AI","authors_text":"Eytan Domany, Liat Ein-Dor, Or Zuk","submitted_at":"2012-06-20T15:10:59Z","abstract_excerpt":"Ranking objects is a simple and natural procedure for organizing data. It is often performed by assigning a quality score to each object according to its relevance to the problem at hand. Ranking is widely used for object selection, when resources are limited and it is necessary to select a subset of most relevant objects for further processing. In real world situations, the object's scores are often calculated from noisy measurements, casting doubt on the ranking reliability. We introduce an analytical method for assessing the influence of noise levels on the ranking reliability. We use two s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5280","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":"1206.5280","created_at":"2026-05-18T03:52:40.596213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5280v1","created_at":"2026-05-18T03:52:40.596213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5280","created_at":"2026-05-18T03:52:40.596213+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEZBNXLVEBHP","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEZBNXLVEBHP2WL2","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEZBNXLV","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13577","citing_title":"LLM-Based Community Surveys for Operational Decision Making in Interconnected Utility Infrastructures","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HEZBNXLVEBHP2WL26JHMTSAKZB","json":"https://pith.science/pith/HEZBNXLVEBHP2WL26JHMTSAKZB.json","graph_json":"https://pith.science/api/pith-number/HEZBNXLVEBHP2WL26JHMTSAKZB/graph.json","events_json":"https://pith.science/api/pith-number/HEZBNXLVEBHP2WL26JHMTSAKZB/events.json","paper":"https://pith.science/paper/HEZBNXLV"},"agent_actions":{"view_html":"https://pith.science/pith/HEZBNXLVEBHP2WL26JHMTSAKZB","download_json":"https://pith.science/pith/HEZBNXLVEBHP2WL26JHMTSAKZB.json","view_paper":"https://pith.science/paper/HEZBNXLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5280&json=true","fetch_graph":"https://pith.science/api/pith-number/HEZBNXLVEBHP2WL26JHMTSAKZB/graph.json","fetch_events":"https://pith.science/api/pith-number/HEZBNXLVEBHP2WL26JHMTSAKZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEZBNXLVEBHP2WL26JHMTSAKZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEZBNXLVEBHP2WL26JHMTSAKZB/action/storage_attestation","attest_author":"https://pith.science/pith/HEZBNXLVEBHP2WL26JHMTSAKZB/action/author_attestation","sign_citation":"https://pith.science/pith/HEZBNXLVEBHP2WL26JHMTSAKZB/action/citation_signature","submit_replication":"https://pith.science/pith/HEZBNXLVEBHP2WL26JHMTSAKZB/action/replication_record"}},"created_at":"2026-05-18T03:52:40.596213+00:00","updated_at":"2026-05-18T03:52:40.596213+00:00"}