{"as_of":"2026-08-16T08:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9aa4a51e1201553cc8022dc2f010800dbb38826d08f33e3e9228271dbae48b86","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:22:53.584690Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.05445/citation-record","integrity":"/paper/1908.05445/integrity","json":"/paper/1908.05445/citation-record.json","paper":"/paper/1908.05445"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:54.214422Z","title":"The Mathematical Theory of Infectious Diseases and its Applications","venue":null,"work_id":"7cf634d1-ebb2-4564-8443-e8baead9b60e","year":1975},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.481459Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:d0c02138ff086511f2de7bcc6975fb816867033e89bb9756d9b01cddfb30231b","observation_id":"87a8335a-3b92-40c7-a315-b01211bd2c9e","resolution":{"observed_at":"2026-08-14T13:22:54.217915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.485440Z","title":"Fixed-parameter tractable algorithms for tracking set problems","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.485440Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:55ded2a72868351482378cfeb12fc774f033f9baaa61236bd288c540a7840a8d","observation_id":"5d3acf3b-ed90-42d9-8934-b6ad3257b36a","resolution":{"observed_at":"2026-08-14T13:22:53.485440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-77404-6_8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.736911Z","title":"A polynomial sized kernel for tracking paths problem","venue":null,"work_id":"bd82732c-9942-4945-bd52-fc6b7a8d3f0a","year":2018},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.490005Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:c440e63b35ee2c59a70cc4b3801f5e7b31448f8fe74a237a67a0a7817d88819d","observation_id":"0fd9bc4a-b0dd-4074-ae8f-b1e8c1fe9b35","resolution":{"observed_at":"2026-08-14T13:22:53.740459Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-57586-5_7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.727142Z","title":"Tracking paths","venue":null,"work_id":"3b457f16-b24d-4ac9-acc5-1cb1b99868a0","year":2017},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.493473Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:ea607b8552451c92cbf8f46d844960be26ec78cf932e7bb80abdbdb09bcdb9a5","observation_id":"a2be11d0-5a22-4702-bf23-579abc9abca2","resolution":{"observed_at":"2026-08-14T13:22:53.730731Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:54.204572Z","title":"Nonserial Dynamic Programming","venue":null,"work_id":"2496c7f5-b90b-4b3e-9cd9-9bcbafe2a4b6","year":1972},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.499113Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:75a3462994c996205bda21266c0b7a92c1b9ca6e99c1fd09505276e08c57b419","observation_id":"d38280da-65a1-4fbc-ad0a-71227463ce87","resolution":{"observed_at":"2026-08-14T13:22:54.208102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icwmc.2009.25","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.717337Z","title":"Survey of target tracking protocols using wireless sensor network","venue":null,"work_id":"2af0a3a3-fb9e-42ff-8567-e65f07738d1d","year":2009},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.502931Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:054769c52899adbdf57164b69cfd06ab9f59b3689e6ebffed744979f66fe9c6f","observation_id":"3a9c06d4-1a24-4722-8d13-6a60dc9ef05e","resolution":{"observed_at":"2026-08-14T13:22:53.720864Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.508291Z","title":"Tracking routes in communication networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.508291Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:71ac33b4dc39a469556b44cc9efbcd057874b03ae0fefe5b780787ae7df335a8","observation_id":"39514f08-2bd8-4d93-95e4-4781b1bca75a","resolution":{"observed_at":"2026-08-14T13:22:53.508291Z","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-14T13:22:53.511711Z","title":"A linear-time algorithm for finding tree-decompositions of small treewidth","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.511711Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:83aa911f9b0f7fecb727f4739491f500ad71efd5d29be5cd9235b17a169bcf33","observation_id":"f6d9076f-8b9b-4982-9f87-455ebd30e743","resolution":{"observed_at":"2026-08-14T13:22:53.511711Z","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-14T13:22:53.515177Z","title":"The monadic second-order logic of graphs","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.515177Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:6db1440f8da76d0853c3b7b9ab6d5384c887f19fa68c84b0d3b4095071291016","observation_id":"998a053c-4e6d-4224-a02d-3a5532811d95","resolution":{"observed_at":"2026-08-14T13:22:53.515177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jal.2011.07.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.688084Z","title":"Automata for the verification of monadic second-order graph properties","venue":null,"work_id":"379be1a0-b9dd-4ebd-9522-fbdddab2a308","year":2012},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.518770Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:777493819c0950b0a75170aa15b2a69381eb746526728f27022cf01f9fa39511","observation_id":"c66dd81d-3365-4ed9-bb47-d0a719654706","resolution":{"observed_at":"2026-08-14T13:22:53.692722Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2015.12.026","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.678091Z","title":"Computations by fly-automata beyond monadic second-order logic","venue":null,"work_id":"2668833e-3570-43a5-ac1f-b6f1f6da6704","year":2016},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.522321Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:638c83fa4060ce844116e9a3bd430c683f3998f0a05f6fe4fa48997284e5746b","observation_id":"26662995-8f55-489c-bd8e-646074fa7eed","resolution":{"observed_at":"2026-08-14T13:22:53.681855Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:54.192583Z","title":"Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , volume 138 of Encyclopedia of mathematics and its applications","venue":null,"work_id":"c558ba6e-3915-4380-85ae-f4d73e6fe9c7","year":2012},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.526163Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:5b3d38703e73b801f9bd39c8c289fb20496b200f74f5862ab11ab8951ed35a43","observation_id":"70807ee2-ece2-4527-a3fc-2fd448164c87","resolution":{"observed_at":"2026-08-14T13:22:54.196247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.529532Z","title":"Handle-rewriting hypergraph grammars","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.529532Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:cf5efb88bf75bff13f7f6630d686f518bcd28a69e3668e94154dfe92f04f0687","observation_id":"37913427-ae54-4ed7-a385-dfca9fcd1f06","resolution":{"observed_at":"2026-08-14T13:22:53.529532Z","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-14T13:22:53.533223Z","title":"Linear time solvable optimization problems on graphs of bounded clique-width","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.533223Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:01769efc2cff5fb2a29bb5385f0e98a5a6fce3cdd7023eb24c87d6d969ca913f","observation_id":"792ab96b-0b86-4981-8ca6-3e3840af37e1","resolution":{"observed_at":"2026-08-14T13:22:53.533223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(93)90064-z","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.653496Z","title":"Monadic second-order evaluations on tree-decomposable graphs","venue":null,"work_id":"4e53b0fe-58bb-4c91-a108-d86f47d228a6","year":1993},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.537694Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:bb2ffc141ae6cff8f8e22f06c71a887306197531f71e2eb820e54f76da47a4e2","observation_id":"2052334c-e325-4d08-b810-5c17e44258fe","resolution":{"observed_at":"2026-08-14T13:22:53.659130Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.541612Z","title":"Upper bounds to the clique width of graphs","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.541612Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:f969b486bf99f4198c0465d466058a89e4be3a513516c0f84833bd2a99cee5bf","observation_id":"5abb02e9-8e42-42b4-8ff3-58fe55be56d7","resolution":{"observed_at":"2026-08-14T13:22:53.541612Z","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":"pubmed/1682999","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:54.181943Z","title":"Epidemiology and control of SARS in Singapore","venue":null,"work_id":"4db884d2-4852-4914-aacf-4a2d70bdff68","year":2006},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.544865Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:8c8d104b91badc4b1b9f25b78185a74097b65f6fbc0ae71fba0cde4f4072265d","observation_id":"1bda84a0-7524-47d6-a279-698ce7515a88","resolution":{"observed_at":"2026-08-14T13:22:54.186906Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12861","last_updated":"2020-03-28T18:22:20Z","snapshot_observed_at":"2026-08-08T06:32:19.536393Z","submitted_at":"2020-03-28T18:22:20Z","title":"Making RooFit Ready for Run 3","version":1},"cited_work":{"arxiv_id":"2003.12861","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.12861","snapshot_observed_at":"2026-08-14T13:22:54.110741Z","title":"Making RooFit Ready for Run 3","venue":"cs.MS","work_id":"eac626e3-0eb1-4351-9b60-9c5a1ad2b4b6","year":2020},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.548254Z"},"links":{"cited_paper":"/paper/2003.12861","citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:6cab525ecff2abc9c7be63bba4bde5c8fd92a4a79e59f48093e383bfbabee003","observation_id":"84642bff-3c25-476e-a799-942cdc321b66","resolution":{"observed_at":"2026-08-14T13:22:54.114032Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.552508Z","title":"S-functions for graphs","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.552508Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:1361d6cee48315f8c917fa28892943a91fc140cdf8389de8335bb7acf20d49ee","observation_id":"a0a11f90-a83c-4637-ac3e-7f83fe9a0cb2","resolution":{"observed_at":"2026-08-14T13:22:53.552508Z","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-14T13:22:53.556178Z","title":"The problem of compatible representatives","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.556178Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:0cfa30e4de0ef4a2ec1e4e18ae92f670d4f51eef4b4c237597726e0affeb943b","observation_id":"6698a807-8315-45fb-afd4-08359f5ee2ef","resolution":{"observed_at":"2026-08-14T13:22:53.556178Z","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-14T13:22:53.560693Z","title":"Planar formulae and their uses","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.560693Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:e1a993c70faf36eb5a80e094f52dce1242892fb25e41fc7f10aa116f581ff876","observation_id":"38d3119a-b1e2-4b98-92f9-1b94f9e41ffe","resolution":{"observed_at":"2026-08-14T13:22:53.560693Z","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-14T13:22:53.564110Z","title":"Epidemics and percolation in small-world networks","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.564110Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:dbae7c2fc5dce413d9cb636598ebfe17e22fea54f63f01842be62879c7c6427c","observation_id":"49752ff5-2ae4-4a4a-b90e-0a235b3bedbf","resolution":{"observed_at":"2026-08-14T13:22:53.564110Z","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-14T13:22:53.567661Z","title":"Spread of epidemic disease on networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.567661Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:a4413ecc0a9dae19f4af7c380d55e9556321c9096ecbc8701a961ac6456f8811","observation_id":"12f8bf14-aa1a-4a17-9c04-7a0002e01403","resolution":{"observed_at":"2026-08-14T13:22:53.567661Z","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-14T13:22:53.571253Z","title":"Approximating rank-width and clique-width quickly","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.571253Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:25b324319a4049b40626233ecc0ea3563379ab7819894a5fe8d72ee80c89a65d","observation_id":"8036450f-71d9-42f6-8e1b-c17d220a7635","resolution":{"observed_at":"2026-08-14T13:22:53.571253Z","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-14T13:22:53.574360Z","title":"Survey of network-based defense mechanisms countering the DoS and DDoS problems","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.574360Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:828e0e14eb928544170dc7ee27f33cb237100d0e534536318781b102fc699d2d","observation_id":"5e1b4430-9d7e-47dc-9f5f-30a41e78b3c7","resolution":{"observed_at":"2026-08-14T13:22:53.574360Z","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-14T13:22:53.577712Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.577712Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:4dd32da1df82f48c940a49b32403e473a584c8483b4b0f2c7879e890f3b1abe4","observation_id":"5c821965-d54a-47b3-994e-51c53e1fda88","resolution":{"observed_at":"2026-08-14T13:22:53.577712Z","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-14T13:22:53.581211Z","title":"Rumors in a network: Who's the culprit? IEEE Transactions on Information Theory , 57(8):5163--5181, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.581211Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:88c91775e6a40077cdda90e70ef1c2c8a06cf2a8f9a92ef15f3d3ccd95632f67","observation_id":"f1366217-24a1-4263-abd8-154d97218e9b","resolution":{"observed_at":"2026-08-14T13:22:53.581211Z","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":"3059.38306","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:22:53.896817Z","title":"Hash-based IP traceback","venue":null,"work_id":"ec0343d3-6b78-4021-b087-e9be0a2d1b71","year":2001},"citing_paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T13:22:53.584690Z"},"links":{"citing_paper":"/paper/1908.05445"},"observation_digest":"sha256:73dc2e5ac3cdc2278defa4e68f6d9f46b55ba1e92e9707605495bc2142f0b486","observation_id":"bf53a43e-dfb6-4d31-b617-afe4b75a1a33","resolution":{"observed_at":"2026-08-14T13:22:53.901602Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.05445","last_updated":"2019-09-29T02:39:23Z","latest_version":2,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-16T03:25:15.189605Z","submitted_at":"2019-08-15T07:13:20Z","title":"Tracking Paths in Planar Graphs"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":16,"verified_exact":8,"verified_fuzzy":3},"total_outbound_references":28},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:1908.05445."}