{"as_of":"2026-08-11T15:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c06d22313db85cb3c317083cb6648b57d2d79ba58906c9934f87ecb0637230e2","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:58:51.118870Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:43:41.152904Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T16:43:41.256924Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"cited_work":{"arxiv_id":"2507.10037","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.10037","snapshot_observed_at":"2026-08-06T16:43:41.256924Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","venue":"math.CO","work_id":"54b8ac87-325d-4155-9149-09851f5ef686","year":2025},"citing_paper":{"arxiv_id":"2507.13298","last_updated":"2025-07-17T17:06:37Z","snapshot_observed_at":"2026-08-11T03:09:08.608085Z","submitted_at":"2025-07-17T17:06:37Z","title":"Beyond the MaxCut problem in $H$-free graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:41.152904Z"},"links":{"cited_paper":"/paper/2507.10037","citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:b7123b1e3f075565a0a5e22c77bb5bbc99579bb8dd94f50c74de34bb223c9620","observation_id":"f3690f6b-3d14-42c6-b4cb-4c3df3bf473a","resolution":{"observed_at":"2026-08-06T16:43:41.317462Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.10037/citation-record","integrity":"/paper/2507.10037/integrity","json":"/paper/2507.10037/citation-record.json","paper":"/paper/2507.10037"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2404.13136","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:58:52.532336Z","title":"Beyond the classification theorem of Cameron, Goethals, Seidel, and Shult, arXiv:2404.13136, 2024","venue":null,"work_id":"52620f6c-5b7b-44ee-a98e-1e8af5921212","year":2024},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:47.188554Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:4be8d847404b2fdd758dc628a4828eaea72cc4c2a4a0921d9eac9afa2da0f9b8","observation_id":"c4ccafe5-cfc0-4dc8-bc22-24b6ec31636e","resolution":{"observed_at":"2026-08-06T17:58:52.687027Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:59.018170Z","title":"Maximum cuts and judicious partitions in graphs without short cycles","venue":null,"work_id":"6ca9c404-397f-485e-bdd2-827536d99176","year":2003},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:47.281496Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:19529ad399e351ec522857d7162d8575070f6775358011db3a285d3a6b7e4d11","observation_id":"01b0b035-7203-4dcf-a6e7-78bcbee1b749","resolution":{"observed_at":"2026-08-06T17:58:59.110776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:58.738793Z","title":"Quasi-randomness and algorithmic regularity for graphs with general degree distributions","venue":null,"work_id":"17617d32-db7e-4737-881e-9ee602a5c1a4","year":2010},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:47.452442Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:8a6760ff47922ff95523d3ec95be3ddbbd91c7244051ac89ee4b289fe5f3a0da","observation_id":"c495c78a-316e-46e1-9d07-16f4fcb58b03","resolution":{"observed_at":"2026-08-06T17:58:58.863873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:58.619492Z","title":"Efficient testing of large graphs","venue":null,"work_id":"ec5f784d-8784-4934-96b4-57fc530f4672","year":2000},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:47.582783Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:37f36932e156694e576aff9de21e5ac71b1de8e8e58b6d3b36d7010c58087350","observation_id":"30558933-14f6-41fc-a0a4-f2b016dfa7e2","resolution":{"observed_at":"2026-08-06T17:58:58.669918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:58.426234Z","title":"Quadratic forms on graphs","venue":null,"work_id":"7abd1ec6-a452-464e-a3aa-b52a9e2e2972","year":2006},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:47.697540Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:7b3cad9d541a3063a8b9d9d86491ae1700eccc103ff2badba0618f87cea8585f","observation_id":"cd0d74b4-c76a-4e4f-a54a-4cad699566f8","resolution":{"observed_at":"2026-08-06T17:58:58.541120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2110.15842","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:58:52.180005Z","title":"Equiangular lines via matrix projection, arXiv:2110.15842, 2024","venue":null,"work_id":"d666f80d-a840-4650-b2c4-566a18292bf1","year":2024},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:47.859647Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:04909c7f57b305ccb182cd21443323545b0ed68d8b2a695e4f40e81416138d17","observation_id":"420e5ae1-98f5-4c58-95b8-1bc144ec46cb","resolution":{"observed_at":"2026-08-06T17:58:52.298076Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23989","last_updated":"2025-06-30T15:54:45Z","snapshot_observed_at":"2026-08-06T21:24:25.908420Z","submitted_at":"2025-06-30T15:54:45Z","title":"Factorization norms and an inverse theorem for MaxCut","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.23989","snapshot_observed_at":"2026-08-06T17:58:47.974353Z","title":"Factorization norms and an inverse theorem for maxcut, arXiv:2506.23989, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:47.974353Z"},"links":{"cited_paper":"/paper/2506.23989","citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:63936e417a1fc5a752570be63910b232d239272690d0b4422d82ef4c5551d542","observation_id":"09cfc524-bb5f-40a8-81b3-0339ac1a4028","resolution":{"observed_at":"2026-08-06T17:58:47.974353Z","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:58:58.075193Z","title":"On MaxCut and the Lov´ asz theta function","venue":null,"work_id":"0f7575d0-5643-4318-bb7c-e4682a211a32","year":2024},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:48.138773Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:6cb194190fd26d73a4eedec076ad88ac1e94fd274e65b0bcbb0ad91135665e0c","observation_id":"8d5cc046-1dd7-44fb-bb52-f4e80b4fc399","resolution":{"observed_at":"2026-08-06T17:58:58.233044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07629","last_updated":"2023-11-21T15:25:46Z","snapshot_observed_at":"2026-08-09T13:12:40.730760Z","submitted_at":"2023-11-13T09:11:02Z","title":"Note on the second eigenvalue of regular graphs","version":2},"cited_work":{"arxiv_id":"2311.07629","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.07629","snapshot_observed_at":"2026-08-06T17:58:51.823937Z","title":"Note on the second eigenvalue of regular graphs","venue":"math.CO","work_id":"78751295-6d49-4fe3-8ec1-5ee906a4ab09","year":2023},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:48.321295Z"},"links":{"cited_paper":"/paper/2311.07629","citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:b5075ebca3e2199ec4a15088013ed8909946336a5c95b935141130efea1bbd0d","observation_id":"13264379-0d2f-4068-99af-95e773de4f47","resolution":{"observed_at":"2026-08-06T17:58:51.944595Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:57.797232Z","title":null,"venue":null,"work_id":"abdfcafb-0062-48d6-ab0e-e0e56fe5b850","year":1989},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:48.444015Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:ce20b7f7a558414407c25b851f932957c578b23ec3083af23e142275e0e4fd58","observation_id":"d3fe1e54-a854-4f97-b338-c276244e76fa","resolution":{"observed_at":"2026-08-06T17:58:57.927393Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:57.546959Z","title":"Lower bounds for max-cut in H-free graphs via semidefinite programming","venue":null,"work_id":"715dbf26-3bef-4e4c-968b-75341093bcb0","year":2021},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:48.587682Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:5cbb956eaacc0e364f7a7fd8bf6df44867326d1c42d6a0f32f8448850d9def79","observation_id":"521652c8-25cb-4248-b16f-0070d7e40b8c","resolution":{"observed_at":"2026-08-06T17:58:57.684951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:57.248361Z","title":"Maximizing quadratic programs: extending Grothendieck’s inequality","venue":null,"work_id":"5e6f77d3-acc8-4315-8fa1-5ab333d70def","year":2004},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:48.693909Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:2c9c44b5c7dbb591abfc429caae64e2ccbf1d108347557fc5b44e954c517222a","observation_id":"cf947e01-9be7-432f-8e7a-2651dfcb0738","resolution":{"observed_at":"2026-08-06T17:58:57.445737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:56.909648Z","title":"Quasirandom Cayley graphs","venue":null,"work_id":"83476c73-9b3c-420c-ad61-f00c72ad5187","year":2017},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:48.848489Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:e707ac89b5d1a7c515b597c3d9053bd419cef2232d8134e05c1d68e1df9f4dd7","observation_id":"158014c9-f920-4eba-ad58-1c2e1564d563","resolution":{"observed_at":"2026-08-06T17:58:57.060060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:56.617567Z","title":"Graphs with least eigenvalue−2: ten years on","venue":null,"work_id":"5ce29828-4486-46d4-ac0a-385f7af555ac","year":2015},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:48.989367Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:33d110d2ce393e5ea0df8fa252e2b5d0547ec1d305ec8ed8eb5f049328b261e3","observation_id":"dff7267a-53dc-49ce-a2eb-657a34125c45","resolution":{"observed_at":"2026-08-06T17:58:56.766309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:56.391878Z","title":null,"venue":null,"work_id":"6112172a-c2dc-4f96-8e93-3cbe168cb239","year":2000},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:49.075291Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:fdb3d6b9d99f3a874b9d5f972c0dc4db5b6da3c2186ac09d0d38301818230f6c","observation_id":"b842a452-7b9a-45ff-aaef-2c6f4044e364","resolution":{"observed_at":"2026-08-06T17:58:56.477779Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:56.046500Z","title":null,"venue":null,"work_id":"f3683e24-ea92-4c56-aab1-46dd7c8f50a6","year":1973},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:49.248596Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:f7755c3f85d9269b43a2f227186e19a3b3883d9071ce21fb6d858306ba676b45","observation_id":"3a22ce8c-b2c8-485f-ba2e-33f3f6ba99dc","resolution":{"observed_at":"2026-08-06T17:58:56.173077Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:55.752828Z","title":null,"venue":null,"work_id":"a8715894-7fe9-4d4f-9f99-66543969e851","year":1974},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:49.408456Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:7ab778b6adae667d0800ac1564e7a57a1d8076d48d7e6cd2b81de8280cedb4ca","observation_id":"d52c4486-81fb-4743-97ef-e19e5c9cc53d","resolution":{"observed_at":"2026-08-06T17:58:55.877667Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:55.485940Z","title":"New results for MaxCut in H-free graphs","venue":null,"work_id":"6cb810ce-4ac8-4ce9-be34-6766b9da900a","year":2023},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:49.533354Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:8fad3610a7dc270c8c57b38d22df31b5663666746cfb27927e38d9a8f99fb767","observation_id":"a144fa81-0c0b-4d9d-9cbe-b3710b9452d8","resolution":{"observed_at":"2026-08-06T17:58:55.616353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:55.197906Z","title":"The energy of a graph: Old and new results","venue":null,"work_id":"51f9fdce-d3f5-4fd9-9ad0-fd9111e89839","year":2001},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:49.656955Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:627bf39cdfd3766957c8a3d5f5edbf683223a6537181da7300b420811f9c2442","observation_id":"0a605507-8551-4adf-bd05-e493f3fd5081","resolution":{"observed_at":"2026-08-06T17:58:55.345704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:54.911190Z","title":"Approximately strongly regular graphs","venue":null,"work_id":"783c1dfa-901f-4e3e-8917-ebe5aee644f3","year":2023},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:49.804863Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:ea728d5081ec82e74efdc9b10d6e610bb0b1479ebdde9efc686913b20f672b7a","observation_id":"6987bbd0-1165-4a3d-a057-d1037d5a32a6","resolution":{"observed_at":"2026-08-06T17:58:55.049322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:54.641327Z","title":"Beyond the maxcut problem in H-free graphs.Personal Communication","venue":null,"work_id":"c63c1e20-2724-43d0-bc00-e9d769ca5758","year":null},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:49.916708Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:b8b2d2a69c9da8bb64e83f210f1f53a93089a1ae43a726a3309c2c46ee770b79","observation_id":"464a0bea-b54d-4fe4-a5f5-aade1f3d48d2","resolution":{"observed_at":"2026-08-06T17:58:54.791860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:54.366136Z","title":"Koolen, and Jae Young Yang","venue":null,"work_id":"5fd828da-a3a9-409f-b795-06c895b46066","year":2016},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:50.022880Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:be9cde1efb1a7782af97cb7bb6cf9c912e32d5e09c2dbc25fb937644c7352500","observation_id":"41cac458-e7ca-4ae6-8f53-1836ce0c4d16","resolution":{"observed_at":"2026-08-06T17:58:54.498827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2506.04964","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:58:51.593264Z","title":"An improved bound for strongly regular graphs with smallest eigenvalue −m, arXiv:2506.04964, 2025","venue":null,"work_id":"d5a574e8-5d9f-4349-a243-18bb7b413545","year":2025},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:50.159444Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:880956c53654616e11a7257a65a04a1d063d454b476d74640cafead6fb861308","observation_id":"ccdbf03e-18ee-4b64-a825-f2f2b9825aa2","resolution":{"observed_at":"2026-08-06T17:58:51.682780Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:54.088670Z","title":"Koolen, Meng-Yue Cao, and Qianqian Yang","venue":null,"work_id":"941c1a6e-3841-4e1b-b0c9-e4dd4f009b62","year":2021},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:50.287437Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:792d9de5e5f2de86fd77be7d9651f48cff46a4f730f18911332dc9dd0b848988","observation_id":"c87db0a6-5553-4847-a786-0bad267b83fc","resolution":{"observed_at":"2026-08-06T17:58:54.212498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:53.830665Z","title":"Neumaier","venue":null,"work_id":"cd2003a8-715a-4270-8c89-fbbeb38a276b","year":1979},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:50.464251Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:59a2f2b475fc6d638fc79a7a7417ad6a247c9576d1d3547bd251f70a7a317c0e","observation_id":"89a53ddd-be89-4f68-a460-1247a8e6713c","resolution":{"observed_at":"2026-08-06T17:58:53.975867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15572","last_updated":"2025-09-10T10:49:18Z","snapshot_observed_at":"2026-08-05T12:05:14.149654Z","submitted_at":"2023-12-25T00:53:40Z","title":"Induced subgraph density. VI. Bounded VC-dimension","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.15572","snapshot_observed_at":"2026-08-06T17:58:50.577237Z","title":"Induced subgraph density","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:50.577237Z"},"links":{"cited_paper":"/paper/2312.15572","citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:c8aeb15c1593723c4346b11d317585e7983df910e0d9f4733ea6494aec35bbc2","observation_id":"93e0de27-0e38-483a-9726-c3581e59c56b","resolution":{"observed_at":"2026-08-06T17:58:50.577237Z","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:58:53.598584Z","title":null,"venue":null,"work_id":"f79926e6-54f7-454a-8425-d898a557b4f7","year":1991},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:50.695370Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:581ff2803a466804caafc87ddaa9f8d2109531420d2958ebf9a2507a5f0ed5c2","observation_id":"77c2933d-2e56-46dc-9c91-9a1232143d32","resolution":{"observed_at":"2026-08-06T17:58:53.718002Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:53.366439Z","title":"Large cuts in hypergraphs via energy.Mathematical Proceedings of the Cambridge Philosophical Society, page 1–17, May 2025","venue":null,"work_id":"78404674-2b21-4639-9da2-371be6ff8698","year":2025},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:50.791276Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:0299f3544c3062a61773a2b1eee4af36f041a277c1d62337cc53ea810f65f7ad","observation_id":"654a209f-6229-4cb3-a946-7aa02264ace7","resolution":{"observed_at":"2026-08-06T17:58:53.481722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.02070","last_updated":"2023-11-20T12:55:00Z","snapshot_observed_at":"2026-07-06T16:42:48.073439Z","submitted_at":"2023-11-03T17:54:27Z","title":"Positive discrepancy, MaxCut, and eigenvalues of graphs","version":2},"cited_work":{"arxiv_id":"2311.02070","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.02070","snapshot_observed_at":"2026-08-06T17:58:51.292583Z","title":"Positive discrepancy, MaxCut, and eigenvalues of graphs","venue":"math.CO","work_id":"71f05f83-944b-45ac-bfd7-aab5f2dd70db","year":2023},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:50.898216Z"},"links":{"cited_paper":"/paper/2311.02070","citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:121da1fab98cb2fcd265eebb256b00a6d7ee37404957586e6f14da62170d3da5","observation_id":"e4780177-24f3-48b2-925b-18aeea99be0a","resolution":{"observed_at":"2026-08-06T17:58:51.396816Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:53.133337Z","title":"Matrix discrepancy and the log-rank conjecture","venue":null,"work_id":"5550b8da-10c4-466f-94a7-717a3b2e04df","year":2025},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:51.020338Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:b9fe802325994f7c5978cc34e251d3775c1ebdafd1460473a9661716c2b5e7d2","observation_id":"af008d93-d53c-44ac-ab57-faa182942fc4","resolution":{"observed_at":"2026-08-06T17:58:53.249724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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:58:52.845191Z","title":"Graph partitioning: an updated survey","venue":null,"work_id":"be0961fe-f468-4431-a1a9-07bff7731429","year":2023},"citing_paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:58:51.118870Z"},"links":{"citing_paper":"/paper/2507.10037"},"observation_digest":"sha256:2d1d806cd922f8b7cb3c2bee8970b3c0df5f11f34d804e887876f43aebebd1d5","observation_id":"643dfa86-fa8f-47ec-8f6e-f943b2477119","resolution":{"observed_at":"2026-08-06T17:58:52.963231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.10037","last_updated":"2025-07-14T08:15:11Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T07:30:48.300046Z","submitted_at":"2025-07-14T08:15:11Z","title":"An Alon-Boppana--type bound for very dense graphs, with applications to max-cut"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":5,"verified_fuzzy":19},"total_outbound_references":31},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 1 inbound Pith citation observation for arXiv:2507.10037."}