{"as_of":"2026-08-12T20:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e78827e871e1650da8f13c20594c4c2ea3260a5dd24c38239670255600a2c3a1","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-12T06:34:41.77262+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-11T15:08:15.680167Z","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-07T14:44:04.913218Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1903.08889","last_updated":"2021-05-19T17:58:06Z","snapshot_observed_at":"2026-08-12T14:06:32.247570Z","submitted_at":"2019-03-21T09:15:09Z","title":"Node Embedding over Temporal Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.08889","snapshot_observed_at":"2026-08-11T15:08:15.680167Z","title":"Singer, I","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11293","last_updated":"2025-05-12T17:41:35Z","snapshot_observed_at":"2026-08-12T20:24:05.034212Z","submitted_at":"2024-12-15T19:56:56Z","title":"A Comparative Study on Dynamic Graph Embedding based on Mamba and Transformers","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T15:08:15.680167Z"},"links":{"cited_paper":"/paper/1903.08889","citing_paper":"/paper/2412.11293"},"observation_digest":"sha256:093292ed4f6ea6322384f551f86e807e0dd18efae5681032afafbd46bbbce568","observation_id":"cb634063-58c0-4b73-9072-3d27340696f0","resolution":{"observed_at":"2026-08-11T15:08:15.680167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.08889","last_updated":"2021-05-19T17:58:06Z","snapshot_observed_at":"2026-08-12T14:06:32.247570Z","submitted_at":"2019-03-21T09:15:09Z","title":"Node Embedding over Temporal Graphs","version":3},"cited_work":{"arxiv_id":"1903.08889","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.08889","snapshot_observed_at":"2026-08-07T14:44:04.913218Z","title":"Node Embedding over Temporal Graphs","venue":"cs.LG","work_id":"3f4b1fa3-b77c-4754-9754-73ff72b21136","year":2019},"citing_paper":{"arxiv_id":"2505.17764","last_updated":"2025-07-23T10:37:00Z","snapshot_observed_at":"2026-08-09T23:00:46.867122Z","submitted_at":"2025-05-23T11:35:24Z","title":"Dynamic Graph Embedding Through Hub-aware Random Walks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:44:04.238877Z"},"links":{"cited_paper":"/paper/1903.08889","citing_paper":"/paper/2505.17764"},"observation_digest":"sha256:c98c4bec3ea23092009162427be96bb67b76cd74d0ba3c4e29f616016e635193","observation_id":"ea4e1382-3bf4-4dd9-8e9d-e8bb9310853b","resolution":{"observed_at":"2026-08-07T14:44:05.010993Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1903.08889/citation-record","integrity":"/paper/1903.08889/integrity","json":"/paper/1903.08889/citation-record.json","paper":"/paper/1903.08889"},"outbound":[],"paper":{"arxiv_id":"1903.08889","last_updated":"2021-05-19T17:58:06Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T14:06:32.247570Z","submitted_at":"2019-03-21T09:15:09Z","title":"Node Embedding over Temporal 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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1903.08889."}