{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5ADGSQ256BAVFAHGPIRAOWBWU4","short_pith_number":"pith:5ADGSQ25","schema_version":"1.0","canonical_sha256":"e80669435df0415280e67a22075836a72d59a51fb640163296916dc7de278e3c","source":{"kind":"arxiv","id":"1906.05998","version":2},"attestation_state":"computed","paper":{"title":"Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Daisuke Hatano, Hanna Sumita, Ken-ichi Kawarabayashi, Naonori Kakimura, Yasushi Kawase, Yuko Kuroki","submitted_at":"2019-06-14T03:06:12Z","abstract_excerpt":"Computational advertising has been studied to design efficient marketing strategies that maximize the number of acquired customers. In an increased competitive market, however, a market leader (a leader) requires the acquisition of new customers as well as the retention of her loyal customers because there often exists a competitor (a follower) who tries to attract customers away from the market leader. In this paper, we formalize a new model called the Stackelberg budget allocation game with a bipartite influence model by extending a budget allocation problem over a bipartite graph to a Stack"},"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":"1906.05998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-14T03:06:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"157ba6a6865ddc78b8b358a0451f26ec0c4d6332154df69bd7625700005a68b3","abstract_canon_sha256":"06c2129268e11b8c836abd6ef1af67f0c3c6c00fbc15bd3ca3cc663764d223da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:14.002694Z","signature_b64":"v6sCG/7D2mUR0yWySXgRXsYLxH1QovwR9I/cX9f4po5Fcn7pxXPT0b85oy8FzyZHo5fVy4VeJLX0oTcnBN/ADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e80669435df0415280e67a22075836a72d59a51fb640163296916dc7de278e3c","last_reissued_at":"2026-05-17T23:43:14.002240Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:14.002240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Daisuke Hatano, Hanna Sumita, Ken-ichi Kawarabayashi, Naonori Kakimura, Yasushi Kawase, Yuko Kuroki","submitted_at":"2019-06-14T03:06:12Z","abstract_excerpt":"Computational advertising has been studied to design efficient marketing strategies that maximize the number of acquired customers. In an increased competitive market, however, a market leader (a leader) requires the acquisition of new customers as well as the retention of her loyal customers because there often exists a competitor (a follower) who tries to attract customers away from the market leader. In this paper, we formalize a new model called the Stackelberg budget allocation game with a bipartite influence model by extending a budget allocation problem over a bipartite graph to a Stack"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05998","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":"1906.05998","created_at":"2026-05-17T23:43:14.002307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05998v2","created_at":"2026-05-17T23:43:14.002307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05998","created_at":"2026-05-17T23:43:14.002307+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ADGSQ256BAV","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ADGSQ256BAVFAHG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ADGSQ25","created_at":"2026-05-18T12:33:10.108867+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/5ADGSQ256BAVFAHGPIRAOWBWU4","json":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4.json","graph_json":"https://pith.science/api/pith-number/5ADGSQ256BAVFAHGPIRAOWBWU4/graph.json","events_json":"https://pith.science/api/pith-number/5ADGSQ256BAVFAHGPIRAOWBWU4/events.json","paper":"https://pith.science/paper/5ADGSQ25"},"agent_actions":{"view_html":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4","download_json":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4.json","view_paper":"https://pith.science/paper/5ADGSQ25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05998&json=true","fetch_graph":"https://pith.science/api/pith-number/5ADGSQ256BAVFAHGPIRAOWBWU4/graph.json","fetch_events":"https://pith.science/api/pith-number/5ADGSQ256BAVFAHGPIRAOWBWU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/action/storage_attestation","attest_author":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/action/author_attestation","sign_citation":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/action/citation_signature","submit_replication":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/action/replication_record"}},"created_at":"2026-05-17T23:43:14.002307+00:00","updated_at":"2026-05-17T23:43:14.002307+00:00"}