{"as_of":"2026-08-08T19:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:79284c0b434dd4d80d1404093f434c36ff13972020c6d677608b443cbf576964","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-01T00:45:27.093492Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T16:33:17.356381Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.30974","snapshot_observed_at":"2026-08-03T16:33:17.356381Z","title":"A tunable incentive mechanism for binary aggregation without verification,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28957","last_updated":"2026-07-31T02:22:08Z","snapshot_observed_at":"2026-08-07T19:22:40.200872Z","submitted_at":"2026-07-31T02:22:08Z","title":"Beyond Byzantine: An Organizational Consensus Algorithm for Self-Interested Agents Under Information Asymmetry","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T16:33:17.356381Z"},"links":{"cited_paper":"/paper/2606.30974","citing_paper":"/paper/2607.28957"},"observation_digest":"sha256:bd17160681a7ba526495f448bb091986cfd1b86d231d5d0ad61bbdca50183729","observation_id":"14bfbf6f-bce9-417b-8d84-2a644ddf81e9","resolution":{"observed_at":"2026-08-03T16:33:17.356381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.30974/citation-record","integrity":"/paper/2606.30974/integrity","json":"/paper/2606.30974/citation-record.json","paper":"/paper/2606.30974"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.561529Z","title":"Animplementationoffakenewspre- vention by blockchain and entropy-based incentive mechanism.Social Network Analysis and Mining, 12(1):114, 2022","venue":null,"work_id":"6f1316c5-59ef-42e6-90e7-8ed990a1a24b","year":2022},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:17e572799c0b8a3b394fbaefe1eee4a53d14faeff16cfd2077fac961bca12c87","observation_id":"db421ebf-52b6-4ae1-b981-1227c2314369","resolution":{"observed_at":"2026-07-07T08:13:30.562796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.557113Z","title":"Max- imum likelihood estimation of observer error-rates using the em algorithm.Journal of the Royal Sta- tistical Society: Series C (Applied Statistics), 28(1): 20–28, 1979","venue":null,"work_id":"ef9169fb-43f8-4407-b4bc-af296056c72f","year":1979},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:2d05c7db71cc1c5e5ee79fd260c66074cf8d28d0a5e8b054bde161ca750f322d","observation_id":"c987dd7c-8e79-430a-b498-93669b5cc673","resolution":{"observed_at":"2026-07-07T08:13:30.558869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.535472Z","title":"Springer Nature","venue":null,"work_id":"e12f834d-a742-4aaf-a3a7-dd2dda8e1850","year":2022},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:16dcdcb154894e92a63420179f022f4959873ce8a997bd47ce5e9adc9aa3f919","observation_id":"9be97ea4-cc6f-4a2c-8ca9-2678df9ba37e","resolution":{"observed_at":"2026-07-07T08:13:30.536595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.537133Z","title":"Crowdsourcing with heterogeneous workers in social networks","venue":null,"work_id":"84504a24-376b-47d4-8db8-843347fd7749","year":2019},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:4816473049799416409c2ad14602655f1979a249c326ef1c29f1260d744f885d","observation_id":"bd7de8de-5dce-4d9b-847b-6c2c87ee9119","resolution":{"observed_at":"2026-07-07T08:13:30.538373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.563290Z","title":"Using truth detection to incentivize workers in mobile crowdsourcing.IEEE transactions on mobile computing, 21(6):2257–2270, 2020","venue":null,"work_id":"b7f3ef2c-519b-46c7-af8a-090263aefd13","year":2020},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:c78a88d5d485aa61d6a397668699e13e7e8adc24add73060e20b677ce7c6b36c","observation_id":"83f2f418-762d-4c6e-8bd9-3bc3d10b046e","resolution":{"observed_at":"2026-07-07T08:13:30.564459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.570121Z","title":"Online crowd learning with heteroge- neous workers via majority voting","venue":null,"work_id":"70c749ef-1091-404a-bc8c-0241e5318c88","year":2020},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:6b9aa88be2f8a4ae92e1926091ff5f337899947812ffdcb23be92061c06e202c","observation_id":"1fc19901-cfac-46e1-9f66-a3255099d8a1","resolution":{"observed_at":"2026-07-07T08:13:30.571246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.551288Z","title":"Strategic information revelation in crowdsourcing systems without verification","venue":null,"work_id":"63dc5b01-ca8d-4a84-bf6f-32bcf0eff894","year":2021},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:eac9a4f611738256e6c92ef1f07bb35cd07ba5a0ec8b889f2fa40c4f9adca47d","observation_id":"ae4e5c6c-ef3f-4c20-a08c-ef42e597a5de","resolution":{"observed_at":"2026-07-07T08:13:30.552437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.552993Z","title":"A technical survey on statistical modelling and design methods for crowdsourcing quality control.Artificial Intelligence, 287:103351, 2020","venue":null,"work_id":"ab064ee1-55ad-4626-a4dc-c7a5b64fdfc7","year":2020},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:92dc5d1bf3233efc3bc28d2002a84c4ab0c70a239cb77c3df25093954a56b487","observation_id":"dd3a725c-d505-4bb3-8812-6485f1f95939","resolution":{"observed_at":"2026-07-07T08:13:30.554290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.575509Z","title":"Bayesian classifier combination","venue":null,"work_id":"b0651901-ccd3-4f43-a96c-81465c1afa43","year":2012},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:e2c05d14cb5e9cf59e9f9c845a6aa96d6659245800e1871251ec389e0b7cba7c","observation_id":"83c78db9-2889-4229-bff7-05558d5f132f","resolution":{"observed_at":"2026-07-07T08:13:30.576644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.577165Z","title":"An infor- mation theoretic framework for designing informa- tion elicitation mechanisms that reward truth-telling","venue":null,"work_id":"39c0a991-cb82-4f7a-95ae-ab31e8a29d8e","year":2019},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:270c40042264c116c8dd73d4f5399618a625a4897d8477c36a3e8a394993aed9","observation_id":"8e45e6d5-f1fe-45fa-bd39-631573065df2","resolution":{"observed_at":"2026-07-07T08:13:30.578391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.572667Z","title":"Surrogate scoring rules.ACM Transactions on Economics and Computation, 10(3):1–36, 2023","venue":null,"work_id":"07a11d32-a190-49ad-b796-65983475af96","year":2023},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:ec2712ce18d2925131bd7f3c21ab72cd72ca4476e5a5313a0b8c87f4c4ce6bfa","observation_id":"aea95102-3dcd-4467-8c45-821992641af8","resolution":{"observed_at":"2026-07-07T08:13:30.574947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.533533Z","title":"Majority rules: how good are we at aggregating convergent opinions? Evolutionary Human Sciences, 1:e6, 2019","venue":null,"work_id":"04a8e685-b9d2-42f2-aa61-477e3a06554a","year":2019},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:33690b7708892585d53abbc7c839c56636d477bb6a5d7579d9d65f60be10b81a","observation_id":"604a45bf-cae3-425a-a9ac-2f692a3be233","resolution":{"observed_at":"2026-07-07T08:13:30.534769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.546009Z","title":"Eliciting informative feedback: The peer-prediction method.Management Science, 51(9):1359–1373, 2005","venue":null,"work_id":"bae43fd4-59f4-43ee-84a1-97837d4febe7","year":2005},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:483c8310595e186025c7c83db0f049a0cbcc99927a0ea051f51e27d548ff2cda","observation_id":"83bfe70b-13ee-4874-95c5-6d1773dbf38b","resolution":{"observed_at":"2026-07-07T08:13:30.547394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.547920Z","title":"A bayesian truth serum for subjective data.science, 306(5695):462–466, 2004","venue":null,"work_id":"e1e483ae-c4db-42c8-806d-f35e055c6ef8","year":2004},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:4fa7cb3512ae0a196cae26bafb520cccf038af3b51f608c961277ccbe0a7d8c1","observation_id":"358a3d80-88dc-45a3-b817-e87ddc5493ba","resolution":{"observed_at":"2026-07-07T08:13:30.549097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.549636Z","title":"A robust bayesian truth serum for non-binary signals","venue":null,"work_id":"a444a246-99e6-4596-b32c-48be719bf7f6","year":2013},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:023206089cca7aba7e85d9cbb6b4b4bec328529b557f25744cf2f6d9a5bfdae5","observation_id":"4bd74db0-1f5b-4eb1-bbf5-a2a96d498ab9","resolution":{"observed_at":"2026-07-07T08:13:30.550782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.554825Z","title":"Learning from crowds.Journal of machine learning research, 11(4), 2010","venue":null,"work_id":"75015e7f-4b66-48da-9362-c9b84a1665de","year":2010},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:9b92e548cf7904c2b005c9164c8e4b1845ef98a2f8c6e8248da1efc0a759f975","observation_id":"a1a2bfc3-f40e-421a-9f64-874f0637397c","resolution":{"observed_at":"2026-07-07T08:13:30.556520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.564963Z","title":"Two strongly truthful mechanisms for three heterogeneous agents answering one question","venue":null,"work_id":"60d5391e-8eda-45db-8788-9feb5dde1b33","year":2020},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:1de1f010d66e7ee3b6229f052f24f78f7e2d4803e845aeb2a846a93564b444ff","observation_id":"f45b37b2-8e23-4dd6-9f6c-7b77e7083306","resolution":{"observed_at":"2026-07-07T08:13:30.566135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.542579Z","title":"Informed truthfulness in multi- task peer prediction","venue":null,"work_id":"b1ceeefb-2a96-446e-a79b-457c55e61073","year":2016},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:dd059a5f5a0e8896bb385668f40fe318454c4924f85b50519857a47668eaa969","observation_id":"260e8ebf-7179-4568-a0ae-5e942b3cd048","resolution":{"observed_at":"2026-07-07T08:13:30.543788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.566874Z","title":"Community-based bayesian aggregation models for crowdsourcing","venue":null,"work_id":"d1e1f8ec-d2bf-4c8a-8851-104032c23c1e","year":2014},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:7c49d86223a1aa124f8fda484314a061602f74b7b92aa5f0d6a2d1f678b3955c","observation_id":"32641409-446a-4005-be2c-cbc69d82f63a","resolution":{"observed_at":"2026-07-07T08:13:30.568014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.578948Z","title":"Labeling images with a computer game","venue":null,"work_id":"d186d68c-b9f3-4a64-8bb8-aed2829e2858","year":2004},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:3a5914a5f2f98340eed7eb27a4f85a30e9c773858b3917e602eaf29036463cca","observation_id":"1d205dd8-8cfc-4fb7-a7a0-9e654258e0ec","resolution":{"observed_at":"2026-07-07T08:13:30.580329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.580881Z","title":"Output agree- ment mechanisms and common knowledge","venue":null,"work_id":"f04a3134-fc8b-4d9d-99c5-d00c7c6c151b","year":2014},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:9eadaf7f768358946c920d1231ef784f0a76f0cee764003e45ffe08cd062d547","observation_id":"aeff567d-6535-487f-af8d-f65038e0764e","resolution":{"observed_at":"2026-07-07T08:13:30.582034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.568511Z","title":"Whose vote should count more: Optimal integration of labels from labelers of unknown expertise.Advances in neural information processing systems, 22, 2009","venue":null,"work_id":"6b2a8041-0272-4f12-ba04-f3a146df022a","year":2009},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:2e5e224db10d0ad86f6dda4a52b23f818fe9a5bd200f95d234cbf4bc9477242d","observation_id":"e089f060-5404-4831-bdf7-f1339753432a","resolution":{"observed_at":"2026-07-07T08:13:30.569648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.544324Z","title":"Arobustbayesian truth serum for small populations","venue":null,"work_id":"6c5ada8a-8e80-46d6-b19a-b2a8c86be581","year":2012},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:200952ad43628ed5e44cb466b8b3a9e5c7f10af0ef6a56d81edadcec56670a88","observation_id":"df970ff0-b9da-432c-aba3-4ca4422bad5f","resolution":{"observed_at":"2026-07-07T08:13:30.545442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.539060Z","title":"Reward or penalty: Aligningincentivesofstakeholdersincrowd- sourcing.IEEE Transactions on Mobile Computing, 18(4):974–985, 2018","venue":null,"work_id":"5c0482dd-beba-4500-87e2-02828f13af8c","year":2018},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:a012b2b0ebded8a81ef48f64aeb73dbd5910f2de82251a3f1edd10ed6c18280e","observation_id":"8a827bfd-925e-44bb-88ee-b5895fbde9c3","resolution":{"observed_at":"2026-07-07T08:13:30.540307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-07T08:13:30.540893Z","title":"Learning from the wisdom of crowds by mini- max entropy.Advances in neural information pro- cessing systems, 25, 2012","venue":null,"work_id":"36bb315d-4f47-4800-b3bb-fdee2142d954","year":2012},"citing_paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-01T00:45:27.093492Z"},"links":{"citing_paper":"/paper/2606.30974"},"observation_digest":"sha256:cde34574495a8a8701090ac91c8606c327f3fb2db847dc4b7631079214b454a4","observation_id":"d2eb14db-f011-48da-be48-5efad97f8d98","resolution":{"observed_at":"2026-07-07T08:13:30.542042Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.30974","last_updated":"2026-06-29T23:19:14Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-04T14:55:45.167564Z","submitted_at":"2026-06-29T23:19:14Z","title":"A Tunable Incentive Mechanism for Binary Aggregation Without Verification"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":24},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2606.30974."}