Ranking and Rank Aggregation with Matroid Prefix Constraints | Paper Citation Record

Observation 93ce44f4-8a66-4a3a-9630-2fe9dacd25ee · outbound

This paper cites Aggregating inconsistent information: Ranking and clustering.Journal of the ACM, 55(5):23:1–23:27, 2008.doi:10.1145/ 1411509.1411513.

Ranking and Rank Aggregation with Matroid Prefix Constraints Aggregating inconsistent information: Ranking and clustering.Journal of the ACM, 55(5):23:1–23:27, 2008.doi:10.1145/ 1411509.1411513

Reference 1

Resolution: malformed identifier; arxiv_id, observed 2026-07-09T19:06:27.363193Z

Source-reported events for the cited work

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

Observation 1293ef34-1a7c-40ed-8bcc-d56de032ad12 · outbound

This paper cites doi:10.1016/j.jcss.2019.04.005.

Ranking and Rank Aggregation with Matroid Prefix Constraints doi:10.1016/j.jcss.2019.04.005

Reference 2

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.340575Z

Source-reported events for the cited work

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

Observation e2bbdff3-4a9d-4d59-9bc7-a22c71b12dd3 · outbound

This paper cites Quentin Berthet, Mathieu Blondel, Olivier Teboul, Marco Cuturi, Jean-Philippe Vert, and Francis Bach.

Ranking and Rank Aggregation with Matroid Prefix Constraints Quentin Berthet, Mathieu Blondel, Olivier Teboul, Marco Cuturi, Jean-Philippe Vert, and Francis Bach

Reference 3

Resolution: metadata mismatch; doi, observed 2026-07-09T19:06:27.342627Z

Source-reported events for the cited work

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

Observation 9f3014e0-97d5-47c7-bb09-4a9083b81145 · outbound

This paper cites Fellows, Jiong Guo, Rolf Niedermeier, and Frances A.

Ranking and Rank Aggregation with Matroid Prefix Constraints Fellows, Jiong Guo, Rolf Niedermeier, and Frances A

Reference 4

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.333262Z

Source-reported events for the cited work

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

Observation 974db0df-a9e4-44bf-bc02-1a2e5991b85e · outbound

This paper cites An improved tableau criterion for Bruhat order.The Electronic Journal of Combinatorics, 3(1):R22, 1996.doi:10.37236/1246.

Ranking and Rank Aggregation with Matroid Prefix Constraints An improved tableau criterion for Bruhat order.The Electronic Journal of Combinatorics, 3(1):R22, 1996.doi:10.37236/1246

Reference 5

Resolution: malformed identifier; doi_truncated, observed 2026-07-09T19:06:27.314102Z

Source-reported events for the cited work

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

Observation b0371e8b-58ca-47f9-ba2e-2d79b1772f19 · outbound

This paper cites Springer, 2005.doi:10.1007/3-540-27596-7.

Ranking and Rank Aggregation with Matroid Prefix Constraints Springer, 2005.doi:10.1007/3-540-27596-7

Reference 6

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.285275Z

Source-reported events for the cited work

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

Observation 80ab844c-9bf1-4ca8-9b36-d3df940fa547 · outbound

This paper cites Borovik, Israel M.

Ranking and Rank Aggregation with Matroid Prefix Constraints Borovik, Israel M

Reference 7

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.300253Z

Source-reported events for the cited work

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

Observation 8bf55201-a33e-4b47-9459-2361238987f7 · outbound

This paper cites Borovik, Israel M.

Ranking and Rank Aggregation with Matroid Prefix Constraints Borovik, Israel M

Reference 8

Resolution: malformed identifier; raw_fallback, observed 2026-07-09T19:06:27.677225Z

Source-reported events for the cited work

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

Observation 5e9f4e77-0219-44ce-ac8b-af0ed7f1a46b · outbound

This paper cites Quotients of M-convex sets and M-convex functions.Combinatorial Theory, 6(1), 2026.doi:10.5070/C66165701.

