{"as_of":"2026-07-15T20:50:00Z","canonical_paper_id":"TFPDX6LW","canonical_url":"https://pith.science/paper/TFPDX6LW/integrity","context_digest":"sha256:a251c130758fe09a7437e1246d7ffb2cefdee4571a96e33d65223192f0b43048","coverage_summary":[],"findings":[],"findings_empty_copy":"No checks are listed for this paper yet.","findings_observation_state":"no_listed_checks","links":{"arxiv":"https://arxiv.org/abs/1907.09064","bundle_json":"/pith/TFPDX6LW4TMYZ7LZYQ7NE2IIR2/bundle.json","citation_record":"/paper/TFPDX6LW/citation-record","evidence":"/evidence","html":"/paper/TFPDX6LW/integrity","integrity_json":"/paper/TFPDX6LW/integrity.json","json":"/paper/TFPDX6LW/integrity.json","legacy_integrity_json":"/pith/TFPDX6LW/integrity.json","paper":"/paper/TFPDX6LW","reference_changes":"/flags?citing=TFPDX6LW"},"paper":{"arxiv_id":"1907.09064","latest_version":3,"primary_cat":"cs.DM","title":"Performance-Complexity Tradeoffs in Greedy Weak Submodular Maximization with Random Sampling"},"pith_number":"pith:2019:TFPDX6LW4TMYZ7LZYQ7NE2IIR2","pith_short":"TFPDX6LW4TMYZ7LZYQ7NE2IIR2","record":{"arxiv_id":"1907.09064","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:1907.09064. No listed check completed, so this record makes no findings claim.","counts":{"completed":0,"failed":0,"listed":0,"not_collected":0,"not_requested":0,"partial":0,"public_findings_from_completed":0,"skipped":0,"unavailable":0,"withheld":0},"coverage":[],"observed_at":null,"refusal":"This is a record of named checks, not a clean-status claim or a paper verdict.","schema":"pith.integrity.v1"},"schema":"pith.paper-integrity-record.v1","species":"LEDGER"}