{"as_of":"2026-08-08T11:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5478ffaa4342056b636aa9a7618115f9900bccf195f59b58f2f8d95ccab0d59e","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-08T06:32:00.761636+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-06T13:08:47.383053Z","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-06T13:08:49.966193Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.08810","last_updated":"2024-12-11T22:53:27Z","snapshot_observed_at":"2026-08-06T11:26:37.622374Z","submitted_at":"2024-12-11T22:53:27Z","title":"Efficient Dynamic Attributed Graph Generation","version":1},"cited_work":{"arxiv_id":"2412.08810","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.08810","snapshot_observed_at":"2026-08-06T13:08:49.966193Z","title":"Efficient Dynamic Attributed Graph Generation","venue":"cs.DB","work_id":"8e2df9a8-a362-4eee-8502-794c2730d3a7","year":2024},"citing_paper":{"arxiv_id":"2507.20967","last_updated":"2025-07-28T16:22:50Z","snapshot_observed_at":"2026-08-07T05:41:14.324729Z","submitted_at":"2025-07-28T16:22:50Z","title":"PROVCREATOR: Synthesizing Complex Heterogenous Graphs with Node and Edge Attributes","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T13:08:47.383053Z"},"links":{"cited_paper":"/paper/2412.08810","citing_paper":"/paper/2507.20967"},"observation_digest":"sha256:92d1d940f86152978634fb4f4655bd1e4aac1dd7dbd7ab0cbafa7e1a8e334c9d","observation_id":"573cf6f6-ff1b-447a-ab22-3a3114492945","resolution":{"observed_at":"2026-08-06T13:08:50.058832Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.08810/citation-record","integrity":"/paper/2412.08810/integrity","json":"/paper/2412.08810/citation-record.json","paper":"/paper/2412.08810"},"outbound":[],"paper":{"arxiv_id":"2412.08810","last_updated":"2024-12-11T22:53:27Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-06T11:26:37.622374Z","submitted_at":"2024-12-11T22:53:27Z","title":"Efficient Dynamic Attributed Graph Generation"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2412.08810."}