{"as_of":"2026-08-20T06:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9b1cd631a818e31ad2601246efa84df098c2dc592099fb895e059aadd3c4ac60","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-20T06:33:59.587034+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-02T05:26:53.717752Z","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":"2108.07890","last_updated":"2021-08-19T22:27:32Z","snapshot_observed_at":"2026-08-16T18:02:37.595483Z","submitted_at":"2021-08-17T21:43:55Z","title":"Constructing Triangle Decomposable Multigraphs with Minimum Multi-edges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07890","snapshot_observed_at":"2026-08-02T05:26:53.717752Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.13369","last_updated":"2026-07-15T01:19:35Z","snapshot_observed_at":"2026-08-17T16:08:47.947751Z","submitted_at":"2026-07-15T01:19:35Z","title":"xChk: Bring Your Own Identity -- Heterogeneous Assurance with Verifier-Determined Sufficiency","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T05:26:53.717752Z"},"links":{"cited_paper":"/paper/2108.07890","citing_paper":"/paper/2607.13369"},"observation_digest":"sha256:8752593839a7adc9a6bbeed2b99d690266a8ad3d43d6af5a119985e309d59186","observation_id":"caf56051-9e0c-4b26-9428-56ed0216d7d5","resolution":{"observed_at":"2026-08-02T05:26:53.717752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2108.07890/citation-record","integrity":"/paper/2108.07890/integrity","json":"/paper/2108.07890/citation-record.json","paper":"/paper/2108.07890"},"outbound":[],"paper":{"arxiv_id":"2108.07890","last_updated":"2021-08-19T22:27:32Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T18:02:37.595483Z","submitted_at":"2021-08-17T21:43:55Z","title":"Constructing Triangle Decomposable Multigraphs with Minimum Multi-edges"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2108.07890."}