Ranking and Rank Aggregation with Matroid Prefix Constraints Quotients of M-convex sets and M-convex functions.Combinatorial Theory, 6(1), 2026.doi:10.5070/C66165701

Reference 9

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.298116Z

Source-reported events for the cited work

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

Observation 79ea1614-bd9b-4cb1-86fc-ebb79d7cf6ae · outbound

This paper cites Multiwinner elections with diversity constraints.

Ranking and Rank Aggregation with Matroid Prefix Constraints Multiwinner elections with diversity constraints

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.673818Z

Source-reported events for the cited work

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

Observation 36a447a6-38ab-4e79-b674-41deed43404a · outbound

This paper cites an unresolved cited work.

Ranking and Rank Aggregation with Matroid Prefix Constraints Unresolved cited work

Reference 11

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.342322Z

Source-reported events for the cited work

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

Observation a12a6a26-428d-49c9-bc98-f2fe578b1817 · outbound

This paper cites Constructions.

Ranking and Rank Aggregation with Matroid Prefix Constraints Constructions

Reference 12

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.317888Z

Source-reported events for the cited work

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

Observation f245f732-2ffc-4c3f-871b-d3651320fb42 · outbound

This paper cites Flag matroids: algebra and geometry.

Ranking and Rank Aggregation with Matroid Prefix Constraints Flag matroids: algebra and geometry

Reference 13

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.322134Z

Source-reported events for the cited work

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

Observation 1127b357-e26e-4aa2-9517-a407000da0c7 · outbound

This paper cites Elisa Celis, Damian Straszak, and Nisheeth K.

Ranking and Rank Aggregation with Matroid Prefix Constraints Elisa Celis, Damian Straszak, and Nisheeth K

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.675571Z

Source-reported events for the cited work

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

Observation fe748e05-fddf-42bf-8e12-b5bc9fa6bcb2 · outbound

This paper cites (Almost-)optimal FPT algorithm and kernel for T-Cycle on planar graphs.

Ranking and Rank Aggregation with Matroid Prefix Constraints (Almost-)optimal FPT algorithm and kernel for T-Cycle on planar graphs

Reference 15

Resolution: malformed identifier; doi_truncated, observed 2026-07-09T19:06:27.330758Z

Source-reported events for the cited work

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

Observation 31518f10-7e42-4787-9536-d873c19638de · outbound

This paper cites Improved rank aggregation under fairness constraint.

Ranking and Rank Aggregation with Matroid Prefix Constraints Improved rank aggregation under fairness constraint

Reference 16

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.296082Z

Source-reported events for the cited work

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

Observation 267b547c-87d3-4d24-804f-c4f90cd347b0 · outbound

This paper cites Fair Rank Aggregation.

Ranking and Rank Aggregation with Matroid Prefix Constraints Fair Rank Aggregation

Reference 17

Resolution: verified exact; local_arxiv, observed 2026-07-09T19:06:27.365849Z

Source-reported events for the cited work

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

Observation 26871267-9c9e-4b92-bf7c-f95852d3b463 · outbound

This paper cites A natural family of flag matroids.SIAM Journal on Discrete Mathematics, 21(1):130–140, 2007.doi:10.1137/050627873.

Ranking and Rank Aggregation with Matroid Prefix Constraints A natural family of flag matroids.SIAM Journal on Discrete Mathematics, 21(1):130–140, 2007.doi:10.1137/050627873

Reference 18

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.314823Z

Source-reported events for the cited work

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

Observation 45b5d655-db6b-4077-b72b-972d6d31dbba · outbound

This paper cites Bumin Yenmez.

Ranking and Rank Aggregation with Matroid Prefix Constraints Bumin Yenmez

Reference 19

Resolution: verified exact; arxiv_id, observed 2026-07-09T19:06:27.308393Z

Source-reported events for the cited work

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

Observation 1338bcd8-14be-42cf-945d-14968feda927 · outbound

This paper cites Rank aggregation methods for the Web.

