{"as_of":"2026-08-17T22:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:875041fc5c7a6b706d66ee6226c85f8d9df737e312747cdb3dbe844e2738ee78","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T10:01:25.189942Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2604.03419/citation-record","integrity":"/paper/2604.03419/integrity","json":"/paper/2604.03419/citation-record.json","paper":"/paper/2604.03419"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Submodular function maximization","venue":null,"work_id":"18fa986a-6c86-48d0-a8fb-804af1d9975c","year":2014},"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":1,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:211217282260de43c7ae6466efccb0b3dd8427785095a8230789023806183557","observation_id":"315c101c-aaf9-4190-bc74-ca0f5613dc5b","resolution":{"observed_at":"2026-05-21T10:04:06.986234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An analysis of ap- proximations for maximizing submodular set functions—i","venue":null,"work_id":"556645f4-176c-498b-a15c-5b9dbc03cf83","year":1978},"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":2,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:332d6e5d0e35e9210ff24136b883345dc6034d08920945efebf9f735eeb09166","observation_id":"8c1585fb-1330-45a2-9de5-de51c7c9c7ca","resolution":{"observed_at":"2026-05-21T10:04:06.988160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maximizing a monotone submodular function subject to a matroid constraint","venue":null,"work_id":"30723556-fae3-4e4e-9ecb-bf9ee1aae159","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":3,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:e90826c75241bbdfcf367a2a4f83ed4c9d5544e477d48ce32600e0b4a8a0a560","observation_id":"3fd3f0c2-1dbf-43d7-a7ee-36e81a9eba96","resolution":{"observed_at":"2026-05-21T10:04:06.982398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Federated learning using variance reduced stochastic gradient for probabilistically activated agents","venue":null,"work_id":"7051c265-3606-4e2d-b69c-e1033e18e1d9","year":2023},"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":5,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:3c631c3c1d4fbb8a4245abb6e8668a5c63401bdc8e989220f009d330de97e997","observation_id":"d02598ae-90f9-4426-9dc8-10041bb6c140","resolution":{"observed_at":"2026-05-21T10:04:07.006412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2410.02260","last_updated":"2026-04-03T21:49:39Z","snapshot_observed_at":"2026-08-02T07:01:47.990437Z","submitted_at":"2024-10-03T07:06:49Z","title":"FedScalar: Federated Learning with Scalar Communication for Bandwidth-Constrained Networks","version":3},"cited_work":{"arxiv_id":"2410.02260","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.02260","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"FedScalar: Federated Learning with Scalar Communication for Bandwidth-Constrained Networks","venue":"cs.LG","work_id":"39dec3fd-9687-4725-8f56-7e5084d9a67e","year":2024},"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":6,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"cited_paper":"/paper/2410.02260","citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:dc3593df66a48a3976d963f6801b5f1085b3fb60b5bf1edc1bbecac61d423030","observation_id":"644658a2-721b-4b32-8923-1f8986627a65","resolution":{"observed_at":"2026-05-21T10:04:06.447536Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies","venue":null,"work_id":"4d754526-f587-4f80-bdcc-8449a014cf20","year":2008},"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":7,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:8a16c72dcaf22433d3ba7141ae6c57cd986a552add7f1f23fc99ee960b2d592c","observation_id":"cdf5a71a-34d8-4a9f-b522-b8905d7a9140","resolution":{"observed_at":"2026-05-21T10:04:06.980102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A class of submodular functions for document summarization","venue":null,"work_id":"91e769ad-76a9-4c67-9ab1-2a1ad4b0c7d2","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":8,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:ec765c43078f44d062061c655ec5c9e434c91c9531a2ba9dee441b353fdfa2dd","observation_id":"5f901730-2f28-4ea2-b055-2ec8c481e3fe","resolution":{"observed_at":"2026-05-21T10:04:06.984281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maximizing the spread of influence through a social network","venue":null,"work_id":"1e23a322-c663-4d64-94a2-543c6016b263","year":2003},"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":9,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:3e03f45452d08c7b6e73a93b527db4807849906aadf63145987a4a0bbbfb1cd2","observation_id":"4c5436ad-5b12-4449-8089-3673f1ef0b26","resolution":{"observed_at":"2026-05-21T10:04:06.990328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptive submodularity: Theory and applica- tions in active learning and stochastic optimization","venue":null,"work_id":"b49aae69-f1d7-430c-86b2-4277cbf01c53","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":10,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:defc8b3ec448bc57f6cb2345b29ce36e2cad572bd11c82e95c7d459711eb734f","observation_id":"2fb153f7-d2b9-4585-94bc-f7179c0f913c","resolution":{"observed_at":"2026-05-21T10:04:06.992540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An analysis of approx- imations for maximizing submodular set functions—ii","venue":null,"work_id":"6795abf3-1d80-40a7-9b75-53f521c2ef8a","year":2009},"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":11,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:c01c572b6bebdf2d593999ba70efc9de7e95c4faccc97f20d30c92b6319e4724","observation_id":"ec355eed-2ebf-4b27-9195-6a6858b4103d","resolution":{"observed_at":"2026-05-21T10:04:06.996765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Decentralized submodular maximization: Bridging discrete and continuous settings","venue":null,"work_id":"331671fa-64bd-468e-9b39-ffc1ef5b82ec","year":2018},"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":12,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:e0268667ea5faee95705a1210005439a530b0f26a524564a488be8bd83c00b25","observation_id":"355acbbf-f41c-41a3-a814-e17b48814cb9","resolution":{"observed_at":"2026-05-21T10:04:06.978192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed strategy selection: A submodu- lar set function maximization approach","venue":null,"work_id":"b5922fea-fea2-48fc-b7c2-c0e514be1d46","year":2023},"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":13,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:42b4d79a4f5dbf575184866de2908c50bb2ea5740d704c1673c62fe6e37f5062","observation_id":"433a23ab-ec37-45e4-805c-264fc6598604","resolution":{"observed_at":"2026-05-21T10:04:06.994453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A convergent iterative hard thresholding for nonnegative sparsity optimization","venue":null,"work_id":"7219b0c8-bc61-4ce4-95e3-975532c174b4","year":2017},"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":14,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:50128557538be1ce6b85b6a1e8c0bb1cd3442f29f22a84bbd13bea1488740584","observation_id":"43620349-e38c-4382-a4ad-17a0e99f054f","resolution":{"observed_at":"2026-05-21T10:04:06.998747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient hard thresholding pursuit for sparsity-constrained optimization","venue":null,"work_id":"2e1175c2-60d5-4dbe-9801-341f0659d660","year":2014},"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":15,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:cf49c140bfa2b37f5f74b6f394c82efc80e6b3191546f7f4673c566bdd8a6a12","observation_id":"7c7f6001-a03d-4b8a-9125-61e71383712f","resolution":{"observed_at":"2026-05-21T10:04:06.967759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hard thresholding pursuit: an algorithm for compressive sensing","venue":null,"work_id":"33e55cfc-aab3-4224-9bba-5d6d2959a214","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":16,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:e09626e5b45141db41bee03c4d8b7e1f3d004bb8d6a9fbd94fb47412b2741e7a","observation_id":"4b23ca51-0e5f-4619-a032-b16a226281db","resolution":{"observed_at":"2026-05-21T10:04:06.972055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Between hard and soft thresholding: optimal iterative thresholding algorithms","venue":null,"work_id":"97295a4f-e831-4669-b786-7425bd92c440","year":2020},"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":17,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:6fd6b9718bf0ff88fd0c2106bb56f47aa2380810ba89be77013dde943f9f27b2","observation_id":"281f780d-b89d-4814-9c51-4dbf773cdeba","resolution":{"observed_at":"2026-05-21T10:04:06.974319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Accelerated greedy algorithms for maximizing submodular set functions","venue":null,"work_id":"ea6d1aab-84d3-48e0-844e-322c5d31861f","year":1978},"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":18,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:7f683c25558645e2f36701923c0912e99217f765caef1072f3745c9f3e47d77d","observation_id":"f6d90300-60f6-44f4-965c-8d6e124ba2db","resolution":{"observed_at":"2026-05-21T10:04:06.969941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lazier than lazy greedy","venue":null,"work_id":"e24a8a3c-b7d8-4b6b-89c0-c8f5439be640","year":2015},"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":19,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:e1d30f682abc45fae3ceef4fd7af25750d79480ad576d6b372784340eae7b398","observation_id":"2ee7522b-e204-446c-b255-062da0c411c1","resolution":{"observed_at":"2026-05-21T10:04:06.976160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed submodular maximization: Identifying representative elements in massive data","venue":null,"work_id":"96e1fd82-0bd2-4909-84b0-033070278809","year":2013},"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":20,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:b4eed3ec1b33e565a5be05297f65105eb57f4b377767567c12a4401775dc299e","observation_id":"ddbb6611-b00b-4e2c-b80d-a6ecd19b2d78","resolution":{"observed_at":"2026-05-21T10:04:06.965048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast greedy algorithms in mapreduce and streaming","venue":null,"work_id":"0824b1c9-ffa5-4242-a896-f70e27674c51","year":2015},"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":21,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:832752a1f6321cdb0c3c718bef0f5c631d822198578d22fb3c307ba0c6026eaf","observation_id":"f6c39a98-56fc-4857-86ca-efa5e297464c","resolution":{"observed_at":"2026-05-21T10:04:07.000621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Communication-efficient learning of deep networks from decentralized data","venue":null,"work_id":"2e10b5a1-5eb2-4d88-8fbb-25e880189620","year":2017},"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":22,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:3c78e7bb9956e39aaecebbcce0db19e95960b69b2ffe1ad27e46614b762fec5f","observation_id":"7077be79-2861-4b4c-89b9-e6333ad97d1b","resolution":{"observed_at":"2026-05-21T10:04:07.004502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem","venue":null,"work_id":"8a31d44c-0265-45ae-aa4d-d9821b73db30","year":1984},"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":23,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:d329950b53013f8c325f744d582a056537ea7dc0cc37368f76050b8d49bcd252","observation_id":"6a3a2ff4-5c0e-4f22-bb99-e43455f4e618","resolution":{"observed_at":"2026-05-21T10:04:07.002588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Submodularity and curvature: the optimal algorithm","venue":null,"work_id":"fe66da1f-e1af-4026-9f9a-7c0a4f9917bc","year":1978},"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":24,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:d600d08916728e6167a158b3510f2a916761bd04ed84215cfc20de50751ca687","observation_id":"1a30176f-d192-4c9a-9d1e-c6efcb29e462","resolution":{"observed_at":"2026-05-21T10:04:07.009777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"67bf90df-205c-4ac2-9552-0c34778e58ee","year":2002},"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":25,"source":"pdf_text","source_observed_at":"2026-05-21T10:01:25.189942Z"},"links":{"citing_paper":"/paper/2604.03419"},"observation_digest":"sha256:f3e9d284e596f1dd33dc346a05e10455ffa1198d8241e10a54aaee3bb9d5130c","observation_id":"71bf68d5-3559-4699-abe6-b15154c251d5","resolution":{"observed_at":"2026-05-21T10:04:07.008075Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"2604.03419","last_updated":"2026-05-18T23:21:13Z","latest_version":2,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":2,"verified_fuzzy":22},"total_outbound_references":25},"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 17 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2604.03419."}