{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7VEI23YFBN3U3IXQTCXKCTHWOJ","short_pith_number":"pith:7VEI23YF","canonical_record":{"source":{"id":"1604.03861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-13T16:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"9b36b828f0b1c51fa448acaf50c12367c9bce86e2b93eb6c3934ae3b711aea5f","abstract_canon_sha256":"701b9de18e18361c5b0bdff1b84b31922bd75aa93867f9a6283aa5bfc5d8cdab"},"schema_version":"1.0"},"canonical_sha256":"fd488d6f050b774da2f098aea14cf67247085e15350e6148662d5b9e82cf431c","source":{"kind":"arxiv","id":"1604.03861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03861","created_at":"2026-05-18T01:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03861v1","created_at":"2026-05-18T01:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03861","created_at":"2026-05-18T01:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"7VEI23YFBN3U","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7VEI23YFBN3U3IXQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7VEI23YF","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7VEI23YFBN3U3IXQTCXKCTHWOJ","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-13T16:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"9b36b828f0b1c51fa448acaf50c12367c9bce86e2b93eb6c3934ae3b711aea5f","abstract_canon_sha256":"701b9de18e18361c5b0bdff1b84b31922bd75aa93867f9a6283aa5bfc5d8cdab"},"schema_version":"1.0"},"canonical_sha256":"fd488d6f050b774da2f098aea14cf67247085e15350e6148662d5b9e82cf431c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:10.854994Z","signature_b64":"lLvJedoQF27xU7nzkjaZCs5khVA8pOApupRrQoKio9LK2v5WPVLBRYGKTX+xOPFrPS7/nQyvfhPMncR0XwoDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd488d6f050b774da2f098aea14cf67247085e15350e6148662d5b9e82cf431c","last_reissued_at":"2026-05-18T01:17:10.854247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:10.854247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03861","source_version":1,"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-18T01:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQ1+/Hxg8/86IQqINfNa+w6XZgaJe/fv89SvV60jUjDfm7++wlvgeZMZ7CFid9alcCU8qeoAUPVX39kwN70LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:31:29.257573Z"},"content_sha256":"5e20fc744bbad1f002fceaef2383c9e63f099d0799d068ab7abd21b651780314","schema_version":"1.0","event_id":"sha256:5e20fc744bbad1f002fceaef2383c9e63f099d0799d068ab7abd21b651780314"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7VEI23YFBN3U3IXQTCXKCTHWOJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New results on metric-locating-dominating sets of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antonio Gonz\\'alez, Carmen Hernando, Merc\\`e Mora","submitted_at":"2016-04-13T16:37:27Z","abstract_excerpt":"A dominating set $S$ of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of $S$, and the minimum cardinality of such a set is called the metric-location-domination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: resolving sets, dominating sets, locating-dominating sets and doubly resolving sets. We first characterize classes of trees according to certain relationships between their metric-location-dominatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03861","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":""},"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-18T01:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHA8cog/k0mOXZxjD9M7UoKIj15FgLUI5A+unuT0fJY+8Xcde6FFCARrhecSme8Q0O0vLAJKCjIhrfPYBJz8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:31:29.258329Z"},"content_sha256":"550ca5929a83d864a27850cbdc75c6dd5142ac6fc2ebf0bab6de7276e5109b74","schema_version":"1.0","event_id":"sha256:550ca5929a83d864a27850cbdc75c6dd5142ac6fc2ebf0bab6de7276e5109b74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/bundle.json","state_url":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/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-05-25T18:31:29Z","links":{"resolver":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ","bundle":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/bundle.json","state":"https://pith.science/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VEI23YFBN3U3IXQTCXKCTHWOJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7VEI23YFBN3U3IXQTCXKCTHWOJ","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":"701b9de18e18361c5b0bdff1b84b31922bd75aa93867f9a6283aa5bfc5d8cdab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-13T16:37:27Z","title_canon_sha256":"9b36b828f0b1c51fa448acaf50c12367c9bce86e2b93eb6c3934ae3b711aea5f"},"schema_version":"1.0","source":{"id":"1604.03861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03861","created_at":"2026-05-18T01:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03861v1","created_at":"2026-05-18T01:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03861","created_at":"2026-05-18T01:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"7VEI23YFBN3U","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7VEI23YFBN3U3IXQ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7VEI23YF","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:550ca5929a83d864a27850cbdc75c6dd5142ac6fc2ebf0bab6de7276e5109b74","target":"graph","created_at":"2026-05-18T01:17:10Z","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":"A dominating set $S$ of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of $S$, and the minimum cardinality of such a set is called the metric-location-domination number. In this paper, we undertake a study that, in general graphs and specific families, relates metric-locating-dominating sets to other special sets: resolving sets, dominating sets, locating-dominating sets and doubly resolving sets. We first characterize classes of trees according to certain relationships between their metric-location-dominatio","authors_text":"Antonio Gonz\\'alez, Carmen Hernando, Merc\\`e Mora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-13T16:37:27Z","title":"New results on metric-locating-dominating sets of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03861","kind":"arxiv","version":1},"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:5e20fc744bbad1f002fceaef2383c9e63f099d0799d068ab7abd21b651780314","target":"record","created_at":"2026-05-18T01:17:10Z","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":"701b9de18e18361c5b0bdff1b84b31922bd75aa93867f9a6283aa5bfc5d8cdab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-13T16:37:27Z","title_canon_sha256":"9b36b828f0b1c51fa448acaf50c12367c9bce86e2b93eb6c3934ae3b711aea5f"},"schema_version":"1.0","source":{"id":"1604.03861","kind":"arxiv","version":1}},"canonical_sha256":"fd488d6f050b774da2f098aea14cf67247085e15350e6148662d5b9e82cf431c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd488d6f050b774da2f098aea14cf67247085e15350e6148662d5b9e82cf431c","first_computed_at":"2026-05-18T01:17:10.854247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:10.854247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lLvJedoQF27xU7nzkjaZCs5khVA8pOApupRrQoKio9LK2v5WPVLBRYGKTX+xOPFrPS7/nQyvfhPMncR0XwoDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:10.854994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e20fc744bbad1f002fceaef2383c9e63f099d0799d068ab7abd21b651780314","sha256:550ca5929a83d864a27850cbdc75c6dd5142ac6fc2ebf0bab6de7276e5109b74"],"state_sha256":"f8b925f98ba3f8d30fff319436adee20abe85cabafca6f945719bb6f2ac74226"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XezDsxv7OFq/19otjrpD1YAp28suy51clskrYg7OREyFmWKmnhFq+TeXJ4fl7KHSfeUk39Z7+DPKRG5EALgGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:31:29.262503Z","bundle_sha256":"0af150add6a4965fd6e4bc3e7f0a4c5511803078125e9356c820b5653352e63e"}}