{"as_of":"2026-08-13T08:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:961c51f9010f3f3fe92597dd4a5e8d7f397ce6bac2281e68951f86b8cc0b3a65","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:29:16.683900Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.15463/citation-record","integrity":"/paper/2411.15463/integrity","json":"/paper/2411.15463/citation-record.json","paper":"/paper/2411.15463"},"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-12T14:29:17.196970Z","title":"O(√ log n) approximation algorithms for min uncut, min 2CNF deletion , and di- rected cut problems","venue":null,"work_id":"b62d3d28-2987-4499-82f4-12e909d8f1cf","year":2005},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.529171Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:63ec7a7d9d628179b8b21e588564b2939b603a1ccd3a42960d65c1610dfcd039","observation_id":"e77cd3ac-2fa7-421d-8ebf-74219ffc9a82","resolution":{"observed_at":"2026-08-12T14:29:17.201992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.180241Z","title":"Branch-and-reduce expon ential/FPT algorithms in practice: A case study of vertex cover","venue":null,"work_id":"b534962a-67f4-4680-9bf3-540b0e04cab0","year":2016},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.535816Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:c2df280dbf9ca71e2f6d37e475ed51bfdff52cf1ca7ac2ece1574574d2722675","observation_id":"6519a256-0a61-4fde-bca9-bd218e2b3eb2","resolution":{"observed_at":"2026-08-12T14:29:17.184953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.164906Z","title":"Feasibility of home–away-pattern sets f or round robin tournaments","venue":null,"work_id":"905d91fa-bcf4-4751-bcbf-a6969e50db1f","year":2008},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.542057Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:eee92a12da327efa948d0581d5e459ff3d6f22d92f3d4268f4fd7c0ff23c7d21","observation_id":"35d7b3db-b95e-4fa4-95d6-f0c9ece7acbf","resolution":{"observed_at":"2026-08-12T14:29:17.169491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.149441Z","title":"de Werra","venue":null,"work_id":"182594f5-e663-40f4-9788-cf82c7cc5511","year":1981},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.547988Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:cc7bf4ae5b1714371b324aa609f80fccc788575b7abc9e56dd3cab70d3a430d8","observation_id":"97def6b3-2b6a-44e7-bf80-f3ab953f7929","resolution":{"observed_at":"2026-08-12T14:29:17.154423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.132412Z","title":"Mi nimizing breaks by maximiz- ing cuts","venue":null,"work_id":"aac2a51f-6b71-4749-8d79-13f413d7ebf4","year":2003},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.553932Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:2b4207b0dc4917f7401b2473a03619802dfc5e789d602a46de3eedf9d5775913","observation_id":"49976d35-66be-4413-abac-4441e13c210a","resolution":{"observed_at":"2026-08-12T14:29:17.137803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.114475Z","title":"Improved approx imation algorithms for maximum cut and satisfiability problems using semidefinite p rogramming","venue":null,"work_id":"71cbcefd-7136-479e-ad99-bffdea1e3465","year":1995},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.563808Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:d1c5f0d81cc14e30159773a4c43048ee913477b07d781dd4a035b97bba7f327a","observation_id":"5f77b31a-21dc-4f02-9857-411bcc45e664","resolution":{"observed_at":"2026-08-12T14:29:17.120019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.096817Z","title":"Scheduling a major college basketball conf erence—revisited","venue":null,"work_id":"a5a6dd21-210d-45a3-b495-7709b36d38f9","year":2001},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.569623Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:9c356a7c39d49827444238a3632340ec4c8b7b7d86471d5b9a15bfa49a3a3323","observation_id":"cfa5cc0c-a918-4c57-84e1-2d56b7e3f7d2","resolution":{"observed_at":"2026-08-12T14:29:17.102301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.078168Z","title":"Algorithm engineering for optimal graph b ipartization","venue":null,"work_id":"c35fefa9-6294-4d54-a625-2b8b9fb11da4","year":2009},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.575460Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:3e3f8b2920cafa574d8361c59173f8c2cf1342f56f0631a775bfbb90cd512e7d","observation_id":"ad50dcbe-7016-4161-8e74-e24896591186","resolution":{"observed_at":"2026-08-12T14:29:17.083817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.059323Z","title":"Linear-tim e FPT algorithms via net- work flow","venue":null,"work_id":"3990fb6d-411c-4838-9132-efc29af06ce6","year":2014},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.580790Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:60df8d737d53a06e0ce14014e7f80f4765982a464fb186ac501fa83ae9f34134","observation_id":"edc017b9-4a43-4104-abd4-3bb2e6bfbaf8","resolution":{"observed_at":"2026-08-12T14:29:17.064505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.030131Z","title":"On polynomial kernel s for structural param- eterizations of odd cycle transversal","venue":null,"work_id":"353e3308-b84f-458e-9138-9d430ace36da","year":2011},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.585769Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:fc9a70f753065eb02b18a7a52dcebc23e33cc1d70fb21316b2ad1f31a92c092a","observation_id":"7bc9eaeb-4b2a-47a7-b59e-3502bbb84634","resolution":{"observed_at":"2026-08-12T14:29:17.047792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:17.010496Z","title":"An (almost) lin ear time algorithm for odd cycles transversal","venue":null,"work_id":"575f2ae1-b447-4689-be96-f2665dc8c859","year":2010},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.591284Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:6f6d54fd145cc71223d016f48e283cd559e317ead63320eea36e92f253a8194d","observation_id":"9841a4da-a944-49c3-9807-554ac6c04295","resolution":{"observed_at":"2026-08-12T14:29:17.016271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.994048Z","title":"Faster graph bipartization","venue":null,"work_id":"f17e1529-6488-4472-8bad-05fa6a7e216a","year":2020},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.596226Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:a4fc7e5340befda4f23bb5e3378beca208b045d7c5dc638fbe608c203abd2fe0","observation_id":"9036399e-3b3e-4200-bbce-f318b8655ee6","resolution":{"observed_at":"2026-08-12T14:29:16.998688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.976725Z","title":"Faster parameterized algorithms using line ar programming","venue":null,"work_id":"4f0e27d0-4e84-42cf-81b6-cc58eeab6e84","year":2014},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.601520Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:c0cb84b1f019db0bc66a46c4f1f0fcd1fb1a6c097ea0bbc2ec659636b7f2f8e1","observation_id":"2e995554-2421-458c-b148-1f7b1f6d5393","resolution":{"observed_at":"2026-08-12T14:29:16.981937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.960798Z","title":"Simpler parameterized algorithm for OCT","venue":null,"work_id":"a77e3449-01b4-4aa0-8969-00e4d9dc9539","year":2009},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.608725Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:bf1dbac74a6311bb77c913dc82baeec48a3753c761ef88678dfc4fe9a8f8c512","observation_id":"ee930603-3e55-47e6-b7bb-a01984b4d45d","resolution":{"observed_at":"2026-08-12T14:29:16.965634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.945129Z","title":"C haracterizing feasible pattern sets with a minimum number of breaks","venue":null,"work_id":"7d1093a4-c1f3-4618-ad10-31f006c47af0","year":2002},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.614725Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:8c0e3257eae952fbebbcb0e0624b61f1b193dcbb58748dcd0f1c21370f970081","observation_id":"1249a575-00b0-448a-ba92-73c97fbe3048","resolution":{"observed_at":"2026-08-12T14:29:16.949978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.929390Z","title":"A polynomial-time algorithm to find an equitable home–away assignment","venue":null,"work_id":"5dd1f34c-9a40-40dc-810e-e4bdf1b214ed","year":2005},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.621915Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:ab74dd97279da4fcd2eb706c8e322f78f3a33845bcdc1c15a02ea8d4067e6656","observation_id":"d917e71a-19ce-4aff-a3f3-8d489f033f53","resolution":{"observed_at":"2026-08-12T14:29:16.934233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.910225Z","title":"Semidefinite progr amming based approaches to the break minimization problem","venue":null,"work_id":"0eb2d36e-7558-4ff7-ad0d-09d819549a8b","year":1975},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.627373Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:ecb46fbdea02230d1468cc19637552007f48d4185d29456a28815300310f9f89","observation_id":"624e0682-2ce6-45ff-8d0e-91d2819f9f16","resolution":{"observed_at":"2026-08-12T14:29:16.917153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.888573Z","title":"Scheduling a maj or college basketball conference","venue":null,"work_id":"7908d283-bac5-4e83-b96d-8e708b6989a0","year":1998},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.632591Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:dd5a34b01d3154d8ccc9b8da70ffdda27479fc70ff8e2078ea4d1c9ded7ed24a","observation_id":"24810d1a-91bd-414d-855b-ec9ca8a4ce2b","resolution":{"observed_at":"2026-08-12T14:29:16.894364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.867861Z","title":"Nuorium Optimizer","venue":null,"work_id":"b6e96aa2-5985-4e86-a008-586902036bc7","year":2024},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.637603Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:1226c7ad6e19ed4e09d739f8b1a036611c33827dd9406751c44135864d503925","observation_id":"40421f96-c11d-48c3-bd0b-997040659430","resolution":{"observed_at":"2026-08-12T14:29:16.874220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.847796Z","title":"Sports tournamen ts, home–away assign- ments, and the break minimization problem","venue":null,"work_id":"cb41f081-70f1-4100-86a6-35ff6620a180","year":2006},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.643079Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:7c418afd75adb18cbc18c131f65df182edb74274d739ef75a49ff241b935da89","observation_id":"f8f6f18b-490d-4c49-9c0d-dff49a2cfd22","resolution":{"observed_at":"2026-08-12T14:29:16.854140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.830952Z","title":"Rasmussen","venue":null,"work_id":"b4e7333f-923b-4812-9c8e-18b7a99a62a6","year":2008},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.649148Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:ec5db313472033ec33c7a7ee1b8aec8b00bee3a06bcfe1b16aa4a78fda58f04f","observation_id":"7332a552-2fc2-46d1-a97f-259d6b68aafb","resolution":{"observed_at":"2026-08-12T14:29:16.836057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.811977Z","title":"The timetable co nstrained distance minimization problem","venue":null,"work_id":"b18b4892-e6fc-4e4a-a33e-f0d7877797f2","year":2006},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.655514Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:29d77df4bc1259515c1f0178b1b7254ffd65bb441843b413e2656e0a1164ce3d","observation_id":"56f69680-dca7-48f8-a064-908264d4d641","resolution":{"observed_at":"2026-08-12T14:29:16.817784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.793885Z","title":"Finding od d cycle transversals","venue":null,"work_id":"4c657b6e-e146-429f-938b-82540f519655","year":2004},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.661162Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:3c93110ba7c04d5d014c9e19cf86059a21bcf2e6ae7970baba6f449e9906462a","observation_id":"bd8e3067-48c9-4f13-81a7-534e699862e3","resolution":{"observed_at":"2026-08-12T14:29:16.798863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.776650Z","title":"A schedule-then-break approach to spo rts timetabling","venue":null,"work_id":"db95d65f-b9f4-4cb9-bc1f-32213a00c067","year":2000},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.666428Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:1cd0b5ca16011439629cd08ab3072f379e34b0d311ae82e43c742113d62903c1","observation_id":"bd2fb937-d488-4035-aa97-735c1f018738","resolution":{"observed_at":"2026-08-12T14:29:16.781671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.759317Z","title":"On the complexity of pattern feasibility prob- lems in time-relaxed sports timetabling","venue":null,"work_id":"6d5f3453-5527-4f0e-be5f-ccbe2de9ccb1","year":2020},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.671447Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:0bf04c0c1b16a339aaf694051a712bc4227c6613ae6918c0e5cd92d72fb4e70f","observation_id":"051e5c76-8c7e-416c-bcdd-ed4cb057f487","resolution":{"observed_at":"2026-08-12T14:29:16.764525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.741994Z","title":"Optimizing rest tim es and differences in games played: an iterative two-phase approach","venue":null,"work_id":"b0a1e78f-1bcb-4207-b935-046fafa7f9c2","year":2022},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.677374Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:0281f443598d9aeb27acd2a489ba7cb4331d991bcc1c4c367efc434dc2aac8e1","observation_id":"a6ac45b0-cde7-4692-80ed-dcde76e2d813","resolution":{"observed_at":"2026-08-12T14:29:16.747093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:29:16.722167Z","title":"On the separation in 2-pe riod double round robin tournaments with minimum breaks","venue":null,"work_id":"e0dc8da9-a3f8-4bcb-a596-5fc41f609e91","year":2012},"citing_paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:29:16.683900Z"},"links":{"citing_paper":"/paper/2411.15463"},"observation_digest":"sha256:2eba4d791ef014ad00d749452764b07c399f317c8ddd6e96a445b91f6b8e77e2","observation_id":"7bfe5f45-c06e-42e3-b701-b985a715018a","resolution":{"observed_at":"2026-08-12T14:29:16.729742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.15463","last_updated":"2024-11-23T05:57:56Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-12T14:14:24.413242Z","submitted_at":"2024-11-23T05:57:56Z","title":"Minimizing breaks by minimizing odd cycle transversals"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":27},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2411.15463."}