{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VVIXMUCPKDRZWU6BTENWZMFON2","short_pith_number":"pith:VVIXMUCP","schema_version":"1.0","canonical_sha256":"ad5176504f50e39b53c1991b6cb0ae6e879098265bba306e8eb8266b44335f82","source":{"kind":"arxiv","id":"2608.04421","version":1},"attestation_state":"computed","paper":{"title":"Generative Optimization for Incentivized Advertising with Global Level Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Da Li, Fan Zhou, Gege Chen, Hao Jiang, Ning Luo, Teng Sha, Wenxin Tai, Wenzheng Shu, Xialong Liu, Yanxiang Zeng","submitted_at":"2026-08-05T04:04:07Z","abstract_excerpt":"Incentivized advertising allocates monetary or virtual rewards to drive user engagement, where a key challenge is optimizing continuous incentive magnitudes under strict global constraints. This problem is complicated by high-frequency interactions, delayed feedback, and non-Markovian user dynamics such as fatigue, which limit the effectiveness of existing uplift modeling and constrained reinforcement learning approaches. To address these challenges, we propose GOAL, a constraint-aware generative framework that formulates incentive allocation as a conditional sequence generation problem. GOAL "},"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":"2608.04421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-08-05T04:04:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fc099b2238fdba7cb66825580eb13c71ee153b0abb9cb8c722a27965bd7e2647","abstract_canon_sha256":"ae8b773039221c55c86462b2a7aa16519473ad8d57b4dba838b0338a292b3865"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:35:23.415011Z","signature_b64":"VBCWeEIGVj2du4CbQdrm7ZBcdvIqC2ervSOVI4MC8rNk6MwiFXCWVRgflROdfBmVz8bvx6jYAkvb7Ue+9mIzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad5176504f50e39b53c1991b6cb0ae6e879098265bba306e8eb8266b44335f82","last_reissued_at":"2026-08-06T01:35:23.413539Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:35:23.413539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative Optimization for Incentivized Advertising with Global Level Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Da Li, Fan Zhou, Gege Chen, Hao Jiang, Ning Luo, Teng Sha, Wenxin Tai, Wenzheng Shu, Xialong Liu, Yanxiang Zeng","submitted_at":"2026-08-05T04:04:07Z","abstract_excerpt":"Incentivized advertising allocates monetary or virtual rewards to drive user engagement, where a key challenge is optimizing continuous incentive magnitudes under strict global constraints. This problem is complicated by high-frequency interactions, delayed feedback, and non-Markovian user dynamics such as fatigue, which limit the effectiveness of existing uplift modeling and constrained reinforcement learning approaches. To address these challenges, we propose GOAL, a constraint-aware generative framework that formulates incentive allocation as a conditional sequence generation problem. GOAL "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04421","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/2608.04421/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":"2608.04421","created_at":"2026-08-06T01:35:23.415379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.04421v1","created_at":"2026-08-06T01:35:23.415379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04421","created_at":"2026-08-06T01:35:23.415379+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVIXMUCPKDRZ","created_at":"2026-08-06T01:35:23.415379+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVIXMUCPKDRZWU6B","created_at":"2026-08-06T01:35:23.415379+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVIXMUCP","created_at":"2026-08-06T01:35:23.415379+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/VVIXMUCPKDRZWU6BTENWZMFON2","json":"https://pith.science/pith/VVIXMUCPKDRZWU6BTENWZMFON2.json","graph_json":"https://pith.science/api/pith-number/VVIXMUCPKDRZWU6BTENWZMFON2/graph.json","events_json":"https://pith.science/api/pith-number/VVIXMUCPKDRZWU6BTENWZMFON2/events.json","paper":"https://pith.science/paper/VVIXMUCP"},"agent_actions":{"view_html":"https://pith.science/pith/VVIXMUCPKDRZWU6BTENWZMFON2","download_json":"https://pith.science/pith/VVIXMUCPKDRZWU6BTENWZMFON2.json","view_paper":"https://pith.science/paper/VVIXMUCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.04421&json=true","fetch_graph":"https://pith.science/api/pith-number/VVIXMUCPKDRZWU6BTENWZMFON2/graph.json","fetch_events":"https://pith.science/api/pith-number/VVIXMUCPKDRZWU6BTENWZMFON2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVIXMUCPKDRZWU6BTENWZMFON2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVIXMUCPKDRZWU6BTENWZMFON2/action/storage_attestation","attest_author":"https://pith.science/pith/VVIXMUCPKDRZWU6BTENWZMFON2/action/author_attestation","sign_citation":"https://pith.science/pith/VVIXMUCPKDRZWU6BTENWZMFON2/action/citation_signature","submit_replication":"https://pith.science/pith/VVIXMUCPKDRZWU6BTENWZMFON2/action/replication_record"}},"created_at":"2026-08-06T01:35:23.415379+00:00","updated_at":"2026-08-06T01:35:23.415379+00:00"}