{"as_of":"2026-08-18T05:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:021d72deb355a7aa8c7decf77c0360c9f87628d5b62cb3c2bd3b53860c153aec","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T10:01:25.189942Z","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-05-21T10:04:06.448828Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1111.6453","last_updated":"2013-10-08T07:22:08Z","snapshot_observed_at":"2026-08-15T04:27:36.916845Z","submitted_at":"2011-11-28T14:45:01Z","title":"Learning with Submodular Functions: A Convex Optimization Perspective","version":2},"cited_work":{"arxiv_id":"1111.6453","doi":null,"metadata_source":"pith","pith_arxiv_id":"1111.6453","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning with Submodular Functions: A Convex Optimization Perspective","venue":"cs.LG","work_id":"77bf9a6d-45f7-4939-9feb-9273e1a466b6","year":2011},"citing_paper":{"arxiv_id":"2604.03419","last_updated":"2026-05-18T23:21:13Z","snapshot_observed_at":"2026-07-06T22:52:34.609783Z","submitted_at":"2026-04-03T19:32:39Z","title":"Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-13T19:51:23.631772Z"},"links":{"cited_paper":"/paper/1111.6453","citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:f711724f0640bfb2baf120153efb713b05bbefa4054a42929f62145bbecfdb44","observation_id":"43ed5545-77c8-4b57-ab3e-f42d8b9a8782","resolution":{"observed_at":"2026-05-13T19:53:11.695984Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1111.6453","last_updated":"2013-10-08T07:22:08Z","snapshot_observed_at":"2026-08-15T04:27:36.916845Z","submitted_at":"2011-11-28T14:45:01Z","title":"Learning with Submodular Functions: A Convex Optimization Perspective","version":2},"cited_work":{"arxiv_id":"1111.6453","doi":null,"metadata_source":"pith","pith_arxiv_id":"1111.6453","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning with Submodular Functions: A Convex Optimization Perspective","venue":"cs.LG","work_id":"77bf9a6d-45f7-4939-9feb-9273e1a466b6","year":2011},"citing_paper":{"arxiv_id":"2604.03419","last_updated":"2026-05-18T23:21:13Z","snapshot_observed_at":"2026-07-06T22:52:34.609783Z","submitted_at":"2026-04-03T19:32:39Z","title":"Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"cited_paper":"/paper/1111.6453","citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:f68d2075734c9477ac6d89762b061fad03413f02c1c125cbea5ca597ffea7f9b","observation_id":"c46a678e-0116-4d00-9fc9-842c38ed3ded","resolution":{"observed_at":"2026-05-21T10:04:06.450284Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1111.6453/citation-record","integrity":"/paper/1111.6453/integrity","json":"/paper/1111.6453/citation-record.json","paper":"/paper/1111.6453"},"outbound":[],"paper":{"arxiv_id":"1111.6453","last_updated":"2013-10-08T07:22:08Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T04:27:36.916845Z","submitted_at":"2011-11-28T14:45:01Z","title":"Learning with Submodular Functions: A Convex Optimization Perspective"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1111.6453."}