Ranking and Rank Aggregation with Matroid Prefix Constraints Rank aggregation methods for the Web

Reference 20

Resolution: verified exact; arxiv_id, observed 2026-07-09T19:06:27.339178Z

Source-reported events for the cited work

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

Observation 0093e76c-2501-4213-8b2a-2234e93e90f0 · outbound

This paper cites Kemeny consensus complexity.

Ranking and Rank Aggregation with Matroid Prefix Constraints Kemeny consensus complexity

Reference 21

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.298359Z

Source-reported events for the cited work

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

Observation c64d1c6c-2f62-4b8e-84ef-55b236ab1499 · outbound

This paper cites Oxford University Press, Oxford, 2011.

Ranking and Rank Aggregation with Matroid Prefix Constraints Oxford University Press, Oxford, 2011

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.655876Z

Source-reported events for the cited work

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

Observation 5eb9d117-cbb9-4ac9-9f38-b4a57e27ba5d · outbound

This paper cites Optimal assignments in an ordered set: An application of matroid theory.Jour- nal of Combinatorial Theory, 4(2):176–180, 1968.doi:10.1016/S0021-9800(68)80039-0.

Ranking and Rank Aggregation with Matroid Prefix Constraints Optimal assignments in an ordered set: An application of matroid theory.Jour- nal of Combinatorial Theory, 4(2):176–180, 1968.doi:10.1016/S0021-9800(68)80039-0

Reference 23

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.312923Z

Source-reported events for the cited work

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

Observation 64d3d5c5-c557-4b6f-992a-85d668cac284 · outbound

This paper cites Garey and David S.

Ranking and Rank Aggregation with Matroid Prefix Constraints Garey and David S

Reference 24

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.289983Z

Source-reported events for the cited work

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

Observation fd387249-a8d7-4b81-ae86-05f74d108f4c · outbound

This paper cites & Virk, G.

Ranking and Rank Aggregation with Matroid Prefix Constraints & Virk, G

Reference 25

Resolution: metadata mismatch; arxiv_id, observed 2026-07-09T19:06:27.345574Z

Source-reported events for the cited work

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

Observation 7f73b0e9-3af6-4ce2-99f2-9010d6908194 · outbound

This paper cites The complexity of Kemeny elec- tions.Theoretical Computer Science, 349:382–391, 2005.doi:10.1016/j.tcs.2005.08.

Ranking and Rank Aggregation with Matroid Prefix Constraints The complexity of Kemeny elec- tions.Theoretical Computer Science, 349:382–391, 2005.doi:10.1016/j.tcs.2005.08

Reference 26

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.274736Z

Source-reported events for the cited work

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

Observation 9e399ef3-1f89-40ae-809c-efe1696ef0a6 · outbound

This paper cites Packing of mixed hyperarborescences with flexible roots via matroid intersection.The Electronic Journal of Combinatorics, 28(3):P3.29, 2021.doi: 10.37236/10105.

Ranking and Rank Aggregation with Matroid Prefix Constraints Packing of mixed hyperarborescences with flexible roots via matroid intersection.The Electronic Journal of Combinatorics, 28(3):P3.29, 2021.doi: 10.37236/10105

Reference 27

Resolution: malformed identifier; doi_truncated, observed 2026-07-09T19:06:27.319817Z

Source-reported events for the cited work

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

Observation 860607be-0d0d-4477-9cd6-d554f8f4b705 · outbound

This paper cites Flag matroids with coefficients.Advances in Mathe- matics, 436:109396, 2024.doi:10.1016/j.aim.2023.109396.

Ranking and Rank Aggregation with Matroid Prefix Constraints Flag matroids with coefficients.Advances in Mathe- matics, 436:109396, 2024.doi:10.1016/j.aim.2023.109396

Reference 28

Resolution: verified exact; arxiv_id, observed 2026-07-09T19:06:27.335766Z

Source-reported events for the cited work

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

