{"as_of":"2026-08-18T04:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0675b7411dad0516e6f1df1033c12e05c68c065b1700e5b1e554afeecae45391","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T05:44:54.426009Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T05:44:55.358363Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1412.6147","last_updated":"2014-12-17T18:49:49Z","snapshot_observed_at":"2026-08-14T23:07:08.325210Z","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-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},"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:f5fe4238a8f89d23a79638988ca55c847c3b2bf171cf0f347d658fae877a50d9","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1412.6147/citation-record","integrity":"/paper/1412.6147/integrity","json":"/paper/1412.6147/citation-record.json","paper":"/paper/1412.6147"},"outbound":[],"paper":{"arxiv_id":"1412.6147","last_updated":"2014-12-17T18:49:49Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-14T23:07:08.325210Z","submitted_at":"2014-12-17T18:49:49Z","title":"Maximizing algebraic connectivity for certain families of graphs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1412.6147."}