{"as_of":"2026-08-10T21:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b774acc83472fdb9df1339bda8a7869b9d2fed68c0c3d60d545fc8662f80b701","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T05:44:54.454255Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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.07360/citation-record","integrity":"/paper/2608.07360/integrity","json":"/paper/2608.07360/citation-record.json","paper":"/paper/2608.07360"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:44:54.402131Z","title":"The Moore bound for irregular graphs","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.402131Z"},"links":{"citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:9dae254fe1e48a6195fd65972b242b05d4073ffca0bcaeee91272f4bd4320874","observation_id":"7b683b4d-bdbc-477e-981e-3fa0e9532c40","resolution":{"observed_at":"2026-08-10T05:44:54.402131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:44:54.407105Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.407105Z"},"links":{"citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:f4982b9b28bfb7295b8f78f75d8715dfe5fb919cdeb3e37da514a68ace22a0dc","observation_id":"959ee62f-3708-4a18-9df0-7e0e434e3ea4","resolution":{"observed_at":"2026-08-10T05:44:54.407105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19413","last_updated":"2025-04-28T01:46:35Z","snapshot_observed_at":"2026-08-02T07:32:11.339534Z","submitted_at":"2025-04-28T01:46:35Z","title":"Mem0: Building Production-Ready AI Agents with Scalable Long-Term Memory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.19413","snapshot_observed_at":"2026-08-10T05:44:54.411297Z","title":"Chhikara, D","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.411297Z"},"links":{"cited_paper":"/paper/2504.19413","citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:d7d7744e0a557b461fa2ea7ac450e783defea1ef287b2c67c60bd6a7d1058ab3","observation_id":"87db64be-f9f8-4d9c-9200-1c0f4b361c6d","resolution":{"observed_at":"2026-08-10T05:44:54.411297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:44:55.553660Z","title":"Algebraic connectivity of graphs","venue":null,"work_id":"7b89456e-796a-4cac-9330-dd65735cae06","year":1973},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.416391Z"},"links":{"citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:5b18fc20643a7145adebbb93546d478b749458ae34208656826aa1913b45b279","observation_id":"55a1be74-8c46-4c4a-bee5-a5bdf04a5781","resolution":{"observed_at":"2026-08-10T05:44:55.558285Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:44:54.421001Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.421001Z"},"links":{"citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:916987814c13dc7cb3a8b21ffaf881727fe5ac7cc02c25565b183cb3904a076f","observation_id":"cf145f56-ffae-4824-8ccb-5d99fa904263","resolution":{"observed_at":"2026-08-10T05:44:54.421001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6147","last_updated":"2014-12-17T18:49:49Z","snapshot_observed_at":"2026-07-06T04:04:08.825063Z","submitted_at":"2014-12-17T18:49:49Z","title":"Maximizing algebraic connectivity for certain families of graphs","version":1},"cited_work":{"arxiv_id":"1412.6147","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.6147","snapshot_observed_at":"2026-08-10T05:44:55.358363Z","title":"Maximizing algebraic connectivity for certain families of graphs","venue":"cs.DM","work_id":"57e1a916-6630-4f9a-9d7c-56e84353e669","year":2014},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.426009Z"},"links":{"cited_paper":"/paper/1412.6147","citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:abe84b35a1fd4f2bd80aacf8bf8b17d0fba702861d27d6bc44634fc88ba5c7b4","observation_id":"33a1ecb8-7124-45e7-b4bf-af99d388a0e3","resolution":{"observed_at":"2026-08-10T05:44:55.363460Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.26959","last_updated":"2026-05-27T04:48:39Z","snapshot_observed_at":"2026-08-09T03:49:28.784182Z","submitted_at":"2026-05-26T12:49:49Z","title":"MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving","version":2},"cited_work":{"arxiv_id":"2605.26959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.26959","snapshot_observed_at":"2026-08-10T05:44:55.336865Z","title":"MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving","venue":"cs.LO","work_id":"77803f90-d260-47dd-9b07-c5dd380002ad","year":2026},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.431365Z"},"links":{"cited_paper":"/paper/2605.26959","citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:160a83b17f6223ecef91c8157fb89ae31bad7697af9fbb7d6ab76e6fe9879c64","observation_id":"ca86a389-b365-4884-bd4e-23139050df87","resolution":{"observed_at":"2026-08-10T05:44:55.341613Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:44:54.436144Z","title":"The Lean 4 theorem prover and programming language","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.436144Z"},"links":{"citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:e1279798045a347fead10cd513ba735ddbe5224667ac0ed671e7bce070db4932","observation_id":"ae7dc91d-d704-4494-921c-ab1f8bfd42c4","resolution":{"observed_at":"2026-08-10T05:44:54.436144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:44:55.316098Z","title":"Maximizing Algebraic Connectivity in the Space of Graphs with a Fixed Number of Vertices and Edges","venue":null,"work_id":"07694b08-c87f-4cf1-a6bf-5ae3310e5656","year":2017},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.440545Z"},"links":{"citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:ac86631ee282d5268278da0487c0c60e0e98cca58cb2035da6e67c09ceb19c28","observation_id":"b74713c4-90e2-4ce4-a883-ab6490223ddb","resolution":{"observed_at":"2026-08-10T05:44:55.321513Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:44:54.444972Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.444972Z"},"links":{"citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:f0eafe13a243a65b446ae5c7fce9b97cfbd84408e8879a2b7ff486f271b0a335","observation_id":"75e7f471-3a6a-403f-a01d-e906d5b3f973","resolution":{"observed_at":"2026-08-10T05:44:54.444972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:44:54.729354Z","title":"Algebraic Connectivity: Local and Global Max- imizer Graphs","venue":null,"work_id":"11db9c28-d284-4ed4-9e00-d665fcc93626","year":2023},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.449306Z"},"links":{"citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:fd2d625aa49aaf168ae04bb75476cbc08284011fb38a319838ec42076fca64a5","observation_id":"ee7c7173-a9e2-412a-aab7-5b25ad76042a","resolution":{"observed_at":"2026-08-10T05:44:54.736174Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.09336","last_updated":"2019-12-16T20:37:52Z","snapshot_observed_at":"2026-08-09T13:59:18.708382Z","submitted_at":"2019-10-21T13:08:24Z","title":"The Lean mathematical library","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.09336","snapshot_observed_at":"2026-08-10T05:44:54.454255Z","title":"2019.doi:10","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.454255Z"},"links":{"cited_paper":"/paper/1910.09336","citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:2c5871ea0918944f2e64e6c6f928be7fa5e6d4075c2626c5f1e29574d5e21ac6","observation_id":"bc4ede93-258d-4fd3-95fd-0ab92ba94ddc","resolution":{"observed_at":"2026-08-10T05:44:54.454255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T21:13:52.673983Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":12},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2608.07360."}