{"as_of":"2026-08-24T04:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:47426e90129de1512e362718bd33b42746b59d08c4ff053f2e676765c92f12d6","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-23T06:30:58.430688+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-15T17:45:30.518471Z","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-07T13:08:57.765711Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.13425","last_updated":"2020-04-28T11:17:15Z","snapshot_observed_at":"2026-08-08T23:36:50.362431Z","submitted_at":"2020-04-28T11:17:15Z","title":"A Branch and Bound Algorithm for Coalition Structure Generation over Graphs","version":1},"cited_work":{"arxiv_id":"2004.13425","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.13425","snapshot_observed_at":"2026-08-07T13:08:57.765711Z","title":"A Branch and Bound Algorithm for Coalition Structure Generation over Graphs","venue":"cs.GT","work_id":"b08d8954-c12f-4c72-a16d-b1e653f6e4ff","year":2020},"citing_paper":{"arxiv_id":"2505.22610","last_updated":"2025-05-28T17:25:53Z","snapshot_observed_at":"2026-08-22T08:43:19.711310Z","submitted_at":"2025-05-28T17:25:53Z","title":"TPDE: A Fast Adaptable Compiler Back-End Framework","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:08:53.842861Z"},"links":{"cited_paper":"/paper/2004.13425","citing_paper":"/paper/2505.22610"},"observation_digest":"sha256:02d80130920f1bba89e1c4e3b16791f288f7f3f466586da68d601578390d9997","observation_id":"7d4b9e3c-b840-4ae0-887c-bcdf51a7c144","resolution":{"observed_at":"2026-08-07T13:08:57.868298Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13425","last_updated":"2020-04-28T11:17:15Z","snapshot_observed_at":"2026-08-08T23:36:50.362431Z","submitted_at":"2020-04-28T11:17:15Z","title":"A Branch and Bound Algorithm for Coalition Structure Generation over Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13425","snapshot_observed_at":"2026-08-15T17:45:30.518471Z","title":"Shi, H.-H.S","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2507.20514","last_updated":"2025-07-28T04:31:38Z","snapshot_observed_at":"2026-08-15T17:40:02.803259Z","submitted_at":"2025-07-28T04:31:38Z","title":"RIMMS: Runtime Integrated Memory Management System for Heterogeneous Computing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T17:45:30.518471Z"},"links":{"cited_paper":"/paper/2004.13425","citing_paper":"/paper/2507.20514"},"observation_digest":"sha256:80c0e708914dbda0732443ba6f46c22747c61d09d3d66d79105dbdd0cf1e88de","observation_id":"88920544-6a72-46ef-83aa-12676174045d","resolution":{"observed_at":"2026-08-15T17:45:30.518471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2004.13425/citation-record","integrity":"/paper/2004.13425/integrity","json":"/paper/2004.13425/citation-record.json","paper":"/paper/2004.13425"},"outbound":[],"paper":{"arxiv_id":"2004.13425","last_updated":"2020-04-28T11:17:15Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-08T23:36:50.362431Z","submitted_at":"2020-04-28T11:17:15Z","title":"A Branch and Bound Algorithm for Coalition Structure Generation over Graphs"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 24 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2004.13425."}