{"as_of":"2026-08-18T14:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:204dbee275ccbb524a35b29ec286ab9e6171bf876500ecc2276f2a437811d465","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T19:12:19.271683Z","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-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:55:42.221290Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T13:55:43.731808Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"cited_work":{"arxiv_id":"2411.11013","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.11013","snapshot_observed_at":"2026-08-07T13:55:43.731808Z","title":"Max-Bisections of graphs without perfect matching","venue":"math.CO","work_id":"98a6e6bd-4079-4753-89f6-4625b1f1619e","year":2024},"citing_paper":{"arxiv_id":"2505.21694","last_updated":"2025-07-20T17:19:45Z","snapshot_observed_at":"2026-08-07T13:22:35.610677Z","submitted_at":"2025-05-27T19:31:03Z","title":"Max-Bisections of graphs without even cycles","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:42.221290Z"},"links":{"cited_paper":"/paper/2411.11013","citing_paper":"/paper/2505.21694"},"observation_digest":"sha256:2e0fcdfcce6cbd47d401204d14266034a599b407961821e9eec87c37c7bdf104","observation_id":"05f29922-4b17-4600-a976-3c037e89f942","resolution":{"observed_at":"2026-08-07T13:55:43.790643Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2411.11013/citation-record","integrity":"/paper/2411.11013/integrity","json":"/paper/2411.11013/citation-record.json","paper":"/paper/2411.11013"},"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-12T19:12:19.585164Z","title":"Alon, Bipartite subgraphs, Combinatorica 16 (1996) 301–311","venue":null,"work_id":"917214a5-8157-41c8-84ea-f3bad6d054af","year":1996},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.164834Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:6689f14cdba0827f16a5795ae23acd2d95ab43daa5da0be1062db6d83721cba1","observation_id":"a5133743-57bd-4ca3-8231-5f8138ac9474","resolution":{"observed_at":"2026-08-12T19:12:19.588181Z","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-12T19:12:19.576814Z","title":null,"venue":null,"work_id":"666941df-794d-44a3-b96d-b7b2659549fc","year":2003},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.169158Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:37c8da26d8411863f607da216703b59150ecd87a78c2ae96d90708cd996be6fd","observation_id":"abda107a-bd2a-430d-b06b-179d8091b238","resolution":{"observed_at":"2026-08-12T19:12:19.579770Z","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-12T19:12:19.568309Z","title":null,"venue":null,"work_id":"547ac2d7-17a8-42a6-97e2-39a57ed66f02","year":2005},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.172789Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:13e0a5ad05bf53f61673e7c06f213676750f7e6e1b3b7a3365fc30383f04601e","observation_id":"974262d5-f7bf-45a3-978c-a2d791d92631","resolution":{"observed_at":"2026-08-12T19:12:19.571264Z","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-12T19:12:19.559914Z","title":"Bollob´ as, A.D","venue":null,"work_id":"107e2caf-db28-4618-9de4-852ff050784e","year":2002},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.175957Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:88508aa137c171a18e3e6873f917f02ae83ae1ce334018321cc229c5600b3872","observation_id":"b0856cf3-c8f0-43c3-8d82-ffeedcbc965d","resolution":{"observed_at":"2026-08-12T19:12:19.562947Z","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-12T19:12:19.551174Z","title":"Bollob´ as, A.D","venue":null,"work_id":"baf2e63c-926b-4743-999e-efb9d57742dd","year":2002},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.179667Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:1fd4d906e71d31766987d6995774a373fe4ae7735af894789a6d649b44da20a6","observation_id":"495a84e8-2ff3-4204-b10b-d01495c615ed","resolution":{"observed_at":"2026-08-12T19:12:19.554137Z","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-12T19:12:19.542313Z","title":"A Bondy, M","venue":null,"work_id":"7db1ab96-0c9b-455c-8853-eaacd7050f5e","year":1974},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.182695Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:0326592abe57849c6f09158a3b6a0c5356e669e6399a4707c60c092c82ffdacb","observation_id":"028b970b-8d20-4678-ae98-2d81db0954f3","resolution":{"observed_at":"2026-08-12T19:12:19.545381Z","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-12T19:12:19.534137Z","title":"Edwards, Some extremal properties of bipartite graphs, C anad","venue":null,"work_id":"8e1352d4-527e-4ad3-a656-1c0f0bdb6564","year":1973},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.187233Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:5a2619a0722407e3a801c4e175b26a7363cd9dedc6c35233c6bdff877f742727","observation_id":"c23e07a1-753d-45d0-939a-d625c4257b94","resolution":{"observed_at":"2026-08-12T19:12:19.537116Z","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-12T19:12:19.524759Z","title":"Edwards, An improved lower bound for the number of edges in a largest bi- partite subgraph, Proceedings of the Second Czechoslovak Symp osium on Graph Theory (1975) 167–181","venue":null,"work_id":"b9389085-0413-4c64-ab0b-da776f91b233","year":1975},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.190283Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:db19650260a1dd23215c694daad69feb85eb15c91833a7c44cce7197cadcdf6b","observation_id":"4d1dbe1a-8a30-45f6-afc7-1c0e5a0bdda8","resolution":{"observed_at":"2026-08-12T19:12:19.528541Z","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-12T19:12:19.514320Z","title":"Erd˝ os, On even subgraphs of graphs, Mat","venue":null,"work_id":"36a3712f-4e44-4ede-8c7b-dae8a4e14a87","year":1967},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.193581Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:427bcd3c3f9334a1a2125dbc37b82f158b236ac165704e327a63c4c189403cfe","observation_id":"b9aedfb1-412f-4119-aa5a-4a52c07d402c","resolution":{"observed_at":"2026-08-12T19:12:19.517982Z","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-12T19:12:19.504855Z","title":"Erd˝ os, Problem and results in graph theory and combinator ial analysis, in: Graph Theory and Related Topics (1979) 153–163","venue":null,"work_id":"b17d4f74-cadc-4749-8811-2335f3ea75c6","year":1979},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.196803Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:d69f5b69199cf465a8ba4d2b1538f2c74946c8fb2426ee80a93b381c949a410e","observation_id":"b092d031-a1af-4c32-b06d-5630946c4d23","resolution":{"observed_at":"2026-08-12T19:12:19.508665Z","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-12T19:12:19.496704Z","title":"Erd˝ os, A","venue":null,"work_id":"e2ee52f4-3a94-4765-8f3c-e980c5f1aee3","year":1997},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.199750Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:b1445d64787d99bd801e29970778b2fdc468d7afc3bd89c5d3fc0a50de037080","observation_id":"b96de68a-1cea-4e11-a9aa-0a07c9c71672","resolution":{"observed_at":"2026-08-12T19:12:19.499489Z","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-12T19:12:19.487531Z","title":null,"venue":null,"work_id":"c53a24d6-aa7c-4115-a88f-3b2bb5203e0b","year":2018},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.202699Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:b4f4848e771c04d0eab26e5132658e442c27dc1eb0b447b5662dbaf08f82bb32","observation_id":"652e9d7f-720a-4654-9536-456d5fca2374","resolution":{"observed_at":"2026-08-12T19:12:19.490442Z","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-12T19:12:19.479097Z","title":"Glock, O","venue":null,"work_id":"d537eb4b-53c2-4915-913c-135ef7b11b53","year":2023},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.205616Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:3994aa0c098e84f14913f73765231e4e1003cb592c16bfd308af52739fbce3ee","observation_id":"374402e5-f55b-4c10-bdfe-d7ab5aae81a5","resolution":{"observed_at":"2026-08-12T19:12:19.481940Z","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-12T19:12:19.470370Z","title":null,"venue":null,"work_id":"07fe8e0e-8def-46e0-af45-b7bef41d22bd","year":2021},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.209689Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:e1ab41577121c2c20bc9f028b69b0df07a4a4c794ea8c23b427e9fe0d39e76ae","observation_id":"c8250fe7-cabe-49df-97e6-a5555d952977","resolution":{"observed_at":"2026-08-12T19:12:19.473562Z","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-12T19:12:19.461339Z","title":null,"venue":null,"work_id":"84a74c79-a8de-42ac-bc37-b896a20dd530","year":2017},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.212774Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:0ae5b1a8adadb2e9cc684ac74b61772b3831f6a07483d23009718721dab16a63","observation_id":"8f8cc3fa-91c5-4b4d-9142-8fda06ec101d","resolution":{"observed_at":"2026-08-12T19:12:19.464194Z","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-12T19:12:19.452926Z","title":null,"venue":null,"work_id":"e2cd0c5e-f5a0-4d51-bc35-0b1f6ead373e","year":2020},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.215498Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:d52e60b97d6e522b91b6457795d79fb62eddf6404a66098a7762e22bc86d1e34","observation_id":"d92ddf15-4e5f-4711-8d26-e4c93166a484","resolution":{"observed_at":"2026-08-12T19:12:19.455951Z","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-12T19:12:19.444853Z","title":null,"venue":null,"work_id":"db61705a-ba9a-4e7a-bf1c-5313c4d644a3","year":2019},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.218522Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:d45ab719210e8552620f6fcad00f9733640a97c7286299c66237aff920b427a9","observation_id":"5e15e936-1b57-4652-9686-808700126b36","resolution":{"observed_at":"2026-08-12T19:12:19.447745Z","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-12T19:12:19.436592Z","title":null,"venue":null,"work_id":"cbe62f0c-3379-4b4f-8954-8a3927265ad5","year":2019},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.221581Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:70a42b5b2ec9c039870421ac6f79460e61decc5f582a8457037abcfe67ec5898","observation_id":"031dfb61-a168-46c1-9a71-6abba304b3ec","resolution":{"observed_at":"2026-08-12T19:12:19.439409Z","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-12T19:12:19.428789Z","title":null,"venue":null,"work_id":"55f92ecc-a348-4612-99ce-99b1733079e6","year":2013},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.224762Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:533eed562fa7fd5b10ace621241530b83625cd5aa048d027183e66480a3a9270","observation_id":"a76f7041-f059-47df-8e88-bc16290c97af","resolution":{"observed_at":"2026-08-12T19:12:19.431596Z","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-12T19:12:19.420698Z","title":null,"venue":null,"work_id":"0f753b1c-9032-46e1-858c-772e62616266","year":2021},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.227785Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:fb6329777f9d753ac0fb976e57e605b3030ba1ccc76807dcf9acab2b69786550","observation_id":"38607b6d-8547-47a7-ad1e-c1b65e56afc8","resolution":{"observed_at":"2026-08-12T19:12:19.423516Z","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-12T19:12:19.412936Z","title":null,"venue":null,"work_id":"25405eaa-425b-464a-8b7c-71fcaac2cb1d","year":2024},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.230620Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:bb52be4bf87b4bd997473905ab52c73b46cdc3391e79bc412a8f7409a2ede5d8","observation_id":"9091cb63-f31c-4ac9-90a4-7c32ecd904d9","resolution":{"observed_at":"2026-08-12T19:12:19.415671Z","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-12T19:12:19.404496Z","title":null,"venue":null,"work_id":"9050a1d3-ed54-47ad-b14e-4951ed9b739d","year":2019},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.233570Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:657428e4dfb592b7e2ba1152dd2ee28ab6749f84283fe8d4d09b767ebbe0798b","observation_id":"9f29bcf1-6f96-4d62-a5eb-a383a76a1233","resolution":{"observed_at":"2026-08-12T19:12:19.407663Z","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-12T19:12:19.396878Z","title":"Poljak, Zs","venue":null,"work_id":"32766016-0a61-4b80-ab5c-e8a2c03fb95c","year":1994},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.236396Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:4276769be1b6b174b9a44ee91065361883e54b0e90fa8cf7bccc4b0b126d3c67","observation_id":"88d21394-f9bd-4432-be32-50a8b79a78fe","resolution":{"observed_at":"2026-08-12T19:12:19.399518Z","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-12T19:12:19.389231Z","title":null,"venue":null,"work_id":"81dfbc61-513e-4a00-ab9f-c673fff0e039","year":2022},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.239472Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:f8834e119f17430e8a0905e06e7a180aeca1d580d12f7e9153adc68d75e42f58","observation_id":"7cd6d1f7-8326-4015-a848-4abe85f832c1","resolution":{"observed_at":"2026-08-12T19:12:19.391961Z","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-12T19:12:19.380220Z","title":"Scott, Judicious partitions and related problems, Surveys in Combinatorics 327 (2005) 95–117","venue":null,"work_id":"090fba38-d5cd-4c23-9024-f64422d0967a","year":2005},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.242172Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:a85a1de8a2436286d788399c4238a94353504cf0f9ff7ac1c606cf5a24600221","observation_id":"d2b1cb68-6766-4c58-89dd-b808d9a9d751","resolution":{"observed_at":"2026-08-12T19:12:19.383998Z","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-12T19:12:19.371141Z","title":"Shearer, A note on bipartite subgraphs of triangle-free gr aphs, Random Struc- tures Algorithms 3 (1992) 223–226","venue":null,"work_id":"d82543bd-8e98-4c87-aac6-ce03b0786110","year":1992},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.244761Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:3c53c6fd9f9d4180da32e50fde8006bab741930cc54cf56cade36a103a181c42","observation_id":"a37567ee-29f9-4ae1-906a-634da62fb173","resolution":{"observed_at":"2026-08-12T19:12:19.374515Z","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-12T19:12:19.363195Z","title":null,"venue":null,"work_id":"d5a631f7-f45b-40ad-9660-087779d130db","year":2023},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.247532Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:33aaccc16b73ce797ab4c882a910982c0e123d7077bd4e7607336ee69301bc47","observation_id":"7bf76d9f-c7b8-46b5-9726-028c9d1ad4b8","resolution":{"observed_at":"2026-08-12T19:12:19.365904Z","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-12T19:12:19.354198Z","title":null,"venue":null,"work_id":"34f0676e-7075-41f5-bbb6-66c9e0155918","year":2024},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.250220Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:52f3e95e51720bb17fd3de913586535f62b62b23e573f7d34fa5774018e4cafd","observation_id":"3ec859f6-1b1f-4cdf-b79d-143c932a310f","resolution":{"observed_at":"2026-08-12T19:12:19.357182Z","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-12T19:12:19.346208Z","title":null,"venue":null,"work_id":"528b2382-deeb-4e57-9a79-50e34a5892b2","year":2025},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.252925Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:3e6da39c02bbfc47dd5ba8df7d230a55671be3482c56a2d2aa5259a156ad40f7","observation_id":"014c342d-07c0-4ab5-834f-4784718ac5d4","resolution":{"observed_at":"2026-08-12T19:12:19.349010Z","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-12T19:12:19.336506Z","title":null,"venue":null,"work_id":"ae054ab5-9146-4151-bc24-4b7c7330dddc","year":2010},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.256884Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:e098e39cf0910e2aeba0e30274576b72fada2af73a8a51ff2932b2b6e2cd95b1","observation_id":"74c3e5ae-498e-44b5-b848-40c24b71707a","resolution":{"observed_at":"2026-08-12T19:12:19.340667Z","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-12T19:12:19.326992Z","title":null,"venue":null,"work_id":"3a11a8d8-b796-4090-ae30-173256a90d07","year":2010},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.259805Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:cb1949bfd699b86fbb46c8254d770d50e6b9e9ce80405a7c11046fe09be31979","observation_id":"4b697d0d-30b3-415a-ad7e-d6637e3234bc","resolution":{"observed_at":"2026-08-12T19:12:19.330639Z","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-12T19:12:19.318152Z","title":null,"venue":null,"work_id":"7c40b437-9dfa-46aa-96ae-293a8ce74752","year":2008},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.262650Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:b990825b640dfb92392b91f4ddf63cd4305649d494f6b979f5d6eb3ae546291a","observation_id":"ab6c43f1-2d90-4f5d-910f-e0fd1a2ee596","resolution":{"observed_at":"2026-08-12T19:12:19.321030Z","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-12T19:12:19.308989Z","title":null,"venue":null,"work_id":"bf4cd75f-20f4-4b51-abea-44988fdc80a0","year":2014},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.265320Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:6088e1fcec2079814cd13d3e7a928e5d72b6d7f0216d83a3bd2340e787ad6fc8","observation_id":"8b77d92c-dc61-4e67-a6cf-7bad61208069","resolution":{"observed_at":"2026-08-12T19:12:19.312074Z","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-12T19:12:19.300462Z","title":null,"venue":null,"work_id":"4e3a0b2f-84c4-4f11-be75-1d522e0c81db","year":2017},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.268206Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:253527902f33d92ad48ed9c326e370a4f2acea7dba6c8a1467e0f5bd1ba27747","observation_id":"f3f6879b-853d-4fc0-ab67-9f591486051c","resolution":{"observed_at":"2026-08-12T19:12:19.303551Z","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-12T19:12:19.290534Z","title":null,"venue":null,"work_id":"b2894073-6c33-4339-a4b6-caeacf871204","year":2018},"citing_paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T19:12:19.271683Z"},"links":{"citing_paper":"/paper/2411.11013"},"observation_digest":"sha256:f3548928258c0cf7acecc390371cd00449a4f4e8a85321727481b64dafab07b6","observation_id":"7d6020ac-8e85-4a09-9d21-f4c71075787a","resolution":{"observed_at":"2026-08-12T19:12:19.294464Z","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"}}],"paper":{"arxiv_id":"2411.11013","last_updated":"2024-11-17T09:33:10Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-18T09:12:12.261740Z","submitted_at":"2024-11-17T09:33:10Z","title":"Max-Bisections of graphs without perfect matching"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":35},"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 18 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 1 inbound Pith citation observation for arXiv:2411.11013."}