{"as_of":"2026-08-09T21:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:57104d89a7b235e202512b7a63ed06f955c90b063af2ce63f6d274df35282db0","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T15:23:45.836127Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2606.20202/citation-record","integrity":"/paper/2606.20202/integrity","json":"/paper/2606.20202/citation-record.json","paper":"/paper/2606.20202"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:23:45.836127Z","title":"Expander flows, geometric embeddings and graph partitioning.Journal of the ACM (JACM), 56(2):1–37, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:0f67adefce753979db0fbadb517c1b30f023dd4fabc81a1f9bd9c66fd52042ed","observation_id":"e3785afa-c43f-4de0-8139-689bd5f9d480","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Submodular max-sat","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:11e5d01b1ddcf888d662db1a257ad41221c44938d1d9bc4355cc470ef7042e48","observation_id":"46d6f1b8-3615-40d1-84ce-a99fb5aed94f","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Improved approximations for min sum vertex cover and generalized min sum set cover","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:db2c1db8d50ddbf7dc1e0bd4e019e736ba1ea404243295ae0fee9c9e68ce5319","observation_id":"ad43848d-9ca5-4e8c-8d92-35a86dbf7bb2","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1309.4029","last_updated":"2015-07-27T12:08:24Z","snapshot_observed_at":"2026-07-06T03:23:08.647067Z","submitted_at":"2013-09-16T16:38:20Z","title":"Concentration inequalities for sampling without replacement","version":2},"cited_work":{"arxiv_id":"1309.4029","doi":null,"metadata_source":"pith","pith_arxiv_id":"1309.4029","snapshot_observed_at":"2026-07-04T05:49:37.776631Z","title":"& Maillard, O.-A","venue":"math.ST","work_id":"d325e0e7-c244-4061-b188-15e5f8111698","year":2013},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"cited_paper":"/paper/1309.4029","citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:2c747b237264414aab6b32bc412f2bb22537ad12ce331cecc41bc82be7ad0bf8","observation_id":"89ae7aca-9cf8-480c-bf86-d16e29d83769","resolution":{"observed_at":"2026-07-04T05:49:37.778240Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-26T15:23:45.836127Z","title":"Improved approximation for min-sum vertex cover","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:023b33ca949a006e737b8593000c50e314e748d2e76861a3cd7f4ff877e7cfb7","observation_id":"e4a7ee20-fd4e-4ede-bc39-798dd60ef680","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Bhatt and Frank Thomson Leighton","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:bfa4d17c9b3ef7fa3527c8885c351f83d37b9a0e4c339461e33cafd73ef4f003","observation_id":"d98a1d87-b547-40dc-bce7-4c3c545bb6b3","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:30f1c3c206b297e92ff92b48282ef00b932fecb8bddf34ee0a276f081c2be29d","observation_id":"656ccbd4-bf53-4b96-9703-690b614e5d6b","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"The minsumcut problem","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:f27c550c560b642128190ad31a2b97f8a36ebbdfa883cc98a8ba4bed0b1b27d2","observation_id":"77bc1137-b1f1-46d8-967a-ae7e1695bb5a","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"From query complexity to computational complexity","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:3f4d0f6fec4610fe08a36bc739ab41438dae97cd649ff54413c8334bdf4974cc","observation_id":"42e3a96d-d6fa-436c-a9f4-fffbca2a46c3","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Local distribution and the symmetry gap: Approx- imability of multiway partitioning problems","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:9154d1697873b3612865fb4f2483617d236a81fbd99e8141de6297b68ad3bf1f","observation_id":"e2cf12f3-1168-4ca3-a487-4e0c41e7f724","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Divide-and-conquer approxi- mation algorithms via spreading metrics.Journal of the ACM (JACM), 47(4):585–616, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:b4abac71fde49feb4fd9ca8f28dca95baea463817184c0eb3cfc2edd0eb3c862","observation_id":"57e2e8fc-1939-435e-8fe9-eddaec081ed2","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Hardness and approximation of submodular minimum linear ordering problems.Mathematical Program- ming, 208(1):277–318, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:306e2436b32c07ff12cfbc1f873fe68dc753cbb71693b291d6bde4be2d79f887","observation_id":"e7ffa7b6-9085-452d-9fc9-a25b2c41f590","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:e911e93f2edce8ffdbf32b6e30108fe33b9cc4cd6678fdab79d8e8c2dbecc2f8","observation_id":"56a51a9e-eadc-44dd-9e02-6f6ffa057874","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"An improved approximation ratio for the minimum linear arrangement problem.Information Processing Letters, 101(1):26–29, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:f851dca3251b765f3cfe20822b442a60d0f90584636e7c5825733a54894039cf","observation_id":"d35bc487-7602-4528-9313-1dbe80f8ae72","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Approximating min sum set cover.Algorithmica, 40(4):219–234, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:5c9fee7e191337ccb2a295fdf73810441914ada71f710bf4ce81a48a9d797c5f","observation_id":"46a0659e-0bd1-4d39-a513-84d10c251a7d","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Maximizing non-monotone submodular functions.SIAM Journal on Computing, 40(4):1133–1153, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:7d1f6f0c2afd856c2cca8d4339a5b4d9f8c05c9f5d55c4c7213d84a65c02b476","observation_id":"200587c5-b1f8-426c-89cf-ca4485630412","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Separating coverage and submodular: Maximization subject to a cardinality constraint","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:405d949323498d33aafc6ab6cc272298336af4c3670af0e7a5d4ea569e379da6","observation_id":"2e06eb97-eb9b-46a5-8d8b-9d59c655a8cf","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Submodular maximization by simulated annealing","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:40b169cc143a5ac70f71dd8c7bb88795c4b4b0a7a78321f948fd9ff175f2e9a2","observation_id":"e34a3f0f-e61a-464a-9af1-8ae4c6d094bf","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Approximability of com- binatorial problems with multi-agent submodular cost functions","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:d2dcfe47729e5d8d291fa049c02719ac5589619f46152000396d988e3e9e3be2","observation_id":"937c23b8-ef0e-42e2-8611-cee8cabb1dca","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Approximat- ing submodular functions everywhere","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:1fda1e328c85f144004ed23efbe25c263772ca245263412b1ecbddab0909e6f3","observation_id":"ea09460a-0423-498c-a5d4-0cbfa9896934","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"The ellipsoid method and its consequences in combinatorial optimization.Combinatorica, 1:169–197, 1981","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:3437a00fdbcf7b0637f0bcbb1c55f13d32af6dcd17a723c4e81712bdba39aa3f","observation_id":"80b36ca9-93c9-4cb2-91f4-7bada58e014e","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"An approximation algorithm for the minimum latency set cover problem","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:5947326c277189907040737a9478afbf0c0c8f984afdd1bbb2d70b74c58990fd","observation_id":"8142e554-9bed-49f6-b767-3686aaf4820a","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Probability inequalities for sums of bounded random variables.Journal of the American statistical association, 58(301):13–30, 1963","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:2d12eed9ad4669ae68009444a8242774a1b34c8d470a1e069bd9d3a3fddff2dc","observation_id":"74fda985-2232-4075-b610-d46694fa1fc8","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"A combinatorial strongly polynomial algo- rithm for minimizing submodular functions.J","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:50d1c27f11fa8addb7eb983504f6fe6d69f9f997e74c5e4cd12eb494f90b9498","observation_id":"1f092beb-febd-4245-a391-acb89b1c03af","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Submodular function minimization under covering con- straints","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:93088e8cb0126fe7eded896ef3ee7b5011199c0916cb693d24b7f6bea26f8423","observation_id":"9d74ff3e-a05e-4016-a74e-1f429cfda307","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Approximating minimum linear order- ing problems","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:15bb4b7be465f65f12a10975ffdf82cde6f8f1fe10fe797553d9253f02afbb96","observation_id":"22094a41-63c6-45e0-8a47-892ed357ef37","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"A simple algorithm for submodular minimum linear order- ing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:227047993e083b5b091243ee69ad3e6ec21fcdcc55ffec4c0bb73a3042371dfa","observation_id":"c560af0a-5cdd-40e2-9c25-cfc741a737b5","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.Journal of the ACM (JACM), 46(6):787–832, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:b38e16bfe45db94c5a6d576dc78025d1029687cb2cd7bda2409a7d6e637aa93a","observation_id":"3cdc0745-4c4b-4cd7-89d3-f36ec983a6e1","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Profile minimization problem for matrices and graphs.Acta Mathematicae Applicatae Sinica, 10:107–112, 1994","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:a56b7b37b9606495c0ff41c3ceac4cc05c3fce6f5986c1a64d1465f05864bee4","observation_id":"b70cda4b-e262-4f3f-a29a-bde909f73e84","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Submodular functions and convexity","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:0dde396afc45135185f34ef322e6f4d2e86b94d55383ac0b1c15e15738686456","observation_id":"b1e32629-9325-4ec8-afd0-e0299d3c42cb","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:ce56d5e3ab19f065056aee760b7ffc838c57ef1fadbb9154e449ae2b8999ffe7","observation_id":"7d117287-ceb0-4873-8381-f1c194061cb0","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":null,"venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:0c39fe74cfeff67c2bbbf9434d6799c36e522fc7f81e32bdb41eb322262de2ee","observation_id":"fec45144-a10a-4b87-b2ab-0dc28a9b468f","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Ramalingam and C.Pandu Rangan","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:b5953fd05621919396719589cee32da719d789a5247304c4400081ef058a5606","observation_id":"ce2c52a1-dca3-429d-bfe8-359fe5be8cbe","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"New approximation techniques for some linear ordering problems.SIAM Journal on Computing, 34(2):388–404, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:26849c075243a3a83e2020efe81adc90a572309eeeb42259755196b789515b8b","observation_id":"6ab5b3ba-93d7-44ef-8cf3-ca239b6df4e7","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Ordering problems approximated: single- processor scheduling and interval graph completion","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:12c2c1e105317340cdf1fa25878626a1d843af6fb3b7eefede7a2fafb325b43b","observation_id":"8730ed35-ce58-4292-aa36-371f1ef21f57","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Multivariate submodular optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:f65459235adc723ee07692f64a4cae2855ea872488d745672ab151012ed2f976","observation_id":"eb5176e0-290e-49c3-9aa7-46676384b5a6","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"A combinatorial algorithm minimizing submodular functions in strongly polynomial time.Journal of Combinatorial Theory, Series B, 80(2):346–355, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:b1ec9818cb4fe188d4720817aa567d868b691a972c10d6ded8916061af9c959e","observation_id":"abcfd163-82d6-4a17-8aeb-2b85ffbf527b","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:d4465d2b2cf3856afdf65c386d3fdbafb3626a60f7b8395c3d1cc033a845c2b3","observation_id":"22b3e28f-de45-4ee3-b62f-18742ebba76a","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Some Results on Approximability of Minimum Sum Vertex Cover","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:022da3367167bb2f29f145f890469294a67c20821e8a152acb588eb8c79c57c5","observation_id":"303bbae1-c030-4c37-9093-76a2a298b88c","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Submodular approximation: Sampling-based algorithms and lower bounds.SIAM Journal on Computing, 40(6):1715–1737, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:4b02a2f0515ee60a38ef33d8e828d4d495365577568049f443cdcf2cbf630c86","observation_id":"a7bc8b32-494f-4732-ab67-0d76a4758862","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","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-06-26T15:23:45.836127Z","title":"Symmetry and approximability of submodular maximization problems.SIAM Journal on Computing, 42(1):265–304, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-26T15:23:45.836127Z"},"links":{"citing_paper":"/paper/2606.20202"},"observation_digest":"sha256:5665d8875a0fe95ca487ed7ce1267f9ca7cf4cd97e6f98850c8eaf8dc9b9d04a","observation_id":"f944f706-76d2-4bb1-a80f-15afd5d275b3","resolution":{"observed_at":"2026-06-26T15:23:45.836127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.20202","last_updated":"2026-06-18T13:16:08Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T04:22:16.123178Z","submitted_at":"2026-06-18T13:16:08Z","title":"Tight Algorithm and Hardness for Submodular Linear Ordering"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":40,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":41},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2606.20202."}