{"as_of":"2026-08-07T10:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f14687adee3888fdf3f32480f35ee9f552e6bd32c02b4c73848ae733c680175c","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:48:04.146947Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-08-04T06:08:32.769518Z","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:36:04.740530Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.10248","snapshot_observed_at":"2026-08-04T06:08:32.769518Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16240","last_updated":"2026-08-01T19:38:32Z","snapshot_observed_at":"2026-08-06T23:24:21.427949Z","submitted_at":"2026-02-18T07:33:51Z","title":"Submodular Maximization under Supermodular Constraint: Greedy Guarantees","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T06:08:32.769518Z"},"links":{"cited_paper":"/paper/2507.10248","citing_paper":"/paper/2602.16240"},"observation_digest":"sha256:040d8b42293fe447c4cfbabae73ced066a529937b674bd07fdf7b21f7f071d85","observation_id":"447108c1-be5a-48df-bd47-a0d1e0a09ee9","resolution":{"observed_at":"2026-08-04T06:08:32.769518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"cited_work":{"arxiv_id":"2507.10248","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.10248","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Feldman, A","venue":null,"work_id":"6723fe6c-90ae-4510-95aa-c4355c05cd8e","year":2025},"citing_paper":{"arxiv_id":"2605.04428","last_updated":"2026-05-06T02:43:13Z","snapshot_observed_at":"2026-07-06T23:17:13.770090Z","submitted_at":"2026-05-06T02:43:13Z","title":"Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:30.268643Z"},"links":{"cited_paper":"/paper/2507.10248","citing_paper":"/paper/2605.04428"},"observation_digest":"sha256:ec09d0d126e068ae5aed3d22d8c58ba57ac140a356ba3e9fe91103af41288bb0","observation_id":"ca265716-5ed4-40a7-badd-077d37c14cfd","resolution":{"observed_at":"2026-05-11T17:36:04.742648Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.10248/citation-record","integrity":"/paper/2507.10248/integrity","json":"/paper/2507.10248/citation-record.json","paper":"/paper/2507.10248"},"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-06T17:48:06.016960Z","title":"Buhmann, and Andreas Krause","venue":null,"work_id":"6f3bba96-3dac-497e-b696-0b5621a588fd","year":2017},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.011115Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:010ff9cf2013c8d0d44a55deb993c3c92de9fcd5ecf6dc815f2bac79a5ea3595","observation_id":"ac1cc644-2666-4c7f-aa71-1d534aa35eb0","resolution":{"observed_at":"2026-08-06T17:48:06.020008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.03412","last_updated":"2022-04-07T12:52:30Z","snapshot_observed_at":"2026-07-06T12:57:51.108636Z","submitted_at":"2022-04-07T12:52:30Z","title":"Maximizing Sums of Non-monotone Submodular and Linear Functions: Understanding the Unconstrained Case","version":1},"cited_work":{"arxiv_id":"2204.03412","doi":"10.48550/arxiv.2204.03412","metadata_source":"pith","pith_arxiv_id":"2204.03412","snapshot_observed_at":"2026-08-06T18:16:30.548575Z","title":"Maximizing Sums of Non-monotone Submodular and Linear Functions: Understanding the Unconstrained Case","venue":"cs.DS","work_id":"c21e347a-645f-4fce-a8db-85eb874fdf70","year":2022},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.014695Z"},"links":{"cited_paper":"/paper/2204.03412","citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:85d11fe92504906941aeb51a6a26cefbbaed24d44cf970622680d84c0f981cea","observation_id":"9472245b-4bc3-4dfe-a222-247c8d9ae0ef","resolution":{"observed_at":"2026-08-06T17:48:04.312814Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:06.009912Z","title":null,"venue":null,"work_id":"b0fc8946-895c-4637-b526-a4c160fabbdd","year":1969},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.018145Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:464fdb37c6592cb2482882fef300b5c525f66dc20311128d9eb0bcf8380639db","observation_id":"04bc34ac-469a-4b17-a131-f36ef101e1f0","resolution":{"observed_at":"2026-08-06T17:48:06.012167Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3184990","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:48:04.299228Z","title":"Deterministic algorithms for submodular maximization problems","venue":null,"work_id":"8f795c7c-d780-44a9-a7aa-d0696d43a2af","year":2018},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.020767Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:e5666acc4ea1037d0ee8818010b72275bfdf46fe115f3cf0f713d57595baa5ba","observation_id":"22c3bde3-55d4-472d-bd3f-3f28f171e28a","resolution":{"observed_at":"2026-08-06T17:48:04.301942Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2018.0955","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:48:05.818010Z","title":"Constrained submodular maximization via a nonsym- metric technique","venue":null,"work_id":"e685ec3c-e5a5-46b5-84b7-7dcb0b428254","year":2019},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.023334Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:4ba1d8c7c54558e0c7ea688e0bb033b5a5fd4016dea2050875ee1afac2bf055f","observation_id":"3191e194-c1bf-4b6b-ba91-527b7b184316","resolution":{"observed_at":"2026-08-06T17:48:05.822070Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:04.025910Z","title":"Constrained submodular maximization via new bounds for DR-submodular functions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.025910Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:9c95dffb313b22833924a1e55fd9afb1f955f096e783e84f6cf68248df212947","observation_id":"0bcc8c2c-cd9f-4064-9668-d30018fc0b32","resolution":{"observed_at":"2026-08-06T17:48:04.025910Z","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-06T17:48:04.028957Z","title":"Submodular maximization with cardinality constraints","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.028957Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:d1b6d2887920d32409fd1425f2a659d5f0ea9ac8edbb6d800e233c3e815a4d9b","observation_id":"a4ebc720-3181-49a7-ba43-6ea5e9188ceb","resolution":{"observed_at":"2026-08-06T17:48:04.028957Z","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-06T17:48:04.031516Z","title":"A tight linear time (1/2)- approximation for unconstrained submodular maximization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.031516Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:b52f67ec1896d86e9678faec116436a782bd8dbf7fe2779f6977d117ddedfae6","observation_id":"f892a7ed-fc07-4db8-b1b1-92ca591788f3","resolution":{"observed_at":"2026-08-06T17:48:04.031516Z","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-06T17:48:06.002008Z","title":"Maximizing a monotone submodular function subject to a matroid constraint","venue":null,"work_id":"bfb399de-30d4-4d3b-a8da-d6ecce6a6159","year":null},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.034193Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:e4e04a5032012ad936463f79994e4a23610913be861edf9d717b3f53e2297e7c","observation_id":"a98b9fd7-bb2e-459e-ba02-832ed68b1930","resolution":{"observed_at":"2026-08-06T17:48:06.004846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:04.039216Z","title":"Submodular function maximization via the multilinear relaxation and contention resolution schemes","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.039216Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:d233081b6b4d46415ffd207806ad9cab26ea384ff3925a8358b1eb6fc36dddc0","observation_id":"bd0bb03d-ec57-4a8c-950a-0d14c9d6f172","resolution":{"observed_at":"2026-08-06T17:48:04.039216Z","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-06T17:48:05.995044Z","title":"The tail of the hypergeometric distribution","venue":null,"work_id":"9e376950-a93b-4e0c-8dc5-7545f64e4b5a","year":1979},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.041628Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:4d4e2234ac01fb35c43ef82d46d18f382006bed456c0a9c20041c8484ed8e644","observation_id":"9a6bab71-ad64-40c2-bbdd-63f6940ad960","resolution":{"observed_at":"2026-08-06T17:48:05.997381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.987537Z","title":"Scalable bicriteria algorithms for non-monotone submodular cover","venue":null,"work_id":"baf5dec2-5dd3-4d54-bd8a-093c9d99a17f","year":2023},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.043959Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:5ba76af1356bfd9f50982b270afe1075c79e36edce08212a44a6aec250c030bf","observation_id":"612f7727-fd1b-4cb4-9498-befd5c6af9c9","resolution":{"observed_at":"2026-08-06T17:48:05.990143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.980152Z","title":null,"venue":null,"work_id":"ac79bccf-bc36-4b82-a8dc-437c4416ee71","year":2019},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.046621Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:1d755f8e2cfbc0b8bb1443962e514678eb3f204a4e8b683290c3fdca035e6f0c","observation_id":"8494977c-3d93-4cfb-98f0-0f1ab9c5276f","resolution":{"observed_at":"2026-08-06T17:48:05.982469Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.972768Z","title":"Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection","venue":null,"work_id":"4a90d8ac-2037-4b96-9cd4-01824fc11eb6","year":null},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.049140Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:050275d4f0f183dcef713a3882e8fe3747ae73fff787a8c3fe1cfc23810444e8","observation_id":"b765026e-9fa0-46f2-aaf6-c4339690021b","resolution":{"observed_at":"2026-08-06T17:48:05.975594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973105.87","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:48:04.270945Z","title":"Communication complexity of combinatorial auctions with submodular valuations","venue":null,"work_id":"9fd801f2-d491-41f7-a816-05f6bdc77c3f","year":2013},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.054331Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:f261289d225b84f7f3f28e7e187d8162e11cb22755bd832151321fb55f5b7037","observation_id":"6e294fac-7744-4452-a2f3-8fc51d3c9d62","resolution":{"observed_at":"2026-08-06T17:48:04.273711Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.965740Z","title":null,"venue":null,"work_id":"ce5cb6bb-9bc2-4d47-9667-a6eb2eca4518","year":2011},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.052051Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:4403f7c83682950b8a8f8e635616f3be9be7612bebaebff44c63ae5741dfbb35","observation_id":"21560312-a3c0-4375-8a22-47065ff258b5","resolution":{"observed_at":"2026-08-06T17:48:05.968096Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.950915Z","title":"Elenberg, Alexandros G","venue":null,"work_id":"61bcadbb-a4e2-429d-aa8c-313a90256a5c","year":2017},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.061682Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:6438928de0b9e032c84198f79d26a2ecd3ba5d25aaa43309fd6472f22cd353c5","observation_id":"36f631b6-1d73-483c-aa6d-f5790cc74dc9","resolution":{"observed_at":"2026-08-06T17:48:05.953589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.958323Z","title":null,"venue":null,"work_id":"351927e8-c953-4804-b5fa-26351cb92e17","year":null},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.056711Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:7636123c631cd44ffb118c14981228e1112faf69ba72397e1dc77a82469d9338","observation_id":"ce5c02b9-03f7-4d59-a5e3-0b570eac45c4","resolution":{"observed_at":"2026-08-06T17:48:05.961193Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:04.066441Z","title":"The submodular welfare problem with demand queries","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.066441Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:0f85382af3d385596228c4035a46f251c0caa54a9ac81d53d3892653ba735ec3","observation_id":"dd3ef7a5-4061-4bf0-ae5c-f16bc3b4f431","resolution":{"observed_at":"2026-08-06T17:48:04.066441Z","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-06T17:48:04.068739Z","title":"Mirrokni, and Jan Vondr´ ak","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.068739Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:1bf5a84610ce621691c1b256c6062a079ac279308a13ee60cb7912f9357e5ef4","observation_id":"1d52514f-6489-4904-a278-84547e1a26df","resolution":{"observed_at":"2026-08-06T17:48:04.068739Z","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-06T17:48:04.064057Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.064057Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:8cf574625be286016743fa1cc3e3d066622204ff6b7cce48dbcd2403b1791a96","observation_id":"ff3b991b-6833-44c4-a3de-976470d63b01","resolution":{"observed_at":"2026-08-06T17:48:04.064057Z","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-06T17:48:04.076046Z","title":"Maximizing symmetric submodular functions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.076046Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:ff1a2e8dcfdcc9dd29e34ed03b5cf04b042d766e304b1d0bbb8b91664210bc3c","observation_id":"b053c718-1f22-4c06-80a7-ba5434e64aa4","resolution":{"observed_at":"2026-08-06T17:48:04.076046Z","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":"10.1007/s00453-020-00757-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:48:04.237324Z","title":"Guess free maximization of submodular and linear sums","venue":null,"work_id":"f7ccc830-7f21-4c15-898a-634494061037","year":2021},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.078549Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:ded778e5c225834caad587fd7250353446016352c7552ac23f907bce03dd6785","observation_id":"36c675d5-d6fe-4354-b6c0-20a1495e0511","resolution":{"observed_at":"2026-08-06T17:48:04.240021Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-08-06T18:20:21.602086+00:00","source":"paper_reference_links","state":"open"},"event_date":"2022-08-31","event_type":"correction","notice_doi":"10.1007/s00453-022-01028-5","provenance":{"observed_at":"2026-07-11T03:09:06.75095+00:00","source":"crossref","source_record_id":"10.1007/s00453-022-01028-5->10.1007/s00453-020-00757-9:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.943438Z","title":"Combinatorial auctions via posted prices","venue":null,"work_id":"e75aaa33-3bd5-4321-881d-f3be2522716e","year":null},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.071124Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:5551a9f52a7b979fd28282ec62c11423d1e64fd7ab3e731a0256667cf3ac7a80","observation_id":"650f05f5-d4a0-4366-b855-c818f411e355","resolution":{"observed_at":"2026-08-06T17:48:05.946306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:04.083248Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.083248Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:1e065c1542d08ed3fab5876603510d29ba5a6df5613297e9d361a92e14f0124b","observation_id":"eca05bed-865a-4a7e-abe6-a4944d472e32","resolution":{"observed_at":"2026-08-06T17:48:04.083248Z","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-06T17:48:05.936143Z","title":"Submodular maximization by simulated annealing","venue":null,"work_id":"0a56e7fe-c74e-414e-bbba-9caedbbaf76d","year":null},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.085629Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:4dc0ce7a48e3c8c8399d69cd606f1d6d847dbfaff4ed5d8376e3d4345963a581","observation_id":"969ac74d-0a67-4573-ad6f-6caccc1dc57f","resolution":{"observed_at":"2026-08-06T17:48:05.938791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s13278-012-0062-z","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:48:04.214199Z","title":null,"venue":null,"work_id":"a0d2ac53-58d8-443c-8b2d-57817a79805a","year":2013},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.090763Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:327a5c465eda9694537639651ea19c391072a8f8775f90cae393fab2dd75070b","observation_id":"0aa76289-2088-4a76-9027-eef05d5f6fac","resolution":{"observed_at":"2026-08-06T17:48:04.216789Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:04.080944Z","title":"A unified continuous greedy algorithm for submodular maximization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.080944Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:d926b4b816a049b33bdda1e20b019975e6ab5bd6534a2acb4c683b7a50bd34c2","observation_id":"d4134628-c754-4785-abb3-5efc9e96f50b","resolution":{"observed_at":"2026-08-06T17:48:04.080944Z","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-06T17:48:04.095543Z","title":"Hochbaum","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.095543Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:e4c0a7e8739678c77c44942b2ba6136a50fd900f0a9138f70f9051becef4d31a","observation_id":"2d4d72f2-d766-4b6f-821a-9a54c7b2513a","resolution":{"observed_at":"2026-08-06T17:48:04.095543Z","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-06T17:48:05.920508Z","title":"Probability inequalities for sums of bounded random variables","venue":null,"work_id":"4879b873-3ae2-4139-bd17-a6f0f19ffe80","year":1963},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.098134Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:928be8950a19eba888af3c7b56545230452a4e5f76b47b5cdd03f967ed81bf05","observation_id":"78669659-476c-4936-804e-a76b76cdcf6e","resolution":{"observed_at":"2026-08-06T17:48:05.923043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.911961Z","title":"Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints","venue":null,"work_id":"96e22b96-392b-42c3-a434-7489edf5af65","year":2013},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.100458Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:4f2967d51f8718cf9fa1ca0a2c681e3806ba7b0fc7890787fabf3f2468d7bddc","observation_id":"6cdf3991-24e4-4556-8f09-2df2735052e9","resolution":{"observed_at":"2026-08-06T17:48:05.915236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:04.102691Z","title":"Uncon- strained submodular maximization with modular costs: Tight approximation and application to profit maximization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.102691Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:5f1be92dd51bb7ae742819030dbb4b4e783061222dfdc3869e67af8b6d72daa9","observation_id":"cefe3769-c161-4706-b077-923454bb0aa3","resolution":{"observed_at":"2026-08-06T17:48:04.102691Z","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-06T17:48:05.927742Z","title":"Submodular Maxi- mization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications","venue":null,"work_id":"ef7cde63-da68-4569-9e96-a6e504b6135d","year":2019},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.093188Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:1aec7d13305145ea963004547f91370796292262908990edc5b79338a6cbb503","observation_id":"ccb3ba7e-a7fe-471d-9f3e-853396554472","resolution":{"observed_at":"2026-08-06T17:48:05.930447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.894986Z","title":"Submodular dictionary selection for sparse representation","venue":null,"work_id":"fae0de1b-041c-491f-a5d5-b4f34b30f4cf","year":2010},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.107683Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:e2a7720b959465fcac3e556580c83bba69d8ee482a4c1da352b304271f3e3b61","observation_id":"140af89b-8e2c-461e-b1fe-e369147c8a41","resolution":{"observed_at":"2026-08-06T17:48:05.898220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.885373Z","title":"Approximations for monotone and nonmono- tone submodular maximization with knapsack constraints","venue":null,"work_id":"84d793ff-e4a9-4814-9143-c0d5f2324817","year":null},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.109949Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:f7d7eec56c0de94e0e73dd2be33ba0ec5b48d461faf8400461995b26dd21790c","observation_id":"df2edebd-6f05-4c62-b34e-3f841bde4746","resolution":{"observed_at":"2026-08-06T17:48:05.888899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.876605Z","title":null,"venue":null,"work_id":"2d03079c-0e23-4e77-894a-2ed8c9b2d593","year":2011},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.114465Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:64ab016dc0cb7ab220ff8604181988ddc4a1e46f6bad6d779570c85ea170aa0d","observation_id":"067ea2c5-78f7-4d5e-8dfc-3006af0fae23","resolution":{"observed_at":"2026-08-06T17:48:05.879421Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:04.116971Z","title":"Regularized nonmonotone submodular max- imization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.116971Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:6ff97a68da9074dfb13d21be4401ef6c6b80db9ee61d5c8a7e0f6012a085a1b1","observation_id":"373409cd-0f46-48c5-9ab9-1ef189378920","resolution":{"observed_at":"2026-08-06T17:48:04.116971Z","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-06T17:48:05.904073Z","title":"Regularized Submodular Maximization at Scale","venue":null,"work_id":"c78d3a74-1089-4cad-9cef-338de1d65e78","year":2021},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.105081Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:1c8e2be516ddcd782f78f61a8417fffb3bcfc928f97018a482a80b97695f460b","observation_id":"11fb334a-be9b-4aa7-b5d3-f0d061f6f447","resolution":{"observed_at":"2026-08-06T17:48:05.907011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.868295Z","title":"Nemhauser, Laurence A","venue":null,"work_id":"7542b0bc-0b9c-4de2-98a0-743385e01c03","year":1978},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.121853Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:b9acd4ce9488edfe767b232219b7370164dfa2cb247969a855734d6fa45969eb","observation_id":"32ce0b36-7cc0-4c3d-847a-c8a263243f9c","resolution":{"observed_at":"2026-08-06T17:48:05.870784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.860383Z","title":"Beyond 1/2-approximation for submodular maximization on massive data streams","venue":null,"work_id":"cff8e641-f0fc-44ba-b9bd-374e41da3824","year":2018},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.124166Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:c2f1117316588bbdab0ff66af2465dd849c5e4bca3498ebe7015a9782d4cfba4","observation_id":"e7cdd2c7-5ece-4466-8d47-9d9b716d2c4b","resolution":{"observed_at":"2026-08-06T17:48:05.863082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.isaac.2022.41","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:48:04.196326Z","title":"On maximizing sums of non-monotone submodular and linear functions","venue":null,"work_id":"079ee293-56d3-468e-ad40-66019909023e","year":2022},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.126577Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:4adcd2cc39239d93b94623107868dd2cae47a6861da11c66645aaf318826449e","observation_id":"f85135e6-98c3-49e1-9395-7d22dedb080f","resolution":{"observed_at":"2026-08-06T17:48:04.199440Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.852912Z","title":"Schrijver","venue":null,"work_id":"bd714813-2028-4ceb-9621-c2390612608c","year":2003},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.128925Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:649a1b4e46c1eb01b760ead2eefe6731c9a07278dd1ec3b9bb697520f5af48fc","observation_id":"2d389561-6f6c-4529-a5c9-ba25f7da702b","resolution":{"observed_at":"2026-08-06T17:48:05.855400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.845261Z","title":"Combinatorial Optimization: Polyhedra and Efficiency","venue":null,"work_id":"2c0a4868-c7e5-4c36-869a-2a90dcc2b268","year":2003},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.131150Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:8ecf49f03dd77164f36c22c8a278df22d76e1805eebdced4d8d02d96ba24b376","observation_id":"5bf1ff8d-64f6-4968-9f10-953202c1e0a7","resolution":{"observed_at":"2026-08-06T17:48:05.847897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:04.119292Z","title":"Submodularity of influence in social networks: From local to global","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.119292Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:262d9a0fe11e21aef26d547af87b387b94770edcc1f3191361117d9c4a7ff49b","observation_id":"89a3e1b0-4ad2-4cab-ab84-ed96d8b91f04","resolution":{"observed_at":"2026-08-06T17:48:04.119292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1311.5939","last_updated":"2013-11-23T00:46:49Z","snapshot_observed_at":"2026-07-06T03:29:01.255297Z","submitted_at":"2013-11-23T00:46:49Z","title":"Hypergeometric tail inequalities: ending the insanity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.5939","snapshot_observed_at":"2026-08-06T17:48:04.136401Z","title":"Hypergeometric tail inequalities: ending the insanity","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.136401Z"},"links":{"cited_paper":"/paper/1311.5939","citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:44373e029c9f62fd543852da21d0508b8f962bfa8b34435b3b9507b17537fec6","observation_id":"4b19658e-499c-485e-b703-82af9f4a4936","resolution":{"observed_at":"2026-08-06T17:48:04.136401Z","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-06T17:48:04.139225Z","title":"Symmetry and approximability of submodular maximization problems","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.139225Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:16a7f1b4e65eaee4d5096d4c4030b995a887793ff149f329f4fcd3fed7db77dd","observation_id":"0c7c031d-cba8-4e2c-ade2-4bb7cb59fae7","resolution":{"observed_at":"2026-08-06T17:48:04.139225Z","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":"10.1007/s10589-009-9269-y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:48:04.182108Z","title":"Greedy approximations for min- imum submodular cover with submodular cost","venue":null,"work_id":"7e796d5c-0611-4379-98d2-a8b956406b5d","year":2010},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.141495Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:cc7246bfcf86dd75661a9228db617fa86df0125dfbfd0004c9c829548e0eed9f","observation_id":"4b6b675b-1b7f-438e-b795-b3fc980a4b38","resolution":{"observed_at":"2026-08-06T17:48:04.185297Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14278","last_updated":"2024-06-20T12:59:53Z","snapshot_observed_at":"2026-07-06T18:34:15.291938Z","submitted_at":"2024-06-20T12:59:53Z","title":"Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions","version":1},"cited_work":{"arxiv_id":"2406.14278","doi":"10.48550/arxiv.2406.14278","metadata_source":"pith","pith_arxiv_id":"2406.14278","snapshot_observed_at":"2026-08-06T18:16:30.548575Z","title":"Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions","venue":"cs.DS","work_id":"614f9182-1a95-4024-897f-49e875b833d4","year":2024},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.144233Z"},"links":{"cited_paper":"/paper/2406.14278","citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:0843bdb5e9e9caa6d3b68a991cf542853b8ff76eda9881384c46417ea029a88e","observation_id":"21bc0a6d-70a6-4a4c-ab64-9a1824f19812","resolution":{"observed_at":"2026-08-06T17:48:04.176599Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.829233Z","title":null,"venue":null,"work_id":"aa668508-49cb-4202-a4b6-67e1c3c39ff7","year":1982},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.146947Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:5c3668b6587028694d23e2145ca8485e985dc4a390a030e1c1de7ec41c428546","observation_id":"52a3f66b-4cfc-414f-b105-2cfaff7d349a","resolution":{"observed_at":"2026-08-06T17:48:05.831999Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:05.837297Z","title":"Combinatorial Optimization: Polyhedra and Efficiency","venue":null,"work_id":"1664af21-0dd8-43c8-920d-ab6f4d0bb392","year":2002},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.133915Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:e272226601705467db54d4d7919e5b1ea7d6ec5c3e11f29be454e7f53f36b736","observation_id":"cfd6b609-72b4-4716-89fb-4ed26d08e63a","resolution":{"observed_at":"2026-08-06T17:48:05.840046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T17:48:04.073571Z","title":"doi: 10.1137/1.9781611973730.10","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":135,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.073571Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:4b5ef9d23900819f69c28d5bc11fff72a60f01ea7e30fa032457d5593c34296d","observation_id":"2fcf3469-2a7a-497a-9d19-5629ba1fae76","resolution":{"observed_at":"2026-08-06T17:48:04.073571Z","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-06T17:48:04.088450Z","title":"doi: 10.1137/1.9781611973082.83","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":1116,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.088450Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:6d71e2395b3e512682f1e5d67492e73e71792d63216de80b406f2a23a19f9c05","observation_id":"3f08f0e2-7f5e-47f1-939d-005e20640eb9","resolution":{"observed_at":"2026-08-06T17:48:04.088450Z","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-06T17:48:04.036659Z","title":"URL https://doi.org/10.1137/080733991","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.036659Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:c6e1e4bb27dac5ac9cd5f7f613f458c5eacc4a84112fe1ca48589ee74d2f9e80","observation_id":"448cb191-55c3-4034-af66-d4d7491e5105","resolution":{"observed_at":"2026-08-06T17:48:04.036659Z","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":"2013.0592","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:48:04.458460Z","title":"URL https://doi.org/10.1287/moor.2013.0592","venue":null,"work_id":"c133430f-23f8-4aff-90b5-844eded49c1f","year":2013},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.112312Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:f024202f21d0287f08383ac5738b10dd7da72390bf6ed86f30a55bfd76fc3586","observation_id":"2ad14e2c-7c94-41d9-92c4-4e93a13b5e5b","resolution":{"observed_at":"2026-08-06T17:48:05.538829Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.1371","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:48:05.659698Z","title":"URL https://doi.org/10.1287/moor.2023.1371","venue":null,"work_id":"79b081de-784f-4be3-9099-0832cc05ab5c","year":2023},"citing_paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T17:48:04.059348Z"},"links":{"citing_paper":"/paper/2507.10248"},"observation_digest":"sha256:2815002876f6000f8d87cf1458a816317957190d4f20c5aa8cc4aca9a904bd25","observation_id":"93c02cba-f32d-4e54-8501-47833759722b","resolution":{"observed_at":"2026-08-06T17:48:05.663491Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.10248","last_updated":"2025-07-14T13:14:45Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T17:33:26.415821Z","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":11,"verified_fuzzy":19},"total_outbound_references":55},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 2 inbound Pith citation observations for arXiv:2507.10248."}