{"as_of":"2026-08-18T15:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b62f8b38101363c8d0b0576b7bf17a9d8a31d6e4a07e88f313c38394330bf037","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:44:35.660079Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T22:44:35.783118Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.13676","last_updated":"2020-11-18T01:40:48Z","snapshot_observed_at":"2026-08-18T06:30:50.435760Z","submitted_at":"2019-09-30T13:26:05Z","title":"Optimal Algorithms for Submodular Maximization with Distributed Constraints","version":3},"cited_work":{"arxiv_id":"1909.13676","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.13676","snapshot_observed_at":"2026-08-10T22:44:35.783118Z","title":"Optimal Algorithms for Submodular Maximization with Distributed Constraints","venue":"math.OC","work_id":"9314f455-b5a5-4efb-8e51-07ba36a5e34d","year":2019},"citing_paper":{"arxiv_id":"2501.01071","last_updated":"2025-01-02T05:41:21Z","snapshot_observed_at":"2026-08-17T16:53:41.657348Z","submitted_at":"2025-01-02T05:41:21Z","title":"Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T22:44:35.660079Z"},"links":{"cited_paper":"/paper/1909.13676","citing_paper":"/paper/2501.01071"},"observation_digest":"sha256:033603ecfcb69b5cec0d43d6ab64f3add1a9384c0ee686b6713b5bcc32adffca","observation_id":"1794a340-2c94-42b0-a340-5250d664caed","resolution":{"observed_at":"2026-08-10T22:44:35.790150Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1909.13676/citation-record","integrity":"/paper/1909.13676/integrity","json":"/paper/1909.13676/citation-record.json","paper":"/paper/1909.13676"},"outbound":[],"paper":{"arxiv_id":"1909.13676","last_updated":"2020-11-18T01:40:48Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T06:30:50.435760Z","submitted_at":"2019-09-30T13:26:05Z","title":"Optimal Algorithms for Submodular Maximization with Distributed Constraints"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1909.13676."}