{"as_of":"2026-08-22T13:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2adc76baed05800151b1425cdd2c7672e8881396ac26e60a3e7fdf91b958f566","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-09T18:58:33.764487Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2607.07153/citation-record","integrity":"/paper/2607.07153/integrity","json":"/paper/2607.07153/citation-record.json","paper":"/paper/2607.07153"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1509.14115","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T19:06:27.361343Z","title":"Aggregating inconsistent information: Ranking and clustering.Journal of the ACM, 55(5):23:1–23:27, 2008.doi:10.1145/ 1411509.1411513","venue":null,"work_id":"dca8c9bc-08ac-41aa-84f1-eea0b2e9b81c","year":2008},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:eeae365e00c08b7af9fdf8e23803bf24e0c4c2c20af36bb0eada98054715f423","observation_id":"93ce44f4-8a66-4a3a-9630-2fe9dacd25ee","resolution":{"observed_at":"2026-07-09T19:06:27.363193Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2019.04.005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi:10.1016/j.jcss.2019.04.005","venue":"Journal of Computer and System Sciences","work_id":"6e2e66b7-6e5e-46a6-808f-f1cd5e4e5a69","year":2019},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:c42c7461599b11db81ac096f90f4d8501647dacba15a5a506acebfca3bc74cc0","observation_id":"1293ef34-1a7c-40ed-8bcc-d56de032ad12","resolution":{"observed_at":"2026-07-09T19:06:27.340575Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf00303169","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quentin Berthet, Mathieu Blondel, Olivier Teboul, Marco Cuturi, Jean-Philippe Vert, and Francis Bach","venue":"Social Choice and Welfare","work_id":"b297f318-c919-4a87-b0bf-a6313b333e46","year":1989},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:864a973dd580216bfb4cb6e787e5995aad0ac4ec5a6ff76458755f0bad23ad21","observation_id":"e2bbdff3-4a9d-4d59-9bc7-a22c71b12dd3","resolution":{"observed_at":"2026-07-09T19:06:27.342627Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2009.08.033","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fellows, Jiong Guo, Rolf Niedermeier, and Frances A","venue":"Theoretical Computer Science","work_id":"a06ec54c-c94f-44e3-aece-4fbedc4322b0","year":2009},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:e7bd9534ae3993f88cccc2a6524f0d154a6e6618e636fa5717999a417836a5b8","observation_id":"9f3014e0-97d5-47c7-bb09-4a9083b81145","resolution":{"observed_at":"2026-07-09T19:06:27.333262Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.37236/1246","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An improved tableau criterion for Bruhat order.The Electronic Journal of Combinatorics, 3(1):R22, 1996.doi:10.37236/1246","venue":"The Electronic Journal of Combinatorics","work_id":"4b13d4e2-d2ec-4bd8-814c-5861dc606323","year":1996},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:42188a874fb0c52d0d010a9be0be6d77370ee441e00e17ed90e911e0f231e2c4","observation_id":"974db0df-a9e4-44bf-bc02-1a2e5991b85e","resolution":{"observed_at":"2026-07-09T19:06:27.314102Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-27596-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Springer, 2005.doi:10.1007/3-540-27596-7","venue":"Graduate texts in mathematics","work_id":"9248b196-f5bf-4804-ae8a-7c92d749701b","year":2005},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:6e141432a5a1ced2528728427ac11bc3bff33dafe0ba5313f4466cd98e5a8185","observation_id":"b0371e8b-58ca-47f9-ba2e-2d79b1772f19","resolution":{"observed_at":"2026-07-09T19:06:27.285275Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-14T22:08:09.925168+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T22:08:09.925168+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-001-0061-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Borovik, Israel M","venue":"Discrete & Computational Geometry","work_id":"ba21cd8e-c734-4145-9cd2-73306bb5160a","year":2002},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:bd11363de3e9920c078eb04ab4706b6d00b9315556cffd0752d297a1d0dc38ae","observation_id":"80ab844c-9bf1-4ca8-9b36-d3df940fa547","resolution":{"observed_at":"2026-07-09T19:06:27.300253Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.676073Z","title":"Borovik, Israel M","venue":null,"work_id":"07c619eb-ed0f-4193-a459-14f74660c023","year":2003},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:88c91e721fc9b587118458b420bd57d548dbb2f5e6ab1104326ba90f03b48ddf","observation_id":"8bf55201-a33e-4b47-9459-2361238987f7","resolution":{"observed_at":"2026-07-09T19:06:27.677225Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5070/c66165701","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quotients of M-convex sets and M-convex functions.Combinatorial Theory, 6(1), 2026.doi:10.5070/C66165701","venue":"Combinatorial Theory","work_id":"21d18c1c-4f64-4be1-8977-9f0c0c8af8fb","year":2026},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:348b742b5e9b8631574f7c636b168e2f84bc6073b8ca42370a307aba441f011d","observation_id":"5e9f4e77-0219-44ce-ac8b-af0ed7f1a46b","resolution":{"observed_at":"2026-07-09T19:06:27.298116Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.672641Z","title":"Multiwinner elections with diversity constraints","venue":null,"work_id":"50d5d6c3-1b3e-472c-8160-cfb794198536","year":2018},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:0c490f774f4c59d251920cfb66276255f5a01bab3fb21e2e44399ef9b908632c","observation_id":"79ea1614-bd9b-4cb1-86fc-ebb79d7cf6ae","resolution":{"observed_at":"2026-07-09T19:06:27.673818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/2038115","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the American Mathematical Society","work_id":"654a3af0-1eda-4425-8ce2-138bc7eafce6","year":1971},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:22be04781ece20a58ff53f80e32cacf2908f3bb1914f4999b5a5505330f5413b","observation_id":"36a447a6-38ab-4e79-b674-41deed43404a","resolution":{"observed_at":"2026-07-09T19:06:27.342322Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511629563.010","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Constructions","venue":"Cambridge University Press eBooks","work_id":"3afe0553-0e6e-46b4-b805-9f6a04f7c1ea","year":1986},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:6e93759a28f49e9373ed56e27f0212d1f9dd5397f8f1c5575c35af66f78b750a","observation_id":"a12a6a26-428d-49c9-bc98-f2fe578b1817","resolution":{"observed_at":"2026-07-09T19:06:27.317888Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-98327-7_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Flag matroids: algebra and geometry","venue":"Springer proceedings in mathematics & statistics","work_id":"ff41e447-e7d1-43af-a960-549e9a4f0d56","year":2022},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:aa02a16fda89c0cc2d231674ac561129ce1248fb50368ebb71ea9c4c9a0ed5fd","observation_id":"f245f732-2ffc-4c3f-871b-d3651320fb42","resolution":{"observed_at":"2026-07-09T19:06:27.322134Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.674406Z","title":"Elisa Celis, Damian Straszak, and Nisheeth K","venue":null,"work_id":"851972a7-fca3-4277-b383-cccdaee8e9e9","year":2018},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:7b575dda7f89b460c3da2edde1d8d218109c85916851c61e24c8112de5e33348","observation_id":"1127b357-e26e-4aa2-9517-a407000da0c7","resolution":{"observed_at":"2026-07-09T19:06:27.675571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T19:06:27.329439Z","title":"(Almost-)optimal FPT algorithm and kernel for T-Cycle on planar graphs","venue":null,"work_id":"990a3ddc-ad0b-497b-88a9-14f1d66f8371","year":2018},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:d50a82f2d18050afa6a52686ba1a9c8417b6289398bba75a1b1faa2fe41a517b","observation_id":"fe748e05-fddf-42bf-8e12-b5bc9fa6bcb2","resolution":{"observed_at":"2026-07-09T19:06:27.330758Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2025/38","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Improved rank aggregation under fairness constraint","venue":null,"work_id":"d4a3327d-d787-409a-b86a-1064cd375284","year":2025},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:4fa4734d678b88cc659e683ab3b3ee06234b3e0a3345e1450a3e81ef94d8c10d","observation_id":"31518f10-7e42-4787-9536-d873c19638de","resolution":{"observed_at":"2026-07-09T19:06:27.296082Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.10499","last_updated":"2023-08-21T06:38:43Z","snapshot_observed_at":"2026-08-16T15:07:05.841385Z","submitted_at":"2023-08-21T06:38:43Z","title":"Fair Rank Aggregation","version":1},"cited_work":{"arxiv_id":"2308.10499","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.10499","snapshot_observed_at":"2026-07-09T19:06:27.364649Z","title":"Fair Rank Aggregation","venue":"cs.DS","work_id":"18d91848-d592-43a5-a427-d8fcd2629798","year":2023},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"cited_paper":"/paper/2308.10499","citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:8462b308311ff30f6762e70719f6d116b9412b1a6893a2bb3dd8a4b25c39fddc","observation_id":"267b547c-87d3-4d24-804f-c4f90cd347b0","resolution":{"observed_at":"2026-07-09T19:06:27.365849Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/050627873","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A natural family of flag matroids.SIAM Journal on Discrete Mathematics, 21(1):130–140, 2007.doi:10.1137/050627873","venue":"SIAM Journal on Discrete Mathematics","work_id":"7f6127bc-77b3-4857-a0ae-79005d3f75f5","year":2007},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:0adfe27050b7b28e05f947eab6fcc53c695885b6ac3b02f91ce87990491840ab","observation_id":"26871267-9c9e-4b92-bf7c-f95852d3b463","resolution":{"observed_at":"2026-07-09T19:06:27.314823Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.106057","doi":"10.1016/j.jet.2025.106057","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bumin Yenmez","venue":"Journal of Economic Theory","work_id":"728e8113-bea8-439c-b513-13b01288ab2a","year":2025},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:1b3bf6bc3fae544b09891d76bdf55cb88af3906370c324d3cd81da8cfeb86416","observation_id":"45b5d655-db6b-4077-b72b-972d6d31dbba","resolution":{"observed_at":"2026-07-09T19:06:27.308393Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1920.372165","doi":"10.1145/371920.372165","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank aggregation methods for the Web","venue":null,"work_id":"829665d1-b804-4c2c-82d6-4db6ab405c6d","year":2001},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:5629c60cbe3f336c78f2db468f8994eaedd094ab782992ca5fa6089d72a5762d","observation_id":"1338bcd8-14be-42cf-945d-14968feda927","resolution":{"observed_at":"2026-07-09T19:06:27.339178Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-14T09:20:17.861815+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T09:20:17.861815+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2021/28","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kemeny consensus complexity","venue":null,"work_id":"8948e806-042c-49eb-a470-02a5e4b5b672","year":2021},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:bc16ea80b5ae51a6d848beb62c81bf5d35077183635a0f9aceec7dfa826fc320","observation_id":"0093e76c-2501-4213-8b2a-2234e93e90f0","resolution":{"observed_at":"2026-07-09T19:06:27.298359Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.654472Z","title":"Oxford University Press, Oxford, 2011","venue":null,"work_id":"ca705324-fbcc-45fe-aaa4-4fcfb6e8e1f1","year":2011},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:785b214739378e65fa679343291fbc03b8e338a24838c2f02092c51a2ede44cb","observation_id":"c64d1c6c-2f62-4b8e-84ef-55b236ab1499","resolution":{"observed_at":"2026-07-09T19:06:27.655876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0021-9800(68)80039-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"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","venue":"Journal of Combinatorial Theory","work_id":"a01b82c4-c9e3-4c2c-83f7-24244f754ad6","year":1968},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:82915f8bf5cdc8683136e1f450e30bc921021eb851544f5e1c08d24f8ffd95fd","observation_id":"5eb9d117-cbb9-4ac9-9f38-b4a57e27ba5d","resolution":{"observed_at":"2026-07-09T19:06:27.312923Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5555/578533","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T19:06:27.288302Z","title":"Garey and David S","venue":null,"work_id":"0d758140-bdd6-446c-90a1-da2195e5938c","year":1979},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:405256e45bd58d791d1be34312849e8f3801d3ce644b42f5f7b544343fc4c41e","observation_id":"64d3d5c5-c557-4b6f-992a-85d668cac284","resolution":{"observed_at":"2026-07-09T19:06:27.289983Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0211.360467","doi":"10.1145/3600211.3604671","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"& Virk, G","venue":null,"work_id":"27aa7da5-3609-4c33-acc2-7bf53675e11d","year":2023},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:f976ff3fc318d8d08ce01140a3adf2a10d88017c2804051d4efa5a56b958b6ee","observation_id":"fd387249-a8d7-4b81-ae86-05f74d108f4c","resolution":{"observed_at":"2026-07-09T19:06:27.345574Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2005.08","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T19:06:27.273006Z","title":"The complexity of Kemeny elec- tions.Theoretical Computer Science, 349:382–391, 2005.doi:10.1016/j.tcs.2005.08","venue":null,"work_id":"5c89887f-2050-43f2-838c-f8b2cbe83e82","year":2005},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:a4fa79c7918e2f67c1f8c195664fc81d15962b3c8f09fc2c096b35220cdf2831","observation_id":"7f73b0e9-3af6-4ce2-99f2-9010d6908194","resolution":{"observed_at":"2026-07-09T19:06:27.274736Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.37236/10105","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Packing of mixed hyperarborescences with flexible roots via matroid intersection.The Electronic Journal of Combinatorics, 28(3):P3.29, 2021.doi: 10.37236/10105","venue":"The Electronic Journal of Combinatorics","work_id":"ea6a2a70-f367-4e19-842e-ecb12622ab1c","year":2021},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:e19ceabfd0702b7b2169c349dcad0aa0670787cbe0dad123dc3fd120b47e5789","observation_id":"9e399ef3-1f89-40ae-809c-efe1696ef0a6","resolution":{"observed_at":"2026-07-09T19:06:27.319817Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2023.109396","doi":"10.1016/j.aim.2023.109396","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Flag matroids with coefficients.Advances in Mathe- matics, 436:109396, 2024.doi:10.1016/j.aim.2023.109396","venue":"Advances in Mathematics","work_id":"32b11222-12ca-4da5-aae8-c59959439325","year":2024},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:a2dd226f1ef40407a168b5a205906d245346318f040bdbe2d7a883739bb36122","observation_id":"860607be-0d0d-4477-9cd6-d554f8f4b705","resolution":{"observed_at":"2026-07-09T19:06:27.335766Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.645495Z","title":null,"venue":null,"work_id":"793c5a18-4230-49ec-a60a-23ad7a61f02c","year":1972},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:8d39783002d83b11ca9bf241b9c181471d1af96e388f49a060e381b69666bbf7","observation_id":"46f20820-430d-46f4-b5e4-7dad47538789","resolution":{"observed_at":"2026-07-09T19:06:27.646613Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.639931Z","title":null,"venue":null,"work_id":"88eba390-7da5-4105-af92-bf7980165e09","year":1959},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:1dc6f3730d2d090e9a5c53b8d123dc3d21747db568bb31ef87eac0b30e058c50","observation_id":"1905aa3c-2c05-41a8-8c36-659f306efafe","resolution":{"observed_at":"2026-07-09T19:06:27.641313Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0790.125080","doi":"10.1145/1250790.1250801","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Proceedings of the Thirty-ninth Annual AC M Symposium on Theory of Computing, pp","venue":null,"work_id":"48ae1dc5-dc5c-4650-923d-05eb3594edfe","year":2007},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:f523d9e4a9d1c4accc50c5e19f5e6f9da67ba7d6706e03d2cdf781e413fc72bb","observation_id":"a45dab1d-0985-4c34-91cd-bf2d6db4424d","resolution":{"observed_at":"2026-07-09T19:06:27.306945Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2023.06.041","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On weakly and strongly popular rankings","venue":"Discrete Applied Mathematics","work_id":"5862b180-9b04-454f-a185-77052e374737","year":2023},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:044cf40687537a5575a2b22c8dccb579666a20933ca847f181e369b55da58255","observation_id":"143e409a-957e-426f-85cb-6621c2aa38e3","resolution":{"observed_at":"2026-07-09T19:06:27.308879Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"oso/9780198","doi":"10.1093/acprof:oso/9780198237907.003.0008","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Oxford Univer- sity Press (2018).https://doi.org/10.1093/oso/9780198814788.001.0001","venue":null,"work_id":"a1b77a81-dfdc-490e-805b-591b44077c3d","year":2016},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:0c05023c5af0e6e37a21d3e0a3d88c6870cacfb2fc66c03a6257c44966cbddd3","observation_id":"2f78a25b-636d-44fa-8261-4e68b54eadbc","resolution":{"observed_at":"2026-07-09T19:06:27.369159Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1112/plms/s3-19.1.17","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"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","venue":"Proceedings of the London Mathematical Society","work_id":"a9272130-0548-41a4-ae94-e35fac99550c","year":1969},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:c7793404ef7f7d27340944389b090c4c17bf1008437108b995b3cf2ff8294e89","observation_id":"1a9a01f6-fd59-4c86-9d51-9e985c764dbf","resolution":{"observed_at":"2026-07-09T19:06:27.327485Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.662130Z","title":"Springer","venue":null,"work_id":"4131ee85-d79c-4394-8280-a22856379f35","year":2003},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:757b92c5bd6cc01318a35eeec4a575f5525ff054fd714acaae63086f483c0ffe","observation_id":"cafce668-72a3-4e52-ac14-22a4e971fbf6","resolution":{"observed_at":"2026-07-09T19:06:27.663199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0166-218x(01)00362-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A framework for the greedy algorithm.Discrete Applied Mathematics, 121(1–3):247–260, 2002.doi:10.1016/S0166-218X(01)00362-6","venue":"Discrete Applied Mathematics","work_id":"6b98719e-fb72-4e1d-98e2-d2d28f86eb1d","year":2002},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:175dc217904bd5052b044627adcedf9cc3dc5562fbeecbee80ae4de45311d3b4","observation_id":"2a4bd438-6b9b-4093-9088-e876d5d75884","resolution":{"observed_at":"2026-07-09T19:06:27.328668Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2024/915","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A survey on rank aggre- gation","venue":null,"work_id":"c9973b17-58aa-46f8-ae08-536a02a5d21b","year":2024},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:382276de0e393bc5cc85882f064726128b9d8108b950fb3c8b370adb89b18398","observation_id":"8aa40f68-cccc-4b63-bdd3-752e1085224e","resolution":{"observed_at":"2026-07-09T19:06:27.316474Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3514221","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank aggregation with proportionate fairness","venue":null,"work_id":"14b56535-4f26-4f16-bfe8-b4ac2c35c256","year":2022},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:b15c0c505ae578508bdc4f4e0f146694dbfad28ab548f53bc639aa1c0abffc82","observation_id":"d30cb4f8-c238-42c7-9568-47e99b35222e","resolution":{"observed_at":"2026-07-09T19:06:27.335170Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-03T14:38:07.974429+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T14:38:07.974429+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2016.0802","doi":"10.1287/moor.2016.0802","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A generalized polymatroid approach to stable matchings with lower quotas","venue":"Mathematics of Operations Research","work_id":"0bb9cfcb-3763-4b41-ae49-105d4f82fe2a","year":2017},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:4ffcd539deea01563e77413914c6aa60ec3002858830301c637b77376a074b7e","observation_id":"d8bffd53-0593-4c7b-8fda-8ebe6bda7d13","resolution":{"observed_at":"2026-07-09T19:06:27.322887Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.668911Z","title":"Peyton Young and Arthur Levenglick","venue":null,"work_id":"f9a2fd11-b12e-4eb2-b203-cd54cedcd45c","year":1978},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:de4e7fe7274b621634725588cd61db9a4936640edd4d2d414dd119386cd3f573","observation_id":"37a8db66-1365-42d3-bcca-40c3d6c6d7b3","resolution":{"observed_at":"2026-07-09T19:06:27.670320Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/1961757","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Condorcet’s theory of voting.American Political Science Review, 82(4):1231–1244, 1988.doi:10.2307/1961757","venue":"American Political Science Review","work_id":"ad548f7c-5f11-4383-a76e-dd6705718f10","year":1988},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:dc3e9c16bd6e59aa75e6e67c2f6014cbb7f087060b20cdfc60b6478c6ea72c9e","observation_id":"bc7bffa0-3570-42b8-bb4c-42313564bd62","resolution":{"observed_at":"2026-07-09T19:06:27.341006Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2847.313293","doi":"10.1145/3132847.3132937","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multi-Task Neural Network for Non-discrete Attribute Prediction in Knowledge Graphs","venue":null,"work_id":"bd29e33c-fd18-4970-afc4-88aee1ff3243","year":2017},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:e98d3ef30122b56dc94829223b463077494a956eef0dc00cd0e2fc365394a0a5","observation_id":"1f2313fc-2867-4638-be4a-7214f69b276c","resolution":{"observed_at":"2026-07-09T19:06:27.278872Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.641667Z","title":"This is equivalent to the condition that for everyi∈[s−1]andB∈ B i, there existsB′ ∈ B i+1 withB⊆B ′","venue":null,"work_id":"0154afb0-e196-4ed1-a61c-47e62a293444","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:6fb0e059e3785522696e9bba5477ac97c379283221dbd36b69563a3f3be238e6","observation_id":"d9590ae9-3d87-4c9f-a4dd-ae5adf2ff645","resolution":{"observed_at":"2026-07-09T19:06:27.642969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.667291Z","title":"3.(M 1, M2,","venue":null,"work_id":"8ba2b0ef-3993-48bc-b9a4-a0034128adea","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:04dbb2adadf4d3ea9c7642affa6c57cd2823580fc8dbe5e3b5c1294bfb4f183a","observation_id":"b3a38919-be8a-4207-8374-e17a6eeb25ee","resolution":{"observed_at":"2026-07-09T19:06:27.668370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.670908Z","title":", s, do the following","venue":null,"work_id":"17757248-b2a5-4188-b3e9-378532f79a9e","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:67b5d4343072ada7c8b4359a83276d40fca777041420d58f7ccc47836776702b","observation_id":"2f6333db-afea-4b03-b625-1ce9cceacd12","resolution":{"observed_at":"2026-07-09T19:06:27.672077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.665478Z","title":", Bs)and outputπ B as defined in Section 4","venue":null,"work_id":"7873ea36-63cb-4336-a15f-b7ec86eb6df3","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:0a3c24ae00bcbac7aede934b2a060a028f724104488bcd1030ee487a20b13e64","observation_id":"c55bae8f-4826-46c7-b0e9-0f5c6c03ae45","resolution":{"observed_at":"2026-07-09T19:06:27.666737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.658260Z","title":",1, do the following","venue":null,"work_id":"54930db3-7f67-426f-9271-a2655e4a8aea","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:c7e068d3cb05f1a0538efdbcc32ae08ad9b4706024e51640e1425eee6341dfc9","observation_id":"b0cc11ac-7aab-4793-a68b-07fe2934b905","resolution":{"observed_at":"2026-07-09T19:06:27.659598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.663754Z","title":", Bs)and outputπ B as defined in Section 4","venue":null,"work_id":"dea4950a-ddfa-4129-a87c-b498e93f9685","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:4b62d218251bcee6acff472b5423d4780dae24be4ca483b3b0781cc58f998885","observation_id":"0b9d23af-a1cb-40a9-b3a4-bcbc0e5e6498","resolution":{"observed_at":"2026-07-09T19:06:27.664818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.647209Z","title":"Indeed, we can impose these assumptions without loss of generality","venue":null,"work_id":"b713b73c-d327-4805-ba21-52a5c31ea783","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:80415b6302d946f66551f8ae9693c63795e0281a39b1484e2a8e5940f4e177d8","observation_id":"3a5bb13b-173d-49dc-b25b-79cb85d83492","resolution":{"observed_at":"2026-07-09T19:06:27.648543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.656441Z","title":null,"venue":null,"work_id":"f5b6037f-12ae-4073-90c0-0a63dfcd5db4","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:1d7dd49180a3f168766c0399fc858d4063f3fd768c3354d3086f562ebea20395","observation_id":"7a4e8258-8be3-4338-809b-f8b36031fb08","resolution":{"observed_at":"2026-07-09T19:06:27.657695Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.651068Z","title":null,"venue":null,"work_id":"5bd5256f-ca23-4565-b751-5b7f035e9e5d","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:c53735024c56e26a75d350c9f675d1cd4e02da8e19d64dd4d354692e440e3927","observation_id":"e63c493a-4c71-4467-99da-5f8259aa2ca4","resolution":{"observed_at":"2026-07-09T19:06:27.652181Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.660214Z","title":"To generalize their algorithm to Matroid-FRA, we consider solving the following generalized version of the colorful bi-partition subproblem","venue":null,"work_id":"486df5a1-c00e-424b-bcb8-ed8038e614da","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:808fb953cace1548a121d848e2dd47209cca72125ab8d002fd78c4245c9910ad","observation_id":"be9c5fe1-dd57-47a3-8ce4-d7fb18d83b5f","resolution":{"observed_at":"2026-07-09T19:06:27.661583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.652793Z","title":null,"venue":null,"work_id":"a59fd6c3-582f-46ba-9700-27cd5442be7b","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:bfb7f1e2b0aa4366df318796142974b45eec9ff3243844a68408d5b6ad4c72b5","observation_id":"4012232d-93c5-4418-8ec0-36de0d3b3074","resolution":{"observed_at":"2026-07-09T19:06:27.653920Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.638134Z","title":null,"venue":null,"work_id":"a0893ae4-f581-4771-885e-0570d7a73adb","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:b81358d81c9aac0a99a5077bc6f9703c270c8d21b376e0d3b95bed6f48c0b0d5","observation_id":"dc74921e-9b78-4b13-b7f1-216c773ae0e0","resolution":{"observed_at":"2026-07-09T19:06:27.639386Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.641869Z","title":"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 α","venue":null,"work_id":"e55f176d-5c03-458c-bb6c-8afb2421e858","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:42182731e690ba9ade58ad7ecb834133259262a9fe1d6d2e4499afd141ced8f8","observation_id":"6bdce3cd-b120-4fdb-a305-9fb48e31c8fc","resolution":{"observed_at":"2026-07-09T19:06:27.643359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.643843Z","title":null,"venue":null,"work_id":"53a07124-4a1e-4c3f-aecc-425aca28e89e","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:e3a32d4c2e53b3caaa7a16f682558088699f517e61813852d89837e896d25aad","observation_id":"c7b1935c-4b22-4e05-a25e-0056feabecbb","resolution":{"observed_at":"2026-07-09T19:06:27.645007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-09T19:06:27.649069Z","title":"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","venue":null,"work_id":"5595c126-fd46-466f-9391-1323193da1d4","year":null},"citing_paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-09T18:58:33.764487Z"},"links":{"citing_paper":"/paper/2607.07153"},"observation_digest":"sha256:9c00a4c4b4b623fb9c88cbc6136f0b9d4596a5109acaebac3319704bb7d1a168","observation_id":"021791a7-d14b-4e65-8568-decb5da578f7","resolution":{"observed_at":"2026-07-09T19:06:27.650554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.07153","last_updated":"2026-07-08T08:47:23Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-21T21:46:31.526220Z","submitted_at":"2026-07-08T08:47:23Z","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":8,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":6,"verified_exact":25,"verified_fuzzy":14},"total_outbound_references":57},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2607.07153."}