{"as_of":"2026-08-04T03:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:52d8a4006c26ca191178ac02c185c24872074ec8985a8ba5ab740d1f6fff2024","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T01:47:41.536825Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+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/2605.19702/citation-record","integrity":"/paper/2605.19702/integrity","json":"/paper/2605.19702/citation-record.json","paper":"/paper/2605.19702"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Combinatorica , volume=","venue":null,"work_id":"958abff7-cb5b-4204-8a9b-17320e7f3d9d","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:76c20b44d08856cc72b4cd83faafa451e21496afd8d72fe085720ac1edbf1c14","observation_id":"300b7c2d-b9fe-4203-aab8-504d39cb94e0","resolution":{"observed_at":"2026-05-20T01:47:57.536707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computational Complexity , volume=","venue":null,"work_id":"993bf8e6-ff08-4c40-92bf-9451de79647c","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:86b6caae3871bf8e31a75080147dfbe06a6d3cd3aa399583e3a8f7d8bb70b1bc","observation_id":"054d3f70-1619-4c7a-8945-5707bc8a8438","resolution":{"observed_at":"2026-05-20T01:47:57.592014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Acta Mathematica Sinica , pages=","venue":null,"work_id":"211a1ea2-78c8-4220-9025-7728de352ddb","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:ef87c6e451229939becfe88bc50a3dbfd0c635566f0b5cda0530f5ffc5a3c805","observation_id":"40f47f99-191c-446e-a244-72fa535255de","resolution":{"observed_at":"2026-05-20T01:47:57.544885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Canadian Journal of Mathematics , volume=","venue":null,"work_id":"47c4fc2d-759c-4b52-9a95-9d45a2a4fc60","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:a7f6a069146781e49a05e28125e84ef3d8ad764c1807eda41f97e8015c075820","observation_id":"04a5f3ba-830d-4446-9736-b625e2dc8814","resolution":{"observed_at":"2026-05-20T01:47:57.579182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2017 , institution=","venue":null,"work_id":"1a0597ca-87e8-4dd0-895e-7ccb128fdd99","year":2017},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:221e8191254570687a34d1029eaf8134af9a8678444f356d7e1b2fd204708458","observation_id":"6861486d-754e-4d73-8e90-18f2d1cf0568","resolution":{"observed_at":"2026-05-20T01:47:57.482274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2016 , institution=","venue":null,"work_id":"b548f3dc-7b74-43d3-887a-336f84a88e1d","year":2016},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:53dddc59eac80e0ce338ba477fb38bad7d97b1660d030806cf5fc6fc551f656e","observation_id":"9d4d38be-63c8-4746-bdee-0b17c65d9ae1","resolution":{"observed_at":"2026-05-20T01:47:57.501187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ACM Transactions on Computational Logic (TOCL) , volume=","venue":null,"work_id":"58297b4e-37d0-41f0-b2f2-728333f724eb","year":2021},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:f31291d41e135b93d11ad45b0dc3582815ad74eb92f1548e46a728beebf91fb7","observation_id":"3599caf5-0814-4844-a642-e5c00bd9886a","resolution":{"observed_at":"2026-05-20T01:47:57.514310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ACM Transactions on Computation Theory (TOCT) , volume=","venue":null,"work_id":"7552e54e-a86e-4bc5-b7d6-ffccb69983f7","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:310f87907b4e53ce5da0751b544e79cc977e830496a9f764ab1b730962a069bd","observation_id":"4a0804b9-43aa-4c41-8637-9a2093396174","resolution":{"observed_at":"2026-05-20T01:47:57.505667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC) , pages=","venue":null,"work_id":"e37144df-7588-4eea-941a-2e5ab8914726","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:6a4c9c54605195c28e629afc75db5540f1e90b79f73e305b2381ea2684d3d159","observation_id":"75faad8d-5592-4f59-8323-8bdc3e0b1d29","resolution":{"observed_at":"2026-05-20T01:47:57.540664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the tenth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"7fc01e39-7c9c-4e5b-9dd7-0123ad93335a","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:609663d5e8af70d888b422c124af8dfa102d6fcfbda3d5f27eb18ce06a7e62ea","observation_id":"13198ced-6bf4-4eb9-a7fd-162c8d0d23ec","resolution":{"observed_at":"2026-05-20T01:47:57.532581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b77b4af3-3d00-47a4-b433-9d3846da42fb","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:de45ede922182c04c02ea160a964d74e19d2a442cf587d26ba8e6d116a0c9ca3","observation_id":"5fd402ad-eb56-488a-b24b-a3154d407b9b","resolution":{"observed_at":"2026-05-20T01:47:57.665626Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Journal of computer and system sciences , volume=","venue":null,"work_id":"16abb08b-fbdb-41bb-ba8f-4bc3c736f79f","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:ae4d53e61fd082d83a736f5625e9771b62c7582c299127df3456cdf14139ac46","observation_id":"855e8533-2eec-4484-a30b-885f289190ab","resolution":{"observed_at":"2026-05-20T01:47:57.638592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the ninth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"9aedb7dd-3317-46bc-8113-b7598ad402e7","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:bab62528551e84c7d1eb848da44f7ca3e6978021248babee06cfd3cdb89ea1df","observation_id":"a3d0bf51-2654-427d-9c33-d89dfb8f0626","resolution":{"observed_at":"2026-05-20T01:47:57.617595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pacific Journal of Mathematics , volume=","venue":null,"work_id":"70bcd573-d4c6-4d32-a1b2-4a86386ae3c2","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:49eea4af20a77ad562cca9ef0540dcf9fade8a84e45a37387ca266501b2a2fd1","observation_id":"97dcbfa7-39b7-4538-8045-f9b901f404db","resolution":{"observed_at":"2026-05-20T01:47:57.609006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.09582","last_updated":"2019-07-22T21:16:29Z","snapshot_observed_at":"2026-08-02T17:49:44.473731Z","submitted_at":"2019-07-22T21:16:29Z","title":"The $k$-Dimensional Weisfeiler-Leman Algorithm","version":1},"cited_work":{"arxiv_id":"1907.09582","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.09582","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The $k$-Dimensional Weisfeiler-Leman Algorithm","venue":"cs.CC","work_id":"a35fb0b8-686f-4602-84fc-7204f397f55f","year":2019},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"cited_paper":"/paper/1907.09582","citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:186f70f6b09ce236199b51632806201c5f967cb2d632ac8bf6536d43665dd965","observation_id":"a7b27d79-23a8-4932-ad5d-07e565ab1568","resolution":{"observed_at":"2026-05-20T01:47:57.286343Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Nauchno-Technicheskaya Informatsia (NTI) Series , volume=","venue":null,"work_id":"0258ebe6-858e-455f-9604-42fc9ac006a5","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:9dc36a4119e549cfc9db71576029994285c4c0e6bae1d93e7ac34e32bbb0e46a","observation_id":"f7ea216f-3af9-4a8a-807b-1ecae2fbeac8","resolution":{"observed_at":"2026-05-20T01:47:57.491344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 22th Annual European Symposium on Algorithms (ESA) , pages=","venue":null,"work_id":"4d7e1887-426f-48b5-b18b-14688dfc15d9","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:bffb7f0d10881052a496fd82f52d3dd1ba7bf3e87f2a436ced33dac457b709a9","observation_id":"4506e908-cdbc-47b8-b67d-7989b1dc64bc","resolution":{"observed_at":"2026-05-20T01:47:57.634597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI) , pages=","venue":null,"work_id":"d6eb0bfc-3167-4f42-bd57-dbcb9f041670","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:c793eb52e998682a1bcc9d269295f7fbdb967ba38efd21488dd77e5e45b41956","observation_id":"7ea85919-166c-4a23-b15d-02a63610e227","resolution":{"observed_at":"2026-05-20T01:47:57.630712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC) , pages=","venue":null,"work_id":"b9bf4ebf-4e64-4bff-b253-d1de7c933ee4","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:7f1308d81702035547f409a592a6209a4cdd0ede1dfe30b1f8f4f9158c632c47","observation_id":"afab978f-d703-4831-b984-4fb8cc725472","resolution":{"observed_at":"2026-05-20T01:47:57.487043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proceedings of the 6th Annual ACM Symposium on Theory of Computing (STOC) , pages=","venue":null,"work_id":"00dcf790-1a12-4c60-a1e9-7bd20abf59c7","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:f7a48a683060d057055a98bb84932687abc4bb33701d6ac8aa63ecc52a484173","observation_id":"5d5329e6-d98e-4dd0-a964-42bedb20b579","resolution":{"observed_at":"2026-05-20T01:47:57.669620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Journal of Algorithms , volume=","venue":null,"work_id":"06649d33-301a-42a1-89ef-8886eb7d5511","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:9bcef7c6db558405f92cfb8eadb2dcc38d5ee643adcb0dc31240233a3a12796a","observation_id":"f084de18-3fad-46fc-9f1d-18c869bc75f1","resolution":{"observed_at":"2026-05-20T01:47:57.605716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"North-Holland Mathematics Studies , volume=","venue":null,"work_id":"ba23ea64-e5f0-4e93-a448-d43512d031a3","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:6446620c2a4c5a9a62b0fbdc7778f51fca29a5dd97750330a5ecc9663408dd43","observation_id":"06b30a11-4a9c-44a6-93ca-81db1f21a456","resolution":{"observed_at":"2026-05-20T01:47:57.622942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Discrete Applied Mathematics , volume=","venue":null,"work_id":"5f49236e-680b-46be-aa9f-0f8aece1fbf7","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:33e376f36f549903342211037ac7fa89b234dca163c9154ced700e75f6101b4f","observation_id":"985393d5-f1fc-44b9-8284-a7b71f85f9f7","resolution":{"observed_at":"2026-05-20T01:47:57.626806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The monotone and planar circuit value problems are log space complete for","venue":null,"work_id":"511654b3-b891-45f9-9443-aca9133e2e59","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:900f4a2e2d5a446ca91f2a8d30b07859a1eabc4a7158c10cb6701cfdb88fabd1","observation_id":"d666e292-7300-425b-b07e-1ab576bfaaae","resolution":{"observed_at":"2026-05-20T01:47:57.570165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2020 , school=","venue":null,"work_id":"a3065f8d-eec5-4f1f-9698-c551be8a6442","year":2020},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:124c240e36e09e981663a448a8a8a13dee238b77c3b5818b7a8d8433299191b8","observation_id":"a60e9e57-7a23-454c-8d30-43f038507354","resolution":{"observed_at":"2026-05-20T01:47:57.598836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Power of the","venue":null,"work_id":"82a03aa0-1112-4caa-9546-fc91218abdc0","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:494e176b3ac793e59bbf5976a22181a70bd7107869ab8fd4bfd0399c84e39b81","observation_id":"f48f4d2d-def9-45bf-a1b4-332aa0d92f2d","resolution":{"observed_at":"2026-05-20T01:47:57.565001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An Introduction to Lifted Probabilistic Inference , year=","venue":null,"work_id":"c32992b9-447b-4440-bd69-0977f3a8ef79","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:e5281abbce60e7d874b9fd3ac20c02e1950eca21d6344b1da141ed125cefcd27","observation_id":"34ef41f9-62a7-45e5-8728-3265785feee9","resolution":{"observed_at":"2026-05-20T01:47:57.585027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"1990 , publisher=","venue":null,"work_id":"41ee255f-bb94-4351-af1d-5027a94dc488","year":1990},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:eeaab2d185d49ad8589cfc9412de3f88bc3881f1ca381e4167c86608f33e60ba","observation_id":"6dcecd33-7d9f-44db-ad41-b4bbb78deb3e","resolution":{"observed_at":"2026-05-20T01:47:57.654028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"International Colloquium on Automata, Languages, and Programming (ICALP) , pages=","venue":null,"work_id":"47a12d82-099e-4a9c-b1ca-16f76f3581b0","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:f6d4ffd4242b6fdb0883b7f89fc2b88c7595dd3a51155364704aff3183b5b54d","observation_id":"948b27c2-e44f-43c0-a8cf-178d0bde5c0a","resolution":{"observed_at":"2026-05-20T01:47:57.549413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9d4090a8-c029-4cbd-8f98-16608e13f818","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:4ba75ded6a6da4efadfa0822f5018b2ae035b6008dde7c6ff5ab3ff6e8654690","observation_id":"272a4734-9803-42ed-83ec-c91719639802","resolution":{"observed_at":"2026-05-20T01:47:57.518682Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Journal of Graph Theory , volume=","venue":null,"work_id":"81954c9a-49d5-45b7-85ad-30ad57d253e6","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:657b3914ded3cc447205316045fb628916c62191ed4de3351f70556c08bc0ee9","observation_id":"cea93961-d453-477b-8cf6-f1dc2168b43a","resolution":{"observed_at":"2026-05-20T01:47:57.495915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) , pages=","venue":null,"work_id":"d6703afb-0d12-47fb-91a2-f83c6dc088d9","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:c884e315c8f36e47c318989db9099be236b99d2aec79f36327e12fa4b51b5713","observation_id":"ab260b8c-b84c-49c6-a04a-1e9a8c8b8601","resolution":{"observed_at":"2026-05-20T01:47:57.509983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Congressus Numerantium , volume=","venue":null,"work_id":"4c1f07be-b926-4f7d-afaf-c2069954d04d","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:8d235af6fa584e0427ffde4299f470d05e0e10a68746577f95b9666356dc6738","observation_id":"10721004-0369-48ab-abdb-190acacb6763","resolution":{"observed_at":"2026-05-20T01:47:57.523044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"International Symposium on Mathematical Foundations of Computer Science , pages=","venue":null,"work_id":"4fe53867-af28-45ab-9716-fb25201914b7","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:871019dc56232277af47f892f9d75b4304b2e34dc9d8156755151bb405022c1b","observation_id":"bbf2f887-0ab3-4866-8fc3-5ea030f45ed5","resolution":{"observed_at":"2026-05-20T01:47:57.553921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Weisfeiler and","venue":null,"work_id":"d8aef8fa-6472-446d-ae77-0c1cc0d1940a","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:9b95891e09d4becdbf35b1709b33c7e647711169ee2590adb5ec4d1d991c1f6e","observation_id":"89d2a4c1-c402-4956-b2dc-920c8dffe4ef","resolution":{"observed_at":"2026-05-20T01:47:57.657871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"32nd International Symposium on Algorithms and Computation (ISAAC) , pages=","venue":null,"work_id":"4577cbb0-4fde-4754-b891-f2d11df26979","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:3020972c82db37f586d18339ba885ee33cce21e4898a9d127bb2b140638b22b6","observation_id":"ba003b80-e360-4d44-9afd-7f6a3b5d6b70","resolution":{"observed_at":"2026-05-20T01:47:57.527850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Weisfeiler and","venue":null,"work_id":"313362ff-a738-4dd1-b468-d29918d7709d","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:61d6ce3f5e0efa4deae57ef23766cd1926fa3f26b2ccb0a5bf947c112c2ba06a","observation_id":"81da250d-115e-4e95-9fc1-f6c7b562ca9f","resolution":{"observed_at":"2026-05-20T01:47:57.661771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ACM Transactions on Computation Theory (TOCT) , volume=","venue":null,"work_id":"94e54b96-de5f-42ef-9c46-6329fe4c4998","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:744e0af5a9af547d7893b2e038bd2ceb24e6fe657e00a590a04f076ca4d456cb","observation_id":"5c53a8e7-d8f3-4362-b930-358c2f30b63b","resolution":{"observed_at":"2026-05-20T01:47:57.646606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bounding the","venue":null,"work_id":"e8827d5e-06dc-43c1-b23e-c1ee1a5e9326","year":null},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:7a44e9a48ea54504fefaaaed3bd64f1cafd67567094434acb95d47489f27ff7d","observation_id":"67691653-3cd3-4190-a307-98811f0550c2","resolution":{"observed_at":"2026-05-20T01:47:57.642645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.04574","last_updated":"2017-10-12T15:44:49Z","snapshot_observed_at":"2026-07-06T06:03:58.446292Z","submitted_at":"2017-10-12T15:44:49Z","title":"Graph isomorphisms in quasi-polynomial time","version":1},"cited_work":{"arxiv_id":"1710.04574","doi":null,"metadata_source":"pith","pith_arxiv_id":"1710.04574","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graph isomorphisms in quasi-polynomial time","venue":"math.GR","work_id":"7d226020-7e92-4723-9f49-f085c0149c86","year":2017},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"cited_paper":"/paper/1710.04574","citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:66f360c638406a07c7559daec0d2cfad27cc1bbc1472345b554edef2b5c11cfd","observation_id":"07a0c6e0-7d3b-4b8e-b790-8418b89bb71d","resolution":{"observed_at":"2026-05-20T01:47:57.293643Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fundamenta Informaticae , volume=","venue":null,"work_id":"5a4fea36-d4b5-43dd-b51e-4d5b255491ca","year":2017},"citing_paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-20T01:47:41.536825Z"},"links":{"citing_paper":"/paper/2605.19702"},"observation_digest":"sha256:24b4b904604fd023c68d970c174703eaec4ec276cc85eb308f8a9bc80ade5f7c","observation_id":"5ef2adae-bb19-44c4-a62b-630bf6394a86","resolution":{"observed_at":"2026-05-20T01:47:57.650257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.19702","last_updated":"2026-05-19T11:38:21Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T23:30:25.609722Z","submitted_at":"2026-05-19T11:38:21Z","title":"A Hierarchy of Tinhofer Graphs: Separations and Membership Testing"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":37},"total_outbound_references":41},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2605.19702."}