{"as_of":"2026-08-15T03:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9218d37ce75f07a5ee299f601a20944d3e5cc08abd38dfd1cff385b58a9871ad","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-14T06:32:32.682623+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-01T05:03:38.143834Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.12339","last_updated":"2026-07-25T10:42:01Z","snapshot_observed_at":"2026-08-12T22:59:20.699881Z","submitted_at":"2024-08-22T12:35:13Z","title":"Graphon estimation beyond binary edges: inference for decorated graphs with applications to multiplex and weighted networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12339","snapshot_observed_at":"2026-08-01T05:03:38.143834Z","title":"Inference for decorated graphs and applica- tion to multiplex networks.arXiv preprint arXiv:2408.12339, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22383","last_updated":"2026-07-24T15:08:24Z","snapshot_observed_at":"2026-08-12T14:48:28.857766Z","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T05:03:38.143834Z"},"links":{"cited_paper":"/paper/2408.12339","citing_paper":"/paper/2607.22383"},"observation_digest":"sha256:2a26812f06604c1e3a4308c23e6f427024427a903e415143e49f80eaa6e6383c","observation_id":"c2228855-e57e-48a7-a02c-331a3075b7e1","resolution":{"observed_at":"2026-08-01T05:03:38.143834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12339","last_updated":"2026-07-25T10:42:01Z","snapshot_observed_at":"2026-08-12T22:59:20.699881Z","submitted_at":"2024-08-22T12:35:13Z","title":"Graphon estimation beyond binary edges: inference for decorated graphs with applications to multiplex and weighted networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12339","snapshot_observed_at":"2026-08-01T03:34:43.463710Z","title":"2408.12339 , eprinttype =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23145","last_updated":"2026-07-25T10:54:51Z","snapshot_observed_at":"2026-08-07T00:05:55.774650Z","submitted_at":"2026-07-25T10:54:51Z","title":"Decorated graphons for temporal network estimation","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T03:34:43.463710Z"},"links":{"cited_paper":"/paper/2408.12339","citing_paper":"/paper/2607.23145"},"observation_digest":"sha256:6422659bbedd5e9a039cf32eb540caa2c92b4d6f25d85520a49394e8969fefbd","observation_id":"9a6f0520-ae76-4672-962d-6c6023285be5","resolution":{"observed_at":"2026-08-01T03:34:43.463710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.12339/citation-record","integrity":"/paper/2408.12339/integrity","json":"/paper/2408.12339/citation-record.json","paper":"/paper/2408.12339"},"outbound":[],"paper":{"arxiv_id":"2408.12339","last_updated":"2026-07-25T10:42:01Z","latest_version":2,"primary_category":"stat.ME","snapshot_observed_at":"2026-08-12T22:59:20.699881Z","submitted_at":"2024-08-22T12:35:13Z","title":"Graphon estimation beyond binary edges: inference for decorated graphs with applications to multiplex and weighted networks"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2408.12339."}