{"as_of":"2026-08-16T16:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:23ed2912fe007d9d8bf467607e0f97b389f7d68fc5c763f5a4732fa9c0167e40","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:34:12.723258Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.09185/citation-record","integrity":"/paper/1908.09185/integrity","json":"/paper/1908.09185/citation-record.json","paper":"/paper/1908.09185"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.114917Z","title":null,"venue":null,"work_id":"9972eb72-6f59-402e-a78b-aa1e36ca2467","year":2014},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.604586Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:6c0ab5ce92a495f34a542ba6f6162ae539283f27e6d54341a31dd1f215c834ca","observation_id":"21e672f5-ef17-4835-9ce3-e9860ce9611e","resolution":{"observed_at":"2026-08-14T11:34:13.118149Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.105107Z","title":"https://www.wordstream.com/blog/ws/2018/01/25/ hyperlocal-marketing, 2018","venue":null,"work_id":"b540e6d9-ec58-41e0-8eda-e736366cc0e8","year":2018},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.609256Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:fae7dd432dbfad394da606168e341d9571b4cc5c18f052b9ec3188b4207f7c01","observation_id":"5e1d6afb-771f-446e-8c1a-607bdec56cf9","resolution":{"observed_at":"2026-08-14T11:34:13.108355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.096708Z","title":"Viral mar- keting meets social advertising: Ad allocation with minimum regret.Proc","venue":null,"work_id":"90ed9927-e973-415b-80df-b77a606e095c","year":2015},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.613396Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:8beb34edd643c6748da6a13655f727b0e47a54b742dd983a483680da0db2e190","observation_id":"4dd92429-969c-40d3-90ae-e8c42e3dbf1d","resolution":{"observed_at":"2026-08-14T11:34:13.099620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.087936Z","title":"Maximizing social influence in nearly optimal time","venue":null,"work_id":"48aa7420-8736-46f0-bd7f-bd3430b9fe8c","year":2014},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.617712Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:eb3c4c296df4e746946f1274e3d53bf8504b13b5f1cfc03d48282b2b245a3d84","observation_id":"a7174383-9de3-42f9-a55f-33dfccc8fb24","resolution":{"observed_at":"2026-08-14T11:34:13.090835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.079214Z","title":"Maximizing a submodular set function subject to a matroid constraint","venue":null,"work_id":"11130aa9-1b46-4546-9156-2a268e762f44","year":2007},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.621538Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:5b3a3db175989bcbbbefa5d6502b2024eb8ca380bd14e5a60703136581599b5e","observation_id":"86f1ecd4-2cf3-443c-8eb8-b2e1d3690ab0","resolution":{"observed_at":"2026-08-14T11:34:13.082146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.068804Z","title":"Maximizing a submodular set function subject to a matroid constraint.SIAM Journal on Computing, 40(6):1740–1766, 2011","venue":null,"work_id":"ff66f891-b2cb-4e10-b8c8-3fc2ce57e2a5","year":2011},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.625199Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:44e19fb4d7ecde667ef6ab3376199579152f48f7423c4c065b6992a2bb6ba825","observation_id":"00785f67-1cd4-413f-b218-2de2ef4cc84c","resolution":{"observed_at":"2026-08-14T11:34:13.071847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.059016Z","title":"Submodular function maximization via the multilinear relaxation and contention resolution schemes","venue":null,"work_id":"2f550878-b0f0-4ebe-919a-2658039a5684","year":2011},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.629099Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:876098dcfaabb99e76b233c9d13062f3f03164a9ed6c66ca7cdfdab906894282","observation_id":"4ffee35c-2020-4797-9454-ad51bfaaeeba","resolution":{"observed_at":"2026-08-14T11:34:13.061888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.049641Z","title":"Lakshmanan, and Carlos Castillo.Information and Influence Propagation in Social Networks","venue":null,"work_id":"44632ec9-0e65-4d7e-9716-7b0cac5669ea","year":2013},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.631611Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:2f32260cb8477476d4fd739dd5a3357e8d00a3a9d5cdb4350637ab7784271c96","observation_id":"a124a7f2-31ef-41a5-887d-d50e8209f7f0","resolution":{"observed_at":"2026-08-14T11:34:13.052773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.038903Z","title":"Efficient influence maximization in social networks","venue":null,"work_id":"aff093ba-1274-4069-a28f-409fd4604dac","year":2009},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.634358Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:e162ecadb78269647bca01a88afd3a4944261c58a52d0f461f88762eba1ab414","observation_id":"e1a1bff8-a368-43e1-bc6e-8159ef7a2c96","resolution":{"observed_at":"2026-08-14T11:34:13.042213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.028743Z","title":"Scalable influence maximization in social networks under the linear threshold model","venue":null,"work_id":"10e2f4f1-109a-4e01-9a12-f287cfe7f1cc","year":2010},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.637751Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:364b6c107d895263b3c8ba5fcb43f67144de0077e460e296843731d11521f533","observation_id":"784e077a-e93a-48bc-931a-8b3f67bdbfcd","resolution":{"observed_at":"2026-08-14T11:34:13.032019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.018486Z","title":"Viral marketing for multiple products","venue":null,"work_id":"5bb8d4fb-8111-42ac-bc8a-bbce1e68acd2","year":2010},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.640556Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:c2bb6654674ac37788fe57d0aea2c298432d54a420ac691d3de4f62306c0cf93","observation_id":"43f13dee-3a96-4eb7-aa46-96c88f9330b9","resolution":{"observed_at":"2026-08-14T11:34:13.021234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:13.009289Z","title":"Mining the network value of customers","venue":null,"work_id":"135dc71e-a034-4eb4-8eb3-747090df13f4","year":2001},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.643228Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:f037423d858c9f104d5cc4a5f5f4f2a9d5ae74942b729a5e1950f74aefceb54f","observation_id":"ba79e415-4108-4454-a8ff-b59659217252","resolution":{"observed_at":"2026-08-14T11:34:13.012117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.999040Z","title":"Competing for customers in a social network: The quasi-linear case","venue":null,"work_id":"271be1b8-d368-4cbf-b9d4-dde348c15f31","year":2006},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.646345Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:662890523ab0820baa9b4d1d85328f4d992f1797bdcca9b7cf041e73279f72bd","observation_id":"81514aa8-680b-4524-b535-0fd31603e77c","resolution":{"observed_at":"2026-08-14T11:34:13.001949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.988474Z","title":"Fisher, George L","venue":null,"work_id":"70875304-7b37-4d59-9ce9-ec1c427c6de8","year":1978},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.649392Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:10cc9057a4696ddd608a511a0a51aa249b2d52bcec34d48a226c3f62d10df25b","observation_id":"1e3650aa-1898-41c1-83f4-c9fb3f000766","resolution":{"observed_at":"2026-08-14T11:34:12.991866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.978330Z","title":"Dependent rounding and its applications to approximation algorithms.Journal of the ACM, 53(3):324–360, 2006","venue":null,"work_id":"0abeb3f6-912b-4edf-8e89-923803a69630","year":2006},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.651845Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:538fed26da45ec39b8d3b9e29ed680c9eb5fbd35cd97c4672cf17674bba5ddc1","observation_id":"f6e72fe7-a063-4951-bb54-e0784a1b8227","resolution":{"observed_at":"2026-08-14T11:34:12.981228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.968650Z","title":"Talk of the network: A complex systems look at the underlying process of word-of-mouth.Marketing Letters, 12:211–223, 2001","venue":null,"work_id":"85b95cf7-f9f2-4a81-b663-60dd20f2351a","year":2001},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.654970Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:f83bb5c043544c100c45a09f5378a1bdba682d095af7e7b47731a5e4308405f3","observation_id":"dd7772bd-947f-44b7-9c9b-f609efaf3fbe","resolution":{"observed_at":"2026-08-14T11:34:12.971496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.959578Z","title":null,"venue":null,"work_id":"70986ce3-98a9-4208-8f83-66d039989fcb","year":2001},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.657548Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:7c97df1601bb2efd6517048551ea4cecc58bf4ad154e1e1fa674eb3685c6a302","observation_id":"0f3725ce-d747-4f97-8355-0e12180c69df","resolution":{"observed_at":"2026-08-14T11:34:12.962054Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.950177Z","title":"Competitive contagion in networks","venue":null,"work_id":"fdc519fb-d745-4625-96f4-44a348c68d98","year":2012},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.659919Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:f1fa722a06d6acc25d0f6601b3706603417271775d0def180c9fb55338e960a5","observation_id":"b45d40b2-a0b9-417e-b049-97b6321bd7c9","resolution":{"observed_at":"2026-08-14T11:34:12.953175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.939768Z","title":"An efficient linear programming based method for the influence maximization problem in social networks.Information Sciences, 503:589–605, 2019","venue":null,"work_id":"cd951272-869d-4412-ae74-a3df2723c0ca","year":2019},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.662310Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:55536afd4ef6d03c42f258cef24f3873a8f9e22b8294650929da8942d5cd004d","observation_id":"2554561a-3382-4d3d-8384-357a6ed7e809","resolution":{"observed_at":"2026-08-14T11:34:12.942675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.930940Z","title":"Hartline, Vahab S","venue":null,"work_id":"a2844b83-a545-40b1-bd49-56113405b361","year":2008},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.665432Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:4463eae1247ad0b00fef9dcdaf87e30a6237d83d59db8933182b7dd0e8c9096d","observation_id":"95c762de-556b-4b00-a034-909701dddc5e","resolution":{"observed_at":"2026-08-14T11:34:12.934272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.920097Z","title":"Price of anarchy for then-player competitive cascade game with submodular activation functions","venue":null,"work_id":"b9d63bf1-0fba-4d56-8f6d-755bae35f658","year":2013},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.669011Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:4caea9f505136409327f3c45685257842f8dd840f13884cd2e44554963f9a5ec","observation_id":"887d880f-b143-4472-bd35-f53971cb97de","resolution":{"observed_at":"2026-08-14T11:34:12.923550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.909140Z","title":"Maximizing the spread of influence in a social network","venue":null,"work_id":"3a9e11b9-e870-47d8-8c89-d5629d49f99a","year":2015},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.671643Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:9abbbf233aaf403462a7f73f49c89d416066955483b06c6fa834050312277d26","observation_id":"ec1824ad-fc42-4209-a119-604837c086c3","resolution":{"observed_at":"2026-08-14T11:34:12.912396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.899080Z","title":"Konect: the koblenz network collection","venue":null,"work_id":"2ace7129-fb5e-4d52-b10a-e072dfc40df6","year":2013},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.674920Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:e2507b4e6e65c427fd2f923af1ae18c18e5e15abb1e20807b8c81faab7ffc807","observation_id":"6149bf91-e351-41bf-ab07-87875a1b4ead","resolution":{"observed_at":"2026-08-14T11:34:12.902254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.888999Z","title":"Submodular maximization over multiple ma- troids via generalized exchange properties","venue":null,"work_id":"35f94e9c-4a05-4505-a2f6-d56bde892a6b","year":2009},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.678462Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:f1d53adbe383b2a529efdb296c315eee79719b1193b90de1a18bad661163dbdc","observation_id":"f5bbd836-ee34-4719-a750-09e63ac0482a","resolution":{"observed_at":"2026-08-14T11:34:12.891947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.879353Z","title":"Lehmann, and Noam Nisan","venue":null,"work_id":"208eff90-1138-40d8-b82f-cd1ca6911c15","year":2006},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.681211Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:25b8f5d8acbaafd6bb2a419e11fb981b17a5f27fd14b5a9cc2d7cd058cdc5d4f","observation_id":"72178970-9a79-44b3-8338-1bba7132e501","resolution":{"observed_at":"2026-08-14T11:34:12.882001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.869380Z","title":null,"venue":null,"work_id":"fd03b45d-2064-46a0-b347-50a7ecaa495e","year":2014},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.683947Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:26f242c84ba6cb8060cefc40048de406fc16b89ef06106601993bb6a9f84705b","observation_id":"c34b4d61-1e8c-4c2e-bc93-11129424f44c","resolution":{"observed_at":"2026-08-14T11:34:12.871872Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.859606Z","title":null,"venue":null,"work_id":"ef64aa61-a012-4a9f-9583-64b1ae4b8c19","year":2015},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.687580Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:dcd68cf4c80232fca2966cbbe03e38a63635903143bbbbe9dcfb5eecfc3fe68e","observation_id":"d06af838-0d73-48b7-8e5a-b4425e20c662","resolution":{"observed_at":"2026-08-14T11:34:12.862232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.849142Z","title":"Submodularity of influence in social networks: From local to global.SIAM Journal on Computing, 39(6):2176–2188, 2010","venue":null,"work_id":"d7242f90-abdd-40c0-b828-eeffb9b0cd06","year":2010},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.691097Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:57d3cf498bb99b64eb9f220b9451eeb2d84415fb3a856e6603e3cd7d37b0d00a","observation_id":"cd403ccc-a52e-4ca5-9be8-42c84af5e260","resolution":{"observed_at":"2026-08-14T11:34:12.851958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.839908Z","title":"Submodular maximization by simulated annealing","venue":null,"work_id":"e03def2e-0603-4b00-b595-c33b63a12a1d","year":2011},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.694687Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:43fd80226b89a6a7233cf49aba4b3da9c6ea3a632e0f2fc2390f5ae3cd945f0e","observation_id":"c469091d-4366-48e7-8f08-dd76198f22e6","resolution":{"observed_at":"2026-08-14T11:34:12.842612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.829925Z","title":"Oxley.Matroid Theory","venue":null,"work_id":"e806071f-f090-4325-af9a-263e15503ad9","year":1992},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.697461Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:08b052f58d6590cf0b003d0fa3b1eadbcbf8c78faf26c6e08c38099ade2c6892","observation_id":"187aacde-1109-41dd-b469-915d4a124a22","resolution":{"observed_at":"2026-08-14T11:34:12.832726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.819415Z","title":"Optimizing ad allocation in social advertising","venue":null,"work_id":"0820adec-dc06-4517-8a6c-4292c059f992","year":2016},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.700727Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:62f600f138138f9e0264e158d5e2f1b5b35e8ab033988c210991a9f94f0abb65","observation_id":"44af35b5-794d-4c78-a764-81dc81dc782d","resolution":{"observed_at":"2026-08-14T11:34:12.822110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.807548Z","title":"Influence maximization in near-linear time: A martingale approach","venue":null,"work_id":"969e2cba-2ea2-46f8-b5f4-075e6eb99f8c","year":2015},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.703655Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:49af88d5db404f5b77a20f849f5d0c71828a3bd157787bdbd77d57c7bcf05e6e","observation_id":"a02f13b3-d540-44fc-b0f8-826640dd408e","resolution":{"observed_at":"2026-08-14T11:34:12.811674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.797007Z","title":"Influence maximization: near-optimal time complexity meets practical efficiency","venue":null,"work_id":"78981d4c-ab90-430c-83df-fce85b454872","year":2014},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.706745Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:8a8cabd97d96932d08093826155879b41f4238639388890027931bd36810245c","observation_id":"49a8ae12-6dcf-4067-a2bd-d1f0e14ea1e8","resolution":{"observed_at":"2026-08-14T11:34:12.800785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.785985Z","title":"Digital advertising attitudes report","venue":null,"work_id":"ae1c1187-c1f0-470c-8ec1-23b11b0f46b2","year":2014},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.710110Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:c8f70c7b778a0b518a2271872f84f56a7f90d72011df13e6164016d2e6756376","observation_id":"a083c496-4ef2-446f-8cb8-1c8cfd3f0582","resolution":{"observed_at":"2026-08-14T11:34:12.789232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.776992Z","title":"Optimal approximation for the submodular welfare problem in the value oracle model","venue":null,"work_id":"8a9b3e79-0a99-4274-bf8e-d918c14ccaec","year":2008},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.713178Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:74e8d0f0ed67782ae9a5396b31f4524e80a1dd2978ae1d5fe02b961aa2f2e3dc","observation_id":"52e004e9-cfc3-415f-985b-fd24f6e750b2","resolution":{"observed_at":"2026-08-14T11:34:12.779984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.766927Z","title":"Symmetry and approximability of submodular maximization problems","venue":null,"work_id":"fd031484-c31a-4e20-9c58-9746d08e18a1","year":2009},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.717243Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:27a5d969ea3736237e02c599a38a3c1a590294ad836810a9ea862fe8c8dd64f1","observation_id":"5fb3dc9e-342d-441e-a86f-a05ca5a711ed","resolution":{"observed_at":"2026-08-14T11:34:12.769775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.755519Z","title":"Scalable influence maximization for independent cascade model in large-scale social networks.Data Mining and Knowledge Discovery Journal, 25(3):545–576, 2012","venue":null,"work_id":"468e3115-03ec-447f-8f2f-8d4ad4d2e6d4","year":2012},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.720442Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:5cf8e030e1a82a750801e94d41340053a81280f30e874dd648915245f31c68a7","observation_id":"d199d2a2-2a3a-4976-99cc-803c33abe6b1","resolution":{"observed_at":"2026-08-14T11:34:12.759644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:34:12.743581Z","title":"End-to-end influence maximization in the field","venue":null,"work_id":"5c0a126f-c814-440b-9e98-66e3dd6aff9d","year":2018},"citing_paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:12.723258Z"},"links":{"citing_paper":"/paper/1908.09185"},"observation_digest":"sha256:0c2d63fef83e030ef120ae25d467a9beba2dd44f147fe504aefb6a66febf1289","observation_id":"65db46a5-8aff-4e07-b0af-89b501f07c5a","resolution":{"observed_at":"2026-08-14T11:34:12.748120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09185","last_updated":"2019-12-27T00:39:47Z","latest_version":2,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-16T07:37:29.991205Z","submitted_at":"2019-08-24T18:50:10Z","title":"Approximation Algorithms for Coordinating Ad Campaigns on Social Networks"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":38},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:1908.09185."}