Paper Citation Record · LEDGER

Parameterized Complexity of Fair Many-to-One Matchings

As of 13 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2411.18367.

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

pith.paper-citation-record.v1
2411.18367 v1

Coverage vector

measured 24 of 24 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T11:31:19.186330Z

measured 24 of 24 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

24 of 24 outbound references displayed

verified exact0
verified fuzzy21
unresolved3
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation f5af65d9-2f25-443c-83d0-322b6054e621 · outbound

This paper cites Fair hierarchical clustering.

Parameterized Complexity of Fair Many-to-One Matchings Fair hierarchical clustering

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.417458Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 13e12eb4-21cc-4b0f-88c3-540d03a62c48 · outbound

This paper cites Fair correlation clustering.

Parameterized Complexity of Fair Many-to-One Matchings Fair correlation clustering

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.407146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 83c9e5ab-2871-425b-aaaa-ba5ce2e288b3 · outbound

This paper cites The structural complexity landscape of finding balance-fair shortest paths.

Parameterized Complexity of Fair Many-to-One Matchings The structural complexity landscape of finding balance-fair shortest paths

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.398273Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ef26f60d-abba-4ec3-a01e-ee807db84cd1 · outbound

This paper cites The complexity of finding fair many-to-one matchings.

Parameterized Complexity of Fair Many-to-One Matchings The complexity of finding fair many-to-one matchings

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.388094Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 84467480-ea36-4162-b528-7b2ffe6c4178 · outbound

This paper cites A refined complexity analysis of fair districting over graphs.

Parameterized Complexity of Fair Many-to-One Matchings A refined complexity analysis of fair districting over graphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.378877Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation a5b59ad7-96d8-4739-ab2e-4156d6763b4b · outbound

This paper cites Matroids, matchings, and fairness.

Parameterized Complexity of Fair Many-to-One Matchings Matroids, matchings, and fairness

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.369762Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 77e3e13d-782d-4921-934c-4ce5d6fc0d44 · outbound

This paper cites Parameterized algorithms , volume 5.

Parameterized Complexity of Fair Many-to-One Matchings Parameterized algorithms , volume 5

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-12T11:31:19.135352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 710fd373-7667-4594-af0c-dd7f76660809 · outbound

This paper cites Fairness in graph mining: A survey.

Parameterized Complexity of Fair Many-to-One Matchings Fairness in graph mining: A survey

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.354519Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 80e6c981-b25b-4d40-828f-ec6f887df1a1 · outbound

This paper cites An Algorithmic Theory of Integer Programming.

Parameterized Complexity of Fair Many-to-One Matchings An Algorithmic Theory of Integer Programming

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-12T11:31:19.141526Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31e2efa1-48da-414f-b73f-4aea08174a06 · outbound

This paper cites On the parameterized complexity of multiple-interval graph problems.

Parameterized Complexity of Fair Many-to-One Matchings On the parameterized complexity of multiple-interval graph problems

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.345665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation fd8fca22-2c85-4931-bed9-1801ad5463c6 · outbound

This paper cites Fair correlation clustering with global and local guarantees.

Parameterized Complexity of Fair Many-to-One Matchings Fair correlation clustering with global and local guarantees

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.336118Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 459bd6c0-3116-442b-a2e2-cd0b9b12b49e · outbound

This paper cites Modification-fair cluster editing.

Parameterized Complexity of Fair Many-to-One Matchings Modification-fair cluster editing

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.327044Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 4755d626-cf5f-442b-addf-7a0c7ee82141 · outbound

This paper cites Fixed-parameter algorithms for fair hitting set problems.

Parameterized Complexity of Fair Many-to-One Matchings Fixed-parameter algorithms for fair hitting set problems

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.317502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 26e80517-561d-40ab-a8ef-79322842b0bf · outbound

This paper cites Bin packing with fixed number of bins revisited.

Parameterized Complexity of Fair Many-to-One Matchings Bin packing with fixed number of bins revisited

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.308439Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 1674d03d-6e0f-4db3-9ae7-942116e4fc0b · outbound

This paper cites Parameterized complexity of fair feedback vertex set problem.

Parameterized Complexity of Fair Many-to-One Matchings Parameterized complexity of fair feedback vertex set problem

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.299224Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 0d9ff443-7751-4f83-b88c-ba81ee4214fa · outbound

This paper cites Fair graph mining.

Parameterized Complexity of Fair Many-to-One Matchings Fair graph mining

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.289976Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation a144e554-a84c-4153-bbd1-dfc6741248ae · outbound

This paper cites Adversarial graph embeddings for fair influence maximization over social networks.

Parameterized Complexity of Fair Many-to-One Matchings Adversarial graph embeddings for fair influence maximization over social networks

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.280922Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 7e12f3c2-5fd1-42f8-8ff0-97f7bcd8bd34 · outbound

This paper cites Parameterized complexity of fair vertex evaluation problems.

Parameterized Complexity of Fair Many-to-One Matchings Parameterized complexity of fair vertex evaluation problems

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.271696Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 9cadd8a6-1c9f-4f5e-ab93-63624cae0f5e · outbound

This paper cites Fair edge deletion problems on tree-decomposable graphs and improper colorings.

Parameterized Complexity of Fair Many-to-One Matchings Fair edge deletion problems on tree-decomposable graphs and improper colorings

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.260889Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 90814058-fb85-4b7b-b326-272991871109 · outbound

This paper cites Structural Graph Parameters, Fine-Grained Complexity, and Approximation.

Parameterized Complexity of Fair Many-to-One Matchings Structural Graph Parameters, Fine-Grained Complexity, and Approximation

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.251632Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 05784cbe-10eb-4209-9dd0-5362b1469b58 · outbound

This paper cites Integer programming with a fixed number of variables.

Parameterized Complexity of Fair Many-to-One Matchings Integer programming with a fixed number of variables

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-12T11:31:19.177784Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c1c999fe-db75-4d37-8d29-2448bdd01c28 · outbound

This paper cites Fair edge deletion problems.

Parameterized Complexity of Fair Many-to-One Matchings Fair edge deletion problems

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.238153Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ea2564ac-2708-4974-8040-958025a175cb · outbound

This paper cites Parameterized complexity of fair deletion problems.

Parameterized Complexity of Fair Many-to-One Matchings Parameterized complexity of fair deletion problems

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.229622Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation b8002b62-3dd4-485e-9dbd-d373e41cb2e6 · outbound

This paper cites Minimizing margin of victory for fair political and educational districting.

Parameterized Complexity of Fair Many-to-One Matchings Minimizing margin of victory for fair political and educational districting

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T11:31:19.220864Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Pith citing papers

No inbound Pith citation observations are available.