{"as_of":"2026-08-20T13:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e5a371e240afd9867260efe1a156ed7aae95db7df3a81c535b8f15d13568998","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-20T06:33:59.587034+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-03T16:54:40.432941Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2503.01723","last_updated":"2025-03-03T16:37:38Z","snapshot_observed_at":"2026-08-16T12:53:31.812291Z","submitted_at":"2025-03-03T16:37:38Z","title":"How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01723","snapshot_observed_at":"2026-08-03T16:54:40.432941Z","title":"arXiv preprint arXiv:2503.01723","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2512.11610","last_updated":"2026-07-22T02:38:25Z","snapshot_observed_at":"2026-08-20T03:49:08.722707Z","submitted_at":"2025-12-12T14:48:18Z","title":"Euclidean Ideal Point Estimation From Roll-Call Data via Distance-Based Bipartite Network Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T16:54:40.432941Z"},"links":{"cited_paper":"/paper/2503.01723","citing_paper":"/paper/2512.11610"},"observation_digest":"sha256:ccd09f265047eaed3e7fa00fda857fe7c9f815c9c72f8cda41b4b9c3193599dd","observation_id":"39c3856f-359f-44fa-8e1d-1228403c1ee9","resolution":{"observed_at":"2026-08-03T16:54:40.432941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.01723/citation-record","integrity":"/paper/2503.01723/integrity","json":"/paper/2503.01723/citation-record.json","paper":"/paper/2503.01723"},"outbound":[],"paper":{"arxiv_id":"2503.01723","last_updated":"2025-03-03T16:37:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T12:53:31.812291Z","submitted_at":"2025-03-03T16:37:38Z","title":"How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2503.01723."}