{"as_of":"2026-08-17T06:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab426616e6b0c5c451ca022bdafebe2bc12c9817149a1d881d00528332bccd8e","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:22:26.547973Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"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/2507.13834/citation-record","integrity":"/paper/2507.13834/integrity","json":"/paper/2507.13834/citation-record.json","paper":"/paper/2507.13834"},"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-06T16:22:26.953634Z","title":"In: International Conference on Advanced Data Mining and Applications","venue":null,"work_id":"4f80a6a0-e18b-4c33-96be-a8b95d1da416","year":2022},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.441216Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:f9b45b38316e12b74025f373af227cc6d2273827cc6b87da32595fa38803e221","observation_id":"e2711eb7-3cb5-4cb0-938e-b1f0c15c69e8","resolution":{"observed_at":"2026-08-06T16:22:26.957274Z","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":{"arxiv_id":"2305.08949","last_updated":"2023-05-15T18:36:30Z","snapshot_observed_at":"2026-08-16T19:01:24.178904Z","submitted_at":"2023-05-15T18:36:30Z","title":"Influential Billboard Slot Selection using Spatial Clustering and Pruned Submodularity Graph","version":1},"cited_work":{"arxiv_id":"2305.08949","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.08949","snapshot_observed_at":"2026-08-06T16:22:26.642566Z","title":"Influential Billboard Slot Selection using Spatial Clustering and Pruned Submodularity Graph","venue":"cs.DB","work_id":"d29880d4-6177-4053-9d6a-2735d7eda073","year":2023},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.445332Z"},"links":{"cited_paper":"/paper/2305.08949","citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:ac811525fe1457ef11dfdf955628be7c1da5d4a51ad33cf6c6e7cc679b8d40d6","observation_id":"1d39428e-4d05-4e43-9b33-d770d7f052a1","resolution":{"observed_at":"2026-08-06T16:22:26.646308Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-06T16:22:26.942263Z","title":"Advances in Neural Information Processing Systems 30 (2017)","venue":null,"work_id":"6ed53b0a-2076-4ea4-8100-5bf1fc0f6d2a","year":2017},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.449532Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:c4b7578b9c7d341a47895e416e88c2ae3f89c9f4a9a3479067a77122947383c1","observation_id":"0e38dc00-774b-430d-90b0-e265a050c360","resolution":{"observed_at":"2026-08-06T16:22:26.945860Z","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-06T16:22:26.928726Z","title":"In: Proceedings eighth IEEE international conference on computer vision","venue":null,"work_id":"2b30e91f-69f2-487a-b146-c5c27b81ef1c","year":2001},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.453956Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:2f0efb7b584d82d82c04118c9df00d0914d20bd0f2af3e7193c3ab33f19cc638","observation_id":"5fd37600-a49c-480e-aeaa-598f4d385d11","resolution":{"observed_at":"2026-08-06T16:22:26.932963Z","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-06T16:22:26.914517Z","title":"Mathematical Programming154, 225–247 (2015)","venue":null,"work_id":"cdcaef6e-eefa-43f2-bcbf-7ec2b371617a","year":2015},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.457302Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:104b7fe31617181b9117ffc22b4bb6feac40caf58e6cb5ba15b1083999e8573f","observation_id":"deab4a1f-d544-41c0-8ecf-5e8a97299f31","resolution":{"observed_at":"2026-08-06T16:22:26.919287Z","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-06T16:22:26.901945Z","title":"Advances in Neural Information Processing Systems29 (2016)","venue":null,"work_id":"e58d6878-e594-498e-a3a6-40fc1f89e3df","year":2016},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.460574Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:84e5bcacf9ed4572d2cf5258740af565f35b951b153e71a92730074ee4c366eb","observation_id":"9ccde5f3-3c0a-4a24-b39d-f2d43eaa8ca9","resolution":{"observed_at":"2026-08-06T16:22:26.905284Z","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-06T16:22:26.890265Z","title":"Springer (2020)","venue":null,"work_id":"7f39a2a1-0700-49c0-b9a5-88db5e00ed8d","year":2020},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.464151Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:fa4fa07747fa63dbb41fef6d3efd53647d4ae644f866ff4db530c1cd0d74b773","observation_id":"f835b7fe-ebbf-41e1-904a-399d100cd04d","resolution":{"observed_at":"2026-08-06T16:22:26.894589Z","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":{"arxiv_id":"0912.0322","last_updated":"2011-11-06T22:23:46Z","snapshot_observed_at":"2026-08-15T05:32:32.434938Z","submitted_at":"2009-12-02T02:02:27Z","title":"Submodular Functions: Extensions, Distributions, and Algorithms. A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0912.0322","snapshot_observed_at":"2026-08-06T16:22:26.467433Z","title":"a survey","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.467433Z"},"links":{"cited_paper":"/paper/0912.0322","citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:8714d58d7b0b274861aad350bf16f2874b258b9f80b557c3014d1245290ea33a","observation_id":"2bc27865-8e9c-4f4e-b227-8f43a4ad7bad","resolution":{"observed_at":"2026-08-06T16:22:26.467433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:22:26.879308Z","title":"Journal of Algorithms37(1), 66–84 (2000)","venue":null,"work_id":"db520876-239c-4c44-8cae-02efc97accbc","year":2000},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.470723Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:3906abc6333fffdc43f0069c9ff2dd844031f19d528499bb20ff80b243998ac4","observation_id":"898f884d-05c8-4c67-a9a9-d868abecebdf","resolution":{"observed_at":"2026-08-06T16:22:26.882637Z","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-06T16:22:26.866532Z","title":"European Journal of Oper- ational Research 255(2), 315–332 (2016)","venue":null,"work_id":"e1bbd4d9-b278-4a27-9c95-ffe32fff432b","year":2016},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.473693Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:07a779773422fadd87e94f2851cabce7785c6f8de9c4c487d8382f3d697f6935","observation_id":"7f94a53d-8806-46dc-8587-317b24b37449","resolution":{"observed_at":"2026-08-06T16:22:26.871105Z","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":{"arxiv_id":"2101.08763","last_updated":"2021-01-21T18:23:44Z","snapshot_observed_at":"2026-08-16T18:50:50.645828Z","submitted_at":"2021-01-21T18:23:44Z","title":"GPU-Accelerated Optimizer-Aware Evaluation of Submodular Exemplar Clustering","version":1},"cited_work":{"arxiv_id":"2101.08763","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.08763","snapshot_observed_at":"2026-08-06T16:22:26.609921Z","title":"GPU-Accelerated Optimizer-Aware Evaluation of Submodular Exemplar Clustering","venue":"cs.DC","work_id":"100e1776-1473-4584-845c-c2d87a3ea2c0","year":2021},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.476869Z"},"links":{"cited_paper":"/paper/2101.08763","citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:967c1cbd5183d0504c71875c0b6d715c56322145b0a5706b07f9dfbb86ef53ee","observation_id":"2d0c60c6-4053-4176-8969-e537399bcd17","resolution":{"observed_at":"2026-08-06T16:22:26.615489Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-06T16:22:26.853630Z","title":"Ad- vances in neural information processing systems29 (2016)","venue":null,"work_id":"38791079-f82f-4bd7-b5e2-17d9db8d3712","year":2016},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.480437Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:cda53246e6f83b9ae65c55344727a5488ed9f46121889e354b287a806ab06224","observation_id":"208c7884-bc4b-40c6-9856-a236b9b87301","resolution":{"observed_at":"2026-08-06T16:22:26.857434Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:22:26.483283Z","title":"In: Proceedings of the ninth ACM SIGKDD international confer- ence on Knowledge discovery and data mining","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.483283Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:b5cee5360d21d5ea4141a1841d423761e2677d687da5654c49ba8ed54092a278","observation_id":"01540ac7-434e-4dad-a17a-a7158f8700bd","resolution":{"observed_at":"2026-08-06T16:22:26.483283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:22:26.834396Z","title":"Tractability3(71- 104), 3 (2014) Anand et al","venue":null,"work_id":"7fdd6d9a-34ec-4ff4-9028-7df5de54f99b","year":2014},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.486336Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:2a65459860c6096a1c8af84a99bf3e4a42f2355816e1dff6919ceb35a0343eb8","observation_id":"6e236d18-91a5-4ef3-9d8d-60af752650aa","resolution":{"observed_at":"2026-08-06T16:22:26.837883Z","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":{"arxiv_id":"1207.1394","last_updated":"2012-07-04T16:16:25Z","snapshot_observed_at":"2026-08-15T00:54:21.881459Z","submitted_at":"2012-07-04T16:16:25Z","title":"Near-optimal Nonmyopic Value of Information in Graphical Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1207.1394","snapshot_observed_at":"2026-08-06T16:22:26.489642Z","title":"arXiv preprint arXiv:1207.1394 (2012)","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.489642Z"},"links":{"cited_paper":"/paper/1207.1394","citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:ab49503f50fc376f01ba524f1380c3265a69fef87b5deeff319f6cc47db208b4","observation_id":"dfb41f89-a6b7-4ad5-a38d-060bfb21c7a5","resolution":{"observed_at":"2026-08-06T16:22:26.489642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:22:26.823669Z","title":"Journal of Machine Learning Research 9(2) (2008)","venue":null,"work_id":"bd72a9de-1338-4699-a95c-e8a058ceff33","year":2008},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.493160Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:1d4a8812d1091d6541e953092a89aabdbd0d33d1af66b0b966fb8317b692fea0","observation_id":"ff542ee7-8045-4c83-b7eb-e301c0667a69","resolution":{"observed_at":"2026-08-06T16:22:26.827088Z","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-06T16:22:26.811967Z","title":"SIAM Journal on Discrete Mathematics 23(4), 2053–2078 (2010)","venue":null,"work_id":"36333bbd-b487-41a2-a932-f2d50f4fa454","year":2010},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.495997Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:de59d04c45b21d0336f916108f51f35179a9b9ef1fe619b09460d4c7294c5155","observation_id":"c9187066-18bf-4f41-a604-2827024c3f72","resolution":{"observed_at":"2026-08-06T16:22:26.816119Z","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-06T16:22:26.800202Z","title":"In: Berkhin, P., Caruana, R., Wu, X","venue":null,"work_id":"38391089-5d3e-49c8-b1e6-3b2a9360f664","year":null},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.499006Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:e610b35bc97b34bb2beff92d75625c59274ebcc16737953358a474c0e825d181","observation_id":"cdaf7c37-25c5-410b-ad98-f30afe26e90f","resolution":{"observed_at":"2026-08-06T16:22:26.804022Z","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-06T16:22:26.779153Z","title":"Transportation research part B: methodological171, 29–43 (2023)","venue":null,"work_id":"4700137c-1b0d-4a06-aa77-7282311c4848","year":2023},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.505614Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:5f8a0750b5cfa3694aa79069095266deebb18b8951f99204179d3ddf2d9e6454","observation_id":"ca5bf033-b42d-4d22-8efe-5f94f77eed87","resolution":{"observed_at":"2026-08-06T16:22:26.782540Z","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-06T16:22:26.767770Z","title":"In: Proceedings of the 49th annual meeting of the association for computational linguistics: human language technologies","venue":null,"work_id":"cd0a784b-f01d-4b82-ba27-d37bc5543df0","year":2011},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.509072Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:ef5d2f955effd3c54245066fed49717c4a2ba011eabb946cc60ecc326cc56fdf","observation_id":"8043c63f-2d80-413f-bc56-44b4842ad1fa","resolution":{"observed_at":"2026-08-06T16:22:26.771586Z","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-06T16:22:26.757377Z","title":"The Journal of Machine Learning Research17(1), 8330–8373 (2016)","venue":null,"work_id":"2c1115a0-249e-481d-acdd-cf7ea4c52cae","year":2016},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.514551Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:1eb1e2dbf5f6214482b25481254e022cef5b6df8bb368e0c9ce13cee21486757","observation_id":"64dd71db-8ba9-4123-a472-55474eb6d348","resolution":{"observed_at":"2026-08-06T16:22:26.760867Z","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-06T16:22:26.745624Z","title":"Mathematical programming14, 265–294 (1978)","venue":null,"work_id":"3c00cac0-120b-4007-8f42-a5ad184362a7","year":1978},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.518041Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:3fc2e91401ac055bf1ec6788c0458a7768218e899e7641cf7b5fcb447426b18a","observation_id":"abcf6845-aa70-4236-b70f-b7e803fc3c77","resolution":{"observed_at":"2026-08-06T16:22:26.749662Z","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":{"arxiv_id":"2307.13372","last_updated":"2024-05-24T14:14:19Z","snapshot_observed_at":"2026-08-16T15:13:30.578756Z","submitted_at":"2023-07-25T09:46:02Z","title":"Submodular Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2307.13372","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.13372","snapshot_observed_at":"2026-08-06T16:22:26.579706Z","title":"Submodular Reinforcement Learning","venue":"cs.LG","work_id":"550e1cb2-f2bd-41f3-97f8-3709c0427625","year":2023},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.521631Z"},"links":{"cited_paper":"/paper/2307.13372","citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:918577f36504269659e0d9255f20c81036c49d95dd6c6af94589d57b63da55db","observation_id":"849bb8c3-526e-4a72-8623-6b20c14df2e9","resolution":{"observed_at":"2026-08-06T16:22:26.584763Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-06T16:22:26.732854Z","title":"Advances in Neural Information Processing Sys- tems 35, 14998–15012 (2022)","venue":null,"work_id":"b68f9f73-ac2f-483b-9ccd-5a04c00afb5a","year":2022},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.525118Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:03c2e5ef268cfeba796432a4f856b656d73317ab415cc4b9a0ea0b96cbec2e55","observation_id":"24b8172c-ca86-483c-972c-92a8cd2cf686","resolution":{"observed_at":"2026-08-06T16:22:26.736614Z","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-06T16:22:26.721158Z","title":"In: International Conference on Machine Learning","venue":null,"work_id":"719db553-771d-46a9-aa56-ff16a8b2c147","year":2015},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.528198Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:1283784dd4e5fb32131018cb20bb22905ac52d0ab1efaad48bd1796ee55be058","observation_id":"b3c17ae0-ecef-4bc0-867e-73c37416c046","resolution":{"observed_at":"2026-08-06T16:22:26.725094Z","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-06T16:22:26.707724Z","title":null,"venue":null,"work_id":"620eb430-7695-4ec7-b11a-367ec4c18bf6","year":2006},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.531217Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:5bf31baa0261eee1eaa95f02821ffc29291035f94b56c8a3aa2c1d1c2d6d73e6","observation_id":"86405160-e04e-494b-b259-a11b2fdffd81","resolution":{"observed_at":"2026-08-06T16:22:26.712559Z","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-06T16:22:26.694818Z","title":"of: Proceedings of the Second International CSP Solver Competition pp","venue":null,"work_id":"f3288e25-c9df-4328-b544-b5e951c38f08","year":2008},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.534660Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:9813db4c546ebe9f4c7fe04a265f07d0c00567f6cd170d0304ff9ff1c199128a","observation_id":"f503c3de-35de-4a49-ab02-a5290e5d9df2","resolution":{"observed_at":"2026-08-06T16:22:26.698260Z","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-06T16:22:26.684773Z","title":"In: 2017 IEEE 56th Annual Conference on De- cision and Control (CDC)","venue":null,"work_id":"f17ea2be-e0f4-4dfb-b1c2-80e6ed982cf7","year":2017},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.537705Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:aa384977438cfc321c7aadc84478b1e8f93ed227bdfecaa25ca9d78a3a2ce151","observation_id":"d26387be-782f-42e7-b66f-e33d3a6b002d","resolution":{"observed_at":"2026-08-06T16:22:26.687938Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:22:26.541450Z","title":"A Bradford Book (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.541450Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:149948e4eac755b5f522d9464c7f96c8f93b29cb9b3691c877bd48ee829e5fb0","observation_id":"d53d7bd9-a2ca-4f9a-963e-3b34d08c775f","resolution":{"observed_at":"2026-08-06T16:22:26.541450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:22:26.665646Z","title":"SIAM Journal on Discrete Mathematics33(3), 1452–1471 (2019)","venue":null,"work_id":"65fcf905-6601-45dd-861e-f0d2d3f673cd","year":2019},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.544592Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:346fcac81bc825bad6ec372d338a67de3cee155ee8199a516365e681025f4075","observation_id":"b7cf5a72-2232-45dc-a7a1-9abc713b0b99","resolution":{"observed_at":"2026-08-06T16:22:26.669297Z","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-06T16:22:26.654683Z","title":"In: Artificial Intelligence and Statistics","venue":null,"work_id":"d1c4ed6a-8b0f-46b3-83bc-4cdc64f9bded","year":2017},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.547973Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:ba72462802e14685732477c146885176f6a6f2e81e89fe2df9abee96ca7549b9","observation_id":"7e644c78-113d-44c8-956a-b4e3847afbdb","resolution":{"observed_at":"2026-08-06T16:22:26.658334Z","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-06T16:22:26.789806Z","title":null,"venue":null,"work_id":"661005dc-f559-4c2d-8781-9eb86ac99bd3","year":2007},"citing_paper":{"arxiv_id":"2507.13834","last_updated":"2025-07-18T11:42:07Z","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:26.502299Z"},"links":{"citing_paper":"/paper/2507.13834"},"observation_digest":"sha256:f807f979f158da1455e0ee05f0d3a20a93ca0a68539714e0ff1379cb55b851e0","observation_id":"bb3421fc-5a42-45e2-9fae-e2125adf256f","resolution":{"observed_at":"2026-08-06T16:22:26.793147Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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":"2507.13834","last_updated":"2025-07-18T11:42:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T21:55:47.446943Z","submitted_at":"2025-07-18T11:42:07Z","title":"Scalable Submodular Policy Optimization via Pruned Submodularity Graph"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":1,"unresolved":5,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":32},"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 17 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2507.13834."}