{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Q3Q2CEZFDXQ7IIRLCQG2QJWYDO","short_pith_number":"pith:Q3Q2CEZF","schema_version":"1.0","canonical_sha256":"86e1a113251de1f4222b140da826d81b9f06b795598fb697205c0d530739da7b","source":{"kind":"arxiv","id":"2411.17948","version":1},"attestation_state":"computed","paper":{"title":"Structural Parameterization of Locating-Dominating Set and Test Cover","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dipayan Chakraborty, Diptapriyo Majumdar, Florent Foucaud, Prafullkumar Tale","submitted_at":"2024-11-26T23:59:21Z","abstract_excerpt":"We investigate structural parameterizations of two identification problems: LOCATING-DOMINATING SET and TEST COVER. In the first problem, an input is a graph $G$ on $n$ vertices and an integer $k$, and one asks if there is a subset $S$ of $k$ vertices such that any two distinct vertices not in $S$ are dominated by distinct subsets of $S$. In the second problem, an input is a set of items $U$, a set of subsets $\\mathcal{F}$ of $U$ called $tests$ and an integer $k$, and one asks if there is a set $S$ of at most $k$ tests such that any two items belong to distinct subsets of tests of $S$. These t"},"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":"2411.17948","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T23:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"432346b7d8a2599b9ed6129cd23e3b387d543e0b4dd174e1f824c364422ea90c","abstract_canon_sha256":"47b47dff8df64d15fa94d13509dc1d026e98e9b1186892c08c28f1cfb63fef53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:09.299216Z","signature_b64":"aIDu2FlhcW4dF3Vg6//qr0XTk26P47S6oy6toVmHIkyE0V2jcCpIhpTlYTRS97PSRtXavMBSl8TlsvNKBLHKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86e1a113251de1f4222b140da826d81b9f06b795598fb697205c0d530739da7b","last_reissued_at":"2026-07-05T09:41:09.297927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:09.297927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural Parameterization of Locating-Dominating Set and Test Cover","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dipayan Chakraborty, Diptapriyo Majumdar, Florent Foucaud, Prafullkumar Tale","submitted_at":"2024-11-26T23:59:21Z","abstract_excerpt":"We investigate structural parameterizations of two identification problems: LOCATING-DOMINATING SET and TEST COVER. In the first problem, an input is a graph $G$ on $n$ vertices and an integer $k$, and one asks if there is a subset $S$ of $k$ vertices such that any two distinct vertices not in $S$ are dominated by distinct subsets of $S$. In the second problem, an input is a set of items $U$, a set of subsets $\\mathcal{F}$ of $U$ called $tests$ and an integer $k$, and one asks if there is a set $S$ of at most $k$ tests such that any two items belong to distinct subsets of tests of $S$. These t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17948","kind":"arxiv","version":1},"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/2411.17948/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":"2411.17948","created_at":"2026-07-05T09:41:09.298829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17948v1","created_at":"2026-07-05T09:41:09.298829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17948","created_at":"2026-07-05T09:41:09.298829+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3Q2CEZFDXQ7","created_at":"2026-07-05T09:41:09.298829+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3Q2CEZFDXQ7IIRL","created_at":"2026-07-05T09:41:09.298829+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3Q2CEZF","created_at":"2026-07-05T09:41:09.298829+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/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO","json":"https://pith.science/pith/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO.json","graph_json":"https://pith.science/api/pith-number/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO/graph.json","events_json":"https://pith.science/api/pith-number/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO/events.json","paper":"https://pith.science/paper/Q3Q2CEZF"},"agent_actions":{"view_html":"https://pith.science/pith/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO","download_json":"https://pith.science/pith/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO.json","view_paper":"https://pith.science/paper/Q3Q2CEZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17948&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO/action/storage_attestation","attest_author":"https://pith.science/pith/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO/action/author_attestation","sign_citation":"https://pith.science/pith/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO/action/citation_signature","submit_replication":"https://pith.science/pith/Q3Q2CEZFDXQ7IIRLCQG2QJWYDO/action/replication_record"}},"created_at":"2026-07-05T09:41:09.298829+00:00","updated_at":"2026-07-05T09:41:09.298829+00:00"}