{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5ADGSQ256BAVFAHGPIRAOWBWU4","short_pith_number":"pith:5ADGSQ25","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"},"canonical_sha256":"e80669435df0415280e67a22075836a72d59a51fb640163296916dc7de278e3c","source":{"kind":"arxiv","id":"1906.05998","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05998","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05998v2","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05998","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"5ADGSQ256BAV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ADGSQ256BAVFAHG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ADGSQ25","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5ADGSQ256BAVFAHGPIRAOWBWU4","target":"record","payload":{"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"},"canonical_sha256":"e80669435df0415280e67a22075836a72d59a51fb640163296916dc7de278e3c","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"},"source_kind":"arxiv","source_id":"1906.05998","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYsQ+Q20Hh+M57wBCFLWPpE90oMu09pISGcPRaK13CRuSdfjoE21enfGkpMUIiT1hJRzY69lHqGdzV4rpx67CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:46:51.462471Z"},"content_sha256":"4badcaa7ebce083e52b20899334a03888427d102395a37ab097b955d975c4a98","schema_version":"1.0","event_id":"sha256:4badcaa7ebce083e52b20899334a03888427d102395a37ab097b955d975c4a98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5ADGSQ256BAVFAHGPIRAOWBWU4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eE5xyUT+pb6dka0e1efsWJ+IftiHupBPy0KaFTOQc9znCZPN4wWxaFYse+YAWalduYfn8B8P/owxAXiSXFmwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:46:51.462808Z"},"content_sha256":"f0fcd61256bdaf37cebd50846f77739c33cefed7f73686869d4111ba0a5fac31","schema_version":"1.0","event_id":"sha256:f0fcd61256bdaf37cebd50846f77739c33cefed7f73686869d4111ba0a5fac31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/bundle.json","state_url":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T20:46:51Z","links":{"resolver":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4","bundle":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/bundle.json","state":"https://pith.science/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ADGSQ256BAVFAHGPIRAOWBWU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5ADGSQ256BAVFAHGPIRAOWBWU4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"06c2129268e11b8c836abd6ef1af67f0c3c6c00fbc15bd3ca3cc663764d223da","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-14T03:06:12Z","title_canon_sha256":"157ba6a6865ddc78b8b358a0451f26ec0c4d6332154df69bd7625700005a68b3"},"schema_version":"1.0","source":{"id":"1906.05998","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05998","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05998v2","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05998","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"5ADGSQ256BAV","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ADGSQ256BAVFAHG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ADGSQ25","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:f0fcd61256bdaf37cebd50846f77739c33cefed7f73686869d4111ba0a5fac31","target":"graph","created_at":"2026-05-17T23:43:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Daisuke Hatano, Hanna Sumita, Ken-ichi Kawarabayashi, Naonori Kakimura, Yasushi Kawase, Yuko Kuroki","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-14T03:06:12Z","title":"Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05998","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4badcaa7ebce083e52b20899334a03888427d102395a37ab097b955d975c4a98","target":"record","created_at":"2026-05-17T23:43:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"06c2129268e11b8c836abd6ef1af67f0c3c6c00fbc15bd3ca3cc663764d223da","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-06-14T03:06:12Z","title_canon_sha256":"157ba6a6865ddc78b8b358a0451f26ec0c4d6332154df69bd7625700005a68b3"},"schema_version":"1.0","source":{"id":"1906.05998","kind":"arxiv","version":2}},"canonical_sha256":"e80669435df0415280e67a22075836a72d59a51fb640163296916dc7de278e3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e80669435df0415280e67a22075836a72d59a51fb640163296916dc7de278e3c","first_computed_at":"2026-05-17T23:43:14.002240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:14.002240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v6sCG/7D2mUR0yWySXgRXsYLxH1QovwR9I/cX9f4po5Fcn7pxXPT0b85oy8FzyZHo5fVy4VeJLX0oTcnBN/ADg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:14.002694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05998","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4badcaa7ebce083e52b20899334a03888427d102395a37ab097b955d975c4a98","sha256:f0fcd61256bdaf37cebd50846f77739c33cefed7f73686869d4111ba0a5fac31"],"state_sha256":"e08da810d4f9eb09332431397f26fa5d3ba935be558b484d16a3d4463939321b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDxBYPE9WKPDJPIs8ln7qix3/TMwIGv/04UP1vzBk7otKEov5bf8k4U3sVmt9K/bCZExLUAA/TTbAnc/w5W1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:46:51.464764Z","bundle_sha256":"fed801ff2ef7f88867f0b1cf098bf4c323a4b9737b359ac7b6b0b3ac6a5a1d4f"}}