{"as_of":"2026-08-21T23:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ee8a9ad8f54177b585d422faf6175d3e46c874addbdb6b9abc255dc8181791a","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:23:01.581619Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2608.09879/citation-record","integrity":"/paper/2608.09879/integrity","json":"/paper/2608.09879/citation-record.json","paper":"/paper/2608.09879"},"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-14T04:23:01.811756Z","title":null,"venue":null,"work_id":"56d65c6c-7354-418a-8fb1-d5dfe91aed01","year":null},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.516322Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:13706ec35c76804d1b95394432ea047a6dcde5a2aa4e899821c82bec04985fa1","observation_id":"f19cda7c-ee27-4fd8-b78b-a92399f3a3e6","resolution":{"observed_at":"2026-08-14T04:23:01.814435Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.801087Z","title":null,"venue":null,"work_id":"c16412f4-61c1-4507-89aa-f9cc7a6e009c","year":null},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.520346Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:9f25978701f685eb2567cec34d293268e22929548859836d53f9af79b6ab6a4a","observation_id":"002d811a-cbe6-4344-bdb3-3a2a8241c11b","resolution":{"observed_at":"2026-08-14T04:23:01.804716Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.792270Z","title":null,"venue":null,"work_id":"27805cc3-c904-4310-9608-81adbe3bf467","year":2016},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.527804Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:7ed9a0edd3866c57ad8988ecbe482745b655a8564cdea8b9cea8635b3d6c9856","observation_id":"cf868abf-5cad-4ff9-a2fd-81034e4b41f1","resolution":{"observed_at":"2026-08-14T04:23:01.795142Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.783169Z","title":"Fiedler,Algebraic connectivity of graphs, Czechoslovak Math","venue":null,"work_id":"06e0063b-c78e-4eb6-9743-5007632b4732","year":1973},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.531207Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:562349d28bf013fd365a63e429240b052586fbef3f089c1ae3606024c15d6b18","observation_id":"8b103aff-4494-4b9e-8daf-5cd58d4583de","resolution":{"observed_at":"2026-08-14T04:23:01.786661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.773885Z","title":"J.25(100)(1975), no","venue":null,"work_id":"63004ec0-8831-4e4b-86f8-7d60c6ca582c","year":1975},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.534048Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:fc94b01e3fcbc29aa2bfb562133adebdc793e05da7b93d7264ac1997b60cd3cc","observation_id":"b7701ece-4e03-4743-936c-e14b79ac2a66","resolution":{"observed_at":"2026-08-14T04:23:01.777239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.764520Z","title":null,"venue":null,"work_id":"868c7b2d-8010-446c-9d43-dedcae81510b","year":1959},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.537405Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:867176707fa18c50736d93a7248748cae5ea680253e6eb404221134eddcd9f7e","observation_id":"6354ae74-cce0-49b0-bc00-04c9f0aa013a","resolution":{"observed_at":"2026-08-14T04:23:01.767369Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.755432Z","title":null,"venue":null,"work_id":"7b1036cd-c758-4077-a78c-59dae890892b","year":2013},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.540994Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:db2c9760ce1f8ad3575d4eb5c6da8c30d4ce0f5b5d9b9bd4549c46d84438d7f2","observation_id":"721ab5e2-daad-4e10-bba2-a62d57ac54fd","resolution":{"observed_at":"2026-08-14T04:23:01.758460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.745299Z","title":"Kolokolnikov,Maximizing algebraic connectivity for certain families of graphs, Linear Algebra Appl.471(2015), 122–140","venue":null,"work_id":"6a8e4c11-f0ab-44a2-a2fd-15e9517e573a","year":2015},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.544135Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:ba9d9b2811fb8943107578c44bc95398690fbf9ca7f84d1624416d5be22c9b8f","observation_id":"54e6f28a-8c39-42f7-856d-073c4dcebac0","resolution":{"observed_at":"2026-08-14T04:23:01.748764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.735734Z","title":"2, 215–229","venue":null,"work_id":"dbcdceb7-d3d8-473c-b788-9e252aca4f34","year":2011},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.547522Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:f4bf338b64da0d347dffde01bbfe301ed0a71fc2cfd760e15cfe104710998921","observation_id":"b3defac7-eeb7-45dd-8ec0-1b6efb4ae900","resolution":{"observed_at":"2026-08-14T04:23:01.739070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.725376Z","title":"Lin and L","venue":null,"work_id":"06cc106b-798f-4991-8fb0-93a93e31252c","year":2022},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.551078Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:05a7cd2f8e9f5c321d3eb9011270f50a0f99c484342253e3f6f589d4f8da0f0f","observation_id":"031b4ebb-b3f5-4ea0-b579-2c1b9d26218b","resolution":{"observed_at":"2026-08-14T04:23:01.728580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.714786Z","title":null,"venue":null,"work_id":"b4940076-16de-4fff-b5b3-eb3b2809085a","year":2014},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.554122Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:2bc4664400fbcac25a6f0594733c9eb257aed901b576ab07d30cc1338d74a670","observation_id":"6c7c4c78-94b1-4116-9465-9e152c635d9b","resolution":{"observed_at":"2026-08-14T04:23:01.718059Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.704959Z","title":"Maas,Transportation in graphs and the admittance spectrum, Discrete Applied Math- ematics16(1987), no","venue":null,"work_id":"3963bedf-7cfd-4276-8f2f-77524149f9d8","year":1987},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.557075Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:1c1f2378d2c21e81c7f1362bc7bd1e691b31ed2c9652915e715990f7fd8e50df","observation_id":"43b5d8ff-0afd-4ed5-8950-9edc7b6eb751","resolution":{"observed_at":"2026-08-14T04:23:01.708384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.694902Z","title":"Merris,Characteristic vertices of trees, Linear and multilinear algebra22(1987), no","venue":null,"work_id":"9863bbcf-8bbe-4e73-86c0-ddc32c2756dc","year":1987},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.560117Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:978cbd930b85607c9a5ec19213731a06007cb3932c5a0f336f6d6aaaf63ec0b1","observation_id":"1c3c3c4e-3ae8-4719-b74f-bec154985a6c","resolution":{"observed_at":"2026-08-14T04:23:01.698284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.684253Z","title":"Mohar,The Laplacian spectrum of graphs, Graph theory, combinatorics, and appli- cations, Vol","venue":null,"work_id":"9838103f-c37c-42bc-8fc2-3936de51e83d","year":1988},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.563365Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:c4bf8822283f9a64b9806bb8ca1835621e75a9b20c20e98ab7ee1d44d2e117b6","observation_id":"5c66346d-b8ac-4187-9789-c54c508a2473","resolution":{"observed_at":"2026-08-14T04:23:01.687748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.673120Z","title":"109, 1992, Algebraic graph theory (Leibnitz, 1989), pp","venue":null,"work_id":"ad69f801-107c-405e-bd37-e574040b786f","year":1992},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.566387Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:6ec3c4fd5e38526dbfa180f5b11ec90eb39c2ac5db296d44fbcf7f5ba1b5b8b5","observation_id":"d7326cb0-126a-42f7-98b5-31821f1b2c28","resolution":{"observed_at":"2026-08-14T04:23:01.676632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.661810Z","title":"6, 677–679","venue":null,"work_id":"2c86a9cd-5089-4aac-afc7-8a6f9c961b1f","year":2008},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.569461Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:a8f2641e46513f2ce454b4b488c39d44e70249fc880f221f005b018e7ef4c4d3","observation_id":"b7bb71fe-6b83-4c59-a392-f36793605e41","resolution":{"observed_at":"2026-08-14T04:23:01.665251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.649455Z","title":"Nozaki,Linear programming bounds for regular graphs, Graphs Combin.31(2015), no","venue":null,"work_id":"455bfc14-7153-430f-877c-37a7ae5ad547","year":2015},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.572528Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:8b6dacbbbebd24058dfe62c8c16c18ee76ee6d17457410e260f2e499660c73aa","observation_id":"ea37489a-fc77-437f-bff9-af00ca9aaaa4","resolution":{"observed_at":"2026-08-14T04:23:01.653504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T04:23:01.638052Z","title":null,"venue":null,"work_id":"2b03a327-4cd7-4bf3-a992-833570c396ce","year":2007},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.577852Z"},"links":{"citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:1d8f8cff98a0fc6250852d288147dbd098f66b7cab9ec532e6832152cb17de2c","observation_id":"346bee28-22b6-4507-afba-5d696d0d3165","resolution":{"observed_at":"2026-08-14T04:23:01.641664Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-15T12:47:35.207743Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2608.07360","snapshot_observed_at":"2026-08-14T04:23:01.581619Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.581619Z"},"links":{"cited_paper":"/paper/2608.07360","citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:0fcfd69d07eeafbc160a99454e5e58911d4c01d10b994a17d495617fbe93151a","observation_id":"861176bf-2eaf-441d-aad4-60b0165c7d31","resolution":{"observed_at":"2026-08-14T04:23:01.581619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2608.09822","last_updated":"2026-08-10T16:40:16Z","snapshot_observed_at":"2026-08-18T03:07:32.521774Z","submitted_at":"2026-08-10T16:40:16Z","title":"On a conjecture of Kolokolnikov on algebraic connectivity","version":1},"cited_work":{"arxiv_id":"2608.09822","doi":null,"metadata_source":"pith","pith_arxiv_id":"2608.09822","snapshot_observed_at":"2026-08-14T04:23:01.624083Z","title":"On a conjecture of Kolokolnikov on algebraic connectivity","venue":"math.CO","work_id":"9b52c495-2ad2-4850-bf3b-685f7ab940d2","year":2026},"citing_paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov","version":2},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-14T04:23:01.523759Z"},"links":{"cited_paper":"/paper/2608.09822","citing_paper":"/paper/2608.09879"},"observation_digest":"sha256:1b562a961cc67b928b2f340218b408bdc2dce9446957784695f7a4b581eb31ab","observation_id":"33ee5fce-9360-4d7b-ab42-f1e11ee7ec6b","resolution":{"observed_at":"2026-08-14T04:23:01.629473Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.09879","last_updated":"2026-08-13T17:44:34Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-18T03:58:18.013657Z","submitted_at":"2026-08-10T17:32:53Z","title":"Maximizing the algebraic connectivity of graphs of given order and size: a proof of a conjecture of Kolokolnikov"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":11},"total_outbound_references":20},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2608.09879."}