{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HTXPWKE2MQUHDBH3GLL7Z7R4C5","short_pith_number":"pith:HTXPWKE2","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"},"canonical_sha256":"3ceefb289a64287184fb32d7fcfe3c175e5e7a1866a0d2d4eeed8203f99ad4e8","source":{"kind":"arxiv","id":"1405.2424","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2424","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2424v3","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2424","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"HTXPWKE2MQUH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HTXPWKE2MQUHDBH3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HTXPWKE2","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HTXPWKE2MQUHDBH3GLL7Z7R4C5","target":"record","payload":{"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"},"canonical_sha256":"3ceefb289a64287184fb32d7fcfe3c175e5e7a1866a0d2d4eeed8203f99ad4e8","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"},"source_kind":"arxiv","source_id":"1405.2424","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LwDIQ32YsiyVjIUHRWcxR/l6dYVsyAAQGKPrH1qEX+iXnG9LXgbjhdibVj2hZKUmV64N2ajCH8a+IgL79pGpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:30:30.929783Z"},"content_sha256":"41ff79ad1b8de239467bdd2fcca4d4cd1ed796f419f7478db19640c179aac3aa","schema_version":"1.0","event_id":"sha256:41ff79ad1b8de239467bdd2fcca4d4cd1ed796f419f7478db19640c179aac3aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HTXPWKE2MQUHDBH3GLL7Z7R4C5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WnBCgx44IwFMHpCWkpZMs8jZR/Mc8RA2/+6UTjSeADNvFRom3x1XB6W0RS6VllzAPf+gj0gbpgX66WdkqIFtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:30:30.930126Z"},"content_sha256":"e4776a7a000bfaf422abf73419400935fe3ec6b19d122a87d7681f2579c94b05","schema_version":"1.0","event_id":"sha256:e4776a7a000bfaf422abf73419400935fe3ec6b19d122a87d7681f2579c94b05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/bundle.json","state_url":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T03:30:30Z","links":{"resolver":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5","bundle":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/bundle.json","state":"https://pith.science/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTXPWKE2MQUHDBH3GLL7Z7R4C5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HTXPWKE2MQUHDBH3GLL7Z7R4C5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2cc3136c4564affbfc2e4e4340da72255f2e27ed3c0556401a463db6f9438865","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-10T11:50:05Z","title_canon_sha256":"19e1ce4cc0bb54ddd446dbd1426faa805f68c5c67ee4917e9abc964934e04020"},"schema_version":"1.0","source":{"id":"1405.2424","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2424","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2424v3","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2424","created_at":"2026-05-18T00:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"HTXPWKE2MQUH","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HTXPWKE2MQUHDBH3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HTXPWKE2","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:e4776a7a000bfaf422abf73419400935fe3ec6b19d122a87d7681f2579c94b05","target":"graph","created_at":"2026-05-18T00:40:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aline Parreau, Florent Foucaud, George B. Mertzios, Petru Valicov, Reza Naserasr","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-10T11:50:05Z","title":"Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2424","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:41ff79ad1b8de239467bdd2fcca4d4cd1ed796f419f7478db19640c179aac3aa","target":"record","created_at":"2026-05-18T00:40:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2cc3136c4564affbfc2e4e4340da72255f2e27ed3c0556401a463db6f9438865","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-10T11:50:05Z","title_canon_sha256":"19e1ce4cc0bb54ddd446dbd1426faa805f68c5c67ee4917e9abc964934e04020"},"schema_version":"1.0","source":{"id":"1405.2424","kind":"arxiv","version":3}},"canonical_sha256":"3ceefb289a64287184fb32d7fcfe3c175e5e7a1866a0d2d4eeed8203f99ad4e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ceefb289a64287184fb32d7fcfe3c175e5e7a1866a0d2d4eeed8203f99ad4e8","first_computed_at":"2026-05-18T00:40:19.900452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:19.900452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"palWnWAjcMuJqzL88lj51tgjXny3/NImJWo9aX3iZHcfK5vTv8g10iChXrKPVZYLdFgSbWQ67AtsNwa9EG/zDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:19.901155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2424","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41ff79ad1b8de239467bdd2fcca4d4cd1ed796f419f7478db19640c179aac3aa","sha256:e4776a7a000bfaf422abf73419400935fe3ec6b19d122a87d7681f2579c94b05"],"state_sha256":"688ee1fdec0a973deae3d95a0e275c025805d26540812f0a2eaf3d8b45bfa5e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3q8dim3KoxDFDcADRO9d0EWjRo5Vir9uTi5S8uPCkF2xD/tjx139bNLlkSOAndh7uH2sygaJxTyPkr2hB8lCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:30:30.932060Z","bundle_sha256":"fd5704c80435cb139ff81ce6d3bcedb0462bd4eceebc31eaa2d1347737e02af7"}}