{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HTXPWKE2MQUHDBH3GLL7Z7R4C5","short_pith_number":"pith:HTXPWKE2","schema_version":"1.0","canonical_sha256":"3ceefb289a64287184fb32d7fcfe3c175e5e7a1866a0d2d4eeed8203f99ad4e8","source":{"kind":"arxiv","id":"1405.2424","version":3},"attestation_state":"computed","paper":{"title":"Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Aline Parreau, Florent Foucaud, George B. Mertzios, Petru Valicov, Reza Naserasr","submitted_at":"2014-05-10T11:50:05Z","abstract_excerpt":"We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted IDENTIFYING CODE, (OPEN) LOCATING-DOMINATING SET and METRIC DIMENSION) of an interval or a permutation graph. In these problems, one asks to distinguish all vertices of a graph by a subset of the vertices, using either the neighbourhood within the solution set or the distances to the solution vertices. Using a general reduction for this class of problems, we prove that the decision problems associated to these four notions are NP-complete, even for interval graphs of diame"},"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":"1405.2424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-10T11:50:05Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"19e1ce4cc0bb54ddd446dbd1426faa805f68c5c67ee4917e9abc964934e04020","abstract_canon_sha256":"2cc3136c4564affbfc2e4e4340da72255f2e27ed3c0556401a463db6f9438865"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:19.901155Z","signature_b64":"palWnWAjcMuJqzL88lj51tgjXny3/NImJWo9aX3iZHcfK5vTv8g10iChXrKPVZYLdFgSbWQ67AtsNwa9EG/zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ceefb289a64287184fb32d7fcfe3c175e5e7a1866a0d2d4eeed8203f99ad4e8","last_reissued_at":"2026-05-18T00:40:19.900452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:19.900452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Aline Parreau, Florent Foucaud, George B. Mertzios, Petru Valicov, Reza Naserasr","submitted_at":"2014-05-10T11:50:05Z","abstract_excerpt":"We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted IDENTIFYING CODE, (OPEN) LOCATING-DOMINATING SET and METRIC DIMENSION) of an interval or a permutation graph. In these problems, one asks to distinguish all vertices of a graph by a subset of the vertices, using either the neighbourhood within the solution set or the distances to the solution vertices. Using a general reduction for this class of problems, we prove that the decision problems associated to these four notions are NP-complete, even for interval graphs of diame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2424","kind":"arxiv","version":3},"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":"1405.2424","created_at":"2026-05-18T00:40:19.900554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2424v3","created_at":"2026-05-18T00:40:19.900554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2424","created_at":"2026-05-18T00:40:19.900554+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTXPWKE2MQUH","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTXPWKE2MQUHDBH3","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTXPWKE2","created_at":"2026-05-18T12:28:30.664211+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/HTXPWKE2MQUHDBH3GLL7Z7R4C5","json":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5.json","graph_json":"https://pith.science/api/pith-number/HTXPWKE2MQUHDBH3GLL7Z7R4C5/graph.json","events_json":"https://pith.science/api/pith-number/HTXPWKE2MQUHDBH3GLL7Z7R4C5/events.json","paper":"https://pith.science/paper/HTXPWKE2"},"agent_actions":{"view_html":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5","download_json":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5.json","view_paper":"https://pith.science/paper/HTXPWKE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2424&json=true","fetch_graph":"https://pith.science/api/pith-number/HTXPWKE2MQUHDBH3GLL7Z7R4C5/graph.json","fetch_events":"https://pith.science/api/pith-number/HTXPWKE2MQUHDBH3GLL7Z7R4C5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/action/storage_attestation","attest_author":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/action/author_attestation","sign_citation":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/action/citation_signature","submit_replication":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/action/replication_record"}},"created_at":"2026-05-18T00:40:19.900554+00:00","updated_at":"2026-05-18T00:40:19.900554+00:00"}