{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:35E5NKPU57NPWHIQZCQPURSTE5","short_pith_number":"pith:35E5NKPU","schema_version":"1.0","canonical_sha256":"df49d6a9f4efdafb1d10c8a0fa4653274e72012a78a9c7c72a98f1b1b015d921","source":{"kind":"arxiv","id":"2402.08346","version":4},"attestation_state":"computed","paper":{"title":"Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Dipayan Chakraborty, Diptapriyo Majumdar, Florent Foucaud, Prafullkumar Tale","submitted_at":"2024-02-13T10:24:20Z","abstract_excerpt":"We investigate fine-grained algorithmic aspects of identification problems in graphs and set systems, with a focus on Locating-Dominating Set and Test Cover. We prove the (tight) conditional lower bounds for these problems when parameterized by treewidth and solution as. Formally, \\textsc{Locating-Dominating Set} (respectively, \\textsc{Test Cover}) parameterized by the treewidth of the input graph (respectively, of the natural auxiliary graph) does not admit an algorithm running in time $2^{2^{o(tw)}} \\cdot poly(n)$ (respectively, $2^{2^{o(tw)}} \\cdot poly(|U| + |\\mathcal{F}|))$. This result a"},"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":"2402.08346","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-02-13T10:24:20Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"ba9e741b564dba39ef2c06259c0961b8f41311251b00d4fa68c10746de96a278","abstract_canon_sha256":"fbe49ad2cae371b365a5e4d666ddea93aa920c54ce2044fe79efd2a505a42390"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:30.537052Z","signature_b64":"7n7nbetf3YfGxC23TmhyjPLIxKmNU906dN3tS//XIEmv8QLBiloqJRmhg06WvCyoFTpeAIToxWYv1L1DhiK8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df49d6a9f4efdafb1d10c8a0fa4653274e72012a78a9c7c72a98f1b1b015d921","last_reissued_at":"2026-07-05T11:57:30.536597Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:30.536597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Dipayan Chakraborty, Diptapriyo Majumdar, Florent Foucaud, Prafullkumar Tale","submitted_at":"2024-02-13T10:24:20Z","abstract_excerpt":"We investigate fine-grained algorithmic aspects of identification problems in graphs and set systems, with a focus on Locating-Dominating Set and Test Cover. We prove the (tight) conditional lower bounds for these problems when parameterized by treewidth and solution as. Formally, \\textsc{Locating-Dominating Set} (respectively, \\textsc{Test Cover}) parameterized by the treewidth of the input graph (respectively, of the natural auxiliary graph) does not admit an algorithm running in time $2^{2^{o(tw)}} \\cdot poly(n)$ (respectively, $2^{2^{o(tw)}} \\cdot poly(|U| + |\\mathcal{F}|))$. This result a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08346","kind":"arxiv","version":4},"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/2402.08346/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":"2402.08346","created_at":"2026-07-05T11:57:30.536653+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08346v4","created_at":"2026-07-05T11:57:30.536653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08346","created_at":"2026-07-05T11:57:30.536653+00:00"},{"alias_kind":"pith_short_12","alias_value":"35E5NKPU57NP","created_at":"2026-07-05T11:57:30.536653+00:00"},{"alias_kind":"pith_short_16","alias_value":"35E5NKPU57NPWHIQ","created_at":"2026-07-05T11:57:30.536653+00:00"},{"alias_kind":"pith_short_8","alias_value":"35E5NKPU","created_at":"2026-07-05T11:57:30.536653+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17948","citing_title":"Structural Parameterization of Locating-Dominating Set and Test Cover","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/35E5NKPU57NPWHIQZCQPURSTE5","json":"https://pith.science/pith/35E5NKPU57NPWHIQZCQPURSTE5.json","graph_json":"https://pith.science/api/pith-number/35E5NKPU57NPWHIQZCQPURSTE5/graph.json","events_json":"https://pith.science/api/pith-number/35E5NKPU57NPWHIQZCQPURSTE5/events.json","paper":"https://pith.science/paper/35E5NKPU"},"agent_actions":{"view_html":"https://pith.science/pith/35E5NKPU57NPWHIQZCQPURSTE5","download_json":"https://pith.science/pith/35E5NKPU57NPWHIQZCQPURSTE5.json","view_paper":"https://pith.science/paper/35E5NKPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08346&json=true","fetch_graph":"https://pith.science/api/pith-number/35E5NKPU57NPWHIQZCQPURSTE5/graph.json","fetch_events":"https://pith.science/api/pith-number/35E5NKPU57NPWHIQZCQPURSTE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35E5NKPU57NPWHIQZCQPURSTE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35E5NKPU57NPWHIQZCQPURSTE5/action/storage_attestation","attest_author":"https://pith.science/pith/35E5NKPU57NPWHIQZCQPURSTE5/action/author_attestation","sign_citation":"https://pith.science/pith/35E5NKPU57NPWHIQZCQPURSTE5/action/citation_signature","submit_replication":"https://pith.science/pith/35E5NKPU57NPWHIQZCQPURSTE5/action/replication_record"}},"created_at":"2026-07-05T11:57:30.536653+00:00","updated_at":"2026-07-05T11:57:30.536653+00:00"}