{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RNT5UPIIVOWD43TWMMGA765O4R","short_pith_number":"pith:RNT5UPII","schema_version":"1.0","canonical_sha256":"8b67da3d08abac3e6e76630c0ffbaee471bae3f8b5616ef189dbfd333017928b","source":{"kind":"arxiv","id":"2206.13102","version":2},"attestation_state":"computed","paper":{"title":"Modeling Content Creator Incentives on Algorithm-Curated Platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.IR","cs.LG","stat.ML"],"primary_cat":"cs.GT","authors_text":"Jiri Hron, Karl Krauth, Michael I. Jordan, Niki Kilbertus, Sarah Dean","submitted_at":"2022-06-27T08:16:59Z","abstract_excerpt":"Content creators compete for user attention. Their reach crucially depends on algorithmic choices made by developers on online platforms. To maximize exposure, many creators adapt strategically, as evidenced by examples like the sprawling search engine optimization industry. This begets competition for the finite user attention pool. We formalize these dynamics in what we call an exposure game, a model of incentives induced by algorithms, including modern factorization and (deep) two-tower architectures. We prove that seemingly innocuous algorithmic choices, e.g., non-negative vs. unconstraine"},"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":"2206.13102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-06-27T08:16:59Z","cross_cats_sorted":["cs.CY","cs.IR","cs.LG","stat.ML"],"title_canon_sha256":"b54c9aeaf7027c045830e0cb55faf61a3623162b2a5bbdd67435b05ad92dbe8e","abstract_canon_sha256":"24c2bfd3b0454829540bf29f2e05cceee9c13f491dd5bf1133dea250b1617372"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:13.427528Z","signature_b64":"adTMe+hJnYmmv1G6xSUu+MMdgmccLR4GdEMF2lb5fPVjvoES2QSRw4kjw5wYlpmXNm/Mued/MffB06TR9aZDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b67da3d08abac3e6e76630c0ffbaee471bae3f8b5616ef189dbfd333017928b","last_reissued_at":"2026-07-05T06:28:13.427029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:13.427029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modeling Content Creator Incentives on Algorithm-Curated Platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.IR","cs.LG","stat.ML"],"primary_cat":"cs.GT","authors_text":"Jiri Hron, Karl Krauth, Michael I. Jordan, Niki Kilbertus, Sarah Dean","submitted_at":"2022-06-27T08:16:59Z","abstract_excerpt":"Content creators compete for user attention. Their reach crucially depends on algorithmic choices made by developers on online platforms. To maximize exposure, many creators adapt strategically, as evidenced by examples like the sprawling search engine optimization industry. This begets competition for the finite user attention pool. We formalize these dynamics in what we call an exposure game, a model of incentives induced by algorithms, including modern factorization and (deep) two-tower architectures. We prove that seemingly innocuous algorithmic choices, e.g., non-negative vs. unconstraine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.13102","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.13102/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":"2206.13102","created_at":"2026-07-05T06:28:13.427089+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.13102v2","created_at":"2026-07-05T06:28:13.427089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.13102","created_at":"2026-07-05T06:28:13.427089+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNT5UPIIVOWD","created_at":"2026-07-05T06:28:13.427089+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNT5UPIIVOWD43TW","created_at":"2026-07-05T06:28:13.427089+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNT5UPII","created_at":"2026-07-05T06:28:13.427089+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10053","citing_title":"Stability in Competitive Search with Results Diversification","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21750","citing_title":"Multistakeholder Impacts of Profile Portability in a Recommender Ecosystem","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RNT5UPIIVOWD43TWMMGA765O4R","json":"https://pith.science/pith/RNT5UPIIVOWD43TWMMGA765O4R.json","graph_json":"https://pith.science/api/pith-number/RNT5UPIIVOWD43TWMMGA765O4R/graph.json","events_json":"https://pith.science/api/pith-number/RNT5UPIIVOWD43TWMMGA765O4R/events.json","paper":"https://pith.science/paper/RNT5UPII"},"agent_actions":{"view_html":"https://pith.science/pith/RNT5UPIIVOWD43TWMMGA765O4R","download_json":"https://pith.science/pith/RNT5UPIIVOWD43TWMMGA765O4R.json","view_paper":"https://pith.science/paper/RNT5UPII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.13102&json=true","fetch_graph":"https://pith.science/api/pith-number/RNT5UPIIVOWD43TWMMGA765O4R/graph.json","fetch_events":"https://pith.science/api/pith-number/RNT5UPIIVOWD43TWMMGA765O4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNT5UPIIVOWD43TWMMGA765O4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNT5UPIIVOWD43TWMMGA765O4R/action/storage_attestation","attest_author":"https://pith.science/pith/RNT5UPIIVOWD43TWMMGA765O4R/action/author_attestation","sign_citation":"https://pith.science/pith/RNT5UPIIVOWD43TWMMGA765O4R/action/citation_signature","submit_replication":"https://pith.science/pith/RNT5UPIIVOWD43TWMMGA765O4R/action/replication_record"}},"created_at":"2026-07-05T06:28:13.427089+00:00","updated_at":"2026-07-05T06:28:13.427089+00:00"}