{"as_of":"2026-08-14T08:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d259cd8a3a96607c2ce8df85824b81144bdaa5b43a11223e9ec0cd5158302af","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:31:19.186330Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.18367/citation-record","integrity":"/paper/2411.18367/integrity","json":"/paper/2411.18367/citation-record.json","paper":"/paper/2411.18367"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.413903Z","title":"Fair hierarchical clustering","venue":null,"work_id":"856b46c3-ccd8-4cd3-bd10-4105aabf6ada","year":2020},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.114997Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:baa25aee5bb8cb198b09f540231c3944293c7f5c73f7ff0ab625db0261fc2344","observation_id":"f5af65d9-2f25-443c-83d0-322b6054e621","resolution":{"observed_at":"2026-08-12T11:31:19.417458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.403933Z","title":"Fair correlation clustering","venue":null,"work_id":"6b9d8087-0de5-4add-9425-5faa5568db92","year":2020},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.118618Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:ea4b7a1a3f2af1fb3bdb503e0abd09ef65439e5e7dfa19baf9d04a20a566e5d5","observation_id":"13e12eb4-21cc-4b0f-88c3-540d03a62c48","resolution":{"observed_at":"2026-08-12T11:31:19.407146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.394788Z","title":"The structural complexity landscape of finding balance-fair shortest paths","venue":null,"work_id":"21415f32-a4f2-44d3-9491-4c1bf0b772d8","year":2022},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.122201Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:1b8dde11506544b0700e66afcab88959bb9d737d130e3ca1061553ee2ffbbfee","observation_id":"83c9e5ab-2871-425b-aaaa-ba5ce2e288b3","resolution":{"observed_at":"2026-08-12T11:31:19.398273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.384667Z","title":"The complexity of finding fair many-to-one matchings","venue":null,"work_id":"2d9c108c-8e51-4b2d-96b1-4e61e3b3686e","year":2024},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.125403Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:1b43ec67649f3a35201393bd50ef4f8266b1eba9125dcc615e732eb1df3d448a","observation_id":"ef26f60d-abba-4ec3-a01e-ee807db84cd1","resolution":{"observed_at":"2026-08-12T11:31:19.388094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.375640Z","title":"A refined complexity analysis of fair districting over graphs","venue":null,"work_id":"a0548197-bf07-473a-a0b3-a58f7506b7b2","year":2023},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.129077Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:3cb2f97fa67e4479593c861d532495ca139df2e099401651216fb3b8f11885f3","observation_id":"84467480-ea36-4162-b528-7b2ffe6c4178","resolution":{"observed_at":"2026-08-12T11:31:19.378877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.366801Z","title":"Matroids, matchings, and fairness","venue":null,"work_id":"f1e45677-7f5b-428d-b557-fe930deb6889","year":2019},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.132312Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:9efa907e94fdb8196856877d108fe67262f5e1232744399f50c4bdd2a4c69f72","observation_id":"a5b59ad7-96d8-4739-ab2e-4156d6763b4b","resolution":{"observed_at":"2026-08-12T11:31:19.369762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.135352Z","title":"Parameterized algorithms , volume 5","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.135352Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:afd34ff7c7b396e65485cece99b66b9292b942ee0f95c6f4556f48a9d5053d57","observation_id":"77e3e13d-782d-4921-934c-4ce5d6fc0d44","resolution":{"observed_at":"2026-08-12T11:31:19.135352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.351559Z","title":"Fairness in graph mining: A survey","venue":null,"work_id":"aa702af5-feb8-42fb-9e84-5cf987bb46fb","year":2023},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.138309Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:e8dc1506f47e40c39422ab7aeae99802b3ad9d6d1eb6d9b046fd3dce0d913edb","observation_id":"710fd373-7667-4594-af0c-dd7f76660809","resolution":{"observed_at":"2026-08-12T11:31:19.354519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-13T07:25:47.957364Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-08-12T11:31:19.141526Z","title":"An algorithmic theory of integer programming","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.141526Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:ecebd3b40621e17bac53d4f372588c4c94790b503e0f12062a4f41210b61a4e3","observation_id":"80e6c981-b25b-4d40-828f-ec6f887df1a1","resolution":{"observed_at":"2026-08-12T11:31:19.141526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.342215Z","title":"On the parameterized complexity of multiple-interval graph problems","venue":null,"work_id":"05727244-9920-4a57-8d3f-cc13e815ab45","year":2009},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.144848Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:3e6d077cc773aa9fab5d6e3b6b066fa67e15105262dd3571cd96ce177f4e15d0","observation_id":"31e2efa1-48da-414f-b73f-4aea08174a06","resolution":{"observed_at":"2026-08-12T11:31:19.345665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.333163Z","title":"Fair correlation clustering with global and local guarantees","venue":null,"work_id":"24129f43-2965-4898-9dc3-323fc382b4ec","year":2021},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.148061Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:16bc06abc99e60178930b182ff4ee986443270bc87f8bdf5d658c7cc2a548096","observation_id":"fd8fca22-2c85-4931-bed9-1801ad5463c6","resolution":{"observed_at":"2026-08-12T11:31:19.336118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.323809Z","title":"Modification-fair cluster editing","venue":null,"work_id":"275045f2-1940-48fd-9d02-6b928569adde","year":2024},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.151271Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:db61420ccc9c5002167818353a5137b43351a512e5828377f2b47c41b7bdb6c0","observation_id":"459bd6c0-3116-442b-a2e2-cd0b9b12b49e","resolution":{"observed_at":"2026-08-12T11:31:19.327044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.314602Z","title":"Fixed-parameter algorithms for fair hitting set problems","venue":null,"work_id":"1688d542-7b40-44f1-9752-cf42d4fcf525","year":2023},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.154633Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:eef5c4cbbea0fa1d680854d761a94b9d7500c1fce34551f27f1ada839b89376e","observation_id":"4755d626-cf5f-442b-addf-7a0c7ee82141","resolution":{"observed_at":"2026-08-12T11:31:19.317502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.305415Z","title":"Bin packing with fixed number of bins revisited","venue":null,"work_id":"0bb43e76-db9b-4449-a3cc-1ec4dad9d472","year":2013},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.157828Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:3edbef2c550b233d7971bbdfad2a632551e7674829a4129e38a31b5fcbdf2a86","observation_id":"26e80517-561d-40ab-a8ef-79322842b0bf","resolution":{"observed_at":"2026-08-12T11:31:19.308439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.295940Z","title":"Parameterized complexity of fair feedback vertex set problem","venue":null,"work_id":"bb79a9ed-4496-4228-a22e-ca106c5be649","year":2021},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.160811Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:8770bf1a7c4840af9df4ed8840840130ce176208220c5a29eefb09cfdbcea0cc","observation_id":"1674d03d-6e0f-4db3-9ae7-942116e4fc0b","resolution":{"observed_at":"2026-08-12T11:31:19.299224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.287093Z","title":"Fair graph mining","venue":null,"work_id":"df278da5-42a8-4090-b957-24bd47d75713","year":2021},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.163819Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:f10e4ae9805540c7ab8f45c4c4c1c7e69b6ff335441190e983da0e201f4adee1","observation_id":"0d9ff443-7751-4f83-b88c-ba81ee4214fa","resolution":{"observed_at":"2026-08-12T11:31:19.289976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.277659Z","title":"Adversarial graph embeddings for fair influence maximization over social networks","venue":null,"work_id":"42afbaeb-6635-43ca-84f6-733064fdfa5a","year":2021},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.166615Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:57eeeacda760f48437d0f9a74798e8974c34787fff470e0a1787319881a30b6d","observation_id":"a144e554-a84c-4153-bbd1-dfc6741248ae","resolution":{"observed_at":"2026-08-12T11:31:19.280922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.267096Z","title":"Parameterized complexity of fair vertex evaluation problems","venue":null,"work_id":"8e4d2110-81cd-44d1-bd09-6c6b863dd233","year":2019},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.169309Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:5cc60a9f0935bb9c6f4c218315c4400f1404b561ba5c80b34ecc65f777f5ed67","observation_id":"7e12f3c2-5fd1-42f8-8ff0-97f7bcd8bd34","resolution":{"observed_at":"2026-08-12T11:31:19.271696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.257718Z","title":"Fair edge deletion problems on tree-decomposable graphs and improper colorings","venue":null,"work_id":"d3a1a295-ff0d-49fa-ac45-5fb337aede2a","year":2010},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.172470Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:546e6d8de325fffc0e8a76fcf7654dbe32929b36838b8a2b64ffd919a04f5f5e","observation_id":"9cadd8a6-1c9f-4f5e-ab93-63624cae0f5e","resolution":{"observed_at":"2026-08-12T11:31:19.260889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.248612Z","title":"Structural Graph Parameters, Fine-Grained Complexity, and Approximation","venue":null,"work_id":"d2ec40e1-fdcd-4e2b-a353-bba1e1e4f510","year":2022},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.175162Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:7b5396cac7169c65724ee484b64c86a9399dbcfdbd2fe984e61b62e0e6267bbf","observation_id":"90814058-fb85-4b7b-b326-272991871109","resolution":{"observed_at":"2026-08-12T11:31:19.251632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.177784Z","title":"Integer programming with a fixed number of variables","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.177784Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:7a69c637da3c2f23ee08ac640bf4bf055cd6b1d838fe3aa8c44e6bd011160ce0","observation_id":"05784cbe-10eb-4209-9dd0-5362b1469b58","resolution":{"observed_at":"2026-08-12T11:31:19.177784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.234991Z","title":"Fair edge deletion problems","venue":null,"work_id":"bd7e0e66-4069-4520-b9b6-61f7a496cfe4","year":1989},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.180957Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:2fe219bc54d3f1df4d068fbc49f7bc7b617d18e859fd66a4ee162ff2cb74aeff","observation_id":"c1c999fe-db75-4d37-8d29-2448bdd01c28","resolution":{"observed_at":"2026-08-12T11:31:19.238153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.226473Z","title":"Parameterized complexity of fair deletion problems","venue":null,"work_id":"a4421895-7151-433e-b01f-b6101b19b84f","year":2020},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.183703Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:08bc55bca3ac25d1e44ad8a7549ed96c0e63572bc831fa6252d5497e45b3632a","observation_id":"ea2564ac-2708-4974-8040-958025a175cb","resolution":{"observed_at":"2026-08-12T11:31:19.229622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:31:19.215492Z","title":"Minimizing margin of victory for fair political and educational districting","venue":null,"work_id":"eea616a9-94e9-4ebc-b6b0-e79e6ad47cfe","year":2020},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.186330Z"},"links":{"citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:1f8bdf78dd53d517064b1fed10baeaa0e9246388ab312480dfce135066fb4200","observation_id":"b8002b62-3dd4-485e-9dbd-d373e41cb2e6","resolution":{"observed_at":"2026-08-12T11:31:19.220864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-13T22:06:57.141985Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":21},"total_outbound_references":24},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2411.18367."}