{"as_of":"2026-08-19T00:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:726c291ae34ad93b6d3e7ccc27fa206dab0948eb7b50cc718eb9843529f458cb","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T14:22:54.066676Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"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/2607.27004/citation-record","integrity":"/paper/2607.27004/integrity","json":"/paper/2607.27004/citation-record.json","paper":"/paper/2607.27004"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T14:22:53.993195Z","title":"MIT press, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:53.993195Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:38b0c8b4110f065eb1935d502ad6c6b2b55cf12cb42cf65ff5e666841caba2a6","observation_id":"af059a64-28b1-4f7d-aca0-7b7c416f7e5d","resolution":{"observed_at":"2026-07-30T14:22:53.993195Z","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-07-30T14:22:53.997524Z","title":"Parameterized (approximate) defective coloring.SIAM Journal on Discrete Mathematics, 34(2):1084–1106, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:53.997524Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:befa97a9eec5a9a18b90842c5ad3fc41c0dcf5bed677393dd8d59bb3b97c7301","observation_id":"fb776de6-c28a-43a9-8169-9d05e6e9b9c1","resolution":{"observed_at":"2026-07-30T14:22:53.997524Z","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-07-30T14:22:54.000646Z","title":"The structural complexity landscape of finding balance- fair shortest paths.Theoretical Computer Science, 933:149–162, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.000646Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:4b64e46ee4ad8ac9d05b3e210dacb5b78db5b2b09197ad310410fb24628a714d","observation_id":"ee79c593-329a-4f13-a4e1-b058ec817ef1","resolution":{"observed_at":"2026-07-30T14:22:54.000646Z","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-07-30T14:22:54.003852Z","title":"Fair algorithms for clustering","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.003852Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:d6030a0e71c15130956c95ef619afa29569f9d860693099acfda1b19066fd8d9","observation_id":"0f2fcac7-a5de-42da-ad37-7c2a6de40a99","resolution":{"observed_at":"2026-07-30T14:22:54.003852Z","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-07-30T14:22:54.006957Z","title":"Dynamic programming on graphs with bounded treewidth","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.006957Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:6417c580758137ddf59018eb568ee529a94286f11964cb1d17160caed382c9a6","observation_id":"f55b00d4-5108-4a82-b896-800927a639f9","resolution":{"observed_at":"2026-07-30T14:22:54.006957Z","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-07-30T14:22:54.009766Z","title":"The complexity of finding fair many-to-one matchings.ACM Transactions on Algorithms, 20(2):1–37, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.009766Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:2c4bdaa0a6b72134339a0e71d01a1835063b22e023ca262dd992998b09af573d","observation_id":"ae898090-3c44-4c68-86db-3962c6802cd0","resolution":{"observed_at":"2026-07-30T14:22:54.009766Z","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-07-30T14:22:54.013339Z","title":"A refined complexity analysis of fair districting over graphs.Autonomous Agents and Multi-Agent Systems, 37(1):13, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.013339Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:0e69466837e6d0315e3fb305bd49e007160829103ebdc4161bcbac5a73b1734b","observation_id":"574d883e-cf6d-4a26-8353-defb8b243967","resolution":{"observed_at":"2026-07-30T14:22:54.013339Z","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-07-30T14:22:54.016738Z","title":"On multidimensional packing problems.SIAM journal on computing, 33(4):837–851, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.016738Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:be6b620841ae5bba8e83dd108d894def1f01cfd3a43fab38208cf69563e9c732","observation_id":"3ca9c39a-7b7b-4517-a8e0-b16aac00c235","resolution":{"observed_at":"2026-07-30T14:22:54.016738Z","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-07-30T14:22:54.019702Z","title":"Multidimensional bin packing and other related problems: A survey.Computer Science Review, 24:34, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.019702Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:5bbf530398dcc32eeb798eb201668fb82747ffe1aba339c54cf160015bd49171","observation_id":"4bd01b4e-d099-47bf-891d-eee1f8d9795b","resolution":{"observed_at":"2026-07-30T14:22:54.019702Z","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-07-30T14:22:54.022457Z","title":"Springer, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.022457Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:a0f9bb02f024927aec1a864d1c7f05cc6225da3ada61da23e3c3a374391191d4","observation_id":"d6a72b63-6aa1-49e0-b44c-76ce3d6be772","resolution":{"observed_at":"2026-07-30T14:22:54.022457Z","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-07-30T14:22:54.026327Z","title":"Balanced schedules.INFOR: Information Systems and Operational Research, 9(3):230–237, 1971","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.026327Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:4f106e53092b833e8353c6a9e4d139805206a13ac0d10b706f9051076c94a4f4","observation_id":"2a868261-f4e7-4b09-be45-07f44ab347cc","resolution":{"observed_at":"2026-07-30T14:22:54.026327Z","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-07-30T14:22:54.029268Z","title":"On a particular conference scheduling problem.INFOR: Information Systems and Operational Research, 13(3):308–315, 1975","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.029268Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:6e68e10fa9635cb52e8f8092c96c273226e57acee75fa9722f18e2f27282e144","observation_id":"dbd87434-256d-4644-b5f0-05b65050fac1","resolution":{"observed_at":"2026-07-30T14:22:54.029268Z","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-07-30T14:22:54.032216Z","title":"On the complexity of some colorful problems parameterized by treewidth.Information and Computation, 209(2):143–153, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.032216Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:376c185426cc182eea4b9cd380ab32bca8b6962b1db99ecb5df462a9e917000b","observation_id":"e14acf38-530a-44df-b46e-d3483f98b6f4","resolution":{"observed_at":"2026-07-30T14:22:54.032216Z","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-07-30T14:22:54.035986Z","title":"Parameterized complexity of coloring problems: Treewidth versus vertex cover.Theoretical Computer Science, 412(23):2513–2523, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.035986Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:62e3f3827a1bc758613f4e4ca8c7339b15904106a93ba718b0a5181a82afebba","observation_id":"2c9a6615-8abc-47b1-9734-2f95422c3e2e","resolution":{"observed_at":"2026-07-30T14:22:54.035986Z","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-07-30T14:22:54.039047Z","title":"Clique-width: on the price of generality","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.039047Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:d310247577bcfd414d9b4ab48f435e07a983f545b9d4085783fe9e1de9f05653","observation_id":"7a61775f-13a2-4e26-9ec6-eb63da8298bf","resolution":{"observed_at":"2026-07-30T14:22:54.039047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1201.3091","last_updated":"2012-01-17T13:13:47Z","snapshot_observed_at":"2026-08-15T04:22:25.994127Z","submitted_at":"2012-01-15T14:52:50Z","title":"Using Neighborhood Diversity to Solve Hard Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1201.3091","snapshot_observed_at":"2026-07-30T14:22:54.041636Z","title":"Using neighborhood diversity to solve hard problems.arXiv preprint arXiv:1201.3091, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.041636Z"},"links":{"cited_paper":"/paper/1201.3091","citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:cdc30b5aa6643364d40873eab53cb9c39f61af9a3a2d32c42e9bef2f5fada0a4","observation_id":"38991b7b-960a-46f4-98cf-4b2f50d9e25a","resolution":{"observed_at":"2026-07-30T14:22:54.041636Z","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-07-30T14:22:54.045456Z","title":"Garey, David S","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.045456Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:ddf1c239e45d02f762b41ed20ed6ef32959e90d14cb98d6adb46b96d23b6c77a","observation_id":"8cf7398b-73c7-4462-b367-6ca699539db5","resolution":{"observed_at":"2026-07-30T14:22:54.045456Z","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-07-30T14:22:54.048553Z","title":"Parameterized complexity of fair many-to-one matchings.Theoretical Com- puter Science, page 115727, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.048553Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:453f3823a4b9161da3042dd7fe2b0be0375c20a2b4b42040ca7ed7a3c5ba8f6f","observation_id":"a2e12f48-8288-4685-a889-98a7044bfedb","resolution":{"observed_at":"2026-07-30T14:22:54.048553Z","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-07-30T14:22:54.051158Z","title":"PhD thesis, Uni- versit´ e Paris Dauphine, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.051158Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:39b0cf0a749f2832a158b993520751607c74d9c2ffc39363eb8611c57ba18101","observation_id":"f4f90ba6-17a8-4ebc-8ec8-53707bf8a58b","resolution":{"observed_at":"2026-07-30T14:22:54.051158Z","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-07-30T14:22:54.053655Z","title":"Integer programming with a fixed number of variables.Mathematics of operations research, 8(4):538–548, 1983","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.053655Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:396e9be5685339175a7a120614f1b00992ed34fd78cc2382f61c26ff63503677","observation_id":"d19d1a5d-6917-4e37-8788-b5f9525e6b97","resolution":{"observed_at":"2026-07-30T14:22:54.053655Z","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-07-30T14:22:54.056364Z","title":"On the optimality of planar and geometric approximation schemes","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.056364Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:7b006199de627e44f137e0ae60057bb3b8d8fce8ec737e368fec757cdde24d6c","observation_id":"54dc5e31-6a07-43a6-bcba-5381215d44fa","resolution":{"observed_at":"2026-07-30T14:22:54.056364Z","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-07-30T14:22:54.059088Z","title":"Equitable coloring.The American mathematical monthly, 80(8):920–922, 1973","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.059088Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:e5544d4d1d5d50c7557e083a74ae90d2f54d33821309caf8695f718bce83d7a3","observation_id":"ace74560-b709-4a28-9844-6a1a03e31ab0","resolution":{"observed_at":"2026-07-30T14:22:54.059088Z","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-07-30T14:22:54.061660Z","title":"Msol partitioning problems on graphs of bounded treewidth and clique-width.Theoretical Computer Science, 377(1-3):260–267, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.061660Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:fe670e38db4b573443e0f4fb38d77ec80138e727efe5577ca6e8c528cbb5a925","observation_id":"0d751d8a-dab7-41b6-b31e-00f68475cba7","resolution":{"observed_at":"2026-07-30T14:22:54.061660Z","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-07-30T14:22:54.064234Z","title":"Minimizing margin of victory for fair political and educational districting","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.064234Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:fcb87cde8790ae688d8979309f8b326e0556743cb5fd98eba4526a5c6320447b","observation_id":"e1b7a65c-6e18-4af7-b4dc-ccc59c596beb","resolution":{"observed_at":"2026-07-30T14:22:54.064234Z","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-07-30T14:22:54.066676Z","title":"There is no asymptotic ptas for two-dimensional vector packing.Information Processing Letters, 64(6):293–297, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-30T14:22:54.066676Z"},"links":{"citing_paper":"/paper/2607.27004"},"observation_digest":"sha256:3a59cee44e0c33c5f14e69b520aab32a922d7f4f5ace379b4a9bacdead61d579","observation_id":"bf12d851-03b8-4d18-9109-90f770837c60","resolution":{"observed_at":"2026-07-30T14:22:54.066676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27004","last_updated":"2026-07-29T15:00:04Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-15T21:37:12.178996Z","submitted_at":"2026-07-29T15:00:04Z","title":"Parameterized Complexity of Fair Coloring Problem"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":25},"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 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.27004."}