{"as_of":"2026-08-16T19:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:203e038ed0cafd9f4f058c05da31f3edf434f578e5d4e6633a043d5de12c747f","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:12:08.539393Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T17:21:08.441873Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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":"0912.0322","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"0912.0322","snapshot_observed_at":"2026-07-04T17:56:43.537382Z","title":"a survey","venue":null,"work_id":"efa04a80-70f6-4758-979a-b4351d3d352d","year":null},"citing_paper":{"arxiv_id":"2605.04425","last_updated":"2026-05-06T02:38:59Z","snapshot_observed_at":"2026-08-16T08:46:02.444078Z","submitted_at":"2026-05-06T02:38:59Z","title":"Joint Semantic Token Selection and Prompt Optimization for Interpretable Prompt Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-08T17:41:05.464502Z"},"links":{"cited_paper":"/paper/0912.0322","citing_paper":"/paper/2605.04425"},"observation_digest":"sha256:2cb715c3e3da04b8a47b4bb86193db5bfac462b312e5b1c70badd71d15d0cce1","observation_id":"7134888f-1437-4c45-a6e0-9d5f16b56837","resolution":{"observed_at":"2026-07-04T17:56:43.537382Z","resolver_source":"arxiv_id","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":{"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-16T00:12:08.539393Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.12532","last_updated":"2026-08-12T19:07:07Z","snapshot_observed_at":"2026-08-16T18:10:26.576928Z","submitted_at":"2026-08-12T19:07:07Z","title":"MASCOT: Model-Aware Submodular Coverage for Composite-Attribute Text-to-Image Retrieval","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T00:12:08.539393Z"},"links":{"cited_paper":"/paper/0912.0322","citing_paper":"/paper/2608.12532"},"observation_digest":"sha256:1aeb59ba4117e7ecd6df9034e969cf714c9c025a4697defc5f14054aa2f34f5d","observation_id":"a34fd930-33d2-4572-80e5-eade19308034","resolution":{"observed_at":"2026-08-16T00:12:08.539393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/0912.0322/citation-record","integrity":"/paper/0912.0322/integrity","json":"/paper/0912.0322/citation-record.json","paper":"/paper/0912.0322"},"outbound":[],"paper":{"arxiv_id":"0912.0322","last_updated":"2011-11-06T22:23:46Z","latest_version":4,"primary_category":"cs.DS","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"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:0912.0322."}