{"as_of":"2026-08-22T06:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9087edc173081833c142834cc3176a1e7b1039bd0ef80126e1d1ea75a4426391","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-21T06:32:19.484+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-07T14:52:37.447783Z","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-07T14:52:40.664268Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.13000","last_updated":"2025-02-18T16:20:50Z","snapshot_observed_at":"2026-08-16T12:57:15.960482Z","submitted_at":"2025-02-18T16:20:50Z","title":"Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges","version":1},"cited_work":{"arxiv_id":"2502.13000","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.13000","snapshot_observed_at":"2026-08-07T14:52:40.664268Z","title":"Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges","venue":"cs.DS","work_id":"e48ad1b4-3033-483c-b5ab-1a0f45be639b","year":2025},"citing_paper":{"arxiv_id":"2505.18043","last_updated":"2025-05-23T15:46:16Z","snapshot_observed_at":"2026-08-13T06:27:45.816332Z","submitted_at":"2025-05-23T15:46:16Z","title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:52:37.447783Z"},"links":{"cited_paper":"/paper/2502.13000","citing_paper":"/paper/2505.18043"},"observation_digest":"sha256:dbd048043a716f72dfaebbd1073388a68b9d460f665fa0ca97f389c6a000b0e1","observation_id":"6a0aea90-454a-48e0-a622-8b2ae3de0b9f","resolution":{"observed_at":"2026-08-07T14:52:40.787819Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.13000/citation-record","integrity":"/paper/2502.13000/integrity","json":"/paper/2502.13000/citation-record.json","paper":"/paper/2502.13000"},"outbound":[],"paper":{"arxiv_id":"2502.13000","last_updated":"2025-02-18T16:20:50Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T12:57:15.960482Z","submitted_at":"2025-02-18T16:20:50Z","title":"Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied 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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2502.13000."}