{"as_of":"2026-08-11T06:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3ab4b71ea428b3b03a4ea5f871ebdcd77ed53cd34cbb25b8437c7791f1d1afed","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T19:53:40.594460Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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.16889/citation-record","integrity":"/paper/2607.16889/integrity","json":"/paper/2607.16889/citation-record.json","paper":"/paper/2607.16889"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:53:36.403327Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:36.403327Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:c67f73b11e1f2960517784cb6ee22e216a8c14ba84963c0503b7df2e423b8fa3","observation_id":"37b07348-5a49-4bb2-9b3e-98908d9b066a","resolution":{"observed_at":"2026-08-01T19:53:36.403327Z","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-08-01T19:53:36.473673Z","title":"Beaudou, J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:36.473673Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:1c7eb381004b58e378610d597065d5867e2d0146fb55b24f92dbda0a9e917768","observation_id":"65adc3ff-1158-41b3-949d-ceb267550745","resolution":{"observed_at":"2026-08-01T19:53:36.473673Z","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-08-01T19:53:36.569823Z","title":"Berthe, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:36.569823Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:cfe607d9f40b0dee649d3979484e7c122027dd06c31375175a7e0250fb341013","observation_id":"95d1f73e-3ae8-4779-8b3e-f76352c3dfa3","resolution":{"observed_at":"2026-08-01T19:53:36.569823Z","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-08-01T19:53:36.690416Z","title":"Bertrand, I","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:36.690416Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:fe6c0b457bc3da523c0fbc5abe4ac588ef0df8ac61b177a192a4525b78206cd8","observation_id":"413d36c6-55f6-4e09-9668-b753774a1c8c","resolution":{"observed_at":"2026-08-01T19:53:36.690416Z","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-08-01T19:53:36.878242Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:36.878242Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:33aed3808e65fab021ebf19b7fa85bdb75f05d829cc6b486251540244a6c4645","observation_id":"863944c1-c1e4-48ac-8d83-ac885e5a4b84","resolution":{"observed_at":"2026-08-01T19:53:36.878242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08266","last_updated":"2025-06-16T02:19:29Z","snapshot_observed_at":"2026-08-07T16:06:38.444747Z","submitted_at":"2025-04-11T05:43:21Z","title":"$\\chi$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.08266","snapshot_observed_at":"2026-08-01T19:53:37.055979Z","title":"Bonamy and C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:37.055979Z"},"links":{"cited_paper":"/paper/2504.08266","citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:5f69dfc200193a627ffc34d928c5412bfff83e0063909269b4a60cc6c9e4b115","observation_id":"c46ec5fc-384a-401f-85d9-677433703903","resolution":{"observed_at":"2026-08-01T19:53:37.055979Z","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-08-01T19:53:37.214448Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:37.214448Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:9552568558c3d0e5045be6c69210c639a26edb1ede02f0bd17a93ebf1bc70cc0","observation_id":"be95e427-20c6-4624-a4d1-489b4633cffb","resolution":{"observed_at":"2026-08-01T19:53:37.214448Z","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-08-01T19:53:37.367702Z","title":"Bonnet, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:37.367702Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:830ca6e1835493fe1adf9985cb0cbb418e31b2448f2b274c14fb658dfa9f02c2","observation_id":"7f96e0a6-49b9-4f9b-af50-62a0f04cd227","resolution":{"observed_at":"2026-08-01T19:53:37.367702Z","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-08-01T19:53:37.482887Z","title":"Bousquet, A","venue":null,"work_id":null,"year":2047},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:37.482887Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:44a21d9a416c737b7056d6f6358bba06a295f6f529b4f9b024975cfb794e5cfa","observation_id":"e6d53308-e49b-4911-9502-af05566f4168","resolution":{"observed_at":"2026-08-01T19:53:37.482887Z","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-08-01T19:53:37.579395Z","title":"Bousquet and S","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:37.579395Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:441736d31180260954b152fa728d0b7365060c35144a9fc1b04827520d9807ae","observation_id":"93aad26a-54ba-48a3-a0dc-ce7b8a1f7567","resolution":{"observed_at":"2026-08-01T19:53:37.579395Z","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-08-01T19:53:37.658778Z","title":"Chakraborty, F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:37.658778Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:2e435711d1615e0338b95a9cbf06ab5d3c06978453f552889c9118b3d2f5646e","observation_id":"9178354e-e4a8-421b-a1f2-159c6b770705","resolution":{"observed_at":"2026-08-01T19:53:37.658778Z","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-08-01T19:53:37.776206Z","title":"Chepoi, B","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:37.776206Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:d5cca297184667ea55b66c329f4df207af288470826ff5974d922d05c79ce49b","observation_id":"d074119b-7f2b-4195-9ff9-dcb1f14bfdf8","resolution":{"observed_at":"2026-08-01T19:53:37.776206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.09646","last_updated":"2026-07-10T17:43:39Z","snapshot_observed_at":"2026-08-08T23:35:34.733741Z","submitted_at":"2026-07-10T17:43:39Z","title":"Forbidding anticomplete planar minors: Induced Erd\\H{o}s--P\\'osa property and Maximum Independent Set in QP","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.09646","snapshot_observed_at":"2026-08-01T19:53:37.858923Z","title":"Chudnovsky, A","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:37.858923Z"},"links":{"cited_paper":"/paper/2607.09646","citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:c42a98dcbfda4dc67a37bab44ff923274d0c981310fc76f304be2e5fe4311b88","observation_id":"0404ea58-4b96-4460-bdf1-572f0453e839","resolution":{"observed_at":"2026-08-01T19:53:37.858923Z","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-08-01T19:53:37.954208Z","title":"Coudert, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:37.954208Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:9e84790f7da6964d9dae0093d81c89bb907262d1b50a1ed261579f227cf70af5","observation_id":"a4d5ad22-2355-4f5b-9464-be63a12636d1","resolution":{"observed_at":"2026-08-01T19:53:37.954208Z","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-08-01T19:53:38.043160Z","title":"Courcelle","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.043160Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:76a23ecd030f60d8fa453eedc78dfcc76296fdb9bcbcca36f35c6e76c326027b","observation_id":"d1121696-d95c-421b-bac4-1dd810848f47","resolution":{"observed_at":"2026-08-01T19:53:38.043160Z","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-08-01T19:53:38.131228Z","title":"Cygan, F","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.131228Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:b8f005c04f14fc94244a38d177b45aefd31514f849e978caaa17684bb114854c","observation_id":"73ba0baa-026a-4bd8-a101-343845e40462","resolution":{"observed_at":"2026-08-01T19:53:38.131228Z","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-08-01T19:53:38.185629Z","title":"Dreier, I","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.185629Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:f59df1b984a8072c458e432f56a650cb59fda0dc61fd2d59efa9b9b777230321","observation_id":"ade08db7-75cf-4ee0-a691-2ed48c1d59ae","resolution":{"observed_at":"2026-08-01T19:53:38.185629Z","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-08-01T19:53:38.282235Z","title":"Dreier, J","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.282235Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:a8ef2c04e19484abad4c1b912e2a03bf1a9ce5a1201eca9b5dbc9760aafa6dfc","observation_id":"3d0dc2d6-4c1c-4fe7-8557-bd4a20fad3b2","resolution":{"observed_at":"2026-08-01T19:53:38.282235Z","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-08-01T19:53:38.377941Z","title":"Dreier and S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.377941Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:6f1f7ea783382d429b95d8651dfee1b56666525a03df116a4fd35d24a98f179e","observation_id":"78c3047a-e637-4a6a-9239-7130e2b2f5b3","resolution":{"observed_at":"2026-08-01T19:53:38.377941Z","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-08-01T19:53:38.532190Z","title":"Eickmeyer, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.532190Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:bb83d871fcc29c2eaf10b8bab5c56d096d09da820432e1720417a03a822810fb","observation_id":"8936b6f5-339f-4a6f-91c9-8ed2e0f341d1","resolution":{"observed_at":"2026-08-01T19:53:38.532190Z","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-08-01T19:53:38.617533Z","title":"Foucaud, S","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.617533Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:160aea1a7e6a9ae578cddf73f55b354906e96ad9d90181f8c956aa08c13a77d3","observation_id":"87ad92ea-2cb3-4bf8-a4ca-35198ed5b03e","resolution":{"observed_at":"2026-08-01T19:53:38.617533Z","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-08-01T19:53:38.689359Z","title":"Foucaud, G","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.689359Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:f896a25024d609f65330d137bfa0fab6fa19ab25085ad255e82948dac02c0788","observation_id":"8276e1a4-8f39-4c0a-baec-7f872d2f3850","resolution":{"observed_at":"2026-08-01T19:53:38.689359Z","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-08-01T19:53:38.768157Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.768157Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:eb40b2ea2337d0d761d0ca1a13f8ff23278dfe8bd5647ada0f8c270f17783796","observation_id":"0a1338c6-65d7-4651-92fa-ce0e5f70959e","resolution":{"observed_at":"2026-08-01T19:53:38.768157Z","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-08-01T19:53:38.837032Z","title":"Gajarsk´ y, P","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.837032Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:5f6865f3f90d2985da7cf71a4cddb0c555485be3b5fd9ba55d19a2b1396e4d64","observation_id":"763781fa-f9a6-485d-b26a-c5da83b873ee","resolution":{"observed_at":"2026-08-01T19:53:38.837032Z","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-08-01T19:53:38.921112Z","title":"Jacob and M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:38.921112Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:6849488ff0fb7e3c8636114ea7fe70348934271aa1830e11fddf954b9a3a5fb9","observation_id":"15bdab44-8749-4c16-b5cf-20cfdecf8aaf","resolution":{"observed_at":"2026-08-01T19:53:38.921112Z","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-08-01T19:53:39.013258Z","title":"Jean and A","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:39.013258Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:922773a87cc9d84b2cc32a7d20b79db9ff72ef4b11f1c3624236623b48e7e4d8","observation_id":"37cb158d-60a4-43c8-9a00-9db1884d5b04","resolution":{"observed_at":"2026-08-01T19:53:39.013258Z","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-08-01T19:53:39.157267Z","title":"Joret and C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:39.157267Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:50bf86c495fa9246ecfb360435568536ce1dde337150f77bca3c0ea8b9ae2476","observation_id":"18058741-4f54-43cd-b8bc-b849ed153599","resolution":{"observed_at":"2026-08-01T19:53:39.157267Z","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-08-01T19:53:39.307133Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:39.307133Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:8f9e205075d41ea89b340d20c421e162859c1b5f7ca49d07e540c4f5ca11d729","observation_id":"34342062-e0f6-4f12-8e3e-f555ffd7e4cf","resolution":{"observed_at":"2026-08-01T19:53:39.307133Z","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-08-01T19:53:39.425663Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:39.425663Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:6766845fc958a2378ae7a9ee6324788a84ea3b64fc0897907b98aa2d4ca31952","observation_id":"daafc430-1663-4b51-a109-01e3b72db9cb","resolution":{"observed_at":"2026-08-01T19:53:39.425663Z","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-08-01T19:53:39.504297Z","title":"Kranakis, D","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:39.504297Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:e02a9bef142999fdbdd27aaf10ec6b3886fa96116f1f61c7b89433fb82a9cbed","observation_id":"eb28cf81-27a2-4196-8ff9-66999bb542a5","resolution":{"observed_at":"2026-08-01T19:53:39.504297Z","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-08-01T19:53:39.556487Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:39.556487Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:bfc7de8e5f134b93bf760cbc5625421b10901e59df192cbf5752d5f7cc6811ab","observation_id":"43035a60-557f-4f83-b103-da224844fda5","resolution":{"observed_at":"2026-08-01T19:53:39.556487Z","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-08-01T19:53:39.613207Z","title":"Lobstein, O","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:39.613207Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:2a8e3d755b324904381e0dcf8a59531e7691db12e19bb4429e4ddf3c585b6e3e","observation_id":"51f4367a-c0ca-43bc-8b2c-7c2c18f1fa0f","resolution":{"observed_at":"2026-08-01T19:53:39.613207Z","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-08-01T19:53:39.693572Z","title":"Lokshtanov, F","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:39.693572Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:1d539d453add21c72fe6faf352d0bb777a4212f52d42afea6d8467c322bebc15","observation_id":"b0e3b601-63bb-48af-b8ad-212c85586118","resolution":{"observed_at":"2026-08-01T19:53:39.693572Z","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-08-01T19:53:39.842586Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:39.842586Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:32f82caa6671579157bfd96d448966cc4b7290ea74e73a93bf29e5e4ba3ab8c2","observation_id":"a3697697-5c54-4dc2-89e0-6a124affba59","resolution":{"observed_at":"2026-08-01T19:53:39.842586Z","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-08-01T19:53:40.021580Z","title":"Reidl, F","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:40.021580Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:f88db8ad2c2a8aa043cadf7b0b5597c5d367bef5c65f5eedc8b9f150483b5949","observation_id":"5fd7b0df-54f4-40ba-a9cb-c1cc12d31fa7","resolution":{"observed_at":"2026-08-01T19:53:40.021580Z","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-08-01T19:53:40.141943Z","title":null,"venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:40.141943Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:2b4363f86ed2ccd798e528537b920534a97bda3f97f0ef1fd168f18cbd53ad42","observation_id":"72113db3-cdfc-47b8-8ad5-5187435ea97d","resolution":{"observed_at":"2026-08-01T19:53:40.141943Z","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-08-01T19:53:40.230044Z","title":"Robertson and P","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:40.230044Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:a117cc2dd27076c9400464ca63b8da7e2632410f969427d55b64c6d2e3e78468","observation_id":"a967b625-44ee-49cb-9d79-392c19af8a21","resolution":{"observed_at":"2026-08-01T19:53:40.230044Z","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-08-01T19:53:40.312495Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:40.312495Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:9b4a07e17110b6720855eddc2dca7d7d8db1a6a41c41b9ad6b7fdb1f9385e4c8","observation_id":"dd5ab7a2-2393-4e42-9c4e-8f0523027c2e","resolution":{"observed_at":"2026-08-01T19:53:40.312495Z","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-08-01T19:53:40.400465Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:40.400465Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:7c5bd344d7f5cecc7535735609e2e9f5df119e0440b2071492b44c2203c827ad","observation_id":"7371918a-f1e1-4bc8-a138-a266243e36ff","resolution":{"observed_at":"2026-08-01T19:53:40.400465Z","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-08-01T19:53:40.465611Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:40.465611Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:8e90daec5ca5ca08147109c4436ba59b9ea6ef43818e32b7ae8a23ff8990f552","observation_id":"3175def3-536e-4600-9cf0-a6c035cfb2df","resolution":{"observed_at":"2026-08-01T19:53:40.465611Z","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-08-01T19:53:40.523137Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:40.523137Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:328a7f0692de9253591a0d5e5b5f323b56edea65ca7bac9a40aabb98453c4447","observation_id":"96fa33af-092a-44bb-a793-9e65503e5bd2","resolution":{"observed_at":"2026-08-01T19:53:40.523137Z","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-08-01T19:53:40.594460Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T19:53:40.594460Z"},"links":{"citing_paper":"/paper/2607.16889"},"observation_digest":"sha256:d9523f7a036a684cb77035c71a154677c3a81be8343d894638dd2c8f9f446236","observation_id":"85ed1fa1-8851-41fd-a58f-a1aa0e0b1546","resolution":{"observed_at":"2026-08-01T19:53:40.594460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.16889","last_updated":"2026-07-18T17:11:16Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-08T23:35:53.025266Z","submitted_at":"2026-07-18T17:11:16Z","title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":42},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2607.16889."}