{"as_of":"2026-08-07T13:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2560ed92599df93547e1b66570a6b907e831be613efe16d6f171aeccfd91f6d","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T07:00:49.981472Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2607.04185/citation-record","integrity":"/paper/2607.04185/integrity","json":"/paper/2607.04185/citation-record.json","paper":"/paper/2607.04185"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:c1aed0d6405f90b90ccfdf146c9cc238b9324afda93945ba0733a8e9d3ac3e12","observation_id":"b50c6dd1-4525-4eb6-8465-0a1725792d76","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.19435","last_updated":"2025-08-26T21:09:45Z","snapshot_observed_at":"2026-08-05T16:02:28.498530Z","submitted_at":"2025-08-26T21:09:45Z","title":"Weak saturation numbers of large complete bipartite graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.19435","snapshot_observed_at":"2026-07-13T07:00:49.981472Z","title":"Akhmejanova, I","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"cited_paper":"/paper/2508.19435","citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:3d493c963482c375a628e26ad3b841c1b1260c646784742dc51e7b86dccd0c98","observation_id":"b0c3281c-81ee-46d6-9d5c-869f8374d7d8","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Alon, An extremal problem for sets with applications to graph theory,J","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:417b1a4e2c523dbbc3e6e47c7f23216fee4b3f2d57d3c20ef26a3e7a64d812f0","observation_id":"ccb64b69-8e94-4555-a059-dd101275ca89","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Ascoli and X","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:8d75f07846fcffeeab91b952e00ff53119b2bf2f6ba4ef6c4ba2f41b892ea7d0","observation_id":"7ffa49d7-6520-426f-8728-1870d0151150","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Avramidi, B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:dc1328605ee0fd0b9caacbe568e2dabea72e43401b9b7cb3e73b71e0c32d23c2","observation_id":"59ab75e4-4ada-4cea-b2cc-de2f28ce039c","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Balogh, B","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:f08f0704445f8d990f5bbc201bf08f427b63dc96933179e9a24c133c442425f0","observation_id":"5d0e8551-d2d5-424d-bc20-f2dbd5aaf8a3","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:79a7f265da6981f8007282fc3ebf0de3e827cd65c5165dc425f653ae787a4f1c","observation_id":"0beed6a6-d926-4746-91da-d81bffd5c629","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Borowiecki and E","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:68adb5324b9b5ca9cc4fbb6633329834a4c3b275e2733791f88647de32d2a4c2","observation_id":"acf4863d-65f0-4149-8c49-becbe418ff80","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Bulavka, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:5d241dd0e22c6b58f5dd33006db563e18be2415ecf49e7ae7368c314ef7e53c7","observation_id":"fe2eff50-e7b5-4a3b-9b96-60933a92b7dd","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:5b346e5ce1cc3d0255dd56e8885912f2f31be568f1f83f0ed13e6f75b4b391bd","observation_id":"5cccf8e7-46d6-402a-8caf-93c0c6f44dd3","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:f08f26d8cd17be71e24bc967ae1c40a77ce99284c86550f309dc5be75c66b68a","observation_id":"16657f55-caaf-4309-b3d6-70f5be2808d3","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Constantinescu, T","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:a8bd7f23379da2081457057e839772902b75982fc6244628b525625227eae3f5","observation_id":"f563eea1-7d92-4316-b48e-28f9b6639443","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Constantinescu, T","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:fdefbb6af66b824309f7d9969a74225c5d397338a286ca577e57a01c22329a7e","observation_id":"43b8a861-8629-40d1-8b8d-9837f2ab3e35","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Douba, G.-S","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:f9034ccee88dca0a0ebcd9628ce88c440df7024c82e95b2c377072a6f4530b42","observation_id":"ce15c2b0-17e9-448c-baf2-7e03ef84a777","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:1c412c3964204b1214e011cb084bada68c584c0aeb05d3c41c410aaf22256f57","observation_id":"43e25a0d-845f-4116-889a-e845f0e12138","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:04832286b5f00cae8d6bece608a5cf32788bcfb69a99c0f1e7dbc2c6fcc6dbe6","observation_id":"5baf6e7d-22b1-4fea-86ce-0a404037fc46","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:60a53f58dc6798c93f6116e6d3ffbfd0e30e2d032e57ba09f0b01eede92937d8","observation_id":"15797acb-b304-40ab-92f5-b6ff01174bd4","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Frankl, An extremal problem for two families of sets,European J","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:8a22f9121ad30a1189ae0e50e54f20fec1cef58dd9ea273970e75c0b6a8a3d50","observation_id":"514810c1-14c3-4b32-86c3-cbaea02ebc4d","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Gromov, Hyperbolic groups, inEssays in Group Theory(S","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:80a53f9ed7545f111bff11ba49d98f6566512ca6879cc4f3ea9c29455ab9989a","observation_id":"08cf521c-c13d-4d0b-ad73-077fa19c4f34","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Januszkiewicz and J","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:fddb85d0b090c7bb67b272dbb8d9bd3004b1d9905b6898e9a303583651576d71","observation_id":"08890f23-79d3-4c17-a894-23e8071bc4be","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Kalai, Weakly saturated graphs are rigid,North-Holl","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:36a4bd8fab04e0c4bfb9ff59fdacd61bb490bd8dc10626c18ff875b5a4d7d0c9","observation_id":"ace40a59-ac61-4274-9cc8-68e15dc487c3","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Kalmanovich, E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:e68cd32da279974cfa04fc45c1214ad32aec3cb58730f572b19dd4353f5161c4","observation_id":"4d478478-65e2-4ef7-99e7-2bbb087b4225","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:ddd390ef839b10043c39570313217c408d795cbdd82c8128cfcb35b0e490e14c","observation_id":"9fdfe924-2eb3-4bb6-b8a0-578296f96e10","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Kopczyński, I","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:de13225b1135bf7d7d357c183daadcf72d2ce7c06fa05825af7854154f138485","observation_id":"2feaa420-8dcc-4b7a-bfb4-7c6c86592fee","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Kronenberg, T","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:eed4919d8d2b0d8302eb713bd40d3cc5c1faf996113d947aaf1c9fa12d8ecdfc","observation_id":"bf502371-fafa-40b3-a8ba-a0af9ac06faf","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Lovász, Flats in matroids and geometric graphs, inCombinatorial Surveys, North-Holland, 1977, 45–86","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:a7dab2c7a90da4d8d9dcbdf2a09edddc1187e8c63b453b68801dc2f7c51953c8","observation_id":"6ec8b11d-e5e9-4a32-bbae-7c0604ee279e","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Miralaei, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:fb2dc7a7f4aff9a267dca21afd429295ed0fd0dbcd3119612c9cfabf0c30e51e","observation_id":"74e58edb-c54c-4585-85b0-4fc9266a8a5f","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Morrison, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:6c9dcecdea61b17dad8f5cdec811131f9ed9727fdb618e9c93e73ae6cc8ed0c1","observation_id":"8fa0119b-b20b-402d-897c-3b9ab7cd2b61","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Moshkovitz and A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:59745c7725ea5784cfab3e6debd3ebe92c303e0da3a0d820cca0d8385502e3f0","observation_id":"44ae5952-68ca-4576-a05d-c56eb8cf4f8c","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:54899f33c88557fe78a0a4a6c0bb511b08cbede1f34b53297ed5fa43f97cd742","observation_id":"72e5ddbc-3404-44cc-a06a-b99ee40f50a7","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Osajda, A construction of hyperbolic Coxeter groups,Comment","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:093129536dd77b9bbf6d2d0833fa85c48c9fa83fa549a0ee5cf6f29dc4e1baae","observation_id":"fddebe42-9477-4965-9316-f8a0f69805c6","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Przytycki and J","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:d6af16b48c74493c3094789559dfc35c930cf1960e26f153f3859871a635c5cd","observation_id":"17e3cd41-eefc-4f27-8a86-ac4e030af117","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:fec471746ecf74e40762769c7bad8d3f0848057259d78eda6884062add939d15","observation_id":"babfacf4-0a85-4b98-80b2-7b72821bdfce","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Shapira and M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:87e2b84aa64181d34629b5e34ff7b533e47ce0eee6d4e4e1da1c6ecebf3a1452","observation_id":"a9f179e1-b6a6-46a7-85a5-86550e57cbe0","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Skotnica and M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:3bb57bbf1f7cb93b5c0b5e4863ff478289bb7394a07a5e29bf12acbf23560d6a","observation_id":"c6b9b723-6527-4b0e-b2ca-500f8fd1fb75","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Tancer and M","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:e83a3f1ce9ca4d7679dd090ae890e809aa8aec8141ed16bce96968a1f40a7cc5","observation_id":"a731b716-058a-40b8-9a37-739700e1b993","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:42cbc6b03d23372b731a6ac9193ae0fd07af113d6b50b9eec1723a5707498b17","observation_id":"c0cbf748-034f-462e-9b5a-f5a7d57362cd","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","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-07-13T07:00:49.981472Z","title":"Terekhov and M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-13T07:00:49.981472Z"},"links":{"citing_paper":"/paper/2607.04185"},"observation_digest":"sha256:3f8ba675d50d4d700e1ca4bc539a4281360499ce0e8328fc8b8d333d5f8ebee5","observation_id":"3133b76f-6541-4cd6-a272-7df8f8b2e360","resolution":{"observed_at":"2026-07-13T07:00:49.981472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04185","last_updated":"2026-07-10T08:38:03Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-06T05:52:11.907237Z","submitted_at":"2026-07-05T09:03:54Z","title":"The Complexity of Weak Saturation for Complete Graphs and Balanced Complete Bipartite Graphs"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":38},"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 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2607.04185."}