Observation 46f20820-430d-46f4-b5e4-7dad47538789 · outbound

This paper cites an unresolved cited work.

Ranking and Rank Aggregation with Matroid Prefix Constraints Unresolved cited work

Reference 29

Resolution: malformed identifier; raw_fallback, observed 2026-07-09T19:06:27.646613Z

Source-reported events for the cited work

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

Observation 1905aa3c-2c05-41a8-8c36-659f306efafe · outbound

This paper cites an unresolved cited work.

Ranking and Rank Aggregation with Matroid Prefix Constraints Unresolved cited work

Reference 30

Resolution: unresolved; raw_fallback, observed 2026-07-09T19:06:27.641313Z

Source-reported events for the cited work

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

Observation a45dab1d-0985-4c34-91cd-bf2d6db4424d · outbound

This paper cites In: Proceedings of the Thirty-ninth Annual AC M Symposium on Theory of Computing, pp.

Ranking and Rank Aggregation with Matroid Prefix Constraints In: Proceedings of the Thirty-ninth Annual AC M Symposium on Theory of Computing, pp

Reference 31

Resolution: metadata mismatch; arxiv_id, observed 2026-07-09T19:06:27.306945Z

Source-reported events for the cited work

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

Observation 143e409a-957e-426f-85cb-6621c2aa38e3 · outbound

This paper cites On weakly and strongly popular rankings.

Ranking and Rank Aggregation with Matroid Prefix Constraints On weakly and strongly popular rankings

Reference 32

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.308879Z

Source-reported events for the cited work

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

Observation 2f78a25b-636d-44fa-8261-4e68b54eadbc · outbound

This paper cites Oxford Univer- sity Press (2018).https://doi.org/10.1093/oso/9780198814788.001.0001.

Ranking and Rank Aggregation with Matroid Prefix Constraints Oxford Univer- sity Press (2018).https://doi.org/10.1093/oso/9780198814788.001.0001

Reference 33

Resolution: malformed identifier; arxiv_id, observed 2026-07-09T19:06:27.369159Z

Source-reported events for the cited work

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

Observation 1a9a01f6-fd59-4c86-9d51-9e985c764dbf · outbound

This paper cites Independence spaces and combinatorial problems.Proceedings of the London Mathematical Society, s3-19(1):17–30, 1969.doi:10.1112/plms/s3-19.1.17.

Ranking and Rank Aggregation with Matroid Prefix Constraints Independence spaces and combinatorial problems.Proceedings of the London Mathematical Society, s3-19(1):17–30, 1969.doi:10.1112/plms/s3-19.1.17

Reference 34

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.327485Z

Source-reported events for the cited work

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

Observation cafce668-72a3-4e52-ac14-22a4e971fbf6 · outbound

This paper cites Springer.

Ranking and Rank Aggregation with Matroid Prefix Constraints Springer

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.663199Z

Source-reported events for the cited work

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

Observation 2a4bd438-6b9b-4093-9088-e876d5d75884 · outbound

This paper cites A framework for the greedy algorithm.Discrete Applied Mathematics, 121(1–3):247–260, 2002.doi:10.1016/S0166-218X(01)00362-6.

Ranking and Rank Aggregation with Matroid Prefix Constraints A framework for the greedy algorithm.Discrete Applied Mathematics, 121(1–3):247–260, 2002.doi:10.1016/S0166-218X(01)00362-6

Reference 36

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.328668Z

Source-reported events for the cited work

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

Observation 8aa40f68-cccc-4b63-bdd3-752e1085224e · outbound

This paper cites A survey on rank aggre- gation.

Ranking and Rank Aggregation with Matroid Prefix Constraints A survey on rank aggre- gation

Reference 37

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.316474Z

Source-reported events for the cited work

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

Observation d30cb4f8-c238-42c7-9568-47e99b35222e · outbound

This paper cites Rank aggregation with proportionate fairness.

Ranking and Rank Aggregation with Matroid Prefix Constraints Rank aggregation with proportionate fairness

