Paper Citation Record · LEDGER

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks

As of 19 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:1908.09185.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1908.09185 v2

Coverage vector

measured 38 of 38 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T11:34:12.723258Z

measured 38 of 38 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

38 of 38 outbound references displayed

verified exact0
verified fuzzy34
unresolved4
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 21e672f5-ef17-4835-9ce3-e9860ce9611e · outbound

This paper cites an unresolved cited work.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:34:13.118149Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 5e1d6afb-771f-446e-8c1a-607bdec56cf9 · outbound

This paper cites https://www.wordstream.com/blog/ws/2018/01/25/ hyperlocal-marketing, 2018.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks https://www.wordstream.com/blog/ws/2018/01/25/ hyperlocal-marketing, 2018

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.108355Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 4dd92429-969c-40d3-90ae-e8c42e3dbf1d · outbound

This paper cites Viral mar- keting meets social advertising: Ad allocation with minimum regret.Proc.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Viral mar- keting meets social advertising: Ad allocation with minimum regret.Proc

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.099620Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a7174383-9de3-42f9-a55f-33dfccc8fb24 · outbound

This paper cites Maximizing social inﬂuence in nearly optimal time.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Maximizing social inﬂuence in nearly optimal time

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.090835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 86f1ecd4-2cf3-443c-8eb8-b2e1d3690ab0 · outbound

This paper cites Maximizing a submodular set function subject to a matroid constraint.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Maximizing a submodular set function subject to a matroid constraint

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.082146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 00785f67-1cd4-413f-b218-2de2ef4cc84c · outbound

This paper cites Maximizing a submodular set function subject to a matroid constraint.SIAM Journal on Computing, 40(6):1740–1766, 2011.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Maximizing a submodular set function subject to a matroid constraint.SIAM Journal on Computing, 40(6):1740–1766, 2011

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.071847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 4ffee35c-2020-4797-9454-ad51bfaaeeba · outbound

This paper cites Submodular function maximization via the multilinear relaxation and contention resolution schemes.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Submodular function maximization via the multilinear relaxation and contention resolution schemes

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.061888Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a124a7f2-31ef-41a5-887d-d50e8209f7f0 · outbound

This paper cites Lakshmanan, and Carlos Castillo.Information and Inﬂuence Propagation in Social Networks.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Lakshmanan, and Carlos Castillo.Information and Inﬂuence Propagation in Social Networks

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.052773Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation e1a1bff8-a368-43e1-bc6e-8159ef7a2c96 · outbound

This paper cites Eﬃcient inﬂuence maximization in social networks.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Eﬃcient inﬂuence maximization in social networks

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.042213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 784e077a-e93a-48bc-931a-8b3f67bdbfcd · outbound

This paper cites Scalable inﬂuence maximization in social networks under the linear threshold model.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Scalable inﬂuence maximization in social networks under the linear threshold model

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.032019Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 43f13dee-3a96-4eb7-aa46-96c88f9330b9 · outbound

This paper cites Viral marketing for multiple products.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Viral marketing for multiple products

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.021234Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ba79e415-4108-4454-a8ff-b59659217252 · outbound

This paper cites Mining the network value of customers.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Mining the network value of customers

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.012117Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 81514aa8-680b-4524-b535-0fd31603e77c · outbound

This paper cites Competing for customers in a social network: The quasi-linear case.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Competing for customers in a social network: The quasi-linear case

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:13.001949Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 1e3650aa-1898-41c1-83f4-c9fb3f000766 · outbound

This paper cites Fisher, George L.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Fisher, George L

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.991866Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation f6e72fe7-a063-4951-bb54-e0784a1b8227 · outbound

This paper cites Dependent rounding and its applications to approximation algorithms.Journal of the ACM, 53(3):324–360, 2006.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Dependent rounding and its applications to approximation algorithms.Journal of the ACM, 53(3):324–360, 2006

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.981228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation dd7772bd-947f-44b7-9c9b-f609efaf3fbe · outbound

This paper cites Talk of the network: A complex systems look at the underlying process of word-of-mouth.Marketing Letters, 12:211–223, 2001.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Talk of the network: A complex systems look at the underlying process of word-of-mouth.Marketing Letters, 12:211–223, 2001

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.971496Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 0f3725ce-d747-4f97-8355-0e12180c69df · outbound

This paper cites an unresolved cited work.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Unresolved cited work

Reference 17

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:34:12.962054Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b45d40b2-a0b9-417e-b049-97b6321bd7c9 · outbound

This paper cites Competitive contagion in networks.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Competitive contagion in networks

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.953175Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 2554561a-3382-4d3d-8384-357a6ed7e809 · outbound

