{"as_of":"2026-08-09T04:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:399de6cf5a6daff1286e6ff6e8e7b3c330292a5a0c7df8b7e56bde746b6c27df","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-08T06:32:00.761636+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-08T19:42:45.024640Z","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-08T19:42:45.497626Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.07720","last_updated":"2022-12-15T10:55:04Z","snapshot_observed_at":"2026-08-06T04:21:50.194196Z","submitted_at":"2022-12-15T10:55:04Z","title":"The Complexity of the Shapley Value for Regular Path Queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.07720","snapshot_observed_at":"2026-08-02T02:19:05.943389Z","title":"Khalil and B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14438","last_updated":"2026-07-17T03:34:05Z","snapshot_observed_at":"2026-08-07T05:38:16.753713Z","submitted_at":"2026-07-16T00:15:25Z","title":"Compensation Design","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T02:19:05.943389Z"},"links":{"cited_paper":"/paper/2212.07720","citing_paper":"/paper/2607.14438"},"observation_digest":"sha256:a5bd4a7064fe2ad2e6436e66a521b0d79c5ef462e23d57f0a32f39da3f55364d","observation_id":"ab33310c-dabe-49da-a52d-ce082348b0fb","resolution":{"observed_at":"2026-08-02T02:19:05.943389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.07720","last_updated":"2022-12-15T10:55:04Z","snapshot_observed_at":"2026-08-06T04:21:50.194196Z","submitted_at":"2022-12-15T10:55:04Z","title":"The Complexity of the Shapley Value for Regular Path Queries","version":1},"cited_work":{"arxiv_id":"2212.07720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.07720","snapshot_observed_at":"2026-08-08T19:42:45.497626Z","title":"The Complexity of the Shapley Value for Regular Path Queries","venue":"cs.DB","work_id":"41fc2f26-5cb6-49a1-b8f0-88964396da85","year":2022},"citing_paper":{"arxiv_id":"2608.04337","last_updated":"2026-08-05T01:28:54Z","snapshot_observed_at":"2026-08-08T23:11:28.657350Z","submitted_at":"2026-08-05T01:28:54Z","title":"From Compensation Design to Budget-Feasible Mechanisms: A Constant Approximation for Subadditive Valuations","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-08T19:42:45.024640Z"},"links":{"cited_paper":"/paper/2212.07720","citing_paper":"/paper/2608.04337"},"observation_digest":"sha256:3b079a79adac86fdc1951a49b55248be9e3f7c5e4820d53f80a8cb45675838b3","observation_id":"53310e62-497f-4a5b-a46f-15d3becaf338","resolution":{"observed_at":"2026-08-08T19:42:45.502426Z","resolver_source":"local_arxiv","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/2212.07720/citation-record","integrity":"/paper/2212.07720/integrity","json":"/paper/2212.07720/citation-record.json","paper":"/paper/2212.07720"},"outbound":[],"paper":{"arxiv_id":"2212.07720","last_updated":"2022-12-15T10:55:04Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-06T04:21:50.194196Z","submitted_at":"2022-12-15T10:55:04Z","title":"The Complexity of the Shapley Value for Regular Path Queries"},"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 2 inbound Pith citation observations for arXiv:2212.07720."}