Pith. sign in

Paper Citation Record · LEDGER

The Complexity of the Shapley Value for Regular Path Queries

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2212.07720 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-08T19:42:45.024640Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-08T19:42:45.497626Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation ab33310c-dabe-49da-a52d-ce082348b0fb · inbound

Compensation Design cites this paper.

Compensation Design The Complexity of the Shapley Value for Regular Path Queries

Reference 2022

Resolution
unresolved
no resolver link, observed 2026-08-02T02:19:05.943389Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T02:19:05.943389Z digest=sha256:a5bd4a7064fe2ad2e6436e66a521b0d79c5ef462e23d57f0a32f39da3f55364d

Observation 53310e62-497f-4a5b-a46f-15d3becaf338 · inbound

From Compensation Design to Budget-Feasible Mechanisms: A Constant Approximation for Subadditive Valuations cites this paper.

From Compensation Design to Budget-Feasible Mechanisms: A Constant Approximation for Subadditive Valuations The Complexity of the Shapley Value for Regular Path Queries

Reference 72

Resolution
metadata mismatch
local_arxiv, observed 2026-08-08T19:42:45.502426Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=arxiv_source observed=2026-08-08T19:42:45.024640Z digest=sha256:b84e6724a0f756e64fe2f898ce9f47b31be007f3b57b63f4ffc4f959dc553674