{"as_of":"2026-08-17T05:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc70248771b78626ec8387be885606e5e46cc0e9ae954a4d67a1ba20f59c0ab7","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-16T06:30:59.297886+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-14T10:40:45.856648Z","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-14T05:33:35.087992Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1802.09612","last_updated":"2020-08-13T21:56:38Z","snapshot_observed_at":"2026-08-16T18:34:48.021490Z","submitted_at":"2018-02-26T21:18:43Z","title":"MILE: A Multi-Level Framework for Scalable Graph Embedding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.09612","snapshot_observed_at":"2026-08-14T10:40:45.856648Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10697","last_updated":"2019-11-09T03:42:54Z","snapshot_observed_at":"2026-08-15T19:15:15.233998Z","submitted_at":"2019-08-28T12:53:01Z","title":"Initialization for Network Embedding: A Graph Partition Approach","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T10:40:45.856648Z"},"links":{"cited_paper":"/paper/1802.09612","citing_paper":"/paper/1908.10697"},"observation_digest":"sha256:37906f47f2ce08760330cb57f56313489f1aa62a63b6bb7fa98b34b66408207b","observation_id":"685b4ea6-898d-4c95-93c2-f6bf93d260ce","resolution":{"observed_at":"2026-08-14T10:40:45.856648Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.09612","last_updated":"2020-08-13T21:56:38Z","snapshot_observed_at":"2026-08-16T18:34:48.021490Z","submitted_at":"2018-02-26T21:18:43Z","title":"MILE: A Multi-Level Framework for Scalable Graph Embedding","version":2},"cited_work":{"arxiv_id":"1802.09612","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.09612","snapshot_observed_at":"2026-08-14T05:33:35.087992Z","title":"MILE: A Multi-Level Framework for Scalable Graph Embedding","venue":"cs.AI","work_id":"56ae3e30-3c1e-496d-bd5f-5dd0fcdb9e71","year":2018},"citing_paper":{"arxiv_id":"1909.00958","last_updated":"2019-09-03T05:21:31Z","snapshot_observed_at":"2026-08-16T18:16:13.162811Z","submitted_at":"2019-09-03T05:21:31Z","title":"Graph Representation Learning: A Survey","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-14T05:33:33.030978Z"},"links":{"cited_paper":"/paper/1802.09612","citing_paper":"/paper/1909.00958"},"observation_digest":"sha256:da20b136cd225b47c7560417c6f1c4d7c493a20669646e193589b02fb634ead7","observation_id":"ec2900d8-3391-40e0-9632-40ce39650326","resolution":{"observed_at":"2026-08-14T05:33:35.175945Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1802.09612/citation-record","integrity":"/paper/1802.09612/integrity","json":"/paper/1802.09612/citation-record.json","paper":"/paper/1802.09612"},"outbound":[],"paper":{"arxiv_id":"1802.09612","last_updated":"2020-08-13T21:56:38Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T18:34:48.021490Z","submitted_at":"2018-02-26T21:18:43Z","title":"MILE: A Multi-Level Framework for Scalable Graph Embedding"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1802.09612."}