{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:U6QZ3SX4U2WP4SYHX2LPXO2YH7","short_pith_number":"pith:U6QZ3SX4","schema_version":"1.0","canonical_sha256":"a7a19dcafca6acfe4b07be96fbbb583fc2122f4976660dcb341d1b3f4e107722","source":{"kind":"arxiv","id":"2009.14730","version":1},"attestation_state":"computed","paper":{"title":"Learning and Strongly Truthful Multi-Task Peer Prediction: A Variational Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Fang-Yi Yu, Grant Schoenebeck","submitted_at":"2020-09-30T15:09:56Z","abstract_excerpt":"Peer prediction mechanisms incentivize agents to truthfully report their signals even in the absence of verification by comparing agents' reports with those of their peers. In the detail-free multi-task setting, agents respond to multiple independent and identically distributed tasks, and the mechanism does not know the prior distribution of agents' signals. The goal is to provide an $\\epsilon$-strongly truthful mechanism where truth-telling rewards agents \"strictly\" more than any other strategy profile (with $\\epsilon$ additive error), and to do so while requiring as few tasks as possible. We"},"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":"2009.14730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-09-30T15:09:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fbbeb1f93e1143b987692470bf5e8b28fcfa90f6ca91aea4699f39d58c772a5b","abstract_canon_sha256":"a533e83d90bc974d7805254889132f31dfe62721094cbb4f3261da4025b52179"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:08:53.915516Z","signature_b64":"fGdonPicvEKA3Zk6WFE9fm5gPeIgGWg7cwK4rpVo0JMBLOOBisr2yrQWtawiOU/sFZvReG2bfEFfwg/IRrlLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7a19dcafca6acfe4b07be96fbbb583fc2122f4976660dcb341d1b3f4e107722","last_reissued_at":"2026-07-05T03:08:53.915059Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:08:53.915059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning and Strongly Truthful Multi-Task Peer Prediction: A Variational Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Fang-Yi Yu, Grant Schoenebeck","submitted_at":"2020-09-30T15:09:56Z","abstract_excerpt":"Peer prediction mechanisms incentivize agents to truthfully report their signals even in the absence of verification by comparing agents' reports with those of their peers. In the detail-free multi-task setting, agents respond to multiple independent and identically distributed tasks, and the mechanism does not know the prior distribution of agents' signals. The goal is to provide an $\\epsilon$-strongly truthful mechanism where truth-telling rewards agents \"strictly\" more than any other strategy profile (with $\\epsilon$ additive error), and to do so while requiring as few tasks as possible. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.14730","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/2009.14730/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":"2009.14730","created_at":"2026-07-05T03:08:53.915117+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.14730v1","created_at":"2026-07-05T03:08:53.915117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.14730","created_at":"2026-07-05T03:08:53.915117+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6QZ3SX4U2WP","created_at":"2026-07-05T03:08:53.915117+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6QZ3SX4U2WP4SYH","created_at":"2026-07-05T03:08:53.915117+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6QZ3SX4","created_at":"2026-07-05T03:08:53.915117+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13875","citing_title":"Common-agency Games for Multi-Objective Test-Time Alignment","ref_index":78,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6QZ3SX4U2WP4SYHX2LPXO2YH7","json":"https://pith.science/pith/U6QZ3SX4U2WP4SYHX2LPXO2YH7.json","graph_json":"https://pith.science/api/pith-number/U6QZ3SX4U2WP4SYHX2LPXO2YH7/graph.json","events_json":"https://pith.science/api/pith-number/U6QZ3SX4U2WP4SYHX2LPXO2YH7/events.json","paper":"https://pith.science/paper/U6QZ3SX4"},"agent_actions":{"view_html":"https://pith.science/pith/U6QZ3SX4U2WP4SYHX2LPXO2YH7","download_json":"https://pith.science/pith/U6QZ3SX4U2WP4SYHX2LPXO2YH7.json","view_paper":"https://pith.science/paper/U6QZ3SX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.14730&json=true","fetch_graph":"https://pith.science/api/pith-number/U6QZ3SX4U2WP4SYHX2LPXO2YH7/graph.json","fetch_events":"https://pith.science/api/pith-number/U6QZ3SX4U2WP4SYHX2LPXO2YH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6QZ3SX4U2WP4SYHX2LPXO2YH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6QZ3SX4U2WP4SYHX2LPXO2YH7/action/storage_attestation","attest_author":"https://pith.science/pith/U6QZ3SX4U2WP4SYHX2LPXO2YH7/action/author_attestation","sign_citation":"https://pith.science/pith/U6QZ3SX4U2WP4SYHX2LPXO2YH7/action/citation_signature","submit_replication":"https://pith.science/pith/U6QZ3SX4U2WP4SYHX2LPXO2YH7/action/replication_record"}},"created_at":"2026-07-05T03:08:53.915117+00:00","updated_at":"2026-07-05T03:08:53.915117+00:00"}