Reference 38

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.335170Z

Source-reported events for the cited work

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

Observation d8bffd53-0593-4c7b-8fda-8ebe6bda7d13 · outbound

This paper cites A generalized polymatroid approach to stable matchings with lower quotas.

Ranking and Rank Aggregation with Matroid Prefix Constraints A generalized polymatroid approach to stable matchings with lower quotas

Reference 39

Resolution: verified exact; arxiv_id, observed 2026-07-09T19:06:27.322887Z

Source-reported events for the cited work

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

Observation 37a8db66-1365-42d3-bcca-40c3d6c6d7b3 · outbound

This paper cites Peyton Young and Arthur Levenglick.

Ranking and Rank Aggregation with Matroid Prefix Constraints Peyton Young and Arthur Levenglick

Reference 40

Resolution: malformed identifier; raw_fallback, observed 2026-07-09T19:06:27.670320Z

Source-reported events for the cited work

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

Observation bc7bffa0-3570-42b8-bb4c-42313564bd62 · outbound

This paper cites Condorcet’s theory of voting.American Political Science Review, 82(4):1231–1244, 1988.doi:10.2307/1961757.

Ranking and Rank Aggregation with Matroid Prefix Constraints Condorcet’s theory of voting.American Political Science Review, 82(4):1231–1244, 1988.doi:10.2307/1961757

Reference 41

Resolution: verified exact; doi, observed 2026-07-09T19:06:27.341006Z

Source-reported events for the cited work

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

Observation 1f2313fc-2867-4638-be4a-7214f69b276c · outbound

This paper cites Multi-Task Neural Network for Non-discrete Attribute Prediction in Knowledge Graphs.

Ranking and Rank Aggregation with Matroid Prefix Constraints Multi-Task Neural Network for Non-discrete Attribute Prediction in Knowledge Graphs

Reference 42

Resolution: metadata mismatch; arxiv_id, observed 2026-07-09T19:06:27.278872Z

Source-reported events for the cited work

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

Observation d9590ae9-3d87-4c9f-a4dd-ae5adf2ff645 · outbound

This paper cites This is equivalent to the condition that for everyi∈[s−1]andB∈ B i, there existsB′ ∈ B i+1 withB⊆B ′.

Ranking and Rank Aggregation with Matroid Prefix Constraints This is equivalent to the condition that for everyi∈[s−1]andB∈ B i, there existsB′ ∈ B i+1 withB⊆B ′

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.642969Z

Source-reported events for the cited work

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

Observation b3a38919-be8a-4207-8374-e17a6eeb25ee · outbound

This paper cites 3.(M 1, M2,.

Ranking and Rank Aggregation with Matroid Prefix Constraints 3.(M 1, M2,

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.668370Z

Source-reported events for the cited work

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

Observation 2f6333db-afea-4b03-b625-1ce9cceacd12 · outbound

This paper cites , s, do the following.

Ranking and Rank Aggregation with Matroid Prefix Constraints , s, do the following

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.672077Z

Source-reported events for the cited work

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

Observation c55bae8f-4826-46c7-b0e9-0f5c6c03ae45 · outbound

This paper cites , Bs)and outputπ B as defined in Section 4.

Ranking and Rank Aggregation with Matroid Prefix Constraints , Bs)and outputπ B as defined in Section 4

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.666737Z

Source-reported events for the cited work

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

Observation b0cc11ac-7aab-4793-a68b-07fe2934b905 · outbound

This paper cites ,1, do the following.

Ranking and Rank Aggregation with Matroid Prefix Constraints ,1, do the following

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.659598Z

Source-reported events for the cited work

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

Observation 0b9d23af-a1cb-40a9-b3a4-bcbc0e5e6498 · outbound

This paper cites , Bs)and outputπ B as defined in Section 4.

Ranking and Rank Aggregation with Matroid Prefix Constraints , Bs)and outputπ B as defined in Section 4

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.664818Z

Source-reported events for the cited work

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

