{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZDRHRJ54E2HIABVIZWZBMDOO3P","short_pith_number":"pith:ZDRHRJ54","schema_version":"1.0","canonical_sha256":"c8e278a7bc268e8006a8cdb2160dcedbd1639fdecdd1ba01176dc5f6b71379ec","source":{"kind":"arxiv","id":"1601.05003","version":2},"attestation_state":"computed","paper":{"title":"Parameterized and approximation complexity of the detection pair problem in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Florent Foucaud, Ralf Klasing","submitted_at":"2016-01-19T17:20:40Z","abstract_excerpt":"We study the complexity of the problem DETECTION PAIR. A detection pair of a graph $G$ is a pair $(W,L)$ of sets of detectors with $W\\subseteq V(G)$, the watchers, and $L\\subseteq V(G)$, the listeners, such that for every pair $u,v$ of vertices that are not dominated by a watcher of $W$, there is a listener of $L$ whose distances to $u$ and to $v$ are different. The goal is to minimize $|W|+|L|$. This problem generalizes the two classic problems DOMINATING SET and METRIC DIMENSION, that correspond to the restrictions $L=\\emptyset$ and $W=\\emptyset$, respectively. DETECTION PAIR was recently in"},"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":"1601.05003","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-19T17:20:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1d7e962c9e8bd106ef4d7bb71ed6ec0eb1b26d4ffbd79d727e59251bb1600990","abstract_canon_sha256":"731e9497b194f0be2bda4d1ffa33682999d39b995e6a5a1ea158fbf871abbe46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:53.413762Z","signature_b64":"6KYN75N+m0PYOi+u/8zGwFShJDRGOJ2KVfucY31sIv0QNePJi4L4tanE4STJ6oZpL+CS+1iT88qpiDuf1A/yAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8e278a7bc268e8006a8cdb2160dcedbd1639fdecdd1ba01176dc5f6b71379ec","last_reissued_at":"2026-05-18T00:24:53.413035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:53.413035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized and approximation complexity of the detection pair problem in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Florent Foucaud, Ralf Klasing","submitted_at":"2016-01-19T17:20:40Z","abstract_excerpt":"We study the complexity of the problem DETECTION PAIR. A detection pair of a graph $G$ is a pair $(W,L)$ of sets of detectors with $W\\subseteq V(G)$, the watchers, and $L\\subseteq V(G)$, the listeners, such that for every pair $u,v$ of vertices that are not dominated by a watcher of $W$, there is a listener of $L$ whose distances to $u$ and to $v$ are different. The goal is to minimize $|W|+|L|$. This problem generalizes the two classic problems DOMINATING SET and METRIC DIMENSION, that correspond to the restrictions $L=\\emptyset$ and $W=\\emptyset$, respectively. DETECTION PAIR was recently in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05003","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":""},"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":"1601.05003","created_at":"2026-05-18T00:24:53.413151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.05003v2","created_at":"2026-05-18T00:24:53.413151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05003","created_at":"2026-05-18T00:24:53.413151+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDRHRJ54E2HI","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDRHRJ54E2HIABVI","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDRHRJ54","created_at":"2026-05-18T12:30:53.716459+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/ZDRHRJ54E2HIABVIZWZBMDOO3P","json":"https://pith.science/pith/ZDRHRJ54E2HIABVIZWZBMDOO3P.json","graph_json":"https://pith.science/api/pith-number/ZDRHRJ54E2HIABVIZWZBMDOO3P/graph.json","events_json":"https://pith.science/api/pith-number/ZDRHRJ54E2HIABVIZWZBMDOO3P/events.json","paper":"https://pith.science/paper/ZDRHRJ54"},"agent_actions":{"view_html":"https://pith.science/pith/ZDRHRJ54E2HIABVIZWZBMDOO3P","download_json":"https://pith.science/pith/ZDRHRJ54E2HIABVIZWZBMDOO3P.json","view_paper":"https://pith.science/paper/ZDRHRJ54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.05003&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDRHRJ54E2HIABVIZWZBMDOO3P/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDRHRJ54E2HIABVIZWZBMDOO3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDRHRJ54E2HIABVIZWZBMDOO3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDRHRJ54E2HIABVIZWZBMDOO3P/action/storage_attestation","attest_author":"https://pith.science/pith/ZDRHRJ54E2HIABVIZWZBMDOO3P/action/author_attestation","sign_citation":"https://pith.science/pith/ZDRHRJ54E2HIABVIZWZBMDOO3P/action/citation_signature","submit_replication":"https://pith.science/pith/ZDRHRJ54E2HIABVIZWZBMDOO3P/action/replication_record"}},"created_at":"2026-05-18T00:24:53.413151+00:00","updated_at":"2026-05-18T00:24:53.413151+00:00"}