{"as_of":"2026-08-10T09:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e01aee676d093ad33b7ebe152ea61e9a360752dd0edede13cfb0d21cd04d8e5c","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:11:48.792004Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T11:05:46.997482Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02503","snapshot_observed_at":"2026-07-30T11:05:46.997482Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27102","last_updated":"2026-07-29T16:28:03Z","snapshot_observed_at":"2026-08-06T14:26:18.341363Z","submitted_at":"2026-07-29T16:28:03Z","title":"Designing Pairwise-Stable Agent Seating Arrangements","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T11:05:46.997482Z"},"links":{"cited_paper":"/paper/2502.02503","citing_paper":"/paper/2607.27102"},"observation_digest":"sha256:b51baf1d55fed1a959f170d99ba0f1f10c376494f7800d59aeb757f33c18fb23","observation_id":"3eaca1dc-6868-47f5-9677-02c68b0f624e","resolution":{"observed_at":"2026-07-30T11:05:46.997482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.02503/citation-record","integrity":"/paper/2502.02503/integrity","json":"/paper/2502.02503/citation-record.json","paper":"/paper/2502.02503"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.980996Z","title":"Theoretical Computer Science 931 (2022), 1–16","venue":null,"work_id":"23c7df09-6edf-4767-8cd6-eb403a4198a3","year":2022},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.735910Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:bd7a1a03140b8202eb0a8c671b72473c12bfa1e853791e0f04c72328158008a6","observation_id":"013f5a21-7c6b-47e3-9033-78dcf38dd466","resolution":{"observed_at":"2026-08-09T12:11:48.984670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-16926-7_7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Algorithms 7, 51–62","venue":"Lecture notes in computer science","work_id":"1e5b89f0-366c-46ba-a44b-c7a5a8fe3432","year":null},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.745096Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:dce774f06054236d86f101a421d872204a75bb8783df05f07b3f8f895bc12cdd","observation_id":"874f7aea-b062-4aaf-982f-2e237602e3fc","resolution":{"observed_at":"2026-08-09T12:11:48.838101Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/a6010161","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Algorithms 6 (03 2013), 161–168","venue":"Algorithms","work_id":"b6c2b356-43fc-4962-8bb6-fab6fbbbf834","year":2013},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.761131Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:96da37d1f8d8b268bba979786d12c7baa379b1d12b229e6607466b284d3eb3c0","observation_id":"b175266a-d36c-4319-a8ae-a335326c2d50","resolution":{"observed_at":"2026-08-09T12:11:48.828653Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.897072Z","title":"Operations Research 67, 6 (2019), 1503–1519","venue":null,"work_id":"dcf01c2c-2d23-49f8-a3b7-87bb97c9dcfb","year":2019},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.776186Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:3d475293e0f8f5453dbd43d1eae7a4289810ab9016d155d5729406a43e923285","observation_id":"8db15b1d-34c8-4d17-b83d-120632f2175f","resolution":{"observed_at":"2026-08-09T12:11:48.900279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.868682Z","title":"Journal of Algorithms 12, 1 (1991), 154–178","venue":null,"work_id":"cf92bcd7-2f92-422d-9b2b-a6077ee29e01","year":1991},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.789102Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:12ab9372288ce1e51fe7edc1bc32a78fdfbc8cede16d42132d9db457fe6e1586","observation_id":"ec599cee-a50e-459b-98c6-f55995b3a89c","resolution":{"observed_at":"2026-08-09T12:11:48.871774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.859191Z","title":null,"venue":null,"work_id":"5c3761e3-e4da-4d14-808d-6a807b33d6b8","year":2013},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.792004Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:fb9a81b3125308f07abb0fa050da18b2ff37a7ab634305f159ae832950c0e663","observation_id":"cf0eb3f8-f2fc-4457-adb6-1e80e0111491","resolution":{"observed_at":"2026-08-09T12:11:48.862278Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.961784Z","title":"The American Mathematical Monthly 69, 1 (1962), 9–15","venue":null,"work_id":"efb7f8fb-470a-4c9a-8b13-c9ea41832902","year":1962},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":1962,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.749089Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:342c529f3d17d9c83cfb2b841ece1ad91eccc9408433b6235917fb68913bd277","observation_id":"ccf0dbf6-5670-4fd7-9dbf-52f33a57d9a8","resolution":{"observed_at":"2026-08-09T12:11:48.966427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.877696Z","title":"Econometrica: Journal of the Econometric Society (1967), 50–69","venue":null,"work_id":"4443e225-e539-4215-ab2b-21479ae8e3f7","year":1967},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":1967,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.786130Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:90dfcb5411e5d17671784cb6f7c78e656bcda66d6eee0a6a49a72025fce56d68","observation_id":"4be995e2-5f65-4443-b3fb-710ef7b0a8b0","resolution":{"observed_at":"2026-08-09T12:11:48.881663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.780114Z","title":"Journal of Political Economy 92, 6 (1984), 991–1016","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":1984,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.780114Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:1d80296a416348305d8ce4bd4e74e2acbad81b008b27c49470882307a95cfa67","observation_id":"50789a72-37a1-4ea2-b183-ac22337fe25a","resolution":{"observed_at":"2026-08-09T12:11:48.780114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.952850Z","title":"stable roomma tes","venue":null,"work_id":"92727ffa-71ab-4a6c-b7e2-8de1b051174d","year":1985},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":1985,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.752034Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:ce74709fa1baaaef88c9f895392ae75133ed49ba84ab57d9d170de28dd0ddbaa","observation_id":"32093cf7-eafd-49c2-a6da-84ca69b1f927","resolution":{"observed_at":"2026-08-09T12:11:48.955966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.767065Z","title":"SIAM Journal on Discrete Mathe- matics 4, 2 (1991), 245–252","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.767065Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:d1a06b94bc9d74d17e75bf0f79daf7ecb379e6eca15c7fb854a0f0a12c3bbb28","observation_id":"97e86c36-dbf7-4274-9445-51f1ccb0930f","resolution":{"observed_at":"2026-08-09T12:11:48.767065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.925571Z","title":"Goldstein: Stable Marria ge and its Relation to other Combinatorial Problems","venue":null,"work_id":"89c03286-9f82-4ce5-b4cd-2884b8a52191","year":1976},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.764097Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:4243375eedef5943928a85743185d5da339601865bddfcaa7a1e3a31c3ad524f","observation_id":"c003c8d4-4d1b-464f-bb17-a6c53003f6db","resolution":{"observed_at":"2026-08-09T12:11:48.928993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:49.026225Z","title":"Social Choice and Welfare 18, 1 (2001), 135–153","venue":null,"work_id":"72651b90-8747-44b1-90e4-31d3c771d6b9","year":2001},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.719069Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:ba970ca07f9d1f95e418548c818f71e47ad638a63cb3a191bf7c7e5a76115f5a","observation_id":"802e02ee-fbf6-419f-8dc1-613c32bd1820","resolution":{"observed_at":"2026-08-09T12:11:49.029312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.715417Z","title":"Journal of Combinatorial Theory, Series B 87, 1 (2003), 72–80","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.715417Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:b40a96557b77ed5d5975bbbdb20ef20c519049b7835d276645f800acc6500997","observation_id":"93b208ac-c7e5-4e8b-890c-295ab28c61dc","resolution":{"observed_at":"2026-08-09T12:11:48.715417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.971726Z","title":"In Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006, Gonzalo Navarro, Leopoldo Bertossi, and Yoshiharu Kohayakawa (Eds.)","venue":null,"work_id":"7f3c3461-b4ba-4299-a5ba-959dcb940e3f","year":2006},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.741991Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:ba7ee673dc14439f2ca9c765858f21575f23de3d9c1e83a1831744493bc68a18","observation_id":"a499c10d-9daf-401e-bb6c-6f15f7f8b777","resolution":{"observed_at":"2026-08-09T12:11:48.975302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.944174Z","title":"Discrete Applied Mathematics 155, 16 (2007), 2118–2129","venue":null,"work_id":"66ffcc70-8ad3-42c9-ab93-49b408faa027","year":2007},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.755210Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:20287e32bec0c9192f6563dd8458dc662467bbecaf2bed49f3304bdab0ea4bd9","observation_id":"160d6cca-e7aa-4fe8-99a5-8075ae9b3a7a","resolution":{"observed_at":"2026-08-09T12:11:48.947255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.887726Z","title":"International Journal of Game Theory 36, 3 (2008), 537–569","venue":null,"work_id":"1db849c9-7c9b-45c5-9362-9f2baac74a52","year":2008},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.783241Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:9c45df4382b5873c5d3f44bfa30cf680073e27dd0544bfe73751160226e2cc82","observation_id":"c2652805-fa56-44e2-a58e-94985dcd958a","resolution":{"observed_at":"2026-08-09T12:11:48.891116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.999718Z","title":"Theoretical Computer Science 411, 34-36 (2010), 3136–3153","venue":null,"work_id":"5ec4ccf3-c81a-4112-9a8f-f30cce0bf9f9","year":2010},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.729187Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:a7c0b08ac11528b6f5ffdd58313f0944fa7dc1c86fa2ea2979e8cc63e1b787cc","observation_id":"322e18be-0c61-47fe-8b20-31df7270d1f9","resolution":{"observed_at":"2026-08-09T12:11:49.002839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.934984Z","title":null,"venue":null,"work_id":"8e1a1f07-3a3e-414c-adc7-c6716b9d96eb","year":2013},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.758197Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:223d05240e18c8d129df848b8c3123fe166373a8eb209ecc111d817bb6eaef0e","observation_id":"30b8a533-353f-4ad1-824b-5312e927a83e","resolution":{"observed_at":"2026-08-09T12:11:48.937988Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:49.008606Z","title":"Discrete Optimization 22 (2016), 241–254","venue":null,"work_id":"32bd28b1-03ed-492d-b6e7-bdd9297a5653","year":2016},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.725648Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:ab078fc062bef2cc81954399378c7050d673b14ea1f999a0f14d608b0bfa56b4","observation_id":"a7eaeb14-10b4-463c-9230-01f473b028db","resolution":{"observed_at":"2026-08-09T12:11:49.012501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.906458Z","title":"American Economic Review 108, 11 (2018), 3154–69","venue":null,"work_id":"a28fba32-e626-42f1-9c23-1e94aaa86297","year":2018},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.773290Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:983b074e724aaca9133cd6d4f74f525029613a486aaee641aa7fd9e0e217420b","observation_id":"91650f0c-0761-4ab2-aa23-aecc59393155","resolution":{"observed_at":"2026-08-09T12:11:48.909751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-018-00544-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.844790Z","title":"Algorithmica 81 (01 2019)","venue":null,"work_id":"672db5a2-15e2-4848-9453-700014434135","year":2019},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.738941Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:e1d4e9943940a33f740b71cf7f9611f9e369af772207884da955c32bd96085cf","observation_id":"113a8670-85fc-4dbd-89bf-71c60f5612d2","resolution":{"observed_at":"2026-08-09T12:11:48.848062Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.915961Z","title":"Management Science 67, 12 (2021), 7438–7454","venue":null,"work_id":"a00da2c6-c8d6-4664-b683-d0330f8acd1c","year":2021},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.770148Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:2ede4407852cb44e0743e56796bb85212abb3d5aa7e5fb0e6f585a8e2f19d1f4","observation_id":"43f86e02-4812-4af1-9ace-cc00772db7e0","resolution":{"observed_at":"2026-08-09T12:11:48.919036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:49.035555Z","title":"European Journal of Operational Research 299, 2 (2022), 722–734","venue":null,"work_id":"b276cf94-5e66-46c5-8f18-c85d5d47b52e","year":2022},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.711216Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:4f3b6faa463f2ae658bc34fafb148df97778afbae1c4011ca4e7ff8c69c4788e","observation_id":"bcf9da96-f875-48d0-a1cf-139f49cdee02","resolution":{"observed_at":"2026-08-09T12:11:49.038613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:48.990256Z","title":"In Proceedings of the 2023 International Conference on Autonomous Agents a nd Multiagent Systems (London, United Kingdom) (AAMAS ’23)","venue":null,"work_id":"ddee4e7e-2b78-43eb-9628-29c9f43b5103","year":2023},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.732568Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:2665a762201d48c1de2968420a09a3cc69af6429f4ea92d5c4919b55ab433b27","observation_id":"d200f45d-eb0a-480f-9e91-857ae0d33c4f","resolution":{"observed_at":"2026-08-09T12:11:48.993762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T12:11:49.017848Z","title":"Games and Economic Behavior 145 (2024), 217–238","venue":null,"work_id":"e9defe2e-6f8c-4f7c-906b-0516b894d1e3","year":2024},"citing_paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-09T12:11:48.722364Z"},"links":{"citing_paper":"/paper/2502.02503"},"observation_digest":"sha256:8e0dbb3b042e87eadb7bfd8135c6d69b7ff102f2653497b61bd161835dbea779","observation_id":"c50de74e-5651-4e63-bf77-0f30927cf9a7","resolution":{"observed_at":"2026-08-09T12:11:49.020862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.02503","last_updated":"2025-02-09T20:41:48Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-09T23:49:24.092583Z","submitted_at":"2025-02-04T17:17:00Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":3,"verified_fuzzy":18},"total_outbound_references":26},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"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."}