Observation 3a5bb13b-173d-49dc-b25b-79cb85d83492 · outbound

This paper cites Indeed, we can impose these assumptions without loss of generality.

Ranking and Rank Aggregation with Matroid Prefix Constraints Indeed, we can impose these assumptions without loss of generality

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.648543Z

Source-reported events for the cited work

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

Observation 7a4e8258-8be3-4338-809b-f8b36031fb08 · outbound

This paper cites an unresolved cited work.

Ranking and Rank Aggregation with Matroid Prefix Constraints Unresolved cited work

Reference 50

Resolution: unresolved; raw_fallback, observed 2026-07-09T19:06:27.657695Z

Source-reported events for the cited work

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

Observation e63c493a-4c71-4467-99da-5f8259aa2ca4 · outbound

This paper cites an unresolved cited work.

Ranking and Rank Aggregation with Matroid Prefix Constraints Unresolved cited work

Reference 51

Resolution: unresolved; raw_fallback, observed 2026-07-09T19:06:27.652181Z

Source-reported events for the cited work

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

Observation be9c5fe1-dd57-47a3-8ce4-d7fb18d83b5f · outbound

This paper cites To generalize their algorithm to Matroid-FRA, we consider solving the following generalized version of the colorful bi-partition subproblem.

Ranking and Rank Aggregation with Matroid Prefix Constraints To generalize their algorithm to Matroid-FRA, we consider solving the following generalized version of the colorful bi-partition subproblem

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.661583Z

Source-reported events for the cited work

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

Observation 4012232d-93c5-4418-8ec0-36de0d3b3074 · outbound

This paper cites an unresolved cited work.

Ranking and Rank Aggregation with Matroid Prefix Constraints Unresolved cited work

Reference 53

Resolution: unresolved; raw_fallback, observed 2026-07-09T19:06:27.653920Z

Source-reported events for the cited work

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

Observation dc74921e-9b78-4b13-b7f1-216c773ae0e0 · outbound

This paper cites an unresolved cited work.

Ranking and Rank Aggregation with Matroid Prefix Constraints Unresolved cited work

Reference 54

Resolution: unresolved; raw_fallback, observed 2026-07-09T19:06:27.639386Z

Source-reported events for the cited work

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

Observation 6bdce3cd-b120-4fdb-a305-9fb48e31c8fc · outbound

This paper cites Proof.Note that each pair{e, f} ∈ P α consists of elements taken from two distinct sets among Jα0K,Jα1K, andJα2K, each of which has sizen α.

Ranking and Rank Aggregation with Matroid Prefix Constraints Proof.Note that each pair{e, f} ∈ P α consists of elements taken from two distinct sets among Jα0K,Jα1K, andJα2K, each of which has sizen α

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.643359Z

Source-reported events for the cited work

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

Observation c7b1935c-4b22-4e05-a25e-0056feabecbb · outbound

This paper cites an unresolved cited work.

Ranking and Rank Aggregation with Matroid Prefix Constraints Unresolved cited work

Reference 56

Resolution: unresolved; raw_fallback, observed 2026-07-09T19:06:27.645007Z

Source-reported events for the cited work

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

Observation 021791a7-d14b-4e65-8568-decb5da578f7 · outbound

This paper cites First, partition the setJαKinto the following subsets: E1 =Jα0K∩B X , F 1 =Jα1K∩B X , G 1 =Jα2K∩B X , E2 =Jα0K\B X , F 2 =Jα1K\B X , G 2 =Jα2K\B X.

Ranking and Rank Aggregation with Matroid Prefix Constraints First, partition the setJαKinto the following subsets: E1 =Jα0K∩B X , F 1 =Jα1K∩B X , G 1 =Jα2K∩B X , E2 =Jα0K\B X , F 2 =Jα1K\B X , G 2 =Jα2K\B X

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T19:06:27.650554Z

Source-reported events for the cited work

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

Coverage vector

Reference resolution

Outbound references

Pith citing papers