{"as_of":"2026-07-15T09:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:44bf0fb6011f6a9b7789ebfaa4b2b7a7bf52ede6c0bf0bd5e6d46aba97ab42fc","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T02:29:35.503535Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-15T06:30:58.975436+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/2605.21998/citation-record","integrity":"/paper/2605.21998/integrity","json":"/paper/2605.21998/citation-record.json","paper":"/paper/2605.21998"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Boesch, S","venue":null,"work_id":"a007605f-46e5-4301-a9ac-12e30c8ce040","year":1978},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:ec2ae83c602c3367b5f50ab94c16effe6614db6fef3daf534c5e1b2f3d2f232e","observation_id":"6062ca30-4308-497d-804d-a7d60a0e02be","resolution":{"observed_at":"2026-05-22T02:30:56.758404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Brualdi, A","venue":null,"work_id":"5f314cd7-fddd-4c60-8e50-30db123efb0b","year":1985},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:d061216552a71365eaa3f19884a23861db1ac7e22f2abc0e0cc8f19ee8289e85","observation_id":"fd299d40-83ca-4774-b190-7b32e1d61397","resolution":{"observed_at":"2026-05-22T02:30:56.764947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Brualdi, E.S","venue":null,"work_id":"d55fd051-97dc-4584-953a-7ef269599e82","year":1986},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:5e25d3cee6ecb2395b9a970b632665072eb6c5b403e359aac2bcc8d1e468dcac","observation_id":"e90f1c2a-f9da-405d-93b2-273a2bfa71a4","resolution":{"observed_at":"2026-05-22T02:30:56.755394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Chandran, Minimum cuts, girth and spectral threshold,Inform","venue":null,"work_id":"e2f2d851-d375-4e86-b582-2ccf317a8115","year":2004},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:1e8e30bc003fe2ebfc5bf017f54feccece32d103b4960f75a7ce37e3322cf78a","observation_id":"2be58fc3-ebff-4498-83c4-45f148103d90","resolution":{"observed_at":"2026-05-22T02:30:56.704921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Chen, L.T","venue":null,"work_id":"f27de95d-e6e9-44c3-a5b8-118ff65b1a47","year":2019},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:bf6ba8aaae27284e4fc053dc2e263963868c5968357989861babfed662fc106d","observation_id":"d56511c1-5236-4d3b-85d9-208010a13efd","resolution":{"observed_at":"2026-05-22T02:30:56.752257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Cioab˘ a, Eigenvalues and edge-connectivity of regular graphs,Linear Algebra Appl.,432(2010) 458–470","venue":null,"work_id":"e8989de4-5fe0-4e1e-8ff1-2d5df1c8cb3e","year":2010},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:347cf422003f0c74ebe5b780246c0241b667dbde2e810d6daae38e22fd168b65","observation_id":"03cdae18-689e-47cd-8f1e-0a64d3df4520","resolution":{"observed_at":"2026-05-22T02:30:56.683502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Cvetovi´ c, P","venue":null,"work_id":"55b2e2ec-14ed-43d6-9654-45222bd23981","year":2010},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:a954c1df9b4702ccf909226aa15696c9d68ec6a8408b57e5b5808c133890767e","observation_id":"8be5f97d-602e-4cd6-90a6-cfed536d14ab","resolution":{"observed_at":"2026-05-22T02:30:56.707877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Fan, X.F","venue":null,"work_id":"fbae08b9-80a2-466a-a42d-f8e40cecf4b0","year":2023},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:f6d22ab149d30395fd6091380bdf6676ee4d0bef05239967eb9eb13c13e0fa85","observation_id":"ba1fa353-27fc-45b5-9b28-914ed794bdad","resolution":{"observed_at":"2026-05-22T02:30:56.745939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Fan, X.F","venue":null,"work_id":"93f31362-0aab-4992-a989-c22d2ad5b189","year":2024},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:8789d3a08d3b2e0f3fbe4800e99121eb5aeecfce7c67fcba349b64eca127775a","observation_id":"25a476d2-2022-48f9-9df5-4366c6e8d954","resolution":{"observed_at":"2026-05-22T02:30:56.697943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Gu, H.-J","venue":null,"work_id":"080ed735-3559-4ee0-9762-c3bc27cdcc32","year":2016},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:cbd2f324304a2a2d81042412392ab2af355ad056e80d20606db6f08667ffac1c","observation_id":"4451e330-fb7a-46a3-999d-48b2fbbee8e6","resolution":{"observed_at":"2026-05-22T02:30:56.739497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Hennayake, H.-J","venue":null,"work_id":"f1f94bb5-8558-4a6b-99f1-8fca2ea08a1e","year":2003},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:0d5dc5611e5e3090d08947e800761c8cde191c2f3142734ef6aa8e890766162c","observation_id":"156c14e8-9592-43c8-90e6-36bb9953c797","resolution":{"observed_at":"2026-05-22T02:30:56.767889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Hong, J.L","venue":null,"work_id":"8a870872-086e-4f92-b835-b929f2387003","year":2001},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:a5e6b5118b748df47f7ffaa703787c69c2eb3add77b3423c08fa2fde3a5e91a1","observation_id":"7b50162b-6a57-4db4-b986-1e8cfdc63d28","resolution":{"observed_at":"2026-05-22T02:30:56.701724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Horn, C.R","venue":null,"work_id":"036a688b-9e39-4edb-b059-a07b0aafdaff","year":1985},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:28e43f2cd3e94e206d8a0f1dce6929a231d49a748ac19360211ba7c1bf97ace9","observation_id":"fd0919a3-e21f-4bcb-a1aa-adaf01bb9961","resolution":{"observed_at":"2026-05-22T02:30:56.761510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"63d704f4-c199-46b4-94a3-321ded5646b5","year":2021},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:928c6948a54111649edb2a4b2a3432339d86dc6085843dd2c86f614d0048fd0c","observation_id":"956aee98-b46f-42d4-a9ee-0b25e591800f","resolution":{"observed_at":"2026-05-22T02:30:56.736280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Lou, C.X","venue":null,"work_id":"b1aee83a-a585-4dcf-b332-5b663a92f4c2","year":2025},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:db6979ad405d58c02cfbab5c939a6b95ba042b62bdb176d22941fe31d5caa0c7","observation_id":"a6970cb2-3b27-4fe9-921f-2b6663a2dd8f","resolution":{"observed_at":"2026-05-22T02:30:56.733225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8dbb8ace-7cb2-4188-93a6-9fe6a6479fa7","year":2023},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:2780a742db236aa80edd9f74057be61388eb4530b74288c8250f6caa04621165","observation_id":"b345bb7b-2d0b-4dc4-a987-fc81eab1c479","resolution":{"observed_at":"2026-05-22T02:30:56.686979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Mader, ¨Uber minimaln-fach zusammenhangende, unendliche Graphen und ein Extremal problem, Archiv","venue":null,"work_id":"dec5d56c-f6d5-4770-91d7-1fb101cd85ce","year":1972},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:3cee98d86eb628b4d42fdf5ba8214ad92e12c8631e2b41aa44fd2d3aa0155170","observation_id":"a1fe2cc9-7b09-4d75-9b92-5087eec1bcb2","resolution":{"observed_at":"2026-05-22T02:30:56.749116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Nikiforov, Some inequalities for the largest eigenvalue of a graph,Combin","venue":null,"work_id":"2341ae5f-dc90-4555-a651-de04a808f2e9","year":2002},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:74fa078b032fe76b6f267f9077664ae5df6d283ac1b7dc681fed65ef918e6f61","observation_id":"f8212afc-437e-4e4c-9e8d-005b8664a1e3","resolution":{"observed_at":"2026-05-22T02:30:56.730177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b3b33f1d-7cd4-492b-9cc0-7b76f97303b8","year":2018},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:40f272bccf597e6a0422f6dc5f9026ab8ce93c9cd2707956f4acbdfa4f5a65fe","observation_id":"2185df98-b0d0-4356-801a-87b9d454c688","resolution":{"observed_at":"2026-05-22T02:30:56.726546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Nosal, Eigenvalues of Graphs (Master s thesis), University of Calgary","venue":null,"work_id":"8f32a0af-419d-4b1f-8a35-e9aba6f8b109","year":1970},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:f328c492d24c8908bc6571ab20d0d0e17cf8416683556fb8940277afc1a25966","observation_id":"fc6a0263-da20-4c90-8356-24666c882cd8","resolution":{"observed_at":"2026-05-22T02:30:56.720615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Oellermann, Explorations into graph connectivity,SAMS Notices,20(1988) 117–151","venue":null,"work_id":"ba78664a-4b92-4805-abd7-e98745efec2d","year":1988},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:91675f0448370afc8cb4ff5fd89bc87bf1b060f538cfdf5c35a4238322f469b4","observation_id":"1b271e84-bd49-413f-b16a-22e805d5f1b4","resolution":{"observed_at":"2026-05-22T02:30:56.771036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Stanley, A bound on the spectral radius of graphs witheedges,Linear Algebra Appl.,87(1987) 267–269","venue":null,"work_id":"76945ac5-33b6-4a5a-8cb8-6a20a1d59a13","year":1987},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:98ae0fb6006f3ec18ed04507889f72661ea86f022b0ed4995afa95811a022c13","observation_id":"2bf1cc42-81d8-4744-a439-179aec0625b1","resolution":{"observed_at":"2026-05-22T02:30:56.717426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Wang, J-M","venue":null,"work_id":"27ed40b7-5edd-4964-a2ef-25a91fe8de6d","year":2020},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:2b0dc54b5f1c406a667dd5619d57effdd90dfd91c0a878646adc38ef1de93452","observation_id":"da081e82-3fa3-4142-a72d-915b3e5821fb","resolution":{"observed_at":"2026-05-22T02:30:56.693687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Wang, H.Q","venue":null,"work_id":"9c954310-860b-474a-b2e8-c2c86212bb81","year":2024},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:0320fd15342d9cd79b963368c677aa636a517d9326b4cbd6ed0cd64699f8d73c","observation_id":"50589ef7-3d6a-4223-adac-6e9a0f615beb","resolution":{"observed_at":"2026-05-22T02:30:56.713945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c1e14c3d-c1bf-4b17-ac08-2a38adb3c19e","year":2005},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:bc632cd28ccce68fb97296638797e6b626ae516a61a47f12dfe292e26e655ecc","observation_id":"7ccef498-4438-4bc1-890c-85ec6be20f66","resolution":{"observed_at":"2026-05-22T02:30:56.710851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Xue, R.F","venue":null,"work_id":"755116a4-bd9f-48b6-86e2-5deaf6ab728a","year":2020},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:60ffe3d468bd70c5729f14b45db00ca000f96b68cdee0bdd3c5607eb8eeddac4","observation_id":"5a8e3ec9-5296-45b0-acf9-07ea6bab6555","resolution":{"observed_at":"2026-05-22T02:30:56.742702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Zhai, H.Q","venue":null,"work_id":"cab483dc-c861-45f7-8431-41770c8ce0a8","year":2021},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:090a9295dc39c371a2639f5408c6a39cb355530a4a85e0984447fec906db35ad","observation_id":"f01b4883-c335-4064-bd58-4615cffd9ed3","resolution":{"observed_at":"2026-05-22T02:30:56.723627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+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-06-05T21:23:00.469572Z","title":"Zhai, H.Q","venue":null,"work_id":"4dd8b25f-d9c3-47a3-aa7c-e0cb4c48e3bf","year":2025},"citing_paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-22T02:29:35.503535Z"},"links":{"citing_paper":"/paper/2605.21998"},"observation_digest":"sha256:adc88c5b892c7b61625dc403ab64dd84d0d495f774fd6bb2f5ad8ae8b623a9e4","observation_id":"fb2b3e08-ba0e-45e6-bcfb-4ff82f3cf246","resolution":{"observed_at":"2026-05-22T02:30:56.690383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-15T06:30:58.975436+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.21998","last_updated":"2026-05-21T04:56:01Z","latest_version":1,"primary_category":"math.SP","snapshot_observed_at":"2026-07-06T23:32:25.286443Z","submitted_at":"2026-05-21T04:56:01Z","title":"Minimally $(k,k)$-edge-connected graphs via spectral radius"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":28},"total_outbound_references":28},"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-07-15T06:30:58.975436+00:00","source":"crossref"},{"observed_at":"2026-07-15T06:30:54.025283+00:00","source":"retraction_watch"}],"thesis":"As of 15 July 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2605.21998."}