{"as_of":"2026-08-19T00:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:21d8f82b5ae7ac51cab517a92a28ff48d62e00291a8b4ca96a04d1a17eadd378","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:05:39.461718Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2505.11456/citation-record","integrity":"/paper/2505.11456/integrity","json":"/paper/2505.11456/citation-record.json","paper":"/paper/2505.11456"},"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-15T21:05:40.090815Z","title":"“Almost stable","venue":null,"work_id":"7e172278-823e-409d-be1a-4ad3a1e97aa2","year":2005},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.156475Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:8e99caf3b42f722e97e11affae22439c83cbe62e4c21e36f8ce37f6b08eb088e","observation_id":"b85a2e0c-8bf2-465f-bbc5-5a479d7ecde9","resolution":{"observed_at":"2026-08-15T21:05:40.095370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.161971Z","title":"On a lemma of Scarf","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.161971Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:0fdd8e2232cd2edc6395bc06065de030f449d7a9296d9f35fc5105a59c6423c1","observation_id":"01152015-ffd0-47d2-9f3c-d379fa4728f3","resolution":{"observed_at":"2026-08-15T21:05:39.161971Z","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":"10.1016/j.geb.2024.08.010","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.712291Z","title":"Manipulating the outcome of stable marriage and roommates problems","venue":null,"work_id":"49dcb91d-5c92-4bbc-9ae3-9610b0538aa5","year":2024},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.166854Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:56ea0a2b18902d3fc8b90b193093075b4f478be3e17cf1b31dfbd1116cc660f9","observation_id":"d2f1e380-47de-47b4-abd5-f5b669ada113","resolution":{"observed_at":"2026-08-15T21:05:39.717162Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:40.076634Z","title":"The stable matching problem and its generalizations: an algorithmic and game theoretical approach","venue":null,"work_id":"a5cb73e3-28f3-4f44-ab01-58f8b74ab67c","year":2008},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.172190Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:b39c41eadef3f9a48ee37973ca5dd0af79af23dd67131fea91c56deafaadfbc2","observation_id":"a4e17428-2472-4c14-8c48-dc366cf546de","resolution":{"observed_at":"2026-08-15T21:05:40.081432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00182-007-0084-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"The dynamics of stable matchings and half- matchings for the stable marriage and roommates problems","venue":"International Journal of Game Theory","work_id":"656de20b-7f13-450f-ad14-1c8462bea099","year":2008},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.177034Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:f348368378934c3de00f29b81e23f598c131a0066ef08057cd9d8f835f0263ba","observation_id":"708dd408-ad35-4dba-ad5e-6249e4c58790","resolution":{"observed_at":"2026-08-15T21:05:39.702404Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.181839Z","title":"Fractional solutions for capacitated NTU-games, with applications to stable matchings","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.181839Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:1918e4ab9a508d4f7cbf7e6c01a26ca4b70a407b934d09afb8ae7f4fe5bb42cc","observation_id":"4b1d7a23-dfeb-416f-a150-465af6f6a3f7","resolution":{"observed_at":"2026-08-15T21:05:39.181839Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.disopt.2010.02.002","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.672151Z","title":"The integral stable allocation problem on graphs","venue":null,"work_id":"dba021ec-a692-446f-ba2e-d4f7efcc0d32","year":2010},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.187543Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:734478256f38f77a4e874424b026508ea0e806dec00bbbcbb433922a7e6ce703","observation_id":"75948583-3fa5-4738-93ac-14c5786c99a6","resolution":{"observed_at":"2026-08-15T21:05:39.677065Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2010.01.017","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.656215Z","title":"Rotations in the stable b-matching problem","venue":null,"work_id":"f4ca2ed7-69f8-469d-8100-815d52a86695","year":2010},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.192761Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:3644ded0326cf4778707d60bd50365656839c21eed3f64b779e118c2ac5d1c99","observation_id":"a8f8e347-24d8-43e2-b25b-1872668dbb2c","resolution":{"observed_at":"2026-08-15T21:05:39.661271Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:40.062672Z","title":"The Stable Multiple Activities Problem","venue":null,"work_id":"f6df9b47-36bd-4d01-964c-d6fb6eab7d3a","year":2005},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.197528Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:571b46a0a071fe433d18754733936ccc6ef880b6e29194cfba87ac768382e73b","observation_id":"d383a92e-ac85-412f-9d78-6b869f79c868","resolution":{"observed_at":"2026-08-15T21:05:40.067040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7464.10774","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.877674Z","title":"On a generalization of the stable roommates problem","venue":null,"work_id":"cba9bfe1-4de7-40d4-96ef-b4dfc2aa6547","year":2005},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.202996Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:a24f6c846da4706f487b6f8dc03c66165dc3e1b07f87334c211d465c8690acff","observation_id":"06ab7c2d-4cb1-4134-8dfc-0ae477030780","resolution":{"observed_at":"2026-08-15T21:05:39.884970Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.208537Z","title":"How hard is it to satisfy (almost) all roommates?","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.208537Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:54080a34be103a0b006952e3eb6949a451df7a79993164b43fb7e6b47c6f9cf9","observation_id":"7f108e38-45f7-4a4b-bfd3-513ac2d5df67","resolution":{"observed_at":"2026-08-15T21:05:39.208537Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01215","last_updated":"2025-02-03T10:11:01Z","snapshot_observed_at":"2026-08-09T15:58:40.949935Z","submitted_at":"2025-02-03T10:11:01Z","title":"Control in Stable Marriage and Stable Roommates: Complexity and Algorithms","version":1},"cited_work":{"arxiv_id":"2502.01215","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.01215","snapshot_observed_at":"2026-08-15T21:05:39.801044Z","title":"Control in Stable Marriage and Stable Roommates: Complexity and Algorithms","venue":"cs.GT","work_id":"71e17ce3-0269-49da-bda8-e4df8d3bf588","year":2025},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.213820Z"},"links":{"cited_paper":"/paper/2502.01215","citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:713b5b301c83f2227eb92d473fbb22034ad7f6ea656dbc40d53dc1d1748cd228","observation_id":"cef50c6d-3f52-494f-a3dc-446540aa05a1","resolution":{"observed_at":"2026-08-15T21:05:39.806377Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2502.02503","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.02503","snapshot_observed_at":"2026-08-15T21:05:39.778771Z","title":"Near-Feasible Solutions to Complex Stable Matching Problems","venue":"cs.GT","work_id":"1518ef7c-51e0-4293-9345-8b69dc871bb7","year":2025},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.219253Z"},"links":{"cited_paper":"/paper/2502.02503","citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:c11a67e42916723d3e7a871151574b77fba30c9b4c714f95d9699464a6854a6b","observation_id":"ac424aa7-1818-4f8a-b109-a09ee911d76c","resolution":{"observed_at":"2026-08-15T21:05:39.783903Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2024/302","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.631463Z","title":"Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples","venue":null,"work_id":"197e94eb-dd51-4003-a5d5-69bda821bf09","year":2024},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.224046Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:0c096cdc84c3c8101512276fb2868e308ba3a21cc922ab5ebb095ce93f9f3eea","observation_id":"69672f17-b311-4d76-bcd2-0c0cf4862ec1","resolution":{"observed_at":"2026-08-15T21:05:39.636392Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:40.047746Z","title":"PuLP: A Linear Programming Toolkit for Python","venue":null,"work_id":"40c42d33-c771-48ae-8a4d-d101fcf1dbf2","year":2011},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.228982Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:112a9ad242ce4e5fcd487955165a4cd7b62207af257f8d32dd545f5bb8e693e4","observation_id":"c5522931-8d24-42a7-b962-349cdb36bb76","resolution":{"observed_at":"2026-08-15T21:05:40.052645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:40.033152Z","title":"A Fixed-Point Approach to Stable Matchings and Some Applications","venue":null,"work_id":"3fdef69c-3c6a-4274-885c-e11d2bca7250","year":2003},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.233780Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:5671f783d25b8e94b754a247e5d96e3b4e0649573acf0b5cf494bddaafbd0640","observation_id":"965e1823-5422-4a8a-b132-6c4cac110637","resolution":{"observed_at":"2026-08-15T21:05:40.038402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:40.018462Z","title":"Fixed points and choices: stable marriages and beyond","venue":null,"work_id":"ead1beaf-fe97-473b-a3d6-b8e951c0f6a2","year":2018},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.238723Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:a83be70098639c584dee8e2bd3db63a2548731dc8ab2dd7fcb1b8e33bf6f4f79","observation_id":"464c64f3-0392-4629-8b9a-e946c511ee48","resolution":{"observed_at":"2026-08-15T21:05:40.023253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:40.003045Z","title":null,"venue":null,"work_id":"75b15e41-80ca-406c-921c-5f3ee928ae2c","year":2002},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.243432Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:2793c976fda7a9eeca917959c805d20db6abcd55e4cbb75c40f0a94fd9696d30","observation_id":"f8b530b9-6aeb-450e-9998-3cf310304316","resolution":{"observed_at":"2026-08-15T21:05:40.008047Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.986510Z","title":"Stable matchings through fixed points and graphs","venue":null,"work_id":"98240699-2177-4539-bdcc-7c8d3d75c811","year":2008},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.248150Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:04d5643e500dbaa365cc2006800c3e431e2d752fa06d5d044b085e067cf360a1","observation_id":"a7ad703d-1c15-476c-9900-dac4e2ca2b39","resolution":{"observed_at":"2026-08-15T21:05:39.991172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.362728Z","title":"College Admissions and the Stability of Marriage","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.362728Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:c1816b54489972a1f555346946286488e675b1e93e6f0942ccb57e2facae13c9","observation_id":"0df52a6f-2648-4b6c-98dd-3e5bdc5c3450","resolution":{"observed_at":"2026-08-15T21:05:39.362728Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.372164Z","title":"Glitzner","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.372164Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:eed7992dd7baf3678600594d8f4488cae1af9723c1b68942fffe24f76324d1e9","observation_id":"bb8b8de0-f47f-4176-a15b-035d062d3801","resolution":{"observed_at":"2026-08-15T21:05:39.372164Z","resolver_source":null,"status":"malformed_identifier"},"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-15T21:05:39.972196Z","title":"Glitzner and D","venue":null,"work_id":"34dae93f-0dd6-4b17-a58c-37131b37a068","year":null},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.377906Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:92290d336c0ccedefe77400b90000ed41233d19d30ad5de4424e05cc01fde79f","observation_id":"e5222cf0-377e-4378-bd89-eb061a231246","resolution":{"observed_at":"2026-08-15T21:05:39.976985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.958373Z","title":"Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem","venue":null,"work_id":"767d8575-9b45-4c6c-a08a-b7ec6090e73a","year":2024},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.390810Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:531f4d064e6b788b76c85c03ea4960d3316849a978cad65e51dc3b80ec99b8a6","observation_id":"23051f27-ef55-409b-847e-bd3e738a40b6","resolution":{"observed_at":"2026-08-15T21:05:39.962882Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00437","last_updated":"2024-11-25T13:48:30Z","snapshot_observed_at":"2026-08-16T13:47:09.362243Z","submitted_at":"2024-06-01T13:24:08Z","title":"Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem","version":3},"cited_work":{"arxiv_id":"2406.00437","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.00437","snapshot_observed_at":"2026-08-15T21:05:39.742994Z","title":"Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem","venue":"cs.DS","work_id":"fc270c67-aa03-47be-837f-ab104e5eb5bb","year":2024},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.395540Z"},"links":{"cited_paper":"/paper/2406.00437","citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:ba413a0ce36ae6584bfd4a66b9a6d8aead8bb2ccf96baadea28f6c3a06b05cf0","observation_id":"bea08081-4482-4d4c-bb66-0ebed1b910a9","resolution":{"observed_at":"2026-08-15T21:05:39.748117Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.943907Z","title":"Gurobi Optimizer Reference Manual","venue":null,"work_id":"299fdabc-cc6f-4a6d-918a-dc264babf1a0","year":2025},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.400548Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:6ecbb458bd32ad0f6549949c848d7a94782586df5fb6be7d2c0ed1ee77430e5b","observation_id":"1a5da46d-a3b5-4d36-924c-3020a43e275d","resolution":{"observed_at":"2026-08-15T21:05:39.948369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.927333Z","title":"Gusfield and R","venue":null,"work_id":"1909c2f8-4248-42eb-9c56-bd5600889ede","year":1989},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.405241Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:7128386db66e9ed77924040c94919aa121ac8106b323193c05304a2396090ebc","observation_id":"cdd9c610-f430-4ecb-8c6f-2b3ba8fdcfb6","resolution":{"observed_at":"2026-08-15T21:05:39.933323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2139/ssrn.5144979","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.597238Z","title":null,"venue":null,"work_id":"c3317c4d-d901-4c8b-9a97-0cd2ebc11470","year":2025},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.410048Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:4bd40bff08392cf10f49fc3603980864780069ab266ae321d57ea7ccf2508fef","observation_id":"68bf07a6-3452-4e6d-9543-53cb436ecf76","resolution":{"observed_at":"2026-08-15T21:05:39.602059Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.414596Z","title":"An efficient algorithm for the “stable roommates","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.414596Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:16e76025dbcbcff0d61395a07c836380dd42439aab425789839b84b634077ab8","observation_id":"709a2605-3081-4f0a-b681-26c5f31cf177","resolution":{"observed_at":"2026-08-15T21:05:39.414596Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.419130Z","title":"The stable fixtures problem—A many-to-many extension of stable roommates","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.419130Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:aedce7049c1d54f436e362c2d9b46749956450879a0245b7ae9ac1780ab4173d","observation_id":"da081881-990f-4f22-b86a-898e9cfa8d4a","resolution":{"observed_at":"2026-08-15T21:05:39.419130Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.423641Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.423641Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:05c41c248a4613cbbcdecc9401c7dd923b6732739896044d35b1791317846259","observation_id":"1a8a93e8-e1e2-48fd-a8b4-3cbb9f7c0f57","resolution":{"observed_at":"2026-08-15T21:05:39.423641Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1088/1742-5468/2005/10/p10008","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.548475Z","title":"Random stable matchings","venue":null,"work_id":"eeb8bfa6-d396-445f-890d-d49830685c5d","year":2005},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.428268Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:ab7e12f9d68de1d7ac1e17ac130a5a873f348c6a34e7bc821460a7f43fc867ac","observation_id":"b83b8906-f17b-457a-bf1f-e27e6357064f","resolution":{"observed_at":"2026-08-15T21:05:39.553112Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.432796Z","title":"Near-Feasible Stable Matchings with Couples","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.432796Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:021b230abe9cb94f15de5761477493866f04e5bb3725cbd2f6f2851e81c418aa","observation_id":"170458b2-fd09-4b4e-87ab-a578f49781a8","resolution":{"observed_at":"2026-08-15T21:05:39.432796Z","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":"10.1002/rsa.3240050307","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:08:47.750906Z","title":"An upper bound for the solvability probability of a random stable roommates instance","venue":"Random Structures and Algorithms","work_id":"6ab09000-b26b-4a6a-b130-15a4110e6597","year":1994},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.437602Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:0ccd27643b3dc8771f26597e046237a167dc6682f0e383196366d7eec0e86a78","observation_id":"ab9a6a00-61f5-4f25-a4b0-316f8e7d7112","resolution":{"observed_at":"2026-08-15T21:05:39.528607Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.442271Z","title":"NP-complete stable matching problems","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.442271Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:256023aebd9cf913423181936ecfbe9d5a9d7314ecca425600c9006556a3a2d0","observation_id":"9076a046-ddc7-4e3c-8764-c280ac8d7937","resolution":{"observed_at":"2026-08-15T21:05:39.442271Z","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-15T21:05:39.912505Z","title":"On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets","venue":null,"work_id":"09c7f8f0-591c-447f-9603-324ae56e906a","year":1986},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.446986Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:3fd52c451cbe6930d59f34e17f95934bd95ed8a9fdc0a0b35167f676f3e64ae9","observation_id":"00fd5488-2a36-4f5b-b4e7-9d78af35f594","resolution":{"observed_at":"2026-08-15T21:05:39.917461Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T21:05:39.452147Z","title":"A necessary and sufficient condition for the existence of a complete stable matching","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.452147Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:b858c75ee471d3ffbbd98360fa90f71c52565e5b414dc79b24adad052642d469","observation_id":"10a31d00-09f8-44fd-b066-309dec40eb83","resolution":{"observed_at":"2026-08-15T21:05:39.452147Z","resolver_source":null,"status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:05:39.456747Z","title":"Stable matchings and stable partitions","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.456747Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:989445e835f3187b86b3e05699b08dff253b9fcf9ca5a1a9bd87fc67140aa06f","observation_id":"ccec17a0-2e4c-4255-b97a-7c771098aebf","resolution":{"observed_at":"2026-08-15T21:05:39.456747Z","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-15T21:05:39.896671Z","title":"LP based approach to optimal stable matchings","venue":null,"work_id":"358394f2-8c96-401f-beae-2ca5bc029e81","year":1997},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.461718Z"},"links":{"citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:7bdefd429dfa10da9a68069ec8c8a2b446774018f22d158a829f599ad7c6d797","observation_id":"21eed98e-3a44-4b5b-bfeb-0d216e1f0a56","resolution":{"observed_at":"2026-08-15T21:05:39.902034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.06717","last_updated":"2025-07-07T15:54:57Z","snapshot_observed_at":"2026-08-15T22:32:53.579648Z","submitted_at":"2025-05-10T17:52:07Z","title":"Perspectives on Unsolvability in the Roommates Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.06717","snapshot_observed_at":"2026-08-15T21:05:39.382675Z","title":"url: https://arxiv.org/abs/2505.06717","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-15T21:05:39.382675Z"},"links":{"cited_paper":"/paper/2505.06717","citing_paper":"/paper/2505.11456"},"observation_digest":"sha256:d756f0d14f2e5e317aa8e9b1b1d379ccb6a39ec319604fccc94f39bdf8c3b399","observation_id":"edc1b1b0-712d-4315-bfa0-291d64f7a47d","resolution":{"observed_at":"2026-08-15T21:05:39.382675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.11456","last_updated":"2025-07-07T11:02:18Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T20:50:24.399240Z","submitted_at":"2025-05-16T17:10:44Z","title":"Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":7,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":9,"verified_exact":11,"verified_fuzzy":11},"total_outbound_references":39},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2505.11456."}