Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-09T12:11:48.792004Z
Paper Citation Record · LEDGER
Near-Feasible Solutions to Complex Stable Matching Problems
As of 10 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 1 inbound Pith citation observation for arXiv:2502.02503.
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, observed 2026-07-30T11:05:46.997482Z
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
26 of 26 outbound references displayed
- verified exact3
- verified fuzzy18
- unresolved5
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 013f5a21-7c6b-47e3-9033-78dcf38dd466 · outbound
This paper cites Theoretical Computer Science 931 (2022), 1–16.
Near-Feasible Solutions to Complex Stable Matching Problems Theoretical Computer Science 931 (2022), 1–16
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.984670Z
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 874f7aea-b062-4aaf-982f-2e237602e3fc · outbound
This paper cites Algorithms 7, 51–62.
Near-Feasible Solutions to Complex Stable Matching Problems Algorithms 7, 51–62
Reference 11
- Resolution
- verified exact
- doi, observed 2026-08-09T12:11:48.838101Z
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 b175266a-d36c-4319-a8ae-a335326c2d50 · outbound
This paper cites Algorithms 6 (03 2013), 161–168.
Near-Feasible Solutions to Complex Stable Matching Problems Algorithms 6 (03 2013), 161–168
Reference 16
- Resolution
- verified exact
- doi, observed 2026-08-09T12:11:48.828653Z
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 8db15b1d-34c8-4d17-b83d-120632f2175f · outbound
This paper cites Operations Research 67, 6 (2019), 1503–1519.
Near-Feasible Solutions to Complex Stable Matching Problems Operations Research 67, 6 (2019), 1503–1519
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.900279Z
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 ec599cee-a50e-459b-98c6-f55995b3a89c · outbound
This paper cites Journal of Algorithms 12, 1 (1991), 154–178.
Near-Feasible Solutions to Complex Stable Matching Problems Journal of Algorithms 12, 1 (1991), 154–178
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.871774Z
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 cf0eb3f8-f2fc-4457-adb6-1e80e0111491 · outbound
This paper cites an unresolved cited work.
Near-Feasible Solutions to Complex Stable Matching Problems Unresolved cited work
Reference 26
- Resolution
- unresolved
- raw_fallback, observed 2026-08-09T12:11:48.862278Z
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 ccf0dbf6-5670-4fd7-9dbf-52f33a57d9a8 · outbound
This paper cites The American Mathematical Monthly 69, 1 (1962), 9–15.
Near-Feasible Solutions to Complex Stable Matching Problems The American Mathematical Monthly 69, 1 (1962), 9–15
Reference 1962
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.966427Z
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 4be995e2-5f65-4443-b3fb-710ef7b0a8b0 · outbound
This paper cites Econometrica: Journal of the Econometric Society (1967), 50–69.
Near-Feasible Solutions to Complex Stable Matching Problems Econometrica: Journal of the Econometric Society (1967), 50–69
Reference 1967
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.881663Z
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 50789a72-37a1-4ea2-b183-ac22337fe25a · outbound
This paper cites Journal of Political Economy 92, 6 (1984), 991–1016.
Near-Feasible Solutions to Complex Stable Matching Problems Journal of Political Economy 92, 6 (1984), 991–1016
Reference 1984
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T12:11:48.780114Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 32093cf7-eafd-49c2-a6da-84ca69b1f927 · outbound
This paper cites stable roomma tes.
Near-Feasible Solutions to Complex Stable Matching Problems stable roomma tes
Reference 1985
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.955966Z
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 97e86c36-dbf7-4274-9445-51f1ccb0930f · outbound
This paper cites SIAM Journal on Discrete Mathe- matics 4, 2 (1991), 245–252.
Near-Feasible Solutions to Complex Stable Matching Problems SIAM Journal on Discrete Mathe- matics 4, 2 (1991), 245–252
Reference 1991
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T12:11:48.767065Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c003c8d4-4d1b-464f-bb17-a6c53003f6db · outbound
This paper cites Goldstein: Stable Marria ge and its Relation to other Combinatorial Problems.
Near-Feasible Solutions to Complex Stable Matching Problems Goldstein: Stable Marria ge and its Relation to other Combinatorial Problems
Reference 1997
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.928993Z
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 802e02ee-fbf6-419f-8dc1-613c32bd1820 · outbound
This paper cites Social Choice and Welfare 18, 1 (2001), 135–153.
Near-Feasible Solutions to Complex Stable Matching Problems Social Choice and Welfare 18, 1 (2001), 135–153
Reference 2001
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:49.029312Z
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 93b208ac-c7e5-4e8b-890c-295ab28c61dc · outbound
This paper cites Journal of Combinatorial Theory, Series B 87, 1 (2003), 72–80.
Near-Feasible Solutions to Complex Stable Matching Problems Journal of Combinatorial Theory, Series B 87, 1 (2003), 72–80
Reference 2003
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T12:11:48.715417Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a499c10d-9daf-401e-bb6c-6f15f7f8b777 · outbound
This paper cites In Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006, Gonzalo Navarro, Leopoldo Bertossi, and Yoshiharu Kohayakawa (Eds.).
Near-Feasible Solutions to Complex Stable Matching Problems In Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006, Gonzalo Navarro, Leopoldo Bertossi, and Yoshiharu Kohayakawa (Eds.)
Reference 2006
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.975302Z
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 160d6cca-e7aa-4fe8-99a5-8075ae9b3a7a · outbound
This paper cites Discrete Applied Mathematics 155, 16 (2007), 2118–2129.
Near-Feasible Solutions to Complex Stable Matching Problems Discrete Applied Mathematics 155, 16 (2007), 2118–2129
Reference 2007
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.947255Z
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 c2652805-fa56-44e2-a58e-94985dcd958a · outbound
This paper cites International Journal of Game Theory 36, 3 (2008), 537–569.
Near-Feasible Solutions to Complex Stable Matching Problems International Journal of Game Theory 36, 3 (2008), 537–569
Reference 2008
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.891116Z
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 322e18be-0c61-47fe-8b20-31df7270d1f9 · outbound
This paper cites Theoretical Computer Science 411, 34-36 (2010), 3136–3153.
Near-Feasible Solutions to Complex Stable Matching Problems Theoretical Computer Science 411, 34-36 (2010), 3136–3153
Reference 2010
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:49.002839Z
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 30b8a533-353f-4ad1-824b-5312e927a83e · outbound
This paper cites an unresolved cited work.
Near-Feasible Solutions to Complex Stable Matching Problems Unresolved cited work
Reference 2013
- Resolution
- unresolved
- raw_fallback, observed 2026-08-09T12:11:48.937988Z
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 a7eaeb14-10b4-463c-9230-01f473b028db · outbound
This paper cites Discrete Optimization 22 (2016), 241–254.
Near-Feasible Solutions to Complex Stable Matching Problems Discrete Optimization 22 (2016), 241–254
Reference 2016
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:49.012501Z
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 91650f0c-0761-4ab2-aa23-aecc59393155 · outbound
This paper cites American Economic Review 108, 11 (2018), 3154–69.
Near-Feasible Solutions to Complex Stable Matching Problems American Economic Review 108, 11 (2018), 3154–69
Reference 2018
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.909751Z
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 113a8670-85fc-4dbd-89bf-71c60f5612d2 · outbound
This paper cites Algorithmica 81 (01 2019).
Near-Feasible Solutions to Complex Stable Matching Problems Algorithmica 81 (01 2019)
Reference 2019
- Resolution
- verified exact
- doi, observed 2026-08-09T12:11:48.848062Z
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 43f86e02-4812-4af1-9ace-cc00772db7e0 · outbound
This paper cites Management Science 67, 12 (2021), 7438–7454.
Near-Feasible Solutions to Complex Stable Matching Problems Management Science 67, 12 (2021), 7438–7454
Reference 2021
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.919036Z
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 bcf9da96-f875-48d0-a1cf-139f49cdee02 · outbound
This paper cites European Journal of Operational Research 299, 2 (2022), 722–734.
Near-Feasible Solutions to Complex Stable Matching Problems European Journal of Operational Research 299, 2 (2022), 722–734
Reference 2022
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:49.038613Z
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 d200f45d-eb0a-480f-9e91-857ae0d33c4f · outbound
This paper cites In Proceedings of the 2023 International Conference on Autonomous Agents a nd Multiagent Systems (London, United Kingdom) (AAMAS ’23).
Near-Feasible Solutions to Complex Stable Matching Problems In Proceedings of the 2023 International Conference on Autonomous Agents a nd Multiagent Systems (London, United Kingdom) (AAMAS ’23)
Reference 2023
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:48.993762Z
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 c50de74e-5651-4e63-bf77-0f30927cf9a7 · outbound
This paper cites Games and Economic Behavior 145 (2024), 217–238.
Near-Feasible Solutions to Complex Stable Matching Problems Games and Economic Behavior 145 (2024), 217–238
Reference 2024
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-09T12:11:49.020862Z
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
Observation 3eaca1dc-6868-47f5-9677-02c68b0f624e · inbound
Designing Pairwise-Stable Agent Seating Arrangements cites this paper.
Designing Pairwise-Stable Agent Seating Arrangements Near-Feasible Solutions to Complex Stable Matching Problems
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-07-30T11:05:46.997482Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.