{"as_of":"2026-08-16T23:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e25bfbc7c39da6b94c86d67110ec4715b134b0315fd9799edb70c2a7e504f1c","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T22:01:39.182038Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:52:19.010013Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T21:56:30.266860Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08184","snapshot_observed_at":"2026-08-07T05:52:19.010013Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs, 2024.arXiv:2411.08184","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07264","last_updated":"2025-06-08T19:58:29Z","snapshot_observed_at":"2026-08-10T07:05:58.717131Z","submitted_at":"2025-06-08T19:58:29Z","title":"Refinement of a conjecture on positive square energy of graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:52:19.010013Z"},"links":{"cited_paper":"/paper/2411.08184","citing_paper":"/paper/2506.07264"},"observation_digest":"sha256:e19f6c6fbb845611e101687ae2951736800a90ccd667cacc6e1fecbafa393f24","observation_id":"b55767d4-afc0-4a37-9511-cf7d86a1166b","resolution":{"observed_at":"2026-08-07T05:52:19.010013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08184","snapshot_observed_at":"2026-08-05T05:13:48.516481Z","title":"Coutinho, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.05814","last_updated":"2025-09-06T19:16:49Z","snapshot_observed_at":"2026-08-10T07:05:55.020231Z","submitted_at":"2025-09-06T19:16:49Z","title":"A graph energy conjecture through the lenses of semidefinite programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T05:13:48.516481Z"},"links":{"cited_paper":"/paper/2411.08184","citing_paper":"/paper/2509.05814"},"observation_digest":"sha256:89a058257e4ecea26bcb119b6a559153ee8a52e7f3a8700c9b2f5fdf1b7c652b","observation_id":"68b0a8e0-3244-430c-a9bd-7d7f34d205d4","resolution":{"observed_at":"2026-08-05T05:13:48.516481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"cited_work":{"arxiv_id":"2411.08184","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.08184","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","venue":null,"work_id":"a1956939-e95e-4c11-9019-4b80fb9c0e0a","year":2024},"citing_paper":{"arxiv_id":"2604.25058","last_updated":"2026-04-27T23:13:20Z","snapshot_observed_at":"2026-08-13T12:31:09.232669Z","submitted_at":"2026-04-27T23:13:20Z","title":"A SWAP-free Framework for QAOA","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T03:43:03.157573Z"},"links":{"cited_paper":"/paper/2411.08184","citing_paper":"/paper/2604.25058"},"observation_digest":"sha256:052b1653dca6aa73fb66cf0fb57bcd20dbe3bceeb968e67f20c6a226b1c7d7d5","observation_id":"ad3efb0d-9b48-419c-8b8d-a69fbdd95b67","resolution":{"observed_at":"2026-05-11T21:56:30.348103Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08184","snapshot_observed_at":"2026-08-01T16:26:15.884817Z","title":"Coutinho, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18031","last_updated":"2026-07-20T14:59:44Z","snapshot_observed_at":"2026-08-10T16:55:40.072063Z","submitted_at":"2026-07-20T14:59:44Z","title":"The positive and negative square-energy conjecture","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T16:26:15.884817Z"},"links":{"cited_paper":"/paper/2411.08184","citing_paper":"/paper/2607.18031"},"observation_digest":"sha256:e33a31fa11e08d7510fbc39fd6af27a0a419a313eff078ceee47d1f72af3fd0a","observation_id":"8a97db61-b1d7-4293-bada-02e8c3c41254","resolution":{"observed_at":"2026-08-01T16:26:15.884817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08184","snapshot_observed_at":"2026-08-01T16:25:45.588243Z","title":"Coutinho, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18044","last_updated":"2026-07-20T15:12:53Z","snapshot_observed_at":"2026-08-16T17:03:41.078767Z","submitted_at":"2026-07-20T15:12:53Z","title":"A positive square-energy strengthening of Tur\\'an's theorem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T16:25:45.588243Z"},"links":{"cited_paper":"/paper/2411.08184","citing_paper":"/paper/2607.18044"},"observation_digest":"sha256:c1344e65c086189692d8a796b9c003d0c2e8c09b098ee38a6805f07af3eb8678","observation_id":"b4a9495c-c586-44a9-9af4-45e69076336e","resolution":{"observed_at":"2026-08-01T16:25:45.588243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.08184/citation-record","integrity":"/paper/2411.08184/integrity","json":"/paper/2411.08184/citation-record.json","paper":"/paper/2411.08184"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2303.11930","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T22:01:39.446028Z","title":"Positive and negative square energies of graphs","venue":null,"work_id":"dac4f765-87fe-485f-a543-9f42fc7fe54f","year":2023},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.057314Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:6c5c0ac0a83e791fd3046335edec84809cb141c6df4fa2c420038a757bd0d18e","observation_id":"4e33ea3a-63ea-4f64-9115-fe823e68df4d","resolution":{"observed_at":"2026-08-12T22:01:39.453090Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.864519Z","title":"Proof of a conjectured lower bo und on the chromatic number of a graph","venue":null,"work_id":"e264525a-a2ce-4148-98de-ea052a2f7276","year":2015},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.062739Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:253f8ffc804b7770133ed6b8d7fde8b73de874f5103147b9174dbb65eec3cb41","observation_id":"62ffda0c-c6d0-4a2a-9593-538a5b161d93","resolution":{"observed_at":"2026-08-12T22:01:39.869000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.851464Z","title":"Orthonormal representations, vector chromatic n umber, and extension complexity","venue":null,"work_id":"a53973f7-86f9-4f77-9ca7-f324a53af470","year":2024},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.067277Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:37bebcc402cd579f49cfcdcd98215861c86d753eeb5f76a983a57319037f8f28","observation_id":"c5dda84c-254d-4eb4-8624-f4f028046bb7","resolution":{"observed_at":"2026-08-12T22:01:39.855830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.838462Z","title":"Matrix Analysis, volume 169","venue":null,"work_id":"f6802dc9-b461-471e-bf8d-1e064a9307d8","year":1997},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.071677Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:3464e5b7b2188d9fe61b6b2ffe31f7a4ac3f4b01de592e4b00e582d650720a16","observation_id":"cfbb14c1-d50a-42ac-8e8f-3f935ec5d2e0","resolution":{"observed_at":"2026-08-12T22:01:39.842831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.825506Z","title":"Academic Press, New York, 1978","venue":null,"work_id":"0dce3ae6-4fc8-4f09-a6f9-62f351845e04","year":1978},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.076354Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:6d9163de66ee3d684aa3fd76bda327abbe783a5791b3686e724349f8d5dd5352","observation_id":"afcb2943-8ec7-4bee-926f-566e319f2bbd","resolution":{"observed_at":"2026-08-12T22:01:39.829659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.812402Z","title":"Cliques and the spectral rad ius","venue":null,"work_id":"3d3ba4fc-d1cd-4480-bec7-fb01070fdaae","year":2007},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.080954Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:a07597aa7daa78ee8c6a50cab5a0d1e0ea1271f9794145197a7e71f56409fc69","observation_id":"b8851863-ec3c-4764-a86b-cf7ab85baa5b","resolution":{"observed_at":"2026-08-12T22:01:39.816636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.799177Z","title":"de Carli Silva and Levent Tun¸ cel","venue":null,"work_id":"53f0c115-2cfe-4b24-85c5-8bfb3219fd5a","year":2017},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.085900Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:2d6b7f1d6c994d1499aadf532ce22d55513779babd0e26ffdf2926c69276c018","observation_id":"89297b92-6a86-4840-8e8b-b2d3073ade0e","resolution":{"observed_at":"2026-08-12T22:01:39.803546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.785883Z","title":"Approximation of the sta - bility number of a graph via copositive programming","venue":null,"work_id":"e476f229-56c4-42a3-9d27-2a77a61682ec","year":2002},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.090037Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:982b91ad7eb03da312778c13586865470a14617d84dbebb7574da809b725211b","observation_id":"1f0317a8-1763-45cd-8b90-aa0507fe1a0e","resolution":{"observed_at":"2026-08-12T22:01:39.790322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.11530","last_updated":"2024-04-24T15:06:32Z","snapshot_observed_at":"2026-08-16T14:41:58.451045Z","submitted_at":"2023-11-20T04:27:33Z","title":"Symmetry and asymmetry between positive and negative square energies of graphs","version":3},"cited_work":{"arxiv_id":"2311.11530","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.11530","snapshot_observed_at":"2026-08-12T22:01:39.274274Z","title":"Symmetry and asymmetry between positive and negative square energies of graphs","venue":"math.CO","work_id":"d1f05adb-c1ad-4366-9348-b586d525ca98","year":2023},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.094142Z"},"links":{"cited_paper":"/paper/2311.11530","citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:a3d1e3dfb0ccc99b547bbf5d30bab0efa6dff9f58bcb0e13ed280be403cb45e7","observation_id":"d8364ea3-9e44-40d9-8c0c-8068c9d35850","resolution":{"observed_at":"2026-08-12T22:01:39.279139Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.772500Z","title":"Erd˝ os, A","venue":null,"work_id":"b9c6f8bd-fd18-4016-ab3c-e909c7a02f0a","year":1983},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.098848Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:bacb65c75a4c7e54eaf9ef0a5dd9c0c7986865dcd02a9237b8bb3875290f6d24","observation_id":"04478cb7-cf31-4500-9968-078e6f8055de","resolution":{"observed_at":"2026-08-12T22:01:39.776739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.759047Z","title":"Continuous characterizations of the maximum clique proble m","venue":null,"work_id":"4da2df5d-a4a2-47d0-857c-81dc9ef146f6","year":1997},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.103079Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:95bea95393ac3850b3261fb7209f127fe675ced30b35eaf0756152deede8d732","observation_id":"8ef34a9d-8366-4571-82ab-0f55d19baec4","resolution":{"observed_at":"2026-08-12T22:01:39.763621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.745877Z","title":"Gr¨ otschel, L","venue":null,"work_id":"db98eaba-224d-41a7-adf5-dd3e7a9cac24","year":1986},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.107324Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:aced5649e0ff87f817c2adc69067c48e538df875c8491805927930de30e58faf","observation_id":"8834c1d4-a2de-4491-88da-ba85d577d10e","resolution":{"observed_at":"2026-08-12T22:01:39.750350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.647559Z","title":"New eigenvalue bound for the fract ional chromatic number","venue":null,"work_id":"6819bd6d-a1e1-4b5e-827c-b831ef0f90ab","year":2024},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.111718Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:acd14af0e60e83079287eacb7668dc196cfc23ffd27517a1b52585440c00ba44","observation_id":"52d0ff22-eb5d-4e15-90b7-f26e1854f4fb","resolution":{"observed_at":"2026-08-12T22:01:39.736333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.634232Z","title":"Clique is hard to approximate within n 1- ε","venue":null,"work_id":"19309e32-c4e7-4aa6-8ffb-1f53ba9eb7e4","year":1999},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.115972Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:e53d91c101be6a805e6c913868047e775034815a48d596a3b918c5c4f0a429d8","observation_id":"1f290161-d885-45e5-b898-ebc3a9a820e1","resolution":{"observed_at":"2026-08-12T22:01:39.638740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.620236Z","title":"Signed spect ral Tur´ an type theorems","venue":null,"work_id":"7ff8ba47-e830-4108-9214-3a42c015a263","year":2023},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.120823Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:e98fef79a5b3e584f27218f6b5e8264a3f6db1ab972798513ed18a3ebf9d6737","observation_id":"487f9ff5-2e83-4ba9-a435-a8f63d513cee","resolution":{"observed_at":"2026-08-12T22:01:39.624775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.605012Z","title":"Approximate graph coloring by semidefinite programming","venue":null,"work_id":"639ea623-1ab4-4697-bcaf-562439e1789d","year":1998},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.125040Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:e01d2f979d8fe0fd4ccfa586f44fa222c9fbcd294f7a3a98a55ee198923f7277","observation_id":"13e453a2-9489-4618-a602-fe9d42025eb3","resolution":{"observed_at":"2026-08-12T22:01:39.609699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"math/9312214","last_updated":"1993-12-06T00:00:00Z","snapshot_observed_at":"2026-07-07T06:06:50.957880Z","submitted_at":"1993-12-06T00:00:00Z","title":"The sandwich theorem","version":1},"cited_work":{"arxiv_id":"math/9312214","doi":null,"metadata_source":"pith","pith_arxiv_id":"math/9312214","snapshot_observed_at":"2026-08-12T22:01:39.255559Z","title":"The sandwich theorem","venue":"math.CO","work_id":"adfa5072-580b-4d26-b247-370858160189","year":1993},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.129689Z"},"links":{"cited_paper":"/paper/math/9312214","citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:e9d447c30fd16c5ec807f6bbfdf62d6dbea10ae7459799a702fa01a5b54a14ce","observation_id":"2831a5de-2d2b-43d8-802c-90dd70e5d236","resolution":{"observed_at":"2026-08-12T22:01:39.259912Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.19341","last_updated":"2024-07-27T21:11:29Z","snapshot_observed_at":"2026-08-16T17:32:53.228928Z","submitted_at":"2024-07-27T21:11:29Z","title":"Bollob\\'as-Nikiforov Conjecture for graphs with not so many triangles","version":1},"cited_work":{"arxiv_id":"2407.19341","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.19341","snapshot_observed_at":"2026-08-12T22:01:39.236551Z","title":"Bollob\\'as-Nikiforov Conjecture for graphs with not so many triangles","venue":"math.CO","work_id":"a78ea42a-c115-4e0b-a7a6-e578364c0f3b","year":2024},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.134872Z"},"links":{"cited_paper":"/paper/2407.19341","citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:bba1e99e7c732dbb4cf203b6a986afa6a0b2a7ef09e8db36b881111e7235a2b1","observation_id":"afeb0830-bf24-4e4f-b303-800aef63ccf3","resolution":{"observed_at":"2026-08-12T22:01:39.241303Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.590670Z","title":"Eigenvalues and triangle s in graphs","venue":null,"work_id":"2e7ada37-5576-4758-a730-02bc8b7de899","year":2021},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.139625Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:34d3bac852c02165f2534c5b770180cff402ad000158626144c1ad66aba03680","observation_id":"84bd2796-807b-46b9-8c2a-b9df3a5d98fd","resolution":{"observed_at":"2026-08-12T22:01:39.595857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.576617Z","title":"Unsolved problems in spectral graph theory","venue":null,"work_id":"b1dbc6c7-b5d6-43eb-bfc4-722f538059f8","year":2023},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.143702Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:ba1f91f9c2014d7634846b1c93451857ad9b35f47fc58402f709c698ce9b0735","observation_id":"18282d5d-4c42-4675-8e6c-6546cf975416","resolution":{"observed_at":"2026-08-12T22:01:39.581078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.561930Z","title":"New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities","venue":null,"work_id":"d893e653-99a2-4951-aa2c-1cb4eed92d91","year":1977},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.148014Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:499664b70c4b8e06657cd8b3f62dd578de38147be27d1d609de6be74924d4713","observation_id":"6172f750-3ebe-4e92-bead-ef2013995ea8","resolution":{"observed_at":"2026-08-12T22:01:39.566668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.548459Z","title":null,"venue":null,"work_id":"052f4226-f0d3-4bc7-bf9c-34240852488d","year":1965},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.152180Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:fb3db4ed33ece77f30b73427cfc3ee761dde4d13830dac3e29cfcd903fffe3af","observation_id":"3549b104-e5e1-4602-9f79-4985e8d8403e","resolution":{"observed_at":"2026-08-12T22:01:39.552837Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.534792Z","title":"Some inequalities for the largest eigenvalue of a graph","venue":null,"work_id":"90f8ab8c-82e4-447b-9350-1585ac1b325c","year":2002},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.156455Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:a1db0cac68750a47dfb3364771fa796b11a481744d000760c0d21c2287c8775e","observation_id":"753bbd11-f40f-4896-87f7-4c181eee3709","resolution":{"observed_at":"2026-08-12T22:01:39.539397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.521390Z","title":"Eigenvalues of graphs","venue":null,"work_id":"547f4a9b-fced-4634-9f1f-a4dad13c62d9","year":1970},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.160655Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:8cbefdba7525480463cf9fe28b402b7073f52e59f224a2b4e40017bdf514cf5d","observation_id":"cd7d4ba4-8a97-4e81-8f01-22ff48c0fc3e","resolution":{"observed_at":"2026-08-12T22:01:39.525436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.506969Z","title":"A comparison of the Delsarte and Lov´ as z bounds","venue":null,"work_id":"73ea0fa5-8aa9-4350-ae00-ddbed42b97af","year":1979},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.164883Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:3c4da26248b2a812b0c8cc3de049d2d519a7954adfd63d44c8498690a06ce69c","observation_id":"25338b64-c607-4ea6-926e-b68b1011e725","resolution":{"observed_at":"2026-08-12T22:01:39.512134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.491447Z","title":"Copositive and com- pletely positive matrices","venue":null,"work_id":"9cf8ecfc-6150-4621-8c3e-baa3da8469bf","year":2021},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.169305Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:3d69aac5fce284f4e7491dda61d51f29a245f66869e2be3735a4e9e5a78d28af","observation_id":"04e7cd03-7b94-48c8-88a6-719c3097014d","resolution":{"observed_at":"2026-08-12T22:01:39.496831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.02613","last_updated":"2020-03-15T18:16:54Z","snapshot_observed_at":"2026-08-14T17:47:27.920266Z","submitted_at":"2018-12-06T15:43:17Z","title":"More Tales of Hoffman: bounds for the vector chromatic number of a graph","version":3},"cited_work":{"arxiv_id":"1812.02613","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.02613","snapshot_observed_at":"2026-08-12T22:01:39.214943Z","title":"More Tales of Hoffman: bounds for the vector chromatic number of a graph","venue":"math.CO","work_id":"90a3c894-3850-4c4c-a20f-ee413ab36702","year":2018},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.173344Z"},"links":{"cited_paper":"/paper/1812.02613","citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:de5976e159058c889a7f3a32bebe6ea6c779422219e0d404f3f1a30ae49e07c5","observation_id":"256ea0d4-d2ba-4a29-adee-fdce344b5f6a","resolution":{"observed_at":"2026-08-12T22:01:39.221339Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.478218Z","title":"On the first two eigenvalues of regular grap hs","venue":null,"work_id":"848e2fb8-cf5d-44b4-976e-18e889b1a37e","year":2024},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.177800Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:8a101738ae15c9e5ddaa989b0c32300077e1f0319a084ace11827678c664006e","observation_id":"0697501f-cc18-4cb4-96d0-a0263e44d3c3","resolution":{"observed_at":"2026-08-12T22:01:39.482408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T22:01:39.462320Z","title":"Graph theory and additive combinatorics—exploring struct ure and randomness","venue":null,"work_id":"71e732c0-cb91-4069-9053-9052d43c300c","year":2023},"citing_paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T22:01:39.182038Z"},"links":{"citing_paper":"/paper/2411.08184"},"observation_digest":"sha256:41557aaa0ace2b2dd3fd4e7eae4b7dccfdd1b33f5ddf94293094223a2ad4d1ce","observation_id":"a82d38b4-205e-4f1f-a0aa-72bdfc52660d","resolution":{"observed_at":"2026-08-12T22:01:39.468794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.08184","last_updated":"2024-11-12T21:07:58Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T03:20:31.083263Z","submitted_at":"2024-11-12T21:07:58Z","title":"Conic programming to understand sums of squares of eigenvalues of graphs"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":5,"verified_fuzzy":23},"total_outbound_references":29},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 5 inbound Pith citation observations for arXiv:2411.08184."}