{"as_of":"2026-08-18T23:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f84428aafe85cf99be3764b4658bb297cfa5f230ac6c8562281c7255472881c7","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:18:07.950730Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2505.13670/citation-record","integrity":"/paper/2505.13670/integrity","json":"/paper/2505.13670/citation-record.json","paper":"/paper/2505.13670"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.183562Z","title":"Submodularity of optimal sensor placement for traffic networks,","venue":null,"work_id":"fa9a9aaa-44b9-4466-ba3e-c0b4c6def693","year":2023},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.881447Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:37bf36da7dd1f6f357e3ed0b0f26114558bcdb59acb003d6d6fd5417ea36c735","observation_id":"832cf789-02a0-4e94-9a1e-12e49e98b4ac","resolution":{"observed_at":"2026-08-15T20:18:08.188023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.169979Z","title":"A sub-modular receding horizon solution for mobile multi-agent persistent monitoring,","venue":null,"work_id":"2e5ab936-ce47-4788-81ca-c8e0cd2d7b4e","year":2021},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.887081Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:4e36d191acf0b9a30c112deebbc2e6187a4dfe57572ceb7cd1762b5964179282","observation_id":"e4b3eb3f-9942-4852-aab2-31ef7d12ed48","resolution":{"observed_at":"2026-08-15T20:18:08.174574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.155877Z","title":"Online submodular resource allocation with applications to rebalancing shared mobility systems,","venue":null,"work_id":"9d0e6ac6-5301-4f7c-a86e-b18008db4ab2","year":2021},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.891637Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:5683e1f500885598bddbcdd5f81fac6567b1f3da43428c0d116ff37475ebe1df","observation_id":"6ecefbce-b4b8-4384-8f30-4a1df7fb01a6","resolution":{"observed_at":"2026-08-15T20:18:08.160696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.142086Z","title":"Liu,A Review for Submodular Optimization on Machine Scheduling Problems, p","venue":null,"work_id":"1fb50f8b-c55c-477b-8ba3-2550c5b7ca79","year":2020},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.897090Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:bf521dded20ea193a18d308adafa5c34d0575e38c369b800cf403a43b069d1b9","observation_id":"f33185e5-ace8-483a-89d8-d6d3530ee267","resolution":{"observed_at":"2026-08-15T20:18:08.146555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:07.901964Z","title":"An analysis of approximations for maximizing submodular set functions—i,","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.901964Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:46dbc68fe026a90873469f675908764570f25233fbe41be1de6c8bc13a2bd8ba","observation_id":"bf932c1d-f6d7-45c1-8108-0f2b60f2c7b0","resolution":{"observed_at":"2026-08-15T20:18:07.901964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:07.906807Z","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":null,"year":1984},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.906807Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:0d035b0b3aa204972a1d16aad41fa0caf443853a65c297f83b862259328f25cc","observation_id":"ddb324cf-ab20-4a43-a7a2-3f9959de82af","resolution":{"observed_at":"2026-08-15T20:18:07.906807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.110216Z","title":"Submodularity and curvature: The optimal algorithm (combinatorial optimization and discrete algorithms),","venue":null,"work_id":"eea02041-d28d-44f0-b156-8ab0432a5e2a","year":2010},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.912377Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:1d4cd8a61c025e7b1f02d4a5360a19b4e4b2ee997c9d822b97c33f65a5459e14","observation_id":"51677f66-d78e-40f6-a2d9-ee4f1f2458a2","resolution":{"observed_at":"2026-08-15T20:18:08.114870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.094631Z","title":"On bounds for greedy schemes in string optimization based on greedy curvatures,","venue":null,"work_id":"cbb8342a-8e34-4471-9ddf-ca5678f2c023","year":2024},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.916910Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:8b1d87b0d5f9b0817ac2f2128e55f7cc87d15ccd6c5be02fffb22ff9efa30e50","observation_id":"9a7f80a9-8c89-4cc9-8519-1ba358740889","resolution":{"observed_at":"2026-08-15T20:18:08.099898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.080155Z","title":"Sampling from probabilistic submodular models,","venue":null,"work_id":"13bd661e-4d25-418f-81e0-bd97e44efe9e","year":2015},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.921580Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:dad9ed205559a0575b77e961101a8f69587f7106da308fba745e6ad6ce5fe90a","observation_id":"bde77cd8-dd9f-4027-adc9-3cc35727ab83","resolution":{"observed_at":"2026-08-15T20:18:08.085192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.065773Z","title":"Gradient methods for submodular maximization,","venue":null,"work_id":"cca54fc1-3eef-477a-8a26-c5cad75eceb9","year":2017},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.925806Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:dd390875e75eeb2ed93312f224680d879f9bca0701a8669855df11ace78c5baf","observation_id":"fe5a1b00-6b6f-49c3-9b41-70d7fbfcfb3f","resolution":{"observed_at":"2026-08-15T20:18:08.070573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.050761Z","title":"Distributed submodular maximization with limited information,","venue":null,"work_id":"0eefb1aa-c802-4fc7-844b-9ee3985a08e7","year":2017},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.930249Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:059484563e3229c8c37cb36220620f970e26f0c06dde54b84b6957f6033bdbd5","observation_id":"47687f12-6ce2-40d0-8b8b-d3c928263219","resolution":{"observed_at":"2026-08-15T20:18:08.055399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.036295Z","title":"Optimality gap of decentralized submodular maximization under probabilistic communication,","venue":null,"work_id":"b47829d9-01d8-4c58-886f-569ca347f570","year":2024},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.934213Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:b0bcc2df379b799e959d1619ce33a85cd1d9b015d676e565a87e868d44a0841b","observation_id":"b9d692db-3a4e-4b8f-ad82-3f260bb956dd","resolution":{"observed_at":"2026-08-15T20:18:08.041276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.01071","snapshot_observed_at":"2026-08-15T20:18:07.938238Z","title":"Submodular maximization subject to uniform and par-tition matroids: From theory to practical applications and distributed solutions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.938238Z"},"links":{"cited_paper":"/paper/2501.01071","citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:1c443bbea4cf1e560fc18c90da2926f66053b61e742e1921d0c926d1ada3269c","observation_id":"9098492e-0fc2-4632-bc5f-f9b7699ca7fb","resolution":{"observed_at":"2026-08-15T20:18:07.938238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.022497Z","title":"An exemplar-based approach to individualized parcellation reveals the need for sex specific functional networks,","venue":null,"work_id":"0e435b1f-2059-47c1-be2a-e71e048c99f5","year":2018},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.942712Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:5dc3b90755cf8c7fb30c129441e9cdd30db969359a6a5f804686c28c5396eeb8","observation_id":"294c5861-b5e1-43f2-b328-704258b05ec7","resolution":{"observed_at":"2026-08-15T20:18:08.027091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:08.008520Z","title":"Submodular Point Processes with Applications to Machine learning,","venue":null,"work_id":"f9a2df1f-6018-4800-88ad-96c2b6e5f49a","year":2015},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.946785Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:3e542894f243432e71db3d5947179b3558bb1f97912d409949a8c5656b8b36e1","observation_id":"5fb210ee-7891-4bee-8a42-e004d2f63e07","resolution":{"observed_at":"2026-08-15T20:18:08.013004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:18:07.993083Z","title":"Domars16k: A diverse dataset for weakly supervised geomorphologic analysis on mars,","venue":null,"work_id":"c511576c-eb45-40e5-8017-9b20d84d8988","year":2020},"citing_paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:18:07.950730Z"},"links":{"citing_paper":"/paper/2505.13670"},"observation_digest":"sha256:849ad84c2986599255ca588c5284f15c1a85999c130820f027724f53af9c349d","observation_id":"8adf0a15-e87d-49f5-aa0a-9001eb317a4d","resolution":{"observed_at":"2026-08-15T20:18:07.999071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2505.13670","last_updated":"2025-05-19T19:17:25Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-18T00:08:08.755707Z","submitted_at":"2025-05-19T19:17:25Z","title":"ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":16},"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 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2505.13670."}