{"as_of":"2026-08-14T07:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2fb4d2d717c190d8005a43c2920c1c3879f71f55ed232dba68515f3a6ac1f61f","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:43:41.152904Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2507.13298/citation-record","integrity":"/paper/2507.13298/integrity","json":"/paper/2507.13298/citation-record.json","paper":"/paper/2507.13298"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:43:45.857645Z","title":"Alon.Bipartite subgraphs.Combinatorica 16 (1996): 301–311","venue":null,"work_id":"0216bfb6-2744-4489-9a69-81f47b3d6b32","year":1996},"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":1,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:39.473121Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:56231e3c0768b5bc2452ee1a18e2122ba1bc86cb8d4fef7b693a1ad3d764d88b","observation_id":"f748e37c-99ad-4c72-a822-8d5e228f910a","resolution":{"observed_at":"2026-08-06T16:43:45.957367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:45.628720Z","title":null,"venue":null,"work_id":"69edb0be-90b9-414f-bbff-22375bd7faec","year":2003},"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":2,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:39.519703Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:067eab4694a3c6e5ca99f78868120fbc9dd7d5da42e5556d70cd0bc0623d40a1","observation_id":"ff28e59e-e268-418a-b3ca-695279328302","resolution":{"observed_at":"2026-08-06T16:43:45.769570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:45.429348Z","title":null,"venue":null,"work_id":"2ef3fbb0-aeb1-4a04-88d9-d218c45865e0","year":2005},"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":3,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:39.593772Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:9209364a7bb39361c49c71445ac2bf42f8d884a7d19e0ef7d73a19d2f1c91b2e","observation_id":"af05c1b5-f454-47fc-b66c-6088c9086f03","resolution":{"observed_at":"2026-08-06T16:43:45.521835Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:39.691265Z","title":"Factorization norms and an inverse theorem for MaxCut","venue":null,"work_id":null,"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":4,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:39.691265Z"},"links":{"cited_paper":"/paper/2506.23989","citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:9e8d251e13d4395d3f18e47a39668d6c9a07e8bc047ec361f9d9aa6d17c23b40","observation_id":"573f28d6-c1f3-4965-b3b5-b824132f8fac","resolution":{"observed_at":"2026-08-06T16:43:39.691265Z","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-06T16:43:45.155171Z","title":"Balla, O","venue":null,"work_id":"e05466c9-9a57-4943-a40d-33b9ce40bced","year":2024},"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":5,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:39.790438Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:7c0ecc583fa4d636ef6fae3ada636976e2792e26adb04873d85c787b55236003","observation_id":"31b0846e-1da9-4d2b-bc0e-9ee90c908a54","resolution":{"observed_at":"2026-08-06T16:43:45.307657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:44.939952Z","title":"de Caen.Large equiangular sets of lines in Euclidean space.Electronic Journal of Combinatorics 7 (2000): #R55","venue":null,"work_id":"9cd410b5-2bae-4a3f-82cf-7f6f7fde2358","year":2000},"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":6,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:39.883838Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:40dda67a9523d8b6855c9edbc95532b7bef4a516aacc1c5b53e30184bb0de054","observation_id":"67e8eb7e-bb5e-4727-8362-121925747a54","resolution":{"observed_at":"2026-08-06T16:43:45.025991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:44.710264Z","title":"Carlson, A","venue":null,"work_id":"9e1c1747-6b9f-49b3-980b-b65636ea842b","year":2021},"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":7,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:39.981102Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:14d4cc2243c09552050e1d90621c93486d5091ff6c7bc2a18fbc15a68a9d246f","observation_id":"824e9ddb-5932-42d9-bca7-6ab54c740f65","resolution":{"observed_at":"2026-08-06T16:43:44.824755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:44.326283Z","title":"Charikar, and A","venue":null,"work_id":"81387d85-c49a-430e-aab8-0714df4220b2","year":2004},"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":8,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.047820Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:8fba3fb6755da24bc8f9831f9f567bba86c78b5ea198980f57d08bafe23ae969","observation_id":"0394d4e7-b268-47a0-bda7-734fc9ba62a0","resolution":{"observed_at":"2026-08-06T16:43:44.552813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:43.949885Z","title":null,"venue":null,"work_id":"ea926a19-354e-4612-8beb-cf8672b46ef8","year":1973},"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":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.140014Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:7193c969389f04be6e687316cbfa36e9e1716c620a551a8aaea2bc100daf476b","observation_id":"3668bd5d-0def-4ed0-8c4f-f4e14b5a18b6","resolution":{"observed_at":"2026-08-06T16:43:44.106351Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:43.581681Z","title":null,"venue":null,"work_id":"cac7a6dc-6066-4db7-9039-5484cfa30e44","year":1975},"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":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.214647Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:22b9f05cd7484551fc1618a5275e8bd9a5605e8715620748dd1d5e893d63278c","observation_id":"dac20b6f-3ed4-4e22-952d-33f06cf311c1","resolution":{"observed_at":"2026-08-06T16:43:43.745175Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:43.176986Z","title":"Erdős.Problems and results in graph theory and combinatorial analysis.Graph theory and related topics (Proc","venue":null,"work_id":"a10ce7b9-cf01-4ef9-9d9a-5bf3881ab819","year":1979},"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":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.292604Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:c69b44c0efee966f3f35be23334b1b785d39963ea5bebeef048c1e69a75b64db","observation_id":"12ea4f0a-6710-4043-8b84-d2af58d3490a","resolution":{"observed_at":"2026-08-06T16:43:43.362634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:42.853609Z","title":"Erdős, A","venue":null,"work_id":"0c08a18f-c071-4034-bdfd-79fefb4209a7","year":1997},"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":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.366637Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:6dc41d07b862c71b38de0fe998072fb166c8482bd992237c95561ebedc70602b","observation_id":"7ef8581e-c7ff-4324-b965-918bb6a03b47","resolution":{"observed_at":"2026-08-06T16:43:43.021513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:42.431325Z","title":null,"venue":null,"work_id":"bc1faa77-a19e-4ec6-90a8-393c643d40fe","year":1976},"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":13,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.442684Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:8e52e200a533646f7cb0ab7648c7a333d1ce3537fd79844d380db6b2547c5be4","observation_id":"a4b77711-2430-41aa-b06a-a19de786a01f","resolution":{"observed_at":"2026-08-06T16:43:42.656779Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:42.252899Z","title":"Glock, O","venue":null,"work_id":"1ce323be-a2f0-4d3f-aa31-cd91c0163670","year":2023},"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":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.525905Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:9e7cfb4722362663cdc1ff7e6ed4104c43f420749593ea4dc88d3add8551d9ac","observation_id":"2f6e4fe9-35f6-403e-8787-d04f92f639bf","resolution":{"observed_at":"2026-08-06T16:43:42.323560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:42.106122Z","title":null,"venue":null,"work_id":"0383336a-885b-4d6b-969a-ec1585bc4343","year":1995},"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":15,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.610337Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:d99535a450ae3bbf2bfbbdd1701d8b12619776ba33e3ff2b465bee417ad1fe8c","observation_id":"d8206532-a1c0-40ea-a554-fcb07864d12f","resolution":{"observed_at":"2026-08-06T16:43:42.162973Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:41.961330Z","title":null,"venue":null,"work_id":"a7f0bbb6-3439-4eac-9637-5b4de1d93fea","year":2016},"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":16,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.705138Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:7ce7619c6dc338b913bef0a12fb2683c6fb0582f1b54c1c2fc00add3978f2d81","observation_id":"e8a3a7b9-9d54-4aed-882e-48c072cf1970","resolution":{"observed_at":"2026-08-06T16:43:42.049097Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:41.811830Z","title":null,"venue":null,"work_id":"d47ce72d-cc4b-4232-9c91-7057132800c0","year":2021},"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":17,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.831887Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:74efec344904e0cdf1a44746e7466cb1949b0d32cbbb5539727218e7566f53e6","observation_id":"5124ab96-4cfd-427a-9374-75d8007204c1","resolution":{"observed_at":"2026-08-06T16:43:41.864061Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:41.675786Z","title":null,"venue":null,"work_id":"8d80d64a-24dc-4785-b176-c949def88373","year":2018},"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":18,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.928095Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:d3f7c758f33e308114e17b089c6d49544c15a3cfe2f644e20aa82a02f89835d9","observation_id":"6b6f7fb6-b983-4022-858e-c2c910c0009d","resolution":{"observed_at":"2026-08-06T16:43:41.733696Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:41.533651Z","title":null,"venue":null,"work_id":"3ebfaab4-b740-42c0-9059-497eb01bfa83","year":null},"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":19,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:40.996189Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:e0e197cee762c4e71f3485b053f0160ba1e0a30f20f338cf870e40886644e2df","observation_id":"0c114ef2-169d-431a-b2f7-8ca80a64479d","resolution":{"observed_at":"2026-08-06T16:43:41.597635Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-06T16:43:41.391381Z","title":"Räty, and I","venue":null,"work_id":"72a5621c-9a79-44d1-b7e0-6d52e2b32711","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":20,"source":"pdf_text","source_observed_at":"2026-08-06T16:43:41.090201Z"},"links":{"citing_paper":"/paper/2507.13298"},"observation_digest":"sha256:07f6fb175fe266d0fa5cc24ee6e554b51996bcc73e45c355d2df4e4f7e3aa512","observation_id":"b89a491d-1067-4970-a065-c57cb9c9add4","resolution":{"observed_at":"2026-08-06T16:43:41.458568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"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:5fc80168bc18796171e6e0ae971adcb754073e74be81228d5359cc92e2d13dd4","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.13298","last_updated":"2025-07-17T17:06:37Z","latest_version":1,"primary_category":"math.CO","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"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":9},"total_outbound_references":21},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2507.13298."}