{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:S4GJUEMDO2FWQKOQOJZKH6FSZ4","short_pith_number":"pith:S4GJUEMD","schema_version":"1.0","canonical_sha256":"970c9a1183768b6829d07272a3f8b2cf37ac57d613db5b26e70f6f7d526fe4e4","source":{"kind":"arxiv","id":"1908.05445","version":2},"attestation_state":"computed","paper":{"title":"Tracking Paths in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"David Eppstein, James A. Liu, Michael T. Goodrich, Pedro Matias","submitted_at":"2019-08-15T07:13:20Z","abstract_excerpt":"We consider the NP-complete problem of tracking paths in a graph, first introduced by Banik et. al. [3]. Given an undirected graph with a source $s$ and a destination $t$, find the smallest subset of vertices whose intersection with any $s-t$ path results in a unique sequence. In this paper, we show that this problem remains NP-complete when the graph is planar and we give a 4-approximation algorithm in this setting. We also show, via Courcelle's theorem, that it can be solved in linear time for graphs of bounded-clique width, when its clique decomposition is given in advance."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1908.05445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-15T07:13:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a3ca17541891fcbf3f9e2b57c8579823bb4dde7d4cb594448a6f09df04367c4c","abstract_canon_sha256":"ccc7d8c5f1024707487a1f69df95f120344814190e8cb010035f976300075346"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:52.799139Z","signature_b64":"M9Qh6AdKlyEYEAerOaTYrrz0HO/tM4p/jWH7D7QyonAbZTk15l26NI98ZKp2C3xEQQ9ar5RdWH4oCzb0hdAGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970c9a1183768b6829d07272a3f8b2cf37ac57d613db5b26e70f6f7d526fe4e4","last_reissued_at":"2026-07-05T00:07:52.798627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:52.798627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tracking Paths in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"David Eppstein, James A. Liu, Michael T. Goodrich, Pedro Matias","submitted_at":"2019-08-15T07:13:20Z","abstract_excerpt":"We consider the NP-complete problem of tracking paths in a graph, first introduced by Banik et. al. [3]. Given an undirected graph with a source $s$ and a destination $t$, find the smallest subset of vertices whose intersection with any $s-t$ path results in a unique sequence. In this paper, we show that this problem remains NP-complete when the graph is planar and we give a 4-approximation algorithm in this setting. We also show, via Courcelle's theorem, that it can be solved in linear time for graphs of bounded-clique width, when its clique decomposition is given in advance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05445","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05445/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.05445","created_at":"2026-07-05T00:07:52.798693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05445v2","created_at":"2026-07-05T00:07:52.798693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05445","created_at":"2026-07-05T00:07:52.798693+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4GJUEMDO2FW","created_at":"2026-07-05T00:07:52.798693+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4GJUEMDO2FWQKOQ","created_at":"2026-07-05T00:07:52.798693+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4GJUEMD","created_at":"2026-07-05T00:07:52.798693+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S4GJUEMDO2FWQKOQOJZKH6FSZ4","json":"https://pith.science/pith/S4GJUEMDO2FWQKOQOJZKH6FSZ4.json","graph_json":"https://pith.science/api/pith-number/S4GJUEMDO2FWQKOQOJZKH6FSZ4/graph.json","events_json":"https://pith.science/api/pith-number/S4GJUEMDO2FWQKOQOJZKH6FSZ4/events.json","paper":"https://pith.science/paper/S4GJUEMD"},"agent_actions":{"view_html":"https://pith.science/pith/S4GJUEMDO2FWQKOQOJZKH6FSZ4","download_json":"https://pith.science/pith/S4GJUEMDO2FWQKOQOJZKH6FSZ4.json","view_paper":"https://pith.science/paper/S4GJUEMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05445&json=true","fetch_graph":"https://pith.science/api/pith-number/S4GJUEMDO2FWQKOQOJZKH6FSZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/S4GJUEMDO2FWQKOQOJZKH6FSZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4GJUEMDO2FWQKOQOJZKH6FSZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4GJUEMDO2FWQKOQOJZKH6FSZ4/action/storage_attestation","attest_author":"https://pith.science/pith/S4GJUEMDO2FWQKOQOJZKH6FSZ4/action/author_attestation","sign_citation":"https://pith.science/pith/S4GJUEMDO2FWQKOQOJZKH6FSZ4/action/citation_signature","submit_replication":"https://pith.science/pith/S4GJUEMDO2FWQKOQOJZKH6FSZ4/action/replication_record"}},"created_at":"2026-07-05T00:07:52.798693+00:00","updated_at":"2026-07-05T00:07:52.798693+00:00"}