{"as_of":"2026-08-16T16:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ffb6fd6d5f0e912dc1797103fa1c08852b9e9ae65243ebc1a6f9666dac218632","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:52:29.932440Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"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.00653/citation-record","integrity":"/paper/1908.00653/integrity","json":"/paper/1908.00653/citation-record.json","paper":"/paper/1908.00653"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1805.06990","last_updated":"2018-05-17T23:19:29Z","snapshot_observed_at":"2026-08-14T19:14:00.801749Z","submitted_at":"2018-05-17T23:19:29Z","title":"Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice","version":1},"cited_work":{"arxiv_id":"1805.06990","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.06990","snapshot_observed_at":"2026-08-14T15:52:29.970916Z","title":"Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice","venue":"cs.DS","work_id":"2c1fa900-ebf9-4f3d-b1af-eb1cd3fbaa7b","year":2018},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.893271Z"},"links":{"cited_paper":"/paper/1805.06990","citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:64de2240cdb7e5948369dd7c02fa00c054f6b1c20299161e709ccb715030e7df","observation_id":"a88c8652-b4b9-4492-835d-482ccc4c2eee","resolution":{"observed_at":"2026-08-14T15:52:29.978095Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-14T15:52:30.126942Z","title":"Singla, S","venue":null,"work_id":"e6dd15ee-b502-4947-aeab-683955a53be5","year":null},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.903631Z"},"links":{"citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:5234eca9b18cc67b0efce023fce7040ea3e99d9f85b6ba695b87d6685de3e708","observation_id":"7b1e6fd1-8fed-4f37-ac1d-31e53c9a6240","resolution":{"observed_at":"2026-08-14T15:52:30.135014Z","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-14T15:52:30.046534Z","title":"For eachy∈A∗, ifπ1(y)≤λ we setmy = 0, otherwisemy is the value in{1,...,k} such that ifi∈{ 1,...,m y} thenπi(y)>λ , and ifi∈{my + 1,...,k} thenπi(y)≤λ","venue":null,"work_id":"834ca599-7c77-4599-8ee6-d1081a933c48","year":2003},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.932440Z"},"links":{"citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:7ddd88ebdd308948e5dc745ba58d4f9914168a90b278eb46e2b3176d3b336b63","observation_id":"7a315567-80f0-414a-af3f-938956a8fbb4","resolution":{"observed_at":"2026-08-14T15:52:30.052341Z","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-14T15:52:30.084216Z","title":"Zhang, A","venue":null,"work_id":"58eefd84-d8c6-4813-badc-19af3bdf25d4","year":2016},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":1982,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.920003Z"},"links":{"citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:1d7b3e6351dd122fc842e37810862b3125432cbb8a746fb5c6593025eb19addd","observation_id":"e77c7486-f588-4a3e-8d2d-8023e08b3732","resolution":{"observed_at":"2026-08-14T15:52:30.091225Z","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-14T15:52:30.158993Z","title":"Kuhnle, T","venue":null,"work_id":"c2708284-8570-48e3-afb3-c0017a4041d4","year":2017},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.889284Z"},"links":{"citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:2f11eae106c815814abdebf1289d8b8581110cdffa12fa3701410d0a9c1581f4","observation_id":"808e2729-dff0-4ed5-8f1f-4fa9c586ec82","resolution":{"observed_at":"2026-08-14T15:52:30.167289Z","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-14T15:52:30.146111Z","title":null,"venue":null,"work_id":"d9d0e7f5-fe74-49df-995c-ed02b7bd2aaf","year":2017},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.897967Z"},"links":{"citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:8026bb132802a0fcacda923efbec40fe0d57394ef7d7357d632b14a3d0a05d38","observation_id":"8db1f380-c42a-4d9b-a5a6-43cfadf765f1","resolution":{"observed_at":"2026-08-14T15:52:30.149761Z","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-14T15:52:30.100116Z","title":null,"venue":null,"work_id":"60b417a5-f7c4-41c5-853d-efd1633c2e3d","year":2013},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.914555Z"},"links":{"citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:627ec44abbb1ce4f1f11f1932df46e558b8b5898d0c0d760eca9af54e228126d","observation_id":"b0dfa98c-112f-478c-8002-61db0cbce418","resolution":{"observed_at":"2026-08-14T15:52:30.105236Z","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":{"arxiv_id":"1711.10665","last_updated":"2017-12-20T03:26:04Z","snapshot_observed_at":"2026-08-14T20:09:04.098054Z","submitted_at":"2017-11-29T03:34:01Z","title":"Cost-Effective Seed Selection in Online Social Networks","version":2},"cited_work":{"arxiv_id":"1711.10665","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.10665","snapshot_observed_at":"2026-08-14T15:52:29.999234Z","title":"Cost-Effective Seed Selection in Online Social Networks","venue":"cs.DS","work_id":"0392d11b-edfc-4c4d-9c32-c68cd4ec20c2","year":2017},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.884590Z"},"links":{"cited_paper":"/paper/1711.10665","citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:8f7749f6a63dd6bc7133900b3dff5be4793d957a3f32ce28515f3dec2b42a060","observation_id":"adc4e7d2-4ec7-40cd-b340-ca731e6313eb","resolution":{"observed_at":"2026-08-14T15:52:30.005002Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-14T15:52:30.177874Z","title":null,"venue":null,"work_id":"043db4ca-8839-49e6-9cde-0a8705200e36","year":2001},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.878218Z"},"links":{"citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:317bac36d08e16c392786715b2ad612c52e047c4b59e1568a53af6a4790c6c2e","observation_id":"115521db-dd1f-45e6-a595-6e3941844977","resolution":{"observed_at":"2026-08-14T15:52:30.181690Z","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-14T15:52:30.113113Z","title":null,"venue":null,"work_id":"f6376141-99b2-409b-b2d9-038e7f5052ee","year":2014},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.908578Z"},"links":{"citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:31b179b787ea26d7ea4c50ac00ce4da12860b1da612d3507ee5bcc526cdd39ae","observation_id":"dafe7458-eca6-488d-aacf-43bfd06c6fe1","resolution":{"observed_at":"2026-08-14T15:52:30.117553Z","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-14T15:52:30.062461Z","title":null,"venue":null,"work_id":"dabc745f-d21d-4cb3-b8db-355cada1916f","year":1982},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.926690Z"},"links":{"citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:7913368744d59c5ddc8c09211d247ee7c6664068bd339487a4b086095746a3e1","observation_id":"788ddae6-a1af-4888-9752-5b6eb20c4bf6","resolution":{"observed_at":"2026-08-14T15:52:30.066426Z","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":{"arxiv_id":"1707.04347","last_updated":"2017-07-13T22:48:43Z","snapshot_observed_at":"2026-08-14T20:47:44.026955Z","submitted_at":"2017-07-13T22:48:43Z","title":"Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?","version":1},"cited_work":{"arxiv_id":"1707.04347","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.04347","snapshot_observed_at":"2026-08-14T15:52:30.024510Z","title":"Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?","venue":"cs.DM","work_id":"b17c580b-7066-4291-a084-ae68932872b4","year":2017},"citing_paper":{"arxiv_id":"1908.00653","last_updated":"2019-08-01T22:55:50Z","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T15:52:29.872425Z"},"links":{"cited_paper":"/paper/1707.04347","citing_paper":"/paper/1908.00653"},"observation_digest":"sha256:9b368d02a05f455c10c19805281238db0ad56ce7db882643d889e75ab832c0a5","observation_id":"604311bb-266e-401d-90d7-8cb71b9a8cd7","resolution":{"observed_at":"2026-08-14T15:52:30.030761Z","resolver_source":"local_arxiv","status":"verified_exact"},"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.00653","last_updated":"2019-08-01T22:55:50Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T08:45:16.532541Z","submitted_at":"2019-08-01T22:55:50Z","title":"Submodular Cost Submodular Cover with an Approximate Oracle"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":3,"verified_fuzzy":4},"total_outbound_references":12},"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 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:1908.00653."}