{"as_of":"2026-08-16T08:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fd9e08043a133138c0d926e3684b74c8528c047b0f6d53a5e265d5dece19b93a","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:30:17.318226Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.03389/citation-record","integrity":"/paper/1908.03389/integrity","json":"/paper/1908.03389/citation-record.json","paper":"/paper/1908.03389"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:30:17.153732Z","title":"Bazgan, L","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.153732Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:05c16054da2b6a8d87e01016e56f244bec29895d162a65956b9e5454b4b2f4a9","observation_id":"dca08d48-1f2f-41a7-b032-c859d712ab0a","resolution":{"observed_at":"2026-08-14T14:30:17.153732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:30:17.826483Z","title":"Birmel \\'e , J","venue":null,"work_id":"8dcf40f0-6c5f-4892-9192-a357f70cab21","year":2007},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.158164Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:a3a693de2c0051dfba6f487c4c5a73139f520f55a5309e9cbb89d754b8b8ceaa","observation_id":"a312a64a-54ab-4843-9f40-a45fa5888cb1","resolution":{"observed_at":"2026-08-14T14:30:17.830187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.816480Z","title":null,"venue":null,"work_id":"a48ec679-6c68-4c2f-8ad9-a01d8a66bcc8","year":2015},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.162068Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:f2813e70a7f94e11767bb325c36df9d5e453ed8a347923cd912e9e298fac7b5c","observation_id":"7aab2b24-1504-408c-951c-0e64f262947d","resolution":{"observed_at":"2026-08-14T14:30:17.819948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.806329Z","title":null,"venue":null,"work_id":"8258f662-6908-43ff-bf27-8dc5b4762f7c","year":2009},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.166119Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:9ece8d02dbf8fc01060a6ead45d498240a39b901aad63e15f1dcb2ac8158f7cf","observation_id":"91f59bcd-847a-4510-bbeb-c123395d481e","resolution":{"observed_at":"2026-08-14T14:30:17.809930Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.796551Z","title":null,"venue":null,"work_id":"684dda2e-fb23-43dc-9abc-c49ed63cc820","year":2016},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.169772Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:8c9da48dc22c6b77e87949f7d0df3543d41d9b4fb44c98d3e8119d070e3b2e2f","observation_id":"8bab6bfd-1ec6-4372-b735-8efd8739c412","resolution":{"observed_at":"2026-08-14T14:30:17.799524Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.787789Z","title":null,"venue":null,"work_id":"6fb482d8-30f2-4b6b-9904-98df80ff7420","year":1995},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.172923Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:516b3d9830cab45c1873800b9e25b24c6753deb75669a2629b889bdb6da014c4","observation_id":"ce6f04e3-ccd6-4c66-974a-3c0fd2cc19b1","resolution":{"observed_at":"2026-08-14T14:30:17.790540Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.778557Z","title":null,"venue":null,"work_id":"624ea232-999c-4539-bb10-eddafed9cc2b","year":2000},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.176365Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:d190f7b274a04acceefb2f7eac70f9f5262212dea55c86ff3238710ab45045e3","observation_id":"25933709-bfb3-4379-9179-64ceb4741526","resolution":{"observed_at":"2026-08-14T14:30:17.781981Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.769378Z","title":"Boria, F","venue":null,"work_id":"1b0e5015-f655-42f8-846b-fb26a2ef2bbc","year":2015},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.179326Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:3ec1a8fdf25eba47eb4b50c8f40eff065b430d87e62c96100eb9d0bdfc406595","observation_id":"d418f030-466a-47d5-906d-0c47743f218a","resolution":{"observed_at":"2026-08-14T14:30:17.772617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.759852Z","title":"Boyacı, T","venue":null,"work_id":"4a6603c9-1dac-4436-a1b8-fb8e81eeca87","year":2017},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.182369Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:1a8055182c5ff1fd69acc0eb48620520d5d64152d15ff11fd864716679bf124f","observation_id":"d1293d16-0c5b-4be5-bc64-d0506bf7b4e6","resolution":{"observed_at":"2026-08-14T14:30:17.763385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.750225Z","title":"Bui-Xuan, O","venue":null,"work_id":"3b4c0f07-ab32-400a-ae5a-2a67cd6f96b3","year":2013},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.185469Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:73a858404c68492440f5b2a9de8651155fd4c9481e0095e480f9f6beefb85c1e","observation_id":"4788a94a-b8e5-42b7-a31f-34b1b3ecd981","resolution":{"observed_at":"2026-08-14T14:30:17.753551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.739345Z","title":"Carvajal, M","venue":null,"work_id":"fd13df24-131a-4e2d-a66a-dd0f905172c5","year":2013},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.188496Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:b150451a00d910d8519e36fcb190cb706509cccd34517d585c3ef14bc4a76797","observation_id":"394d7031-0bb0-4ffe-bc85-e3a5fb0e40f2","resolution":{"observed_at":"2026-08-14T14:30:17.743733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.729528Z","title":"Chaourar","venue":null,"work_id":"4dc12120-12b6-4b9b-9457-007de67f3025","year":2017},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.191810Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:64de8d9db651603c3d3c99bee800ec9ceebe526aef66bc84809459e25c6537b9","observation_id":"7a4c1b90-b83e-436c-a621-5d6b16874eb7","resolution":{"observed_at":"2026-08-14T14:30:17.733064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.12641","last_updated":"2019-04-23T21:23:11Z","snapshot_observed_at":"2026-08-14T16:54:40.260741Z","submitted_at":"2019-03-29T17:42:37Z","title":"Connected max cut is polynomial for graphs without $K_5\\backslash e$ as a minor","version":2},"cited_work":{"arxiv_id":"1903.12641","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.12641","snapshot_observed_at":"2026-08-14T14:30:17.348994Z","title":"Connected max cut is polynomial for graphs without $K_5\\backslash e$ as a minor","venue":"cs.DS","work_id":"7a55e1e1-d20d-4778-8db5-17620ae2c450","year":2019},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.194967Z"},"links":{"cited_paper":"/paper/1903.12641","citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:9d261ace5fbfa31b2c05a6c12ef9fa009649a1669ecbdc11bcccfe999b6c89bb","observation_id":"f08f27e6-7462-4c03-9468-6bb8514da221","resolution":{"observed_at":"2026-08-14T14:30:17.355088Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.719142Z","title":"Courcelle and S","venue":null,"work_id":"6ade1c09-8635-44e6-bea1-055be828cca8","year":2000},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.198919Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:6690f258d04acef718b73e2c2eeb79db0534263c2dc012803f812870d9537992","observation_id":"9a7381e5-038a-46a4-ab34-b4a853583826","resolution":{"observed_at":"2026-08-14T14:30:17.722550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.709082Z","title":null,"venue":null,"work_id":"5202d20b-468e-4692-b028-67b03c180996","year":2012},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.202400Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:32544ef3715e9105e24d1c32f2acec563668d935d8b505d03adf4b11cbd870bb","observation_id":"236ca90c-2de9-485c-a992-2d07c977223a","resolution":{"observed_at":"2026-08-14T14:30:17.712370Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.698333Z","title":"Cygan, F","venue":null,"work_id":"484deb2d-124e-4756-88b3-94f34454cc44","year":2015},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.205862Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:af3b7841c8c07828c2ad950ec8c34838f0db1fd1cdae85997e09e5aa9c48cc25","observation_id":"94f39cad-2b27-46f9-a3b9-23690ffe0647","resolution":{"observed_at":"2026-08-14T14:30:17.701982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.688106Z","title":"Cygan, J","venue":null,"work_id":"77e4a44d-bf8f-4fa5-a2f1-cd91fcf872b1","year":2011},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.209513Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:bc84f647d74b5f94fc365c768aa2fa9ea03e2e0b61320c627d9619b4059f5271","observation_id":"85e0c25f-b8ef-4325-bbe4-bbb2eab8ea20","resolution":{"observed_at":"2026-08-14T14:30:17.691688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.677370Z","title":"de Berg and A","venue":null,"work_id":"e85cf4a3-4d82-44f3-bbef-d0923cd61afc","year":2009},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.212768Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:f72939b1754271f9da5bb492b6f7f7dd4a747384cf8ddf0343baf14f16be28ac","observation_id":"3845bf3d-b69b-4512-bc27-0f71a3b636c0","resolution":{"observed_at":"2026-08-14T14:30:17.681076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.666770Z","title":null,"venue":null,"work_id":"60a4d999-b194-4341-b651-a06af1cbbcad","year":1999},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.216250Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:b2607474c7b82471416e3fe4c104600494caa5b0ffe0731d57adc19a6abb4991","observation_id":"04aa40aa-5a7e-445a-83c3-6606f55d4c8f","resolution":{"observed_at":"2026-08-14T14:30:17.670224Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.656256Z","title":null,"venue":null,"work_id":"d8640e41-28af-47a1-a5cd-2614dd2e2843","year":2012},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.221093Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:d8e9d65a210645484e8339c9151a5c24d48a30de35129dd385864ee3e6660b3d","observation_id":"8bb47c48-da35-4a3a-a330-5ef7fea601b0","resolution":{"observed_at":"2026-08-14T14:30:17.659534Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.646280Z","title":"Díaz and M","venue":null,"work_id":"24131459-fdd4-421b-9738-b42b970db854","year":2007},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.224386Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:dfa08be060ecd406ce30b43cdb23aec336d02c6e2a97f756da575bde4de440e1","observation_id":"8ffcd120-f9dd-4562-8442-d48bdb58f200","resolution":{"observed_at":"2026-08-14T14:30:17.649506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.634882Z","title":null,"venue":null,"work_id":"2d5513d3-2eeb-4d4d-81c0-03eeef94462c","year":2009},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.228020Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:42a4f5ffa43ce79a9487ed0d12b1c6aa1833cde329bf8af81812539f905b5ad4","observation_id":"49c20e00-567e-4d32-a322-505a9558e47d","resolution":{"observed_at":"2026-08-14T14:30:17.638629Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.623467Z","title":null,"venue":null,"work_id":"a90d1a75-a781-440d-800f-d868d56a7c33","year":2014},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.232133Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:dbc83549fe2d66dc0ac7bec05b11623cbd3b81eb5694860722123d1df33db103","observation_id":"cd9975be-2f96-4598-b7f3-e71f11ebd531","resolution":{"observed_at":"2026-08-14T14:30:17.627362Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.611815Z","title":null,"venue":null,"work_id":"c44c953d-d70f-4ad7-ac56-71a2aecfdeab","year":2015},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.235746Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:58381a190d65f59e307299732a3b2b49064131d5e0f5339fc19f52b064b27a28","observation_id":"e1e2ef9a-88fd-45df-ae7c-99f7f87ad570","resolution":{"observed_at":"2026-08-14T14:30:17.615913Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:30:17.239440Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.239440Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:3ae7a98bc742cdff4b8ff5c166c6e4d98e6670270013213ba69c53f8165aeefb","observation_id":"1ed93960-8f15-4e66-9dce-9997d894e044","resolution":{"observed_at":"2026-08-14T14:30:17.239440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:30:17.594289Z","title":null,"venue":null,"work_id":"79f37ee7-b1e2-4f2f-b122-b1e1bece7bb7","year":1995},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.242823Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:36480afec3e9986d467d6b756e211ee285e895234c1d5c8b7919f0367a7b54b0","observation_id":"a912bf8a-e944-42df-9c5c-3936f511c7ff","resolution":{"observed_at":"2026-08-14T14:30:17.597919Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.582272Z","title":"Grimm, T","venue":null,"work_id":"b8fd7335-20f9-4ae3-99ce-149d48f8655d","year":2019},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.246521Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:987bcf52b217f245f017c41354d40f91510a913e0d07a711d3e853f9ff105f3f","observation_id":"5107389f-5970-4720-bd41-15aeff1381c9","resolution":{"observed_at":"2026-08-14T14:30:17.586354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.571764Z","title":"Guha and S","venue":null,"work_id":"4c931371-0d50-43c6-9e75-20e60bd8121b","year":1998},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.250334Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:1fb0af08523533c01bac45b23409bc249716e70b8b20498c5d5d426ca2fae0bc","observation_id":"d4495e1c-127b-4fd4-addd-9b750c09f4f6","resolution":{"observed_at":"2026-08-14T14:30:17.575431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.560776Z","title":"Guruswami","venue":null,"work_id":"6bf6dede-046b-4eff-9594-b9e3b2c71c35","year":1999},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.253845Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:b30d46713c6d56b52a3b84d2dd2ffbd5be935ee3af1a85fe2ef806409df85a72","observation_id":"0e59891f-6b41-4c9c-ab4d-0ea7366eefc7","resolution":{"observed_at":"2026-08-14T14:30:17.564596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.550620Z","title":null,"venue":null,"work_id":"f0c3df84-26ac-441f-923c-acd8d3cc7b2d","year":1975},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.257742Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:0264d1152bc0157cc70ed9d4efc4a017cc8437d148eb41392131473d6091abe7","observation_id":"2950bdf8-fd17-412d-9ac3-f058024c9975","resolution":{"observed_at":"2026-08-14T14:30:17.554113Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.540155Z","title":null,"venue":null,"work_id":"406c7e7b-a206-495f-837d-d8acd289772a","year":1991},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.261281Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:6e926352fb1d2f615b5e64807281310712acc2082c87d0c6bc7ebde00450b103","observation_id":"cb95ff94-e056-4192-bb0c-2a31d5c976f8","resolution":{"observed_at":"2026-08-14T14:30:17.543774Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.528806Z","title":null,"venue":null,"work_id":"5dcb95df-ed4b-47d0-8b5e-bc08bd7412f5","year":2015},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.265017Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:e280117004c69cacadaa6e9a28b1778515a7c3590c6ff313a4374fcccd7aca23","observation_id":"d0772b43-dfc8-4fdc-8312-77632774eb1e","resolution":{"observed_at":"2026-08-14T14:30:17.533317Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.519540Z","title":"Hanaka, H","venue":null,"work_id":"34dd7d00-835b-4ccf-b289-dbf10ba9ff2b","year":2017},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.268455Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:ae089ec79b932c041dda996fd39fa7511c41bc900c51a87b347b668249afc817","observation_id":"117897ed-552b-4d7d-ac51-4acf5cdb8a6c","resolution":{"observed_at":"2026-08-14T14:30:17.522751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.509662Z","title":"Hliněný and S","venue":null,"work_id":"5542d054-caf7-41aa-a9ac-ad5cacb76cdc","year":2008},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.271528Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:22f3f33558796a3c74fc72a48e5c25fd5192a88133f4edd3cc7a6c7bd01145d1","observation_id":"d555fb82-5142-4eac-a2b1-2fa2a7e0b82d","resolution":{"observed_at":"2026-08-14T14:30:17.513167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.500158Z","title":null,"venue":null,"work_id":"4eb3d72b-bac8-41fc-8198-1bb6500204fe","year":1972},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.274503Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:15d94f0c3a34085b5d09f05b4a9173505262946470fd0e80e5785189a0d5b6fa","observation_id":"6fc28033-6352-4c0f-8a5d-80693663773b","resolution":{"observed_at":"2026-08-14T14:30:17.503047Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.491125Z","title":"Khoshkhah, M","venue":null,"work_id":"d32e4995-0009-4073-a0fe-ba764833b6a3","year":2019},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.277663Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:3c1b0121a8e45c55c05b6e7626cad10bc57adcbbf3508d1dd402777699663d70","observation_id":"f4be7482-75f7-4652-aa32-b931b6309ae9","resolution":{"observed_at":"2026-08-14T14:30:17.494214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.481658Z","title":"Mahajan and V","venue":null,"work_id":"7b0612fe-5f00-4552-963c-deab5368abda","year":1999},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.280525Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:0cb67f0176b00b2b1a099c843278287c1804ade44725a50552e5ca959f9ddf3b","observation_id":"693c4b44-ee20-4317-9314-1d75c3e9de27","resolution":{"observed_at":"2026-08-14T14:30:17.485062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.470585Z","title":"Mulmuley, U","venue":null,"work_id":"da2f70e8-1367-46c3-84b9-b87b0f95c7ed","year":1987},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.283360Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:eca901d69a75a5a2bc642cf607b6f9c6f0231518c6a66b349bec0c594f234560","observation_id":"05650ed7-6f7a-410a-9eb2-662c260aa009","resolution":{"observed_at":"2026-08-14T14:30:17.474033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.460416Z","title":null,"venue":null,"work_id":"8c56d491-9d91-45ad-b7de-20c40ad25bc8","year":1972},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.286280Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:a6a2ec82f5050c808c291d59a06eaf90a63f1b5e729cbaa1b8e1830693364f90","observation_id":"90e9b1b9-2ce4-427b-8fa0-2fca9ae1ad0d","resolution":{"observed_at":"2026-08-14T14:30:17.463734Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.449854Z","title":null,"venue":null,"work_id":"210cad68-022a-4fc6-b42f-d84648c9f98a","year":2008},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.289437Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:b2bd68dc41ae2182212b47c14ec955d84853d563df774054cda7b46bc7597815","observation_id":"b22a7d07-1f3f-4ddb-9f71-be9f822fa07f","resolution":{"observed_at":"2026-08-14T14:30:17.453662Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.439056Z","title":"Oum and P","venue":null,"work_id":"5cca62b3-b105-41c5-8032-121b3fb2399f","year":2006},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.292399Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:94059eaba6e6693d672cfd1cc7932c1f963c14cafc5788a0dafab498fc9cf436","observation_id":"c9d778cf-1f24-42c8-9a6d-4f4d748478ec","resolution":{"observed_at":"2026-08-14T14:30:17.442768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.426035Z","title":"Raman and S","venue":null,"work_id":"bf372a5b-c285-477a-bb25-df015024ba80","year":2007},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.296345Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:12b151a0a9988b974467c55d74ea4e987f24573cd4a55db83d4b65c367d87ab1","observation_id":"06a7bc34-7068-4b6e-84c6-ff3fe2644e1b","resolution":{"observed_at":"2026-08-14T14:30:17.430637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.415457Z","title":null,"venue":null,"work_id":"e9777646-cd15-4d0b-a1b4-c2ef26c434f4","year":2008},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.299900Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:0aa16a633fc9215b9078b793e035c3d61b0d72760281fda865d3ccfa3509eb3c","observation_id":"ce29de9a-1f83-4d57-bfd5-d8b2643c4ede","resolution":{"observed_at":"2026-08-14T14:30:17.418444Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.404778Z","title":"Robertson and P","venue":null,"work_id":"eb214c2b-1ad8-48cd-add5-5864a1b19b59","year":1986},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.303952Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:2581a3be7f3861ad6ae897dbbb3e6deaf7e20c4205ec97655dccc3bb4a77d99d","observation_id":"90c4c86a-d1e3-4c86-91c9-c69ad5b06897","resolution":{"observed_at":"2026-08-14T14:30:17.408528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.393474Z","title":"Saurabh and M","venue":null,"work_id":"c922e739-03f5-4cb9-b091-9c83b2181a7f","year":2018},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.307443Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:e7002ad5420810e2c97f21079437399c1ba35ab2b355f150364b84c85fb74ec5","observation_id":"307d4a79-8c1b-4bd5-8621-e2ca912c63fa","resolution":{"observed_at":"2026-08-14T14:30:17.397638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.382082Z","title":"Vicente , V","venue":null,"work_id":"c990bca4-e959-4531-917d-80a0da41bf50","year":2008},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.310936Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:7c47188425c6dec5fc6b7466be6dda292d97e1f684e251b2c1b6360406f0852a","observation_id":"2e701c77-690b-4362-9608-c0e1f9d364cb","resolution":{"observed_at":"2026-08-14T14:30:17.385784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:30:17.370939Z","title":"Yannakakis and F","venue":null,"work_id":"915da045-53df-4fb1-a973-ec58e8e0457d","year":1980},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.314701Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:341dcb217e41d8807b47d654e47cea6179e95c2948b1dc041f3895c01808d697","observation_id":"eb4a2df9-b13a-4d74-af55-0bcbe7e30152","resolution":{"observed_at":"2026-08-14T14:30:17.374729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:30:17.318226Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-14T14:30:17.318226Z"},"links":{"citing_paper":"/paper/1908.03389"},"observation_digest":"sha256:5f3823b833f7502f6acec4ea1af489cd0a99d696dd59603d872782416c5816d2","observation_id":"556d01f7-4395-44c1-b86b-a0e92d85c4a1","resolution":{"observed_at":"2026-08-14T14:30:17.318226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.03389","last_updated":"2019-08-09T09:56:48Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T04:36:28.584928Z","submitted_at":"2019-08-09T09:56:48Z","title":"Parameterized Algorithms for Maximum Cut with Connectivity Constraints"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":1,"verified_fuzzy":25},"total_outbound_references":48},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:1908.03389."}