{"as_of":"2026-08-13T22:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cbd69d1d364fa1a527b58342e0531495652c4d439645716385f1e3877ba4d7d9","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T13:29:53.791575Z","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-11T12:31:52.493648Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.02028","last_updated":"2023-12-04T16:50:27Z","snapshot_observed_at":"2026-08-13T19:19:06.094555Z","submitted_at":"2023-12-04T16:50:27Z","title":"Every $d(d+1)$-connected graph is globally rigid in $\\mathbb{R}^d$","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.02028","snapshot_observed_at":"2026-08-11T13:29:53.791575Z","title":"Vill´ anyi","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.13127","last_updated":"2024-12-17T17:45:23Z","snapshot_observed_at":"2026-08-13T19:20:58.720393Z","submitted_at":"2024-12-17T17:45:23Z","title":"On the Rigidity of Random Graphs in high-dimensional spaces","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T13:29:53.791575Z"},"links":{"cited_paper":"/paper/2312.02028","citing_paper":"/paper/2412.13127"},"observation_digest":"sha256:fe06eff17e6444a583d8f119785d4e3307308769b6031409203aefa1756dc12b","observation_id":"437638b3-1cb1-43e6-a0c2-90bfc23755ae","resolution":{"observed_at":"2026-08-11T13:29:53.791575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.02028","last_updated":"2023-12-04T16:50:27Z","snapshot_observed_at":"2026-08-13T19:19:06.094555Z","submitted_at":"2023-12-04T16:50:27Z","title":"Every $d(d+1)$-connected graph is globally rigid in $\\mathbb{R}^d$","version":1},"cited_work":{"arxiv_id":"2312.02028","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.02028","snapshot_observed_at":"2026-08-11T12:31:52.493648Z","title":"Every $d(d+1)$-connected graph is globally rigid in $\\mathbb{R}^d$","venue":"math.CO","work_id":"7d738eb4-3a80-4db5-ace7-f9dcd8e65a98","year":2023},"citing_paper":{"arxiv_id":"2412.14364","last_updated":"2024-12-18T22:02:44Z","snapshot_observed_at":"2026-08-11T12:16:04.779201Z","submitted_at":"2024-12-18T22:02:44Z","title":"Minimum degree conditions for graph rigidity","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T12:31:52.474286Z"},"links":{"cited_paper":"/paper/2312.02028","citing_paper":"/paper/2412.14364"},"observation_digest":"sha256:b60c58892931556e8764b59a50e3ba32b9ef6924bd18b56cbd054d57e3f7d0ea","observation_id":"a8f92060-ae81-47af-bea6-16a97044589d","resolution":{"observed_at":"2026-08-11T12:31:52.498561Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.02028/citation-record","integrity":"/paper/2312.02028/integrity","json":"/paper/2312.02028/citation-record.json","paper":"/paper/2312.02028"},"outbound":[],"paper":{"arxiv_id":"2312.02028","last_updated":"2023-12-04T16:50:27Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-13T19:19:06.094555Z","submitted_at":"2023-12-04T16:50:27Z","title":"Every $d(d+1)$-connected graph is globally rigid in $\\mathbb{R}^d$"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.02028."}