Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-07-11T11:50:26.030339Z
Paper Citation Record · LEDGER
Stable Matchings with Minimum Utility Gap
As of 10 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2607.07160.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
36 of 36 outbound references displayed
- verified exact17
- verified fuzzy7
- unresolved6
- parse uncertain0
- malformed identifier4
- metadata mismatch2
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation c72564e4-2eca-4e2f-bfdb-c20db3d14c0a · outbound
This paper cites Many-to-manymatching: Stablepolyandrouspolygamy (or polygamous polyandry).Discrete Applied Mathematics, 101(1–3):1–12, 2000.doi: 10.1016/S0166-218X(99)00203-6.
Stable Matchings with Minimum Utility Gap Many-to-manymatching: Stablepolyandrouspolygamy (or polygamous polyandry).Discrete Applied Mathematics, 101(1–3):1–12, 2000.doi: 10.1016/S0166-218X(99)00203-6
Reference 1
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.079176Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 3b9a7f01-14f3-4c00-ac9a-c6ebdbf3e653 · outbound
This paper cites Polynomialtimealgorithmforanop- timal stable assignment with multiple partners.Theoretical Computer Science, 379(3):317– 328, 2007.doi:10.1016/j.tcs.2007.02.050.
Stable Matchings with Minimum Utility Gap Polynomialtimealgorithmforanop- timal stable assignment with multiple partners.Theoretical Computer Science, 379(3):317– 328, 2007.doi:10.1016/j.tcs.2007.02.050
Reference 2
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.063186Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation be89dbb7-c994-4443-8c42-ea979714d587 · outbound
This paper cites an unresolved cited work.
Stable Matchings with Minimum Utility Gap Unresolved cited work
Reference 3
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.076775Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 2de36b46-f5cb-4e8c-84cf-3791e84311c8 · outbound
This paper cites Cormen, CharlesE.
Stable Matchings with Minimum Utility Gap Cormen, CharlesE
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-09T18:56:27.845118Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 61900490-c85f-4869-879e-7bf495ae0b77 · outbound
This paper cites Superluminal Neutrinos and Monopoles.
Stable Matchings with Minimum Utility Gap Superluminal Neutrinos and Monopoles
Reference 5
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-07-09T18:56:27.039906Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation ad9dbac1-0fff-464d-b85a-73431292cd0e · outbound
This paper cites Minimum Cut Representability of Stable Matching Problems.
Stable Matchings with Minimum Utility Gap Minimum Cut Representability of Stable Matching Problems
Reference 6
- Resolution
- verified exact
- local_arxiv, observed 2026-07-09T18:56:27.279457Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation a775343c-eff5-4da3-8c39-901c8ab9d033 · outbound
This paper cites Affinely representable lattices, stable matchings, and choice functions.Mathematical Programming, 197(2):721–760, 2023.doi:10.1007/ s10107-022-01838-z.
Stable Matchings with Minimum Utility Gap Affinely representable lattices, stable matchings, and choice functions.Mathematical Programming, 197(2):721–760, 2023.doi:10.1007/ s10107-022-01838-z
Reference 7
- Resolution
- malformed identifier
- raw_fallback, observed 2026-07-09T18:56:27.865410Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation e647867d-3808-4def-894c-01c51af7ef03 · outbound
This paper cites American Mathematical Society, 1995.doi:10.1090/memo/0555.
Stable Matchings with Minimum Utility Gap American Mathematical Society, 1995.doi:10.1090/memo/0555
Reference 8
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.053776Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 860c7858-f6cd-4cca-8915-c8f9b7f361bf · outbound
This paper cites an unresolved cited work.
Stable Matchings with Minimum Utility Gap Unresolved cited work
Reference 9
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.057287Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation e0fded12-4704-43d7-b011-33ac017cef31 · outbound
This paper cites Balanced stable marriage: How close is close enough?Theoretical Computer Science, 883:19–43, 2021.
Stable Matchings with Minimum Utility Gap Balanced stable marriage: How close is close enough?Theoretical Computer Science, 883:19–43, 2021
Reference 10
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.067545Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 5556c0aa-d363-42fb-9de0-fbe3267770ed · outbound
This paper cites Three fast algorithms for four problems in stable marriage.SIAM Journal on Computing, 16(1):111–128, 1987.doi:10.1137/0216010.
Stable Matchings with Minimum Utility Gap Three fast algorithms for four problems in stable marriage.SIAM Journal on Computing, 16(1):111–128, 1987.doi:10.1137/0216010
Reference 11
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.055142Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation ef61bf7f-8477-472c-bb8a-896efacdadfd · outbound
This paper cites Irving.The Stable Marriage Problem: Structure and Algo- rithms.
Stable Matchings with Minimum Utility Gap Irving.The Stable Marriage Problem: Structure and Algo- rithms
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-09T18:56:27.863652Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 92f7a08e-e566-410b-b9ae-07e391adb870 · outbound
This paper cites an unresolved cited work.
Stable Matchings with Minimum Utility Gap Unresolved cited work
Reference 13
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.065075Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation e5d6b307-c0fb-4802-820d-4fa19db97125 · outbound
This paper cites Irving and Paul Leather.
Stable Matchings with Minimum Utility Gap Irving and Paul Leather
Reference 14
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.061141Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 020dcec8-1b33-4172-a0d8-871b4450f94d · outbound
This paper cites Irving, Paul Leather, and Dan Gusfield.
Stable Matchings with Minimum Utility Gap Irving, Paul Leather, and Dan Gusfield
Reference 15
- Resolution
- verified exact
- arxiv_id, observed 2026-07-09T18:56:27.068591Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation f812524e-4a9e-4dfd-af9e-f5894f177d3c · outbound
This paper cites A combinatorial strongly polynomial algorithm for minimizing submodular functions.Journal of the ACM, 48(4):761–777, 2001.
Stable Matchings with Minimum Utility Gap A combinatorial strongly polynomial algorithm for minimizing submodular functions.Journal of the ACM, 48(4):761–777, 2001
Reference 16
- Resolution
- verified exact
- arxiv_id, observed 2026-07-09T18:56:27.071252Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation c5ddddc7-17d9-4ead-8a53-fcbc5b2e0cc1 · outbound
This paper cites Maximizing Nash social welfare under two-sided preferences.
Stable Matchings with Minimum Utility Gap Maximizing Nash social welfare under two-sided preferences
Reference 17
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.050566Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 6629f269-eb58-493f-b38a-9bd09d26f625 · outbound
This paper cites Karlin, Shayan Oveis Gharan, and Robbie Weber.
Stable Matchings with Minimum Utility Gap Karlin, Shayan Oveis Gharan, and Robbie Weber
Reference 18
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-07-09T18:56:27.040020Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation b6220ae4-4c70-4b2a-9ca7-c6077ee542d6 · outbound
This paper cites Karzanov.
Reference 19
- Resolution
- malformed identifier
- raw_fallback, observed 2026-07-09T18:56:27.856756Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 0e3e2349-6dca-46e2-aa6e-7cca4e6f0c2f · outbound
This paper cites Complexity of the sex-equal stable marriage problem.Japan Journal of Industrial and Applied Mathematics, 10(1):1, February 1993.
Stable Matchings with Minimum Utility Gap Complexity of the sex-equal stable marriage problem.Japan Journal of Industrial and Applied Mathematics, 10(1):1, February 1993
Reference 20
- Resolution
- verified exact
- doi, observed 2026-07-09T18:56:27.074566Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation d54cb67b-f5fc-4769-ad34-cf6f553fd757 · outbound
This paper cites Knuth.Mariages stables et leurs relations avec d’autres problèmes combina- toires.
Stable Matchings with Minimum Utility Gap Knuth.Mariages stables et leurs relations avec d’autres problèmes combina- toires
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-09T18:56:27.858590Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation d546db01-97ca-41a0-8f1d-7ecdd84281f6 · outbound
This paper cites Manlove.Algorithmics of Matching Under Preferences, volume 2 ofSeries on Theoretical Computer Science.
Stable Matchings with Minimum Utility Gap Manlove.Algorithmics of Matching Under Preferences, volume 2 ofSeries on Theoretical Computer Science
Reference 22
- Resolution
- malformed identifier
- doi_truncated, observed 2026-07-09T18:56:27.028560Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 7abbe354-9cb4-4b15-ad2c-8e25e216d45c · outbound
This paper cites On achieving leximin fairness and stability in many-to-one matchings.
Stable Matchings with Minimum Utility Gap On achieving leximin fairness and stability in many-to-one matchings
Reference 23
- Resolution
- verified exact
- arxiv_id, observed 2026-07-09T18:56:27.076797Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation dda7a5f8-b630-4fcc-acbe-a0dfce27b847 · outbound
This paper cites Roth and Marilda A.
Stable Matchings with Minimum Utility Gap Roth and Marilda A
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-09T18:56:27.855099Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 1513e5d8-429a-4eab-baa1-f4646fe46bdf · outbound
This paper cites A combinatorial algorithm minimizing submodular functions in strongly polynomial time.Journal of Combinatorial Theory, Series B, 80(2):346–355, 2000.
Stable Matchings with Minimum Utility Gap A combinatorial algorithm minimizing submodular functions in strongly polynomial time.Journal of Combinatorial Theory, Series B, 80(2):346–355, 2000
Reference 25
- Resolution
- verified exact
- arxiv_id, observed 2026-07-09T18:56:27.037319Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 3a91f564-2f9c-4e8c-883a-b13a7561dd3a · outbound
This paper cites Many-to-one stable matching: Ge- ometry and fairness.Mathematics of Operations Research, 31(3):581–596, 2006.doi: 10.1287/moor.1060.0207.
Stable Matchings with Minimum Utility Gap Many-to-one stable matching: Ge- ometry and fairness.Mathematics of Operations Research, 31(3):581–596, 2006.doi: 10.1287/moor.1060.0207
Reference 26
- Resolution
- verified exact
- arxiv_id, observed 2026-07-09T18:56:27.072023Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 3779adc6-264e-4308-a418-f157f8f03b10 · outbound
This paper cites The geometry of fractional stable matchings and its applications.Mathematics of Operations Research, 23(4):874–891, 1998.doi:10.1287/ moor.23.4.874.
Stable Matchings with Minimum Utility Gap The geometry of fractional stable matchings and its applications.Mathematics of Operations Research, 23(4):874–891, 1998.doi:10.1287/ moor.23.4.874
Reference 27
- Resolution
- malformed identifier
- raw_fallback, observed 2026-07-09T18:56:27.860423Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 48a35b4b-1b77-4a7c-a85c-14ba0963cd95 · outbound
This paper cites Thus condition (b) fails for∆rat as well.
Stable Matchings with Minimum Utility Gap Thus condition (b) fails for∆rat as well
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-09T18:56:27.862015Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 01c203bf-bdf6-47d4-afe1-eb2c5fb945d7 · outbound
This paper cites an unresolved cited work.
Stable Matchings with Minimum Utility Gap Unresolved cited work
Reference 29
- Resolution
- unresolved
- raw_fallback, observed 2026-07-09T18:56:27.853213Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation d656c777-5891-4c12-90c2-143da667705b · outbound
This paper cites an unresolved cited work.
Stable Matchings with Minimum Utility Gap Unresolved cited work
Reference 30
- Resolution
- unresolved
- raw_fallback, observed 2026-07-09T18:56:27.845860Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 73196a80-3959-470f-8942-d5d6cd01ba60 · outbound
This paper cites an unresolved cited work.
Stable Matchings with Minimum Utility Gap Unresolved cited work
Reference 31
- Resolution
- unresolved
- raw_fallback, observed 2026-07-09T18:56:27.842448Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 70d0068e-ae66-4b72-91d9-c489a6ae75d4 · outbound
This paper cites an unresolved cited work.
Stable Matchings with Minimum Utility Gap Unresolved cited work
Reference 32
- Resolution
- unresolved
- raw_fallback, observed 2026-07-09T18:56:27.840884Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 36d7b608-dc35-42f0-b82b-d6f9a4dd5f74 · outbound
This paper cites an unresolved cited work.
Stable Matchings with Minimum Utility Gap Unresolved cited work
Reference 33
- Resolution
- unresolved
- raw_fallback, observed 2026-07-09T18:56:27.844150Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 96876b30-002a-413a-a849-51377ae6cd88 · outbound
This paper cites an unresolved cited work.
Stable Matchings with Minimum Utility Gap Unresolved cited work
Reference 34
- Resolution
- unresolved
- raw_fallback, observed 2026-07-09T18:56:27.847678Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation e08f4a46-9eef-423c-a569-27543705d20a · outbound
This paper cites The values in (5) and (6) are attained in the student-optimal stable matching, while those in (7) and (8) are attained in the student-pessimal stable matching.
Stable Matchings with Minimum Utility Gap The values in (5) and (6) are attained in the student-optimal stable matching, while those in (7) and (8) are attained in the student-pessimal stable matching
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-09T18:56:27.851207Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 37ad1cd7-85c1-4938-8763-027712f077b0 · outbound
This paper cites Hence the utility gap is ∆diff(M) = B+ P i∈J ai − B+ T 2 = P i∈J ai − T 2.
Stable Matchings with Minimum Utility Gap Hence the utility gap is ∆diff(M) = B+ P i∈J ai − B+ T 2 = P i∈J ai − T 2
Reference 36
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-07-09T18:56:27.849240Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Pith citing papers
No inbound Pith citation observations are available.