{"as_of":"2026-08-13T10:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:165ace255270664d9eba1e25436f10ccf8086144886aa1e53f1987c7205a004a","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-13T06:32:02.005865+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-11T20:12:25.225632Z","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-11T20:12:25.854952Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.14367","last_updated":"2024-02-22T08:11:22Z","snapshot_observed_at":"2026-08-13T04:13:06.153575Z","submitted_at":"2024-02-22T08:11:22Z","title":"Representation Learning for Frequent Subgraph Mining","version":1},"cited_work":{"arxiv_id":"2402.14367","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.14367","snapshot_observed_at":"2026-08-11T20:12:25.854952Z","title":"Representation Learning for Frequent Subgraph Mining","venue":"cs.LG","work_id":"5f6ade7f-37b0-48a3-8595-e2d283341d26","year":2024},"citing_paper":{"arxiv_id":"2412.05957","last_updated":"2024-12-08T14:30:21Z","snapshot_observed_at":"2026-08-12T11:33:47.837071Z","submitted_at":"2024-12-08T14:30:21Z","title":"A Two-Stage AI-Powered Motif Mining Method for Efficient Power System Topological Analysis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T20:12:25.225632Z"},"links":{"cited_paper":"/paper/2402.14367","citing_paper":"/paper/2412.05957"},"observation_digest":"sha256:7466a6f552a019ede68b94b3081ff087a30da16806d6dd93e9e5a105c7403c7a","observation_id":"464382f0-b226-475f-bc23-f09b65fd0d7e","resolution":{"observed_at":"2026-08-11T20:12:25.860745Z","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/2402.14367/citation-record","integrity":"/paper/2402.14367/integrity","json":"/paper/2402.14367/citation-record.json","paper":"/paper/2402.14367"},"outbound":[],"paper":{"arxiv_id":"2402.14367","last_updated":"2024-02-22T08:11:22Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T04:13:06.153575Z","submitted_at":"2024-02-22T08:11:22Z","title":"Representation Learning for Frequent Subgraph Mining"},"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 1 inbound Pith citation observation for arXiv:2402.14367."}