{"as_of":"2026-08-14T09:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:43f9cf65991c79a9605796780f7755b17a12f2cd404e99c8d1836280d747f10a","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:53:52.376554Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.13348/citation-record","integrity":"/paper/2411.13348/integrity","json":"/paper/2411.13348/citation-record.json","paper":"/paper/2411.13348"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:53:52.816172Z","title":"Domination in convex bipartite and convex-round graphs","venue":null,"work_id":"da14ff5a-384b-4769-a0e4-26b3c86f0943","year":1999},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.247281Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:183b47cfe83af8bbb64e380827f190577a862c645aa8a8f4a54fe1179e7b1bab","observation_id":"56442670-6896-4421-8f86-ecef1b8c1911","resolution":{"observed_at":"2026-08-12T16:53:52.820679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.801907Z","title":"On the restriction of some NP-complete graph problems to permutation graphs","venue":null,"work_id":"35fed239-ad43-43b5-99ff-7fb9a3a1edc1","year":1985},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.252705Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:10febcecb55da2cdb530366284a0f24f24f7951674f9a258ed689b7e792e5db6","observation_id":"6e085a19-e2e5-4acf-813e-8e86da84aaa5","resolution":{"observed_at":"2026-08-12T16:53:52.806781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.787896Z","title":"Decompositions of complete multigraphs into stars of varying sizes","venue":null,"work_id":"1778d458-69fd-481a-b248-02365e44e287","year":2020},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.257609Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:ce64cd499f39d3392367a1f14a447e6fda33791aa1a32d1f9788c0c58771382b","observation_id":"ff5122fd-fdaa-4eed-9e85-467d18370072","resolution":{"observed_at":"2026-08-12T16:53:52.792357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.772880Z","title":"On the star decomposition of a graph: Hardness results and approximation for the max--min optimization problem","venue":null,"work_id":"07143816-04e9-46b0-a52a-3f7c78c559ec","year":2021},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.262438Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:757db949d3e48238db4c1582f516ec026fe17609440d11ddf6cb079082f2a1bd","observation_id":"8ddac6c6-7020-4f1c-a30b-d77a455a356f","resolution":{"observed_at":"2026-08-12T16:53:52.778137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.267552Z","title":"Parameterized algorithms , volume 5","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.267552Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:1c43a30d4c78e98c3d10efbbe9558747b5193565d0dc639e5254871403f899a3","observation_id":"b3820a3e-9323-4fdc-afd3-15ac7805c3f1","resolution":{"observed_at":"2026-08-12T16:53:52.267552Z","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-12T16:53:52.749943Z","title":"Domination in convex and chordal bipartite graphs","venue":null,"work_id":"918b50b6-a84b-4839-a04e-9cad22d1b4aa","year":1990},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.272407Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:83f9bcb6407ded7c696c421df04f4eea232d02bfc0fc0d428a394ecb2a8e1874","observation_id":"8eee7eae-2abe-4ea3-b7de-d60e7e97b460","resolution":{"observed_at":"2026-08-12T16:53:52.754213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.736551Z","title":"On star partition of split graphs","venue":null,"work_id":"f8840d94-38e5-46f1-b06e-6c7c1b3ff2b2","year":2024},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.277591Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:7ee2e2d70d42b6ee2cb5bca1ecf5b5d22c130b7e27ce7e02afa3024a8b054304","observation_id":"48f4bf91-f9d1-4f3c-8717-9b8b1d74404e","resolution":{"observed_at":"2026-08-12T16:53:52.740867Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.722466Z","title":"Graph decomposition is np-complete: A complete proof of holyer's conjecture","venue":null,"work_id":"9a86089b-8a24-43db-9ed5-d052f63c69d5","year":1997},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.282021Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:07b45508772d00cd7794b8aac1ea1f1f254afa7af35bff71c51f17a84f13bfd1","observation_id":"1ba35951-cc50-4459-9b0e-379c4c1b87ab","resolution":{"observed_at":"2026-08-12T16:53:52.726823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.708251Z","title":"Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs","venue":null,"work_id":"daaa0392-78e1-46cf-acdd-94b3224953e2","year":2014},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.286575Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:476cc457f4125403d29c0195329b7f6ae87865b61c89d6aaf0b9d28615597d41","observation_id":"2a143406-49c7-451c-b1c2-01f7eae8c9d7","resolution":{"observed_at":"2026-08-12T16:53:52.713006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.694128Z","title":"On the complexity of partitioning graphs into connected subgraphs","venue":null,"work_id":"01dc98fa-de91-4f2d-86d5-e05b3952b523","year":1985},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.291180Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:2d043f3262e12c9c06b995bf776bafe75a76b1f33606dfc439bb05c7791d3807","observation_id":"d546425d-e12e-42e8-92ee-ab6ce20718e1","resolution":{"observed_at":"2026-08-12T16:53:52.698847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.678730Z","title":"Integer programming and incidence treedepth","venue":null,"work_id":"a31773d6-38d1-4e6b-97a3-c49387567e80","year":2019},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.295658Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:b1fd9cbef3506eb3f956bb09745f72c24c1c56663d72148682381a00aea4e954","observation_id":"f9345fb7-6994-4bb9-ad82-b5d5c684150f","resolution":{"observed_at":"2026-08-12T16:53:52.684042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-13T07:25:47.957364Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-08-12T16:53:52.300235Z","title":"An algorithmic theory of integer programming","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.300235Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:d056d6e25a6d1754672c69d3fa3c339df4ba10c3a2bc7ecdae0b078c922ca1b8","observation_id":"d443c60e-e5fe-4e75-9c6a-1c24ef807651","resolution":{"observed_at":"2026-08-12T16:53:52.300235Z","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-12T16:53:52.663432Z","title":"Domination in permutation graphs","venue":null,"work_id":"d25d92c0-b666-44cc-9cc3-8761b8d7c179","year":1985},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.305376Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:92d429de6bfc75a09960f205880523b2ffca3ef6898dcc883ee99df9ab107241","observation_id":"aef6ad71-370b-4cc0-9aa8-cc5eda8cfeed","resolution":{"observed_at":"2026-08-12T16:53:52.668046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.648485Z","title":"Maximum independent sets in 3-and 4-regular hamiltonian graphs","venue":null,"work_id":"90131104-9149-49dd-be46-638f8b408db9","year":2010},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.309733Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:c43586c56fb70ed43e43acb68a4d0a2ceba182e4b3a8925f844dec7badeb664e","observation_id":"82cf48f8-307d-469a-ad9e-c365821c6d71","resolution":{"observed_at":"2026-08-12T16:53:52.653524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.633875Z","title":"Computers and intractability: A guide to the theory of np-completeness, 1979","venue":null,"work_id":"e213cd93-fa76-4e7b-86c9-a6f94458c152","year":1979},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.314114Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:c229628f6617dc88861a21a5360caca0f60b13080907354e2b596ad7216c62d9","observation_id":"64c6f19c-8918-4817-9ea2-bb3a5d7593d9","resolution":{"observed_at":"2026-08-12T16:53:52.638673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.617576Z","title":"A linear al-gorithm for the domination number of a tree","venue":null,"work_id":"6301f11c-f6c0-40bb-8e33-175c139b682e","year":1975},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.318459Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:1863aa6dafe384926dbdf4077cbc3ebe0f6e4cdeab844fd34703929d2bd1fa63","observation_id":"2653ec87-9aac-46d3-b8db-016ffd78e7d5","resolution":{"observed_at":"2026-08-12T16:53:52.623181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.602276Z","title":"The np-completeness of some edge-partition problems","venue":null,"work_id":"aa1a3b6b-9961-4bcc-b8f0-fddbb1f3b421","year":1981},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.322704Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:f9045ac8f60fc86fbbfbd385e89bfa317119c0f2f2659f0a00f09013946feccf","observation_id":"4436b11c-732f-43af-803f-f05cd506d102","resolution":{"observed_at":"2026-08-12T16:53:52.606952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.327228Z","title":"Bin packing with fixed number of bins revisited","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.327228Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:65c8a97ada1158fa3e65ee034c617ed9569023ebec0f211d44200ecefafd6126","observation_id":"3740e0de-f55e-4cac-9ea2-6c58556811a2","resolution":{"observed_at":"2026-08-12T16:53:52.327228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11840","last_updated":"2020-09-24T17:38:31Z","snapshot_observed_at":"2026-08-14T09:29:47.200476Z","submitted_at":"2020-09-24T17:38:31Z","title":"Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines","version":1},"cited_work":{"arxiv_id":"2009.11840","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11840","snapshot_observed_at":"2026-08-12T16:53:52.413832Z","title":"Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines","venue":"cs.DS","work_id":"00af0048-d501-4404-aeeb-f07ddfc8bd82","year":2020},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.331546Z"},"links":{"cited_paper":"/paper/2009.11840","citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:5cf933d66b744061810620d01dac73c9367017c4e3b5d9d82fe142d72fd0c525","observation_id":"954ef9f0-596f-49db-adf5-d06841cd91a4","resolution":{"observed_at":"2026-08-12T16:53:52.420532Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.577687Z","title":"Structural Graph Parameters, Fine-Grained Complexity, and Approximation","venue":null,"work_id":"0ece7f83-7b8b-447b-b1ce-4b90faba02f3","year":2022},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.336296Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:164778e3d0038350e6ec7564a3e2f69813f61fe28d459999b2b0e3ea8d0ff3ef","observation_id":"90e41f36-e560-40e0-81a5-721690cb5996","resolution":{"observed_at":"2026-08-12T16:53:52.582648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.341093Z","title":"Integer programming with a fixed number of variables","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.341093Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:c2ae11e08217406fd2dc842d3d81201c1e289f09fcb0f05e4e8efcee6232a924","observation_id":"ce57af88-b6d1-45dc-9c2c-7b21fb210041","resolution":{"observed_at":"2026-08-12T16:53:52.341093Z","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-12T16:53:52.554077Z","title":"u ller and Andreas Brandst \\","venue":null,"work_id":"1efcc28f-8979-4e35-a752-7e7f166521e9","year":1987},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.345527Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:132adc3b8d07c16447549f4b6d87653fc79408baa3d8732d906f2df43e96656c","observation_id":"a8d5580f-0988-439b-9dd8-d118970886c0","resolution":{"observed_at":"2026-08-12T16:53:52.558423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.539458Z","title":null,"venue":null,"work_id":"b4b4b0a4-f136-4090-93e7-0cfefb14ec8e","year":2023},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.349943Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:494616947be877694deab4ce8e27defaae641690dea6c0513dc78d37498cd46c","observation_id":"e176591b-b889-41cb-be51-84f5e667d90a","resolution":{"observed_at":"2026-08-12T16:53:52.544239Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.523763Z","title":"Short cycles make w-hard problems hard: Fpt algorithms for w-hard problems in graphs with no short cycles","venue":null,"work_id":"2d560b08-b4af-4f9b-819f-2df713c081fe","year":2008},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.354281Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:01a9496dd80fac0113300df85db596d47233d431ac6026616fd720ff4ef9a1ec","observation_id":"09d30cb2-4b00-4cc7-b084-787ee5f55a8a","resolution":{"observed_at":"2026-08-12T16:53:52.529168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.507511Z","title":"Induced star partition of graphs","venue":null,"work_id":"fac478ca-a443-47b6-aebf-382c5e30092f","year":2022},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.358562Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:fa9d2c3e5552604bb9be9571e1f3e03e10761048a53aef9564d9059c3a281e2a","observation_id":"ba42a673-6a18-4d02-b4e5-d8c7c75da7ff","resolution":{"observed_at":"2026-08-12T16:53:52.512341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.491882Z","title":"Decomposition of complete multigraphs into stars","venue":null,"work_id":"37457b07-3235-448a-8b36-9c875d2aae2e","year":1979},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.362899Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:5200f1d5b992c5f3f1c5ce4cc08e285f14c26d6151c668e7ad18c291a60ff6e7","observation_id":"345d3595-e3c9-444a-8118-f3b139295eb7","resolution":{"observed_at":"2026-08-12T16:53:52.496854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.476966Z","title":"On the decomposition of a graph into stars","venue":null,"work_id":"fbfa14a1-2dde-4ca6-ad8e-1f2f1f1db6c0","year":1981},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.367407Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:6b2df0c5f3007181d0194069ae1b9470e2ea74572185eed11e4b94bc94fdb42f","observation_id":"b808fcba-c515-44b2-82d6-68404dcdea77","resolution":{"observed_at":"2026-08-12T16:53:52.481703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.461887Z","title":"On claw-decomposition of a complete multipartite graph","venue":null,"work_id":"f048af4d-ae5e-4041-8fe9-7d0bb3d853d1","year":1978},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.371748Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:442615d07098c65ab39e8f8da74e270b0349012f2275177fcb8605450c28fde8","observation_id":"2cd1665e-b508-47f5-8c61-7b852024ec78","resolution":{"observed_at":"2026-08-12T16:53:52.466791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T16:53:52.447077Z","title":"On claw-decomposition of complete graphs and complete bigraphs","venue":null,"work_id":"80bc2ea7-ef4d-4ce9-88a1-f45c94c22d3a","year":1975},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.376554Z"},"links":{"citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:7a7ba4ea745823fbf3b4d61dbe006d9ebe791670ca39d6ef74acb7c3198d6cf7","observation_id":"41d9fea9-2fdf-4882-aa07-3308aa2bae16","resolution":{"observed_at":"2026-08-12T16:53:52.452081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-13T00:48:48.218931Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":23},"total_outbound_references":29},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2411.13348."}