{"as_of":"2026-08-09T19:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d551b535f67c7690088b6e66ecccdc1f35852bfb893747d59b55c8b8fbc4df0","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T10:22:09.081632Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.28355/citation-record","integrity":"/paper/2607.28355/integrity","json":"/paper/2607.28355/citation-record.json","paper":"/paper/2607.28355"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.867614Z","title":"STACS , pages =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.867614Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:d57a914de1f639353da2c4d5261bf60f81c45931fedf10e0b352600e2c0ae14c","observation_id":"29d8a391-64db-4792-8051-66e465696fb0","resolution":{"observed_at":"2026-07-31T10:22:08.867614Z","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":"10.1007/s00453-003-1072-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmica , volume =","venue":"Algorithmica","work_id":"b8cb2c48-f3e9-49e3-904f-39ab754abc8b","year":2004},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.874737Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:024a00fe503d4dc0bced717b5c5263a58a11ec58e9cc1af04fc8a2cdaad371a4","observation_id":"a36dbf38-f13f-4ae9-9e15-07632526e2c3","resolution":{"observed_at":"2026-07-31T10:26:32.255155Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:16.386182+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:16.386182+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973082.124","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tight Hardness Results for Minimizing Discrepancy , booktitle =","venue":null,"work_id":"660cba60-5b9d-478a-ac39-ceefa6ba8d70","year":2011},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.878929Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:30c0240e23aa67af6c517cd731d0887bb09658907a40447d745ec22868aff6c4","observation_id":"6a0cc6f8-b2da-472b-b9b9-abd27a2c9b7c","resolution":{"observed_at":"2026-07-31T10:26:32.241642Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:16.445769+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:16.445769+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978971.239","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SODA , pages =","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"35c8917c-20eb-4321-a4c1-0dbcb70c0283","year":2026},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.883083Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:8d7c8149b7b0ea999dbfd6bccfe7727c5ce2b4f3e1be3aa1e653f0eb97a7d053","observation_id":"85429847-ad5b-47a2-ad58-400abba353df","resolution":{"observed_at":"2026-07-31T10:26:32.232145Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:16.503709+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:16.503709+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-31T10:22:08.888029Z","title":"1978 , publisher=","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.888029Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:f606e16dfde06aa97e2ce5f2d9c7ba2c0bd6392db26307fadecbd2c4b63babe4","observation_id":"f5f1f9b2-b60d-47d5-9b52-fb8bb4886168","resolution":{"observed_at":"2026-07-31T10:22:08.888029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.892068Z","title":"1997 , publisher=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.892068Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:40085d41b6017ca874b6ebdaa55926bd9ae5082c505c1f820ec5904241566b1a","observation_id":"d5d31464-71e4-48a0-919b-cbe2a804648e","resolution":{"observed_at":"2026-07-31T10:22:08.892068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.896527Z","title":"STOC , pages =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.896527Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:73978a07237f961e1fbdeb0b41e3ad39df61ca1523c7ec7317ae3a09fcbf8c6d","observation_id":"e561a856-e689-434b-bafa-db2efd2ac0d9","resolution":{"observed_at":"2026-07-31T10:22:08.896527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.900353Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.900353Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:2a8dd9cba88499ca8d58c0f7724c1b6e9a4311828883dbeaac7d78087f3a8485","observation_id":"1735ed78-0663-4588-8493-2ad903280cb0","resolution":{"observed_at":"2026-07-31T10:22:08.900353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.904091Z","title":"COLT , pages =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.904091Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:5e62ee47b4f9eb1168f228b3ab23a99899b9def753141a194b53b2fe83bd0175","observation_id":"b106be55-4b43-402b-bcd1-c094aecf25db","resolution":{"observed_at":"2026-07-31T10:22:08.904091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.908577Z","title":"STOC , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.908577Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:81271066bb1e43e77c8c7242e710a6497c031d6f98cabc87c478400100313170","observation_id":"f324d919-e19d-40cb-a0de-d63ea9af1783","resolution":{"observed_at":"2026-07-31T10:22:08.908577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.912343Z","title":"A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , journal =","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.912343Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:6fd178018545abaf5a4698763ef049c457a82b128659465c38725027bb8554c7","observation_id":"87827cf3-a15a-4c8e-a6e4-835c44eeb7d9","resolution":{"observed_at":"2026-07-31T10:22:08.912343Z","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":"10.1007/bfb0028990","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"STACS , pages =","venue":"Lecture notes in computer science","work_id":"ee4e4ea9-ae46-4877-8642-d889b98734b4","year":1989},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.916484Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:786d4635b8c43128a87542bdc50a8489152bb13b77a25aaab4244fa47977d59d","observation_id":"5fc396d6-9b02-4ce3-8fd7-8fc407d841ae","resolution":{"observed_at":"2026-07-31T10:26:32.215690Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:16.60521+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:16.60521+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2021.10","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ITCS , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"38c3c435-dc3a-41b3-a439-a35080645a3e","year":2021},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.920893Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:d9f0bda63591f256f8f4b4ad23e1933b50a417cba7e5aa043ff510366cf90cf8","observation_id":"839c3890-f291-48c4-8502-2e00833d5d68","resolution":{"observed_at":"2026-07-31T10:26:32.204900Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:16.661273+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:16.661273+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-31T10:22:08.924736Z","title":"2020 , url =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.924736Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:edd2a125dc5988d96bb0d4e3758682da8adc5d102a5c0db76b7822464998d16d","observation_id":"85bcdc97-2857-400e-823d-1dde70b05913","resolution":{"observed_at":"2026-07-31T10:22:08.924736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.929322Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.929322Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:d155e7e46f19f887a64b4a109c4373d85e74215a80c2b6e6ed8b1511506034ea","observation_id":"6cd10b69-eba7-4fdd-b4ea-12302edfebe0","resolution":{"observed_at":"2026-07-31T10:22:08.929322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.933665Z","title":"STOC , pages =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.933665Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:3ac87e691cb3ace96a606f2c49b0f1586d7cd086a813ee6bd4fa2c1eabbe8163","observation_id":"d2c6ea20-e28d-4139-ba4a-89b4f3fb698a","resolution":{"observed_at":"2026-07-31T10:22:08.933665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.937381Z","title":"A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms , journal =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.937381Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:89b4be364680df60c7be6b85f2342680b00a42b598f3158d687499d2a2658086","observation_id":"1d68500e-ced7-4e8a-9173-3462b68f2b1b","resolution":{"observed_at":"2026-07-31T10:22:08.937381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.941652Z","title":"Downey and Patricia A","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.941652Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:e6678a5fcd4fabbaa64b3521cdccddbfc56b2cfca0c2a10c96ee008298e59278","observation_id":"9cf9eb55-2d04-434d-8594-8febeef60eb5","resolution":{"observed_at":"2026-07-31T10:22:08.941652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.946287Z","title":"Downey and Michael R","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.946287Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:eed72def6f7d28cc5dab7641fbba2172e34013e48f62d784b2a3abf70c3fd3c3","observation_id":"e4fa2413-9c97-4fa1-848e-42e2d1825357","resolution":{"observed_at":"2026-07-31T10:22:08.946287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.951537Z","title":"Fomin and Lukasz Kowalik and Daniel Lokshtanov and D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.951537Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:d761f7692410ae23391b91d019cb00e588fa2ba6bb8efaf89fbd20cb1f25b672","observation_id":"ba838b7f-44e2-49a6-81ab-b9f045bba4b2","resolution":{"observed_at":"2026-07-31T10:22:08.951537Z","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":"10.1016/j.tcs.2018.09.013","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Theoretical Computer Science","work_id":"28e4bf50-cb6a-4e5e-b072-573dab336f6d","year":2019},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.955553Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:4737f0fba63c8fc160bfb2e58aac1ae824b145a6692958cf33071e44e24b49f6","observation_id":"1b2a3723-073a-439e-890a-afbd44290163","resolution":{"observed_at":"2026-07-31T10:26:32.167491Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:16.881247+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:16.881247+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-31T10:22:08.959506Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.959506Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:ff7fc74edd723898092f733bbe83c4cb5504806a316bccc4f925b05b2eb3ee12","observation_id":"2d57f7e2-9347-4cba-8f2b-5b5e356c013b","resolution":{"observed_at":"2026-07-31T10:22:08.959506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.963482Z","title":"CCC , pages =","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.963482Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:e6489087e5ddf89e197a038404d43a2599c3cf064663e7e6bec78e9defd930c8","observation_id":"9f518f6d-2bb4-4172-8e09-2314418f293b","resolution":{"observed_at":"2026-07-31T10:22:08.963482Z","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":"10.1016/s0022-0000(02)00022-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Computer and System Sciences","work_id":"d9a77a38-1412-49ff-af4f-c2a5679d2330","year":2002},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.967740Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:6a6b4b3865bdf6834b35f8225684faec325b7146cfd5d871ed87f2fb0cd91e66","observation_id":"9b508f6f-95b2-444a-a128-16b9b8d07675","resolution":{"observed_at":"2026-07-31T10:26:32.156726Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:16.922245+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:16.922245+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-31T10:22:08.971877Z","title":"Papadimitriou and Mihalis Yannakakis , title =","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.971877Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:979699d8a8da85257226efed7670d20245ab364fa1d6becb1086af4d163c4014","observation_id":"8658f91a-1796-4718-be5f-c38e12fe358d","resolution":{"observed_at":"2026-07-31T10:22:08.971877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.975979Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.975979Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:2be36f9f28fd04ffe5e014da64b8ffcdf7f7eb11bee5d31d24f9fcf203de4b93","observation_id":"1ea15236-9ac2-40ae-8db1-e181efd9fa6d","resolution":{"observed_at":"2026-07-31T10:22:08.975979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.980058Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.980058Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:3d5873370abff05d094960b7e9e8fed3468e2db1b6fd339916a33ceb7043a6c2","observation_id":"cc5d84cd-1e12-4045-9903-53532c8c4d68","resolution":{"observed_at":"2026-07-31T10:22:08.980058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.984045Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.984045Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:b084b40e05ab5e8dad8ed243484a13c2be484f21eef1ed0cc4137e31d2a8bb76","observation_id":"d5039d20-7103-4277-b19b-2b514bbc5ea8","resolution":{"observed_at":"2026-07-31T10:22:08.984045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.988610Z","title":"The Parameterized Complexity of","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.988610Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:6ace12dbd54daccef46d78f2cf0292a60175eea8928108d7dce05eac27cc85aa","observation_id":"2f187c0c-ad04-4d63-8834-9f8e06373163","resolution":{"observed_at":"2026-07-31T10:22:08.988610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.992785Z","title":"Random Struct","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.992785Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:96ea17d23352488473c3404d18ad10c6ebc2b34f138781fc28870c683c6bbce9","observation_id":"ce2ecd07-3320-483e-991c-ad5dc09cff17","resolution":{"observed_at":"2026-07-31T10:22:08.992785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:08.996887Z","title":"Algorithms and Complexity: New Directions and Recent Results , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:08.996887Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:f6a7ebc747822fe9f9ecb75072f907df7ce2b6d993dd070e632efe2b730e0cdc","observation_id":"47263dbd-5fe9-47db-bb0c-e3713490c9a2","resolution":{"observed_at":"2026-07-31T10:22:08.996887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.000776Z","title":"ICALP , pages =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.000776Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:524ba41122b558434a3048aa64c1351e15b2a7d8ea71487cc146971cd7c7be45","observation_id":"507f7e39-69e3-4107-93c2-b91aefef86a1","resolution":{"observed_at":"2026-07-31T10:22:09.000776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.004919Z","title":"Electron","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.004919Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:0f053324ee02d3dd03eb09af843e2c3a3cddbc47d2cdb229c9e6ecdfd704d2e7","observation_id":"379c12d5-cc3f-46e9-a68d-20704ab1dc31","resolution":{"observed_at":"2026-07-31T10:22:09.004919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.009412Z","title":"Clique is Hard to Approximate Within n^","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.009412Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:5598dd99ca5bd793ebeed66a4492f737d4cc760c9603b5cae421c863443b8663","observation_id":"68861216-0339-40ae-a5a9-5a6e39c4816d","resolution":{"observed_at":"2026-07-31T10:22:09.009412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.013602Z","title":"Theory Comput","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.013602Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:626bb08db6bc8b6bd626172ad7c0e2527aa59b70b6a417ddfb6bfad7aa732d08","observation_id":"9f526fe2-c505-4272-b427-5c874b7a78d4","resolution":{"observed_at":"2026-07-31T10:22:09.013602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.017296Z","title":"ICALP , pages =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.017296Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:e29db5c0e75b142ca3fcf4bd115dd2d2df619a5970e8f49f2b4ba82945427f92","observation_id":"f79a74b4-89e5-4719-8065-239eb10e7f10","resolution":{"observed_at":"2026-07-31T10:22:09.017296Z","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":"10.1137/s0097539705447037","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2006 , url =","venue":"SIAM Journal on Computing","work_id":"707ffb93-1cbd-40d6-9ce0-fc9d9eaaf899","year":2006},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.021360Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:a67ed022d52d1c84566aa7f83d9eb4d7acc2307ffc6009cd9568b7b5e66cd836","observation_id":"b1d5af67-37b3-4aaf-8f16-241da21ec45c","resolution":{"observed_at":"2026-07-31T10:26:32.103193Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:17.295629+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:17.295629+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2017.79","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ICALP , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"539b88d5-b300-4f85-9a4d-2b803b0ecdb6","year":2017},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.025197Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:d22510eb2d8c778b4dffeea4d639e75e34dfbc23e40f68a2478b370bcb101968","observation_id":"fa3c1280-1681-4806-9c19-da1f2ca2c5b3","resolution":{"observed_at":"2026-07-31T10:26:32.092890Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:17.343354+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:17.343354+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-31T10:22:09.029681Z","title":"2004 , institution =","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.029681Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:6568fb80424d4a2d872b82a0a63225f81d444737fe534040c571358d0dd21752","observation_id":"897897d5-5d07-4a1e-98f0-500003a9ea6a","resolution":{"observed_at":"2026-07-31T10:22:09.029681Z","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":"10.4230/lipics.icalp.2016.6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ICALP , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"8d5436be-65fa-40b6-8c6d-fc8a4f098bb8","year":2016},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.034416Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:2bcd47c376e22310a4229b58dae1eacdff0f87ea7c0045817499cafe6adf64b1","observation_id":"e239496c-cb1e-4102-a014-7b87d1cf3ec4","resolution":{"observed_at":"2026-07-31T10:26:32.082990Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:17.403553+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:17.403553+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-31T10:22:09.038293Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.038293Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:70aebbc0ba336e3021bf9e926ebb89807b597e201ef9db339f118238cbbf35c5","observation_id":"eca10129-e24d-409b-8674-573ed2ec746a","resolution":{"observed_at":"2026-07-31T10:22:09.038293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.042774Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.042774Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:23b90599d90c96e149862701e1cdeba9f97a95783d8811e965de033ad93abe06","observation_id":"0fc5e758-5ebc-4a4f-9396-b3d996ec8077","resolution":{"observed_at":"2026-07-31T10:22:09.042774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.046988Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.046988Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:bf0bde17511ada37089caadd9d85522f3e05b2b74c9764989cefa65908cfc7fd","observation_id":"4a70ed51-e6f5-4021-a5b3-4720fc1b62ed","resolution":{"observed_at":"2026-07-31T10:22:09.046988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.051382Z","title":"Warmuth , title =","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.051382Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:b47132d174736d55adcf2211675e9f3d333b06fc2e9253ac55c9893a9e99b28b","observation_id":"5e2cf265-3231-4bde-b3e9-d5fe987e615f","resolution":{"observed_at":"2026-07-31T10:22:09.051382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.055566Z","title":"Theoretical Computer Science, Essays in Memory of Shimon Even , pages =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.055566Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:54c1a74de4f57c9a6c6e0d1736ecac20f142d165ac441c5da64dafb19c7013a8","observation_id":"a46e4906-c8c3-42ef-ac09-7e4cfd0c2686","resolution":{"observed_at":"2026-07-31T10:22:09.055566Z","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":"10.4230/lipics.itcs.2023.85","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ITCS , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"f0a3713a-cfb3-4aa2-bec0-e49add04d41e","year":2023},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.059545Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:00e169ffefbbe36a388e4e2c0f0a27c269487abbe39b1051e4f7657fdb15ba76","observation_id":"c52e7a8a-a83c-4506-948b-675032df0ee0","resolution":{"observed_at":"2026-07-31T10:26:32.059408Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-08T15:08:17.543168+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T15:08:17.543168+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-31T10:22:09.063602Z","title":"The Parameterized Complexity of Computing the","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.063602Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:43565f770207b687c6d043e19d27eeb152f538f742ee7ea529c9d0f0d9e346ff","observation_id":"d3f19710-6e86-4d9b-915e-c9907b851c42","resolution":{"observed_at":"2026-07-31T10:22:09.063602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.067717Z","title":"STOC , pages =","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.067717Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:4971469171a405ba61b7f03344809960329bd1476bc72832b009d27e0eec53eb","observation_id":"2645eaf1-70a1-4fe6-939b-e4fed41435c7","resolution":{"observed_at":"2026-07-31T10:22:09.067717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10043","last_updated":"2020-07-15T11:58:45Z","snapshot_observed_at":"2026-08-09T13:49:31.425757Z","submitted_at":"2020-02-24T02:33:01Z","title":"Complete Dictionary Learning via $\\ell_p$-norm Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10043","snapshot_observed_at":"2026-07-31T10:22:09.071743Z","title":"CCC , pages =","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.071743Z"},"links":{"cited_paper":"/paper/2002.10043","citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:02f61fd768d15fbe7a289f07f3c20be80f14cb3732aeca54d3b3a83b6151277b","observation_id":"0222fb42-7bad-4448-89f9-cd184ec6b5f4","resolution":{"observed_at":"2026-07-31T10:22:09.071743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.076508Z","title":"The maximum edge biclique problem is","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.076508Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:325b7bb056ced9658852d4c4d600b4316cecea3ee206109ba9bdfe90d8ae6111","observation_id":"dc0b13e0-b246-4e53-972a-b3cbfb047727","resolution":{"observed_at":"2026-07-31T10:22:09.076508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:22:09.081632Z","title":"2026 , month =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-31T10:22:09.081632Z"},"links":{"citing_paper":"/paper/2607.28355"},"observation_digest":"sha256:1795467548844442b4dc0ae60d93bb718db055f825555a96688d7d6a7a01f8c3","observation_id":"636ea9d9-fc89-4920-95ed-37d5980f24c4","resolution":{"observed_at":"2026-07-31T10:22:09.081632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.28355","last_updated":"2026-07-30T15:24:28Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-09T14:55:35.126324Z","submitted_at":"2026-07-30T15:24:28Z","title":"On the Computational Complexity of (Extended) Threshold Dimension and (Semi-)Ladder Index"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":40,"verified_exact":11,"verified_fuzzy":0},"total_outbound_references":51},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2607.28355."}