{"as_of":"2026-08-10T12:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05a693fd9ec42138eba34da94ab22eb4e6d48bd483906d8bf3fb9bbde8bb7423","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T11:50:26.030339Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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.07160/citation-record","integrity":"/paper/2607.07160/integrity","json":"/paper/2607.07160/citation-record.json","paper":"/paper/2607.07160"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0166-218x(99)00203-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Many-to-manymatching: Stablepolyandrouspolygamy (or polygamous polyandry).Discrete Applied Mathematics, 101(1–3):1–12, 2000.doi: 10.1016/S0166-218X(99)00203-6","venue":"Discrete Applied Mathematics","work_id":"4535db2e-e11c-4c58-a08c-cd8a373f1c57","year":2000},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:d9373ef4e20f024c88dd28db4d161325487706cf353fb5e829f04ea61ebd918d","observation_id":"c72564e4-2eca-4e2f-bfdb-c20db3d14c0a","resolution":{"observed_at":"2026-07-09T18:56:27.079176Z","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.1016/j.tcs.2007.02.050","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Polynomialtimealgorithmforanop- timal stable assignment with multiple partners.Theoretical Computer Science, 379(3):317– 328, 2007.doi:10.1016/j.tcs.2007.02.050","venue":"Theoretical Computer Science","work_id":"48a54da9-d362-445a-b0f3-6bbcbc7338aa","year":2007},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:dbcd51ade3f4b11ba35a568724cff3ef6606db6c77fca7e4d0c1f4f7bd46960c","observation_id":"3b9a7f01-14f3-4c00-ac9a-c6ebdbf3e653","resolution":{"observed_at":"2026-07-09T18:56:27.063186Z","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.1007/s00453-009-9307-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Algorithmica","work_id":"0c67c1fd-1157-458d-8ad7-4193fbfb9eb5","year":2010},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:c8e123b0113df365b0236fe755b17349662426f970e323cf0e79cca4c50c4d59","observation_id":"be89dbb7-c994-4443-8c42-ea979714d587","resolution":{"observed_at":"2026-07-09T18:56:27.076775Z","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-07-09T18:56:27.843996Z","title":"Cormen, CharlesE","venue":null,"work_id":"73c7454a-7e19-49bf-9b34-d2289393e77a","year":2022},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:d60ef794138d36696a9978f91eae31e54cdd88b51b26410306d73c165b5cd415","observation_id":"2de36b46-f5cb-4e8c-84cf-3791e84311c8","resolution":{"observed_at":"2026-07-09T18:56:27.845118Z","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":{"arxiv_id":"1110.0449","last_updated":"2011-10-07T17:25:01Z","snapshot_observed_at":"2026-08-05T06:54:14.065981Z","submitted_at":"2011-10-03T19:26:05Z","title":"Superluminal Neutrinos and Monopoles","version":2},"cited_work":{"arxiv_id":"1110.0449","doi":"10.1287/ijoc.1110.0449","metadata_source":"pith","pith_arxiv_id":"1110.0449","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Superluminal Neutrinos and Monopoles","venue":"hep-ph","work_id":"731dfb0a-a4e1-4c9c-b880-31c8a789108b","year":2011},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/1110.0449","citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:a15a564825c50b4ddd0b6d9d201a96e4e9475e28df5e9ccce42045b48910fc1f","observation_id":"61900490-c85f-4869-879e-7bf495ae0b77","resolution":{"observed_at":"2026-07-09T18:56:27.039906Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":{"arxiv_id":"2504.04577","last_updated":"2025-04-06T18:35:25Z","snapshot_observed_at":"2026-08-07T16:08:10.414838Z","submitted_at":"2025-04-06T18:35:25Z","title":"Minimum Cut Representability of Stable Matching Problems","version":1},"cited_work":{"arxiv_id":"2504.04577","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.04577","snapshot_observed_at":"2026-07-09T18:56:27.278092Z","title":"Minimum cut representability of stable matching problems","venue":"math.OC","work_id":"58e58542-539c-4935-b757-4f5f41f696dd","year":2025},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"cited_paper":"/paper/2504.04577","citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:e483f3785785ecd7c9cd4bf769af95564755d4fb2ad97f9e69cfe826a75bbfaf","observation_id":"ad9dbac1-0fff-464d-b85a-73431292cd0e","resolution":{"observed_at":"2026-07-09T18:56:27.279457Z","resolver_source":"local_arxiv","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-07-09T18:56:27.864237Z","title":"Affinely representable lattices, stable matchings, and choice functions.Mathematical Programming, 197(2):721–760, 2023.doi:10.1007/ s10107-022-01838-z","venue":null,"work_id":"e271fcac-4165-4642-bfa6-d1d4299f3023","year":2023},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:34bcd6b935b56789212da0d548916c0f92235521d28ab45f991ccc7af02260a9","observation_id":"a775343c-eff5-4da3-8c39-901c8ab9d033","resolution":{"observed_at":"2026-07-09T18:56:27.865410Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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.1090/memo/0555","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"American Mathematical Society, 1995.doi:10.1090/memo/0555","venue":"Memoirs of the American Mathematical Society","work_id":"e5e643ff-87d2-4eeb-9e2c-fa05c073f4b9","year":1995},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:f05404acd6d95682f1707ea23b2b79aa7e42e027a0d1c1e37bb601334943e38b","observation_id":"e647867d-3808-4def-894c-01c51af7ef03","resolution":{"observed_at":"2026-07-09T18:56:27.053776Z","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.2307/2312726","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"American Mathematical Monthly","work_id":"bee06159-2b1c-4937-b60d-5e2820ae76a1","year":1962},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:73c4b68db6f2c50d7366fb38bd49a49ce0807e4132ede7d058dc0ef90656ec98","observation_id":"860c7858-f6cd-4cca-8915-c8f9b7f361bf","resolution":{"observed_at":"2026-07-09T18:56:27.057287Z","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.1016/j.tcs.2021.05.015","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T18:56:27.065785Z","title":"Balanced stable marriage: How close is close enough?Theoretical Computer Science, 883:19–43, 2021","venue":null,"work_id":"f4e8d19e-ed54-43a9-a341-8d4a096dfa6f","year":2021},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:3816388200a30771de0b295998708735157083c71a0568acb056dbfaf049cceb","observation_id":"e0fded12-4704-43d7-b011-33ac017cef31","resolution":{"observed_at":"2026-07-09T18:56:27.067545Z","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.1137/0216010","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Three fast algorithms for four problems in stable marriage.SIAM Journal on Computing, 16(1):111–128, 1987.doi:10.1137/0216010","venue":"SIAM Journal on Computing","work_id":"447af630-3c6f-4c7a-b1ed-703943fec150","year":1987},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:ae068fdc328c754dac80849613023279e35db32318c5505e80848b2ea186d593","observation_id":"5556c0aa-d363-42fb-9de0-fbe3267770ed","resolution":{"observed_at":"2026-07-09T18:56:27.055142Z","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-07-09T18:56:27.862511Z","title":"Irving.The Stable Marriage Problem: Structure and Algo- rithms","venue":null,"work_id":"9928d406-65ee-45ee-a543-4e3fa722a438","year":1989},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:fd74bffb005d41a4160ec487be1dee40e96487a1bd0069e365a9355e5176e105","observation_id":"ef61bf7f-8477-472c-bb8a-896efacdadfd","resolution":{"observed_at":"2026-07-09T18:56:27.863652Z","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.1016/0166-218x(92)00179-p","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Discrete Applied Mathematics","work_id":"08c1f0d4-26f0-48a2-88f6-6730dc088194","year":1994},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:7114c93ed7d78106a72d67f7eecad066c296f5bf37fe1d9e62b384523425b51b","observation_id":"92f7a08e-e566-410b-b9ae-07e391adb870","resolution":{"observed_at":"2026-07-09T18:56:27.065075Z","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-07-12T01:49:06.008199+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T01:49:06.008199+00:00","source":"openalex_status_cache"},{"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.1137/0215048","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Irving and Paul Leather","venue":"SIAM Journal on Computing","work_id":"4fbc6363-609f-4e3b-aa77-bfbd0de2538d","year":1986},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:2ef51b67d9c6ffb1fcc3a140d53e779a996165b7ac94bbfc17b5ee5c1eeab3ef","observation_id":"e5d6b307-c0fb-4802-820d-4fa19db97125","resolution":{"observed_at":"2026-07-09T18:56:27.061141Z","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":"8869.28871","doi":"10.1145/28869.28871","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Irving, Paul Leather, and Dan Gusfield","venue":"Journal of the ACM","work_id":"8cde5008-26d9-44fc-9c7a-3a4b5c9de96a","year":1987},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:3d98f325c6e3bed74ad651b5d6d4d27cf810f17af23a11bc12823b3ad0394cb9","observation_id":"020dcec8-1b33-4172-a0d8-871b4450f94d","resolution":{"observed_at":"2026-07-09T18:56:27.068591Z","resolver_source":"arxiv_id","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":"2090.502096","doi":"10.1145/502090.502096","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A combinatorial strongly polynomial algorithm for minimizing submodular functions.Journal of the ACM, 48(4):761–777, 2001","venue":"Journal of the ACM","work_id":"dc162be1-731b-4ae1-b67c-6d8483be24ca","year":2001},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:1875b39d66d4e342f093511eaaf07b767f2143305eebb8a0393173aa0a9d027a","observation_id":"f812524e-4a9e-4dfd-af9e-f5894f177d3c","resolution":{"observed_at":"2026-07-09T18:56:27.071252Z","resolver_source":"arxiv_id","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.1609/aaai.v38i9.28839","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Maximizing Nash social welfare under two-sided preferences","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"80ae5df6-ea87-4949-97a5-56c1465bddc4","year":2024},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:55284bfd7dfac15bfd2f6242c0dd742d892dbef69ad649be8b469e546da0fec9","observation_id":"c5ddddc7-17d9-4ead-8a53-fcbc5b2e0cc1","resolution":{"observed_at":"2026-07-09T18:56:27.050566Z","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":"8745.318884","doi":"10.1145/3188745.3188842","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Karlin, Shayan Oveis Gharan, and Robbie Weber","venue":null,"work_id":"68c29404-e0ec-44f9-aa48-e91b2fa9e033","year":2018},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:ef0561b682ebb87ab4355958314b7c6c180fa135a1f9f473094e8197b1e4cc28","observation_id":"6629f269-eb58-493f-b38a-9bd09d26f625","resolution":{"observed_at":"2026-07-09T18:56:27.040020Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-07-09T18:56:27.855695Z","title":"Karzanov","venue":null,"work_id":"1e425090-6356-4985-991b-d5c18eb11b55","year":2025},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:ae390103545291599910146e0884b62ac2f655aa653688ceab49849fe21432e0","observation_id":"b6220ae4-4c70-4b2a-9ca7-c6077ee542d6","resolution":{"observed_at":"2026-07-09T18:56:27.856756Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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/bf03167200","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Complexity of the sex-equal stable marriage problem.Japan Journal of Industrial and Applied Mathematics, 10(1):1, February 1993","venue":"Japan Journal of Industrial and Applied Mathematics","work_id":"faf2d707-73d4-4fd0-a57d-502ee3707a8f","year":1993},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:8debe802b0f55f66a3bf93165b3643141301fd8a9479a24e3f9bafea0966d32b","observation_id":"0e3e2349-6dca-46e2-aa6e-7cca4e6f0c2f","resolution":{"observed_at":"2026-07-09T18:56:27.074566Z","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-07-09T18:56:27.857372Z","title":"Knuth.Mariages stables et leurs relations avec d’autres problèmes combina- toires","venue":null,"work_id":"1fd45d51-7978-4eaa-a0e2-2d71e72fbddf","year":1976},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:2abcccdf34a335b3e9236bc98c990c6bbeeb57321763ef80c98c5c92f01df9de","observation_id":"d54cb67b-f5fc-4769-ad34-cf6f553fd757","resolution":{"observed_at":"2026-07-09T18:56:27.858590Z","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.1142/8591","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Manlove.Algorithmics of Matching Under Preferences, volume 2 ofSeries on Theoretical Computer Science","venue":"Theoretical computer science","work_id":"a0e24ed2-08c0-4db5-99a3-392f10662d3e","year":2013},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:2008bfce0de354776c0728fee06ebc4bab18c3767466b34c7ee7b28c61ec296d","observation_id":"d546db01-97ca-41a0-8f1d-7ecdd84281f6","resolution":{"observed_at":"2026-07-09T18:56:27.028560Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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":"5850.353608","doi":"10.5555/3535850.3536083","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"On achieving leximin fairness and stability in many-to-one matchings","venue":null,"work_id":"b5b88560-72a3-4a04-95c0-20772173880d","year":2022},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:1cf0f00fe5f436b23ec5b01bc8cc09118272b8516b9435fd820fe3c47c025ebf","observation_id":"7abbe354-9cb4-4b15-ad2c-8e25e216d45c","resolution":{"observed_at":"2026-07-09T18:56:27.076797Z","resolver_source":"arxiv_id","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-07-09T18:56:27.853793Z","title":"Roth and Marilda A","venue":null,"work_id":"6cbbbf84-9ea8-4dfb-ad21-f95928ea794b","year":1990},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:c92ab712de42232f05d9d4a15dd825dbdcb8eb0ff954d3ecdcca7e9b9d9ca2bb","observation_id":"dda7a5f8-b630-4fcc-acbe-a0dfce27b847","resolution":{"observed_at":"2026-07-09T18:56:27.855099Z","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":"2000.1989","doi":"10.1006/jctb.2000.1989","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A combinatorial algorithm minimizing submodular functions in strongly polynomial time.Journal of Combinatorial Theory, Series B, 80(2):346–355, 2000","venue":"Journal of Combinatorial Theory Series B","work_id":"a772da8f-d448-4ffc-96e5-3baed522d4b7","year":2000},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:550b2cc809c686c6dcb00d71ba3f337076ff76d49c776e19dd52aa45c049c2a2","observation_id":"1513e5d8-429a-4eab-baa1-f4646fe46bdf","resolution":{"observed_at":"2026-07-09T18:56:27.037319Z","resolver_source":"arxiv_id","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":"1060.0207","doi":"10.1287/moor.1060.0207","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Many-to-one stable matching: Ge- ometry and fairness.Mathematics of Operations Research, 31(3):581–596, 2006.doi: 10.1287/moor.1060.0207","venue":"Mathematics of Operations Research","work_id":"083991f6-2a9f-4427-89f7-33ff3533c610","year":2006},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:d0a78758ad6824752ae8860ce886c5ec7c83463b8572723527008887f038beb1","observation_id":"3a91f564-2f9c-4e8c-883a-b13a7561dd3a","resolution":{"observed_at":"2026-07-09T18:56:27.072023Z","resolver_source":"arxiv_id","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-07-09T18:56:27.859159Z","title":"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","venue":null,"work_id":"53e594eb-f6ab-4b2d-ab21-3712eda8735e","year":1998},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:42a5eaeab77a78323d7a2b61fdb7cf137f18eda4d864f91d1336939570dd490f","observation_id":"3779adc6-264e-4308-a418-f157f8f03b10","resolution":{"observed_at":"2026-07-09T18:56:27.860423Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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-07-09T18:56:27.860904Z","title":"Thus condition (b) fails for∆rat as well","venue":null,"work_id":"1a2f9e8d-151f-44ad-9ad0-d7290b1fa8db","year":null},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:7abdb616f120509cef6242c70e447cc49e26f94422c2d93e6cc7325e7e1d4dac","observation_id":"48a35b4b-1b77-4a7c-a85c-14ba0963cd95","resolution":{"observed_at":"2026-07-09T18:56:27.862015Z","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-07-09T18:56:27.851831Z","title":null,"venue":null,"work_id":"7360b263-a354-4f6e-ba40-aaea517c022b","year":null},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:9211ad452d7ad63c34a3f406aa47f99f22a4a5ffc43479aa0b3d05f6dc3ea989","observation_id":"01c203bf-bdf6-47d4-afe1-eb2c5fb945d7","resolution":{"observed_at":"2026-07-09T18:56:27.853213Z","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-07-09T18:56:27.844828Z","title":null,"venue":null,"work_id":"67a3a70a-ca2c-4d00-8798-472a5b812d0c","year":null},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:deddbf53422edff724a6f529666cc3e25255099ee4780cbb0a31b9984ce6497d","observation_id":"d656c777-5891-4c12-90c2-143da667705b","resolution":{"observed_at":"2026-07-09T18:56:27.845860Z","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-07-09T18:56:27.841413Z","title":null,"venue":null,"work_id":"87c18066-ba44-48c6-814e-738a6c502ce7","year":null},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:36150dda67a038938e9d59698f663ec0a0f34dcbbfd0c8cdc01a86648f5ef4e6","observation_id":"73196a80-3959-470f-8942-d5d6cd01ba60","resolution":{"observed_at":"2026-07-09T18:56:27.842448Z","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-07-09T18:56:27.839862Z","title":null,"venue":null,"work_id":"0af70d5f-1756-4ca1-ac8a-006ead4244f4","year":null},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:9f74595af11032712df3bd15a43469310d065b1c20a50cf613fef8264427ac66","observation_id":"70d0068e-ae66-4b72-91d9-c489a6ae75d4","resolution":{"observed_at":"2026-07-09T18:56:27.840884Z","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-07-09T18:56:27.842947Z","title":null,"venue":null,"work_id":"c1375b48-1cd7-40ed-9398-d9e5b19ebdad","year":null},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:a9c6b0474981dce99dba6f5dd9f7a3634ed8b5c0bce8083c00216a8ea476b319","observation_id":"36d7b608-dc35-42f0-b82b-d6f9a4dd5f74","resolution":{"observed_at":"2026-07-09T18:56:27.844150Z","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-07-09T18:56:27.846390Z","title":null,"venue":null,"work_id":"c3fc3476-9f04-490d-8ed8-65c1a8d2b514","year":null},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:ce81afac5f487b628cd4de8d8186658ec14e85340c4c80a9731eb7814e2b4c8e","observation_id":"96876b30-002a-413a-a849-51377ae6cd88","resolution":{"observed_at":"2026-07-09T18:56:27.847678Z","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-07-09T18:56:27.849764Z","title":"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","venue":null,"work_id":"5f4231e1-ab37-4b95-b616-5f8e6471174b","year":null},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:2204db7ca39c772f29ca0ea05398db18fc3c7e87f976e7f987a7e8142d1a1081","observation_id":"e08f4a46-9eef-423c-a569-27543705d20a","resolution":{"observed_at":"2026-07-09T18:56:27.851207Z","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-07-09T18:56:27.848181Z","title":"Hence the utility gap is ∆diff(M) = B+ P i∈J ai − B+ T 2 = P i∈J ai − T 2","venue":null,"work_id":"d2f5ad07-ed5c-4f1f-a725-fddede035519","year":null},"citing_paper":{"arxiv_id":"2607.07160","last_updated":"2026-07-08T08:52:28Z","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-09T18:46:52.649414Z"},"links":{"citing_paper":"/paper/2607.07160"},"observation_digest":"sha256:5ff948af26d03e1f5b69bdcec4d465c38502c63eb1da4bdfab00ee10ddf74602","observation_id":"37ad1cd7-85c1-4938-8763-027712f077b0","resolution":{"observed_at":"2026-07-09T18:56:27.849240Z","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":"2607.07160","last_updated":"2026-07-08T08:52:28Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-03T17:45:57.518714Z","submitted_at":"2026-07-08T08:52:28Z","title":"Stable Matchings with Minimum Utility Gap"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":4,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":6,"verified_exact":17,"verified_fuzzy":7},"total_outbound_references":36},"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 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2607.07160."}