This paper cites An eﬃcient linear programming based method for the inﬂuence maximization problem in social networks.Information Sciences, 503:589–605, 2019.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks An eﬃcient linear programming based method for the inﬂuence maximization problem in social networks.Information Sciences, 503:589–605, 2019

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.942675Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 95c762de-556b-4b00-a034-909701dddc5e · outbound

This paper cites Hartline, Vahab S.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Hartline, Vahab S

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.934272Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 887d880f-b143-4472-bd35-f53971cb97de · outbound

This paper cites Price of anarchy for then-player competitive cascade game with submodular activation functions.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Price of anarchy for then-player competitive cascade game with submodular activation functions

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.923550Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ec1824ad-fc42-4209-a119-604837c086c3 · outbound

This paper cites Maximizing the spread of inﬂuence in a social network.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Maximizing the spread of inﬂuence in a social network

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.912396Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 6149bf91-e351-41bf-ab07-87875a1b4ead · outbound

This paper cites Konect: the koblenz network collection.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Konect: the koblenz network collection

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.902254Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation f5bbd836-ee34-4719-a750-09e63ac0482a · outbound

This paper cites Submodular maximization over multiple ma- troids via generalized exchange properties.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Submodular maximization over multiple ma- troids via generalized exchange properties

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.891947Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 72178970-9a79-44b3-8338-1bba7132e501 · outbound

This paper cites Lehmann, and Noam Nisan.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Lehmann, and Noam Nisan

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.882001Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c34b4d61-1e8c-4c2e-bc93-11129424f44c · outbound

This paper cites an unresolved cited work.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Unresolved cited work

Reference 26

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:34:12.871872Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d06af838-0d73-48b7-8e5a-b4425e20c662 · outbound

This paper cites an unresolved cited work.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Unresolved cited work

Reference 27

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:34:12.862232Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation cd403ccc-a52e-4ca5-9be8-42c84af5e260 · outbound

This paper cites Submodularity of inﬂuence in social networks: From local to global.SIAM Journal on Computing, 39(6):2176–2188, 2010.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Submodularity of inﬂuence in social networks: From local to global.SIAM Journal on Computing, 39(6):2176–2188, 2010

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.851958Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c469091d-4366-48e7-8f08-dd76198f22e6 · outbound

This paper cites Submodular maximization by simulated annealing.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Submodular maximization by simulated annealing

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.842612Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 187aacde-1109-41dd-b469-915d4a124a22 · outbound

This paper cites Oxley.Matroid Theory.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Oxley.Matroid Theory

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.832726Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 44af35b5-794d-4c78-a764-81dc81dc782d · outbound

This paper cites Optimizing ad allocation in social advertising.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Optimizing ad allocation in social advertising

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.822110Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a02f13b3-d540-44fc-b0f8-826640dd408e · outbound

This paper cites Inﬂuence maximization in near-linear time: A martingale approach.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Inﬂuence maximization in near-linear time: A martingale approach

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.811674Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 49a8ae12-6dcf-4067-a2bd-d1f0e14ea1e8 · outbound

This paper cites Inﬂuence maximization: near-optimal time complexity meets practical eﬃciency.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Inﬂuence maximization: near-optimal time complexity meets practical eﬃciency

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.800785Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a083c496-4ef2-446f-8cb8-1c8cfd3f0582 · outbound

This paper cites Digital advertising attitudes report.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Digital advertising attitudes report

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.789232Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 52e004e9-cfc3-415f-985b-fd24f6e750b2 · outbound

This paper cites Optimal approximation for the submodular welfare problem in the value oracle model.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Optimal approximation for the submodular welfare problem in the value oracle model

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.779984Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 5fb3dc9e-342d-441e-a86f-a05ca5a711ed · outbound

This paper cites Symmetry and approximability of submodular maximization problems.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Symmetry and approximability of submodular maximization problems

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.769775Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d199d2a2-2a3a-4976-99cc-803c33abe6b1 · outbound

This paper cites Scalable inﬂuence maximization for independent cascade model in large-scale social networks.Data Mining and Knowledge Discovery Journal, 25(3):545–576, 2012.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks Scalable inﬂuence maximization for independent cascade model in large-scale social networks.Data Mining and Knowledge Discovery Journal, 25(3):545–576, 2012

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.759644Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 65db46a5-8aff-4e07-b0af-89b501f07c5a · outbound

This paper cites End-to-end inﬂuence maximization in the ﬁeld.

Approximation Algorithms for Coordinating Ad Campaigns on Social Networks End-to-end inﬂuence maximization in the ﬁeld

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:34:12.748120Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Pith citing papers

No inbound Pith citation observations are available.