{"as_of":"2026-08-09T02:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6471509ff2f82f443cec7a8e1b246720a852b1ca4266653fdb7a09a26fd2fbdd","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T12:36:02.220999Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T06:54:21.426067Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.00020","last_updated":"2024-11-16T11:30:53Z","snapshot_observed_at":"2026-07-06T19:59:06.645605Z","submitted_at":"2024-11-16T11:30:53Z","title":"Partitioning Message Passing for Graph Fraud Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00020","snapshot_observed_at":"2026-08-06T12:36:02.220999Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.21653","last_updated":"2025-07-29T10:10:47Z","snapshot_observed_at":"2026-08-06T12:36:00.544371Z","submitted_at":"2025-07-29T10:10:47Z","title":"DGP: A Dual-Granularity Prompting Framework for Fraud Detection with Graph-Enhanced LLMs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T12:36:02.220999Z"},"links":{"cited_paper":"/paper/2412.00020","citing_paper":"/paper/2507.21653"},"observation_digest":"sha256:533e60393ba6e31e466fccfcc23f9f26a460f35d3698e9bdd543593eb55f63c1","observation_id":"25c85ca9-7ef8-4859-98d0-1a380820499b","resolution":{"observed_at":"2026-08-06T12:36:02.220999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00020","last_updated":"2024-11-16T11:30:53Z","snapshot_observed_at":"2026-07-06T19:59:06.645605Z","submitted_at":"2024-11-16T11:30:53Z","title":"Partitioning Message Passing for Graph Fraud Detection","version":1},"cited_work":{"arxiv_id":"2412.00020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00020","snapshot_observed_at":"2026-06-30T06:54:21.426067Z","title":"Partitioning message passing for graph fraud detection","venue":null,"work_id":"a344280c-2901-423d-a816-f89d744ee6ff","year":2024},"citing_paper":{"arxiv_id":"2604.12329","last_updated":"2026-04-14T06:04:37Z","snapshot_observed_at":"2026-07-06T23:00:32.607699Z","submitted_at":"2026-04-14T06:04:37Z","title":"UniDetect: LLM-Driven Universal Fraud Detection across Heterogeneous Blockchains","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T16:00:39.657115Z"},"links":{"cited_paper":"/paper/2412.00020","citing_paper":"/paper/2604.12329"},"observation_digest":"sha256:7bb82704b3d8f761b6c69cfa3f7d6071d60fab8519c9bcdf11293261b29c70f0","observation_id":"d3439a33-d9f0-43d0-853c-38aa7b50dc8e","resolution":{"observed_at":"2026-05-11T09:26:03.385751Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00020","last_updated":"2024-11-16T11:30:53Z","snapshot_observed_at":"2026-07-06T19:59:06.645605Z","submitted_at":"2024-11-16T11:30:53Z","title":"Partitioning Message Passing for Graph Fraud Detection","version":1},"cited_work":{"arxiv_id":"2412.00020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00020","snapshot_observed_at":"2026-06-30T06:54:21.426067Z","title":"Partitioning message passing for graph fraud detection","venue":null,"work_id":"a344280c-2901-423d-a816-f89d744ee6ff","year":2024},"citing_paper":{"arxiv_id":"2605.11749","last_updated":"2026-05-12T08:27:06Z","snapshot_observed_at":"2026-07-06T23:23:30.499023Z","submitted_at":"2026-05-12T08:27:06Z","title":"Learning Feature Encoder with Synthetic Anomalies for Weakly Supervised Graph Anomaly Detection","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-13T06:29:31.837409Z"},"links":{"cited_paper":"/paper/2412.00020","citing_paper":"/paper/2605.11749"},"observation_digest":"sha256:d0689f6ef3e96d544f039bb317a652f159d13d9af4a2268ae7c65edacb2af1e9","observation_id":"eb1d09ae-fcd4-49af-8867-faeebd29cf0f","resolution":{"observed_at":"2026-05-13T06:32:24.546727Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00020","last_updated":"2024-11-16T11:30:53Z","snapshot_observed_at":"2026-07-06T19:59:06.645605Z","submitted_at":"2024-11-16T11:30:53Z","title":"Partitioning Message Passing for Graph Fraud Detection","version":1},"cited_work":{"arxiv_id":"2412.00020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00020","snapshot_observed_at":"2026-06-30T06:54:21.426067Z","title":"Partitioning message passing for graph fraud detection","venue":null,"work_id":"a344280c-2901-423d-a816-f89d744ee6ff","year":2024},"citing_paper":{"arxiv_id":"2605.26040","last_updated":"2026-05-25T17:06:13Z","snapshot_observed_at":"2026-08-05T07:16:17.547116Z","submitted_at":"2026-05-25T17:06:13Z","title":"L2IR: Revealing Latent Intent in Graph Fraud Detection","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T21:43:17.919274Z"},"links":{"cited_paper":"/paper/2412.00020","citing_paper":"/paper/2605.26040"},"observation_digest":"sha256:513baf9a76dbecd7641f3ca1e79abf48596bcef8691cb44f15be49dbb584da38","observation_id":"a0f2c3c7-323f-4379-b7ad-bcf5a25f879a","resolution":{"observed_at":"2026-06-29T21:43:58.689014Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00020","last_updated":"2024-11-16T11:30:53Z","snapshot_observed_at":"2026-07-06T19:59:06.645605Z","submitted_at":"2024-11-16T11:30:53Z","title":"Partitioning Message Passing for Graph Fraud Detection","version":1},"cited_work":{"arxiv_id":"2412.00020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00020","snapshot_observed_at":"2026-06-30T06:54:21.426067Z","title":"Partitioning message passing for graph fraud detection","venue":null,"work_id":"a344280c-2901-423d-a816-f89d744ee6ff","year":2024},"citing_paper":{"arxiv_id":"2605.29526","last_updated":"2026-06-16T07:57:24Z","snapshot_observed_at":"2026-08-05T22:42:35.917712Z","submitted_at":"2026-05-28T07:43:20Z","title":"Temporal Motif-aware Graph Test-time Adaptation for OOD Blockchain Anomaly Detection","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T06:42:13.589935Z"},"links":{"cited_paper":"/paper/2412.00020","citing_paper":"/paper/2605.29526"},"observation_digest":"sha256:474aab15d03019063a7fcc4646cc15f042d129c650989ee655fe54eb46d6e6da","observation_id":"c908d363-b096-432c-a3c0-1f33d5a78d75","resolution":{"observed_at":"2026-06-29T06:43:10.321595Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2412.00020","last_updated":"2024-11-16T11:30:53Z","snapshot_observed_at":"2026-07-06T19:59:06.645605Z","submitted_at":"2024-11-16T11:30:53Z","title":"Partitioning Message Passing for Graph Fraud Detection","version":1},"cited_work":{"arxiv_id":"2412.00020","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.00020","snapshot_observed_at":"2026-06-30T06:54:21.426067Z","title":"Partitioning message passing for graph fraud detection","venue":null,"work_id":"a344280c-2901-423d-a816-f89d744ee6ff","year":2024},"citing_paper":{"arxiv_id":"2606.30009","last_updated":"2026-06-29T09:14:18Z","snapshot_observed_at":"2026-07-07T00:03:56.075924Z","submitted_at":"2026-06-29T09:14:18Z","title":"Node-to-Neighborhood Semantic Consistency: Text-Topology Alignment for TAGs Anomaly Detection","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-30T06:24:18.318819Z"},"links":{"cited_paper":"/paper/2412.00020","citing_paper":"/paper/2606.30009"},"observation_digest":"sha256:9c02383a3adba6d351ba942fdc780932ba215bf66c890115aaa056b57b4decce","observation_id":"94ba9cb2-092f-4ffd-b1eb-7cd21dfe1a38","resolution":{"observed_at":"2026-06-30T06:54:21.427632Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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.00020/citation-record","integrity":"/paper/2412.00020/integrity","json":"/paper/2412.00020/citation-record.json","paper":"/paper/2412.00020"},"outbound":[],"paper":{"arxiv_id":"2412.00020","last_updated":"2024-11-16T11:30:53Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T19:59:06.645605Z","submitted_at":"2024-11-16T11:30:53Z","title":"Partitioning Message Passing for Graph Fraud Detection"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2412.00020."}