{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BDSMRTV2WFYCQC3JYPBCTIV6OX","short_pith_number":"pith:BDSMRTV2","schema_version":"1.0","canonical_sha256":"08e4c8cebab170280b69c3c229a2be75d379d1f73ff5cdc8bf2218cfba9ba44d","source":{"kind":"arxiv","id":"1612.04794","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"R. Ravi, Wolfgang Gatterbauer, Yang Jiao","submitted_at":"2016-12-14T20:20:29Z","abstract_excerpt":"We introduce a new set of problems based on the Chain Editing problem. In our version of Chain Editing, we are given a set of anonymous participants and a set of undisclosed tasks that every participant attempts. For each participant-task pair, we know whether the participant has succeeded at the task or not. We assume that participants vary in their ability to solve tasks, and that tasks vary in their difficulty to be solved. In an ideal world, stronger participants should succeed at a superset of tasks that weaker participants succeed at. Similarly, easier tasks should be completed successfu"},"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":"1612.04794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-14T20:20:29Z","cross_cats_sorted":[],"title_canon_sha256":"255b5c72b1fd2dcf65a99d913d62204819aeb8a30ce08b1938a7191e3d55818f","abstract_canon_sha256":"9cd2fd1025b89abecde1ebd6802b3be1e1919cac9c405c0594b350a8961082a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:25.981363Z","signature_b64":"KOStsRcC8MA9R799P4Q1I84W5+uA+1irDxGYc/st2GzqSf3NyneJT2tSRHAWWkZavRa3E8u+8vj3ttAT3fyTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e4c8cebab170280b69c3c229a2be75d379d1f73ff5cdc8bf2218cfba9ba44d","last_reissued_at":"2026-05-18T00:54:25.980602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:25.980602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"R. Ravi, Wolfgang Gatterbauer, Yang Jiao","submitted_at":"2016-12-14T20:20:29Z","abstract_excerpt":"We introduce a new set of problems based on the Chain Editing problem. In our version of Chain Editing, we are given a set of anonymous participants and a set of undisclosed tasks that every participant attempts. For each participant-task pair, we know whether the participant has succeeded at the task or not. We assume that participants vary in their ability to solve tasks, and that tasks vary in their difficulty to be solved. In an ideal world, stronger participants should succeed at a superset of tasks that weaker participants succeed at. Similarly, easier tasks should be completed successfu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04794","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.04794","created_at":"2026-05-18T00:54:25.980717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04794v2","created_at":"2026-05-18T00:54:25.980717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04794","created_at":"2026-05-18T00:54:25.980717+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDSMRTV2WFYC","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDSMRTV2WFYCQC3J","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDSMRTV2","created_at":"2026-05-18T12:30:07.202191+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/BDSMRTV2WFYCQC3JYPBCTIV6OX","json":"https://pith.science/pith/BDSMRTV2WFYCQC3JYPBCTIV6OX.json","graph_json":"https://pith.science/api/pith-number/BDSMRTV2WFYCQC3JYPBCTIV6OX/graph.json","events_json":"https://pith.science/api/pith-number/BDSMRTV2WFYCQC3JYPBCTIV6OX/events.json","paper":"https://pith.science/paper/BDSMRTV2"},"agent_actions":{"view_html":"https://pith.science/pith/BDSMRTV2WFYCQC3JYPBCTIV6OX","download_json":"https://pith.science/pith/BDSMRTV2WFYCQC3JYPBCTIV6OX.json","view_paper":"https://pith.science/paper/BDSMRTV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04794&json=true","fetch_graph":"https://pith.science/api/pith-number/BDSMRTV2WFYCQC3JYPBCTIV6OX/graph.json","fetch_events":"https://pith.science/api/pith-number/BDSMRTV2WFYCQC3JYPBCTIV6OX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDSMRTV2WFYCQC3JYPBCTIV6OX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDSMRTV2WFYCQC3JYPBCTIV6OX/action/storage_attestation","attest_author":"https://pith.science/pith/BDSMRTV2WFYCQC3JYPBCTIV6OX/action/author_attestation","sign_citation":"https://pith.science/pith/BDSMRTV2WFYCQC3JYPBCTIV6OX/action/citation_signature","submit_replication":"https://pith.science/pith/BDSMRTV2WFYCQC3JYPBCTIV6OX/action/replication_record"}},"created_at":"2026-05-18T00:54:25.980717+00:00","updated_at":"2026-05-18T00:54:25.980717